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.


An incomplete factorization technique for positive definite linear systems
HTML articles powered by AMS MathViewer

by T. A. Manteuffel PDF
Math. Comp. 34 (1980), 473-497 Request permission


This paper describes a technique for solving the large sparse symmetric linear systems that arise from the application of finite element methods. The technique combines an incomplete factorization method called the shifted incomplete Cholesky factorization with the method of generalized conjugate gradients. The shifted incomplete Cholesky factorization produces a splitting of the matrix A that is dependent upon a parameter $\alpha$. It is shown that if A is positive definite, then there is some $\alpha$ for which this splitting is possible and that this splitting is at least as good as the Jacobi splitting. The method is shown to be more efficient on a set of test problems than either direct methods or explicit iteration schemes.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65F10, 15A06
  • Retrieve articles in all journals with MSC: 65F10, 15A06
Additional Information
  • © Copyright 1980 American Mathematical Society
  • Journal: Math. Comp. 34 (1980), 473-497
  • MSC: Primary 65F10; Secondary 15A06
  • DOI:
  • MathSciNet review: 559197