The stable parallel solution of general narrow banded linear systems
We propose a stable algorithm for the parallel solution of banded and periodically banded linear systems. While most of the known parallel algorithms are stable only for symmetric positive definite or diagonally dominant systems, the new algorithm incorporates pivoting without sacrificing efficiency. The principle ingredient of the algorithm is a bidiagonal cyclic reduction that admits pivoting. We report on numerical experiments conducted on various multiprocessor computers.
|Collections||ANU Research Publications|
|1593-01.2003-07-03T02:51:22Z.xsh||356 B||EPrints MD5 Hash XML|
|TR-CS-97-01.pdf||362.58 kB||Adobe PDF|