Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

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



The construction of preconditioners for elliptic problems by substructuring. III

Authors: James H. Bramble, Joseph E. Pasciak and Alfred H. Schatz
Journal: Math. Comp. 51 (1988), 415-430
MSC: Primary 65N30; Secondary 65F10
MathSciNet review: 935071
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: In earlier parts of this series of papers, we constructed preconditioners for the discrete systems of equations arising from the numerical approximation of elliptic boundary value problems. The resulting algorithms are well suited for implementation on computers with parallel architecture. In this paper, we will develop a technique which utilizes these earlier methods to derive even more efficient preconditioners. The iterative algorithms using these new preconditioners converge to the solution of the discrete equations with a rate that is independent of the number of unknowns. These preconditioners involve an incomplete Chebyshev iteration for boundary interface conditions which results in a negligible increase in the amount of computational work. Theoretical estimates and the results of numerical experiments are given which demonstrate the effectiveness of the methods.

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

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65N30, 65F10

Retrieve articles in all journals with MSC: 65N30, 65F10

Additional Information

Article copyright: © Copyright 1988 American Mathematical Society