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.

Official URL: http://dx.doi.org/10.1007/978-3-540-79409-7_40


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 Paper (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
ID Code:1068
Deposited By:IR Admin
Deposited On:04 Nov 2011 10:21
Last Modified:29 Dec 2014 16:26

Repository Staff Only: item control page

Browse Repository
   UMS News
Quick Search

   Latest Repository

Link to other Malaysia University Institutional Repository

Malaysia University Institutional Repository