A least squares approach for saddle point problems
DOI10.1007/s13160-022-00509-yzbMath1505.65159OpenAlexW4223510398MaRDI QIDQ2111547
Ren-Cang Li, Mei Yang, Gul Karaduman
Publication date: 17 January 2023
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13160-022-00509-y
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Linear equations (linear algebraic aspects) (15A06) Orthogonalization in numerical linear algebra (65F25)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On semi-convergence of the Uzawa-HSS method for singular saddle-point problems
- Refined saddle-point preconditioners for discretized Stokes problems
- Saddlepoint methods and statistical inference. With comments and a rejoinder by the author
- A shift-splitting preconditioner for asymmetric saddle point problems
- Null-Space Preconditioners for Saddle Point Systems
- The university of Florida sparse matrix collection
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- Numerical solution of saddle point problems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- An Inexact Uzawa Algorithmic Framework for Nonlinear Saddle Point Problems with Applications to Elliptic Optimal Control Problem
- On Nonsingular Saddle-Point Systems with a Maximally Rank Deficient Leading Block
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
This page was built for publication: A least squares approach for saddle point problems
