A method for verifying the accuracy of numerical solutions of symmetric saddle point linear systems

DOI10.1007/s11075-016-0240-6zbMath1378.65085OpenAlexW2554480944MaRDI QIDQ2408147

Shin'ichi Oishi, Takuma Kimura, Ryo Kobayashi

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

zbMATH Keywords

numerical experimentsnumerical verificationblock preconditioningsaddle point matrix

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)

Uses Software

• INTLAB

Cites Work

• Unnamed Item
• Verified bounds for singular values, in particular for the spectral norm of a matrix and its inverse
• Fast verification of solutions of matrix equations
• Accurate solution of dense linear systems. II: Algorithms using directed rounding
• Numerical solution of saddle point problems
• Eigenvalue estimates for preconditioned saddle point matrices
• Validated Solutions of Saddle Point Linear Systems
• Numerical validation of solutions of saddle point matrix equations
• A Mixed Formulation for the Brinkman Problem
• Finite Elements

This page was built for publication: A method for verifying the accuracy of numerical solutions of symmetric saddle point linear systems