LU-decomposition with iterative refinement for solving sparse linear systems

In the solution of a system of linear algebraic equations Ax = b with a large sparse coefficient matrix A, the LU-decomposition with iterative refinement (LUIR) is compared with the LU-decomposition with direct solution (LUDS), which is without iterative refinement. We verify by numerical experiment...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computational and applied mathematics 2006-01, Vol.185 (2), p.391-403
Hauptverfasser: Al-Kurdi, Ahmad, Kincaid, David R.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In the solution of a system of linear algebraic equations Ax = b with a large sparse coefficient matrix A, the LU-decomposition with iterative refinement (LUIR) is compared with the LU-decomposition with direct solution (LUDS), which is without iterative refinement. We verify by numerical experiments that the use of sparse matrix techniques with LUIR may result in a reduction of both the computing time and the storage requirements. The powers of a Boolean matrix strategy (PBS) is used in an effort to achieve such a reduction and in an attempt to control the sparsity. We conclude that iterative refinement procedures may be efficiently used as an option in software for the solution of sparse linear systems of equations.
ISSN:0377-0427
1879-1778
DOI:10.1016/j.cam.2005.03.018