Super-fast validated solution of linear systems
DOI10.1016/J.CAM.2005.07.038zbMATH Open1108.65020OpenAlexW1974511919MaRDI QIDQ861871FDOQ861871
Authors: Takeshi Ogita, Siegfried M. Rump 
Publication date: 2 February 2007
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.2005.07.038
Recommendations
- scientific article; zbMATH DE number 524107
- Fast verified solutions of linear systems
- Validated Solutions of Saddle Point Linear Systems
- Fast verification of solutions of matrix equations
- Computation of sharp rigorous componentwise error bounds for the approximate solutions of systems of linear equations
numerical resultsCholesky decompositioninterval arithmeticsparse linear systemsself-validating methodssymmetric positive definite matrixINTLABverified error boundssuper-fast validation algorithm
Direct numerical methods for linear systems and matrix inversion (65F05) Interval and finite arithmetic (65G30) Algorithms with automatic result verification (65G20)
Cites Work
- Title not available (Why is that?)
- Interval Methods for Systems of Equations
- Accuracy and Stability of Numerical Algorithms
- Title not available (Why is that?)
- Accurate Sum and Dot Product
- Title not available (Why is that?)
- Fast verification of solutions of matrix equations
- Design, implementation and testing of extended and mixed precision BLAS
- Computation of sharp rigorous componentwise error bounds for the approximate solutions of systems of linear equations
- Title not available (Why is that?)
Cited In (10)
- Solving systems of linear fuzzy equations by parametric functions -- an improved algorithm
- Interval arithmetic for nonlinear problem solving
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- On verified numerical computations in convex programming
- Fast verified solutions of linear systems
- Title not available (Why is that?)
- Rigorous verification of feasibility
- Shifted Cholesky QR for computing the QR factorization of ill-conditioned matrices
- Correct approximation of IEEE 754 floating-point arithmetic for program verification
- Validated Solutions of Saddle Point Linear Systems
Uses Software
This page was built for publication: Super-fast validated solution of linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861871)
