Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)

 

A framework for block ILU factorizations using block-size reduction


Authors: Tony F. Chan and Panayot S. Vassilevski
Journal: Math. Comp. 64 (1995), 129-156
MSC: Primary 65F30
MathSciNet review: 1257575
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: We propose a block ILU factorization technique for block tridiagonal matrices that need not necessarily be M-matrices. The technique explores reduction by a coarse-vector restriction of the block size of the approximate Schur complements computed throughout the factorization process. Then on the basis of the Sherman-Morrison-Woodbury formula these are easily inverted. We prove the existence of the proposed factorization techniques in the case of (nonsymmetric, in general) M-matrices. For block tridiagonal matrices with positive definite symmetric part we show the existence of a limit version of the factorization (exact inverses of the reduced matrices are needed). The theory is illustrated with numerical tests.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65F30

Retrieve articles in all journals with MSC: 65F30


Additional Information

DOI: http://dx.doi.org/10.1090/S0025-5718-1995-1257575-9
PII: S 0025-5718(1995)1257575-9
Keywords: Block ILU factorization, M-matrices, positive definite matrices, second-order elliptic equation, finite differences, Sherman-Morrison-Woodbury formula
Article copyright: © Copyright 1995 American Mathematical Society