A Tridiagonalization Method for Symmetric Saddle-Point Systems

DOI10.1137/18M1194900zbMath1436.65029OpenAlexW2982575326WikidataQ126867698 ScholiaQ126867698MaRDI QIDQ5241260

Dominique Orban, Alfredo Buttari, David Titley-Peloquin, Daniel Ruiz

Publication date: 30 October 2019

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/18m1194900

zbMATH Keywords

iterative methodsorthogonal tridiagonalizationsymmetric saddle-point systems

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22) Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)

Related Items

GPMR: An Iterative Method for Unsymmetric Partitioned Linear Systems, BiLQ: An Iterative Method for Nonsymmetric Linear Systems with a Quasi-Minimum Error Property, <scp>TriCG</scp> and <scp>TriMR</scp>: Two Iterative Methods for Symmetric Quasi-definite Systems

Uses Software

• LSQR
• SparseMatrix
• CUTEst
• LSMR
• CRAIG

Cites Work

• Approximation of the scattering amplitude and linear systems
• Structured backward errors for KKT systems
• CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
• Iterative Solution of Symmetric Quasi-Definite Linear Systems
• The university of Florida sparse matrix collection
• LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
• Numerical solution of saddle point problems
• On Normwise Structured Backward Errors for Saddle Point Systems
• A generalized LSQR algorithm
• Two Conjugate-Gradient-Type Methods for Unsymmetric Linear Equations
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Solution of Sparse Indefinite Systems of Linear Equations
• A Regularized Factorization-Free Method for Equality-Constrained Optimization
• On the Compatibility of a Given Solution With the Data of a Linear System
• Calculating the Singular Values and Pseudo-Inverse of a Matrix
• Bidiagonalization of Matrices and Solution of Linear Equations
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• Methods of conjugate gradients for solving linear systems
• The N‐Step Iteration Procedures