A new half-sweep algebraic multigrid (HSAMG) algorithm for two-point boundary problems
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 multigri...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
IEEE
2006
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/59105/1/A%20new%20half-sweep%20algebraic%20multigrid%20%28HSAMG%29%20algorithm%20for%20two-point%20boundary%20problems.pdf |
| Summary: | 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. |
|---|