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.

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.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Keyword: Computer science, Hardware and architecture, Computer science, Information systems, Computer science, Theory and methods
Subjects: Q Science > QA Mathematics > QA1-939 Mathematics > QA299.6-433 Analysis
Department: SCHOOL > School of Science and Technology
Depositing User: ADMIN ADMIN
Date Deposited: 04 Nov 2011 10:21
Last Modified: 29 Dec 2014 16:26
URI: https://eprints.ums.edu.my/id/eprint/1068

Actions (login required)

View Item View Item