LU-decomposition with iterative refinement for solving sparse linear systems

Journal of Computational and Applied Mathematics

Volumn 185, Issue 2, 2006, Pages 391-403

  Al Kurdi, Ahmad ^a   Kincaid, David R ^b  

^a Teshreen University   (Syrian Arab Republic)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Large sparse linear systems; LU decomposition with direct solution (LUDS); LU decomposition with iterative refinement (LUIR); Powers of a Boolean matrix strategy (PBS)

Indexed keywords

BOOLEAN ALGEBRA; COMPUTER SOFTWARE; DECOMPOSITION; ITERATIVE METHODS; LINEAR SYSTEMS; MATRIX ALGEBRA;

LARGE SPARSE LINEAR SYSTEMS; LU-DECOMPOSITION WITH DIRECT SOLUTION (LUDS); LU-DECOMPOSITION WITH ITERATIVE REFINEMENT (LUIR); POWERS OF A BOOLEAN MATRIX STRATEGY (PBS);

LINEAR EQUATIONS;

EID: 25144472585     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2005.03.018     Document Type: Conference Paper

References (5)

1. F.G. Gustavson Some basic techniques for solving sparse systems of linear equations D.J. Rose R.A. Willoughby Sparse Matrices and Their Applications 1972 Plenum Press New York 41 52
2. N.J. Higham Iterative refinement for linear systems and LAPACK IMA J. Numer. Anal. 17 1997 495 509
3. R.C. Mittal, and A.H. Al-Kurdi LU-decomposition and numerical structure for solving large sparse nonsymmetric linear systems Comput. Math. Appl. 4 2002 131 155
4. Z. Zlatev Use of iterative refinement in the solution of sparse linear systems SIAM J. Numer. Anal. 19 1982 381 399
5. J.M. Wilkinson, Progress report on the automatic computing engine, Report MA/17/1024, Mathematics Division, Department of Scientific and Industrial Research, National Physical Laboratory, Tenddington, UK, April 1948.