Premium
A parallel block overlap preconditioning with inexact submatrix inversion for linear elasticity problems
Author(s) -
Kaporin Igor E.,
Konshin Igor N.
Publication year - 2002
Publication title -
numerical linear algebra with applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.02
H-Index - 53
eISSN - 1099-1506
pISSN - 1070-5325
DOI - 10.1002/nla.260
Subject(s) - preconditioner , cholesky decomposition , incomplete cholesky factorization , solver , domain decomposition methods , mathematics , linear system , positive definite matrix , incomplete lu factorization , conjugate gradient method , iterative method , factorization , matrix decomposition , algorithm , mathematical optimization , eigenvalues and eigenvectors , finite element method , mathematical analysis , physics , quantum mechanics , thermodynamics
We present a parallel preconditioned iterative solver for large sparse symmetric positive definite linear systems. The preconditioner is constructed as a proper combination of advanced preconditioning strategies. It can be formally seen as being of domain decomposition type with algebraically constructed overlap. Similar to the classical domain decomposition technique, inexact subdomain solvers are used, based on incomplete Cholesky factorization. The proper preconditioner is shown to be near optimal in minimizing the so‐called K ‐condition number of the preconditioned matrix. The efficiency of both serial and parallel versions of the solution method is illustrated on a set of benchmark problems in linear elasticity. Copyright © 2002 John Wiley & Sons, Ltd.