Verified numerical computations for large-scale linear systems.
From MaRDI portal
Publication:2662465
DOI10.21136/AM.2021.0318-19OpenAlexW3122902324MaRDI QIDQ2662465
Takahiro Katagiri, Takeshi Terao, Katsuhisa Ozaki, Takeshi Ogita
Publication date: 13 April 2021
Published in: Applications of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.21136/am.2021.0318-19
floating-point arithmetichigh-performance computinglarge-scale linear systemverified numerical computation
Roundoff error (65G50) Parallel numerical computation (65Y05) Algorithms with automatic result verification (65G20)
Uses Software
Cites Work
- Unnamed Item
- Reducing Floating Point Error in Dot Product Using the Superblock Family of Algorithms
- An algorithm for automatically selecting a suitable verification method for linear systems
- A method of obtaining verified solutions for linear systems suited for Java
- Fast verification of solutions of matrix equations
- Computation of sharp rigorous componentwise error bounds for the approximate solutions of systems of linear equations
- A simple derivation of the Hansen-Bliek-Rohn-Ning-Kearfott enclosure for linear interval equations
- Accurate solution of dense linear systems I: Algorithms in rounding to nearest
- Accurate solution of dense linear systems. II: Algorithms using directed rounding
- Gaussian elimination is not optimal
- Improved Error Bounds for Inner Products in Floating-Point Arithmetic
- An efficient approach to solve very large dense linear systems with verified computing on clusters
- Iterative Refinement Implies Numerical Stability for Gaussian Elimination
- ScaLAPACK Users' Guide
- Accuracy and Stability of Numerical Algorithms
- A New Approach to Probabilistic Rounding Error Analysis
- Accurate Sum and Dot Product
This page was built for publication: Verified numerical computations for large-scale linear systems.