An Optimal Order Process for Solving Finite Element Equations
Open Access
- 1 January 1981
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 36 (153) , 35-51
- https://doi.org/10.2307/2007724
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.Keywords
This publication has 12 references indexed in Scilit:
- Polynomial Approximation of Functions in Sobolev SpacesMathematics of Computation, 1980
- Incomplete Iteration for Time-Stepping a Galerkin Method for a Quasilinear Parabolic ProblemSIAM Journal on Numerical Analysis, 1979
- Discrete Methods for Parabolic Equations with Time-Dependent CoefficientsPublished by Elsevier ,1979
- Multi-Level Adaptive Solutions to Boundary-Value ProblemsMathematics of Computation, 1977
- Estimations d'erreur pour des éléments finis droits presque dégénérésRevue française d'automatique, informatique, recherche opérationnelle. Analyse numérique, 1976
- BEHAVIOR OF THE SOLUTIONS OF AN ELLIPTIC BOUNDARY VALUE PROBLEM IN A POLYGONAL OR POLYHEDRAL DOMAINPublished by Elsevier ,1976
- A Recursive Analysis of Dissection Strategies††This work was supported in part by the Office of Naval Research under contract N00014-75-C-0243.Published by Elsevier ,1976
- On multiple grid and related techniques for solving discrete elliptic systemsJournal of Computational Physics, 1975
- Bounds for a class of linear functionals with applications to Hermite interpolationNumerische Mathematik, 1971
- Triangular Elements in the Finite Element MethodMathematics of Computation, 1970