A new Half-Sweep Algebraic Multigrid (HSAMG) algorithm for two-point boundary problems

Jumat Sulaiman and Mohamed Othman and Mohammad Khatim Hasan (2006) A new Half-Sweep Algebraic Multigrid (HSAMG) algorithm for two-point boundary problems. In: 2006 International Conference on Computing and Informatics, ICOCI '06, 6-8 June 2006, Kuala Lumpur, Malaysia.

Full text not available from this repository.


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.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Keyword: Algebraic method, Algebraic multigrids, Basic idea, Computational experiment, Finite difference approximations, Multigrid methods, Two-point boundary problems, Algebra, Computer science, Difference equations, Approximation algorithms
Subjects: Q Science > QA Mathematics
Department: SCHOOL > School of Science and Technology
Depositing User: ADMIN ADMIN
Date Deposited: 29 Feb 2012 13:24
Last Modified: 29 Dec 2014 16:26
URI: https://eprints.ums.edu.my/id/eprint/3624

Actions (login required)

View Item View Item