A new half-sweep algebraic multigrid (HSAMG) algorithm for two-point boundary problems

Citation

Sulaiman, Jumat and Othman, Mohamed and Hasan, Mohammad Khatim (2006) A new half-sweep algebraic multigrid (HSAMG) algorithm for two-point boundary problems. In: International Conference on Computing and Informatics (ICOCI 2006), 6-8 June 2006, Kuala Lumpur, Malaysia. .

Abstract

The primary goal of this paper is to propose a new half-sweep algebraic multigrid (HSAMG) algorithm using the finite difference approximation equation for solving two-point boundary problems. The basic idea and formulation of the HSAMG algorithm are inspired by the concept of the half-sweep multigrid method. Some computational experiments have been conducted in order to show that the HSAMG method is superior to the standard algebraic method.

Download File

Preview

Text (Abstract)
A new half-sweep algebraic multigrid (HSAMG) algorithm for two-point boundary problems.pdf
Download (35kB) | Preview

Additional Metadata

Item Type:	Conference or Workshop Item (Paper)
Divisions:	Faculty of Computer Science and Information Technology
DOI Number:	https://doi.org/10.1109/ICOCI.2006.5276561
Publisher:	IEEE
Keywords:	Half-sweep algebraic multigrid (HSAMG); Two-point boundary problems
Depositing User:	Nabilah Mustapa
Date Deposited:	22 Feb 2018 07:21
Last Modified:	22 Feb 2018 07:21
Altmetrics:	http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1109/ICOCI.2006.5276561
URI:	http://psasir.upm.edu.my/id/eprint/59105
Statistic Details:	View Download Statistic

Actions (login required)

View Item