Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

A stability analysis of incomplete $LU$ factorizations
HTML articles powered by AMS MathViewer

by Howard C. Elman PDF
Math. Comp. 47 (1986), 191-217 Request permission

Abstract:

The combination of iterative methods with preconditionings based on incomplete LU factorizations constitutes an effective class of methods for solving the sparse linear systems arising from the discretization of elliptic partial differential equations. In this paper, we show that there are some settings in which the incomplete LU preconditioners are not effective, and we demonstrate that their poor performance is due to numerical instability. Our analysis consists of an analytic and numerical study of a sample two-dimensional non-self-adjoint elliptic problem discretized by several finite-difference schemes.
References
Similar Articles
Additional Information
  • © Copyright 1986 American Mathematical Society
  • Journal: Math. Comp. 47 (1986), 191-217
  • MSC: Primary 65F10; Secondary 65N10, 65N20
  • DOI: https://doi.org/10.1090/S0025-5718-1986-0842130-7
  • MathSciNet review: 842130