A method for verifying the accuracy of numerical solutions of symmetric saddle point linear systems
From MaRDI portal
Publication:2408147
The authors are concerned with the verification of numerical solutions of symmetric saddle point linear systems. Their method is based on results of an algebraic analysis of a block diagonal preconditioner. They extend in this way some previous similar results. Numerical experiments and comparisons with previous algorithms are also presented.
Recommendations
- Validated Solutions of Saddle Point Linear Systems
- Numerical validation of solutions of saddle point matrix equations
- Fast verified solutions of linear systems
- A symmetric positive definite preconditioner for saddle-point problems
- An efficient numerical method for preconditioned saddle point problems
Cites work
- A mixed formulation for the Brinkman problem
- Accurate solution of dense linear systems. II: Algorithms using directed rounding
- Eigenvalue estimates for preconditioned saddle point matrices
- Fast verification of solutions of matrix equations
- Finite Elements
- scientific article; zbMATH DE number 1440908 (Why is no real title available?)
- Numerical solution of saddle point problems
- Numerical validation of solutions of saddle point matrix equations
- Validated Solutions of Saddle Point Linear Systems
- Verified bounds for singular values, in particular for the spectral norm of a matrix and its inverse
Cited in
(2)
This page was built for publication: A method for verifying the accuracy of numerical solutions of symmetric saddle point linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408147)