Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Bramble et al. (1986) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: