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

Jumat Sulaiman, and M. Othman, and M. K. Hasan, (2006) A new half-sweep algebraic multigrid (HSAMG) algorithm for two point boundary problems. In: International Conference on Computing and Informatics, 06-08 Jun 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)
Uncontrolled Keywords: Computer science, Hardware and architecture, Computer science, Information systems, Computer science, Theory and methods
Subjects: ?? QA299.6-433 ??
Divisions: SCHOOL > School of Science and Technology
Depositing User: Unnamed user with email storage.bpmlib@ums.edu.my
Date Deposited: 04 Nov 2011 02:21
Last Modified: 29 Dec 2014 08:26
URI: http://eprints.ums.edu.my/id/eprint/1068

Actions (login required)

View Item View Item

Browse Repository
   UMS News
Quick Search

   Latest Repository

Link to other Malaysia University Institutional Repository

Malaysia University Institutional Repository