A method for verifying the accuracy of numerical solutions of symmetric saddle point linear systems
DOI10.1007/S11075-016-0240-6zbMATH Open1378.65085OpenAlexW2554480944MaRDI QIDQ2408147FDOQ2408147
Authors: Ryo Kobayashi, Takuma Kimura, Shin'ichi Oishi
Publication date: 10 October 2017
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-016-0240-6
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
Computational methods for sparse matrices (65F50) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10)
Cites Work
- Title not available (Why is that?)
- Numerical solution of saddle point problems
- A mixed formulation for the Brinkman problem
- Finite Elements
- Eigenvalue estimates for preconditioned saddle point matrices
- Fast verification of solutions of matrix equations
- Verified bounds for singular values, in particular for the spectral norm of a matrix and its inverse
- Validated Solutions of Saddle Point Linear Systems
- Numerical validation of solutions of saddle point matrix equations
- Accurate solution of dense linear systems. II: Algorithms using directed rounding
Cited In (2)
Uses Software
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)