A Tridiagonalization Method for Symmetric Saddle-Point Systems - Archive ouverte HAL Access content directly
Journal Articles SIAM Journal on Scientific Computing Year : 2019

A Tridiagonalization Method for Symmetric Saddle-Point Systems

Abstract

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
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

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⟩
71 View
158 Download

Altmetric

Share

Gmail Facebook X LinkedIn More