TY - JOUR
T1 - A new preconditioner update strategy for the solution of sequences of linear systems in structural mechanics
T2 - application to saddle point problems in elasticity
AU - Mercier, Sylvain
AU - Gratton, Serge
AU - Tardieu, Nicolas
AU - Vasseur, Xavier
N1 - Publisher Copyright:
© 2017, Springer-Verlag GmbH Germany.
PY - 2017/12/1
Y1 - 2017/12/1
N2 - Many applications in structural mechanics require the numerical solution of sequences of linear systems typically issued from a finite element discretization of the governing equations on fine meshes. The method of Lagrange multipliers is often used to take into account mechanical constraints. The resulting matrices then exhibit a saddle point structure and the iterative solution of such preconditioned linear systems is considered as challenging. A popular strategy is then to combine preconditioning and deflation to yield an efficient method. We propose an alternative that is applicable to the general case and not only to matrices with a saddle point structure. In this approach, we consider to update an existing algebraic or application-based preconditioner, using specific available information exploiting the knowledge of an approximate invariant subspace or of matrix-vector products. The resulting preconditioner has the form of a limited memory quasi-Newton matrix and requires a small number of linearly independent vectors. Numerical experiments performed on three large-scale applications in elasticity highlight the relevance of the new approach. We show that the proposed method outperforms the deflation method when considering sequences of linear systems with varying matrices.
AB - Many applications in structural mechanics require the numerical solution of sequences of linear systems typically issued from a finite element discretization of the governing equations on fine meshes. The method of Lagrange multipliers is often used to take into account mechanical constraints. The resulting matrices then exhibit a saddle point structure and the iterative solution of such preconditioned linear systems is considered as challenging. A popular strategy is then to combine preconditioning and deflation to yield an efficient method. We propose an alternative that is applicable to the general case and not only to matrices with a saddle point structure. In this approach, we consider to update an existing algebraic or application-based preconditioner, using specific available information exploiting the knowledge of an approximate invariant subspace or of matrix-vector products. The resulting preconditioner has the form of a limited memory quasi-Newton matrix and requires a small number of linearly independent vectors. Numerical experiments performed on three large-scale applications in elasticity highlight the relevance of the new approach. We show that the proposed method outperforms the deflation method when considering sequences of linear systems with varying matrices.
KW - Deflation
KW - Nonsymmetric matrices
KW - Preconditioning
KW - Saddle point matrices
KW - Sequence of linear systems
KW - Structural mechanics
U2 - 10.1007/s00466-017-1450-z
DO - 10.1007/s00466-017-1450-z
M3 - Article
AN - SCOPUS:85026456146
SN - 0178-7675
VL - 60
SP - 969
EP - 982
JO - Computational Mechanics
JF - Computational Mechanics
IS - 6
ER -