Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

The stable parallel solution of general narrow banded linear systems

Thumbnail Image

Date

1997

Authors

Arbenz, Peter
Hegland, Markus

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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.

Description

Keywords

banded linear systems, bidiagonal cyclic reduction, linear systems, Gaussian elimination, block elimination schemes, cyclic reduction, tridiagonal diagonally dominant systems, partial pivoting, bidiagonal systems, parallel band solvers

Citation

URI

http://hdl.handle.net/1885/40760
 http://digitalcollections.anu.edu.au/handle/1885/40760

Collections

ANU Research Publications

Source

Type

Working/Technical Paper

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until

Downloads

File
Description
TR-CS-97-01.pdf (362.58 KB)

DSpace software copyright © 2002-2026 LYRASIS