Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

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



An optimal order process for solving finite element equations

Authors: Randolph E. Bank and Todd Dupont
Journal: Math. Comp. 36 (1981), 35-51
MSC: Primary 65N30; Secondary 65F10
MathSciNet review: 595040
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: A k-level iterative procedure for solving the algebraic equations which arise from the finite element approximation of elliptic boundary value problems is presented and analyzed. The work estimate for this procedure is proportional to the number of unknowns, an optimal order result. General geometry is permitted for the underlying domain, but the shape plays a role in the rate of convergence through elliptic regularity. Finally, a short discussion of the use of this method for parabolic problems is presented.

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 1981 American Mathematical Society

American Mathematical Society