A sharp error bound of the approximate solutions for saddle point linear systems
From MaRDI portal
Publication:464634
DOI10.1016/j.cam.2014.09.003zbMath1302.65080OpenAlexW2005255273MaRDI QIDQ464634
Publication date: 28 October 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2014.09.003
convergence accelerationerror estimationfast algorithmnumerical resultrounding errorverified error boundsaddle point linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On interval systems \([x = [A][x] + [b]\) and the powers of interval matrices in complex interval arithmetics]
- Fast verification of solutions of matrix equations
- Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hemitian positive semidefinite linear systems
- An Iterative Method with Variable Relaxation Parameters for Saddle-Point Problems
- Verified Bounds for Least Squares Problems and Underdetermined Linear Systems
- Accelerated Hermitian and skew-Hermitian splitting iteration methods for saddle-point problems
- Validated Solutions of Saddle Point Linear Systems
- Restrictively preconditioned conjugate gradient methods for systems of linear equations
- Accuracy and Stability of Numerical Algorithms
- Numerical validation of solutions of saddle point matrix equations