An algorithm for automatically selecting a suitable verification method for linear systems
From MaRDI portal
Publication:633151
DOI10.1007/S11075-010-9389-6zbMATH Open1209.65051OpenAlexW2051982336MaRDI QIDQ633151FDOQ633151
Authors: Katsuhisa Ozaki, Takeshi Ogita, Shin'ichi Oishi 
Publication date: 31 March 2011
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-010-9389-6
Recommendations
- Tight enclosures of solutions of linear systems
- Fast verified solutions of linear systems
- Computation of sharp rigorous componentwise error bounds for the approximate solutions of systems of linear equations
- scientific article; zbMATH DE number 1206063
- Refining and verifying the solution of a linear system
Direct numerical methods for linear systems and matrix inversion (65F05) Algorithms with automatic result verification (65G20)
Cites Work
- Title not available (Why is that?)
- Accuracy and Stability of Numerical Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inversion of extremely ill-conditioned matrices in floating-point
- Fast and parallel interval arithmetic
- Accurate Sum and Dot Product
- Convergence of Rump's method for inverting arbitrarily ill-conditioned matrices
- Fast verification of solutions of matrix equations
- Computation of sharp rigorous componentwise error bounds for the approximate solutions of systems of linear equations
- Fast inclusion of interval matrix multiplication
- Title not available (Why is that?)
- Fast verified solutions of linear systems
- A method of obtaining verified solutions for linear systems suited for Java
Cited In (4)
Uses Software
This page was built for publication: An algorithm for automatically selecting a suitable verification method for linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633151)
