A robust preconditioner for high-contrast problems (research)

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper concerns robust numerical treatment of an elliptic PDE with high contrast coefficients. A finite-element discretization of such an equation yields a linear system whose conditioning worsens as the variations in the values of PDE coefficients becomes large. This paper introduces a procedure by which the discrete system obtained from a linear finite element discretization of the given continuum problem is converted into an equivalent linear system of the saddle point type. Then a robust preconditioner for the Lanczos method of minimized iterations for solving the derived saddle point problem is proposed. Robustness with respect to the contrast parameter and the mesh size is justified. Numerical examples support theoretical results and demonstrate independence of the number of iterations on the contrast, the mesh size and also on the different contrasts on the inclusions.

Cite

CITATION STYLE

APA

Gorb, Y., Kurzanova, D., & Kuznetsov, Y. (2020). A robust preconditioner for high-contrast problems (research). In Association for Women in Mathematics Series (Vol. 21, pp. 289–310). Springer. https://doi.org/10.1007/978-3-030-42687-3_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free