An Iterative Method for Elliptic Problems on Regions Partitioned into Substructures
- 1 April 1986
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 46 (174) , 361-369
- https://doi.org/10.2307/2007981
Abstract
Some new preconditioners for discretizations of elliptic boundary problems are studied. With these preconditioners, the domain under consideration is broken into subdomains and preconditioners are defined which only require the solution of matrix problems on the subdomains. Analytic estimates are given which guarantee that under appropriate hypotheses, the preconditioned iterative procedure converges to the solution of the discrete equations with a rate per iteration that is independent of the number of unknowns. Numerical examples are presented which illustrate the theoretically predicted iterative convergence rates.Keywords
This publication has 8 references indexed in Scilit:
- Elliptic Problems in Nonsmooth DomainsPublished by Society for Industrial & Applied Mathematics (SIAM) ,2011
- Numerical Solution of Elliptic ProblemsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1984
- A capacitance matrix method for Dirichlet problem on polygon regionNumerische Mathematik, 1982
- A Finite Element-Capacitance Matrix Method for the Neumann Problem for Laplace’s EquationSIAM Journal on Scientific and Statistical Computing, 1980
- A class of iterative methods for finite element equationsComputer Methods in Applied Mechanics and Engineering, 1976
- A GENERALIZED CONJUGATE GRADIENT METHOD FOR THE NUMERICAL SOLUTION OF ELLIPTIC PARTIAL DIFFERENTIAL EQUATIONSPublished by Elsevier ,1976
- The Direct Solution of the Biharmonic Equation on Rectangular Regions and the Poisson Equation on Irregular RegionsSIAM Journal on Numerical Analysis, 1974
- The Direct Solution of the Discrete Poisson Equation on Irregular RegionsSIAM Journal on Numerical Analysis, 1971