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.


Preconditioning by incomplete block cyclic reduction
HTML articles powered by AMS MathViewer

by Garry Rodrigue and Donald Wolitzer PDF
Math. Comp. 42 (1984), 549-565 Request permission


Iterative methods for solving linear systems arising from the discretization of elliptic/parabolic partial differential equations require the use of preconditioners to gain increased rates of convergence. Preconditioners arising from incomplete factorizations have been shown to be very effective. However, the recursiveness of these methods can offset these gains somewhat on a vector processor. In this paper, an incomplete factorization based on block cyclic reduction is developed. It is shown that under block diagonal dominance conditions the off-diagonal terms decay quadratically, yielding more effective algorithms.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65F10, 65W05
  • Retrieve articles in all journals with MSC: 65F10, 65W05
Additional Information
  • © Copyright 1984 American Mathematical Society
  • Journal: Math. Comp. 42 (1984), 549-565
  • MSC: Primary 65F10; Secondary 65W05
  • DOI:
  • MathSciNet review: 736452