An iterative generalized Golub-Kahan algorithm for problems in structural mechanics

Beitrag in einer Fachzeitschrift

Details zur Publikation

Autor(en): Arioli M, Kruse C, Rüde U, Tardieu N
Zeitschrift: arXiv
Jahr der Veröffentlichung: 2018
ISSN: 2331-8442


This paper studies the Craig variant of the Golub-Kahan bidiagonalization algorithm as an iterative solver for linear systems with saddle point structure. Such symmetric indefinite systems in 2x2 block form arise in many applications, but standard iterative solvers are often found to perform poorly on them and robust preconditioners may not be available. Specifically, such systems arise in structural mechanics, when a semidefinite finite element stiffness matrix is augmented with linear multi-point constraints via Lagrange multipliers. Engineers often use such multi-point constraints to introduce boundary or coupling conditions into complex finite element models. The article will present a systematic convergence study of the Golub-Kahan algorithm for a sequence of test problems of increasing complexity, including concrete structures enforced with pretension cables and the coupled finite element model of a reactor containment building. When the systems are suitably transformed using augmented Lagrangians on the semidefinite block and when the constraint equations are properly scaled, the Golub-Kahan algorithm is found to exhibit excellent convergence that depends only weakly on the size of the model. The new algorithm is found to be robust in practical cases that are otherwise considered to be difficult for iterative solvers.

FAU-Autoren / FAU-Herausgeber

Kruse, Carola Dr.
Lehrstuhl für Informatik 10 (Systemsimulation)
Rüde, Ulrich Prof. Dr.
Lehrstuhl für Informatik 10 (Systemsimulation)


Arioli, M., Kruse, C., Rüde, U., & Tardieu, N. (2018). An iterative generalized Golub-Kahan algorithm for problems in structural mechanics. arXiv.

Arioli, Mario, et al. "An iterative generalized Golub-Kahan algorithm for problems in structural mechanics." arXiv (2018).


Zuletzt aktualisiert 2019-15-05 um 08:09