A Tridiagonalization Method for Symmetric Saddle-Point Systems - Algorithmes Parallèles et Optimisation Accéder directement au contenu
Article Dans Une Revue SIAM Journal on Scientific Computing Année : 2019

A Tridiagonalization Method for Symmetric Saddle-Point Systems

Résumé

We propose an iterative method for the solution of symmetric saddle-point systems that exploits the orthogonal tridiagonalization method of Saunders, Simon, and Yip (1988). By contrast with methods based on the Golub and Kahan (1965) bidiagonalization process, our method takes advantage of two initial vectors and splits the system into the sum of a least-squares and a least-norm problem. Our method typically requires fewer operator-vector products than MINRES, yet performs a comparable amount of work per iteration and has comparable storage requirements.
Fichier principal
Vignette du fichier
A_Tridiagonalization_Method_for_Symmetric_Saddle_Point_and_Quasi_Definite_Systems_.pdf (894.91 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02343661 , version 1 (27-12-2019)

Identifiants

Citer

Alfredo Buttari, Dominique Orban, Daniel Ruiz, David Titley-Peloquin. A Tridiagonalization Method for Symmetric Saddle-Point Systems. SIAM Journal on Scientific Computing, 2019, 41 (5), pp.S409-S432. ⟨10.1137/18M1194900⟩. ⟨hal-02343661⟩
67 Consultations
151 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More