pith. sign in

arxiv: 1801.01578 · v1 · pith:DSKQZTX5new · submitted 2018-01-04 · 🧮 math.NA · cs.NA

A Robust Preconditioner for High-Contrast Problems

classification 🧮 math.NA cs.NA
keywords linearsystemcontrastdiscretizationiterationsmeshpointpreconditioner
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.