Algorithms for roundoff error analysis - a relative error approach
From MaRDI portal
Publication:1132500
Cites work
- scientific article; zbMATH DE number 3473182 (Why is no real title available?)
- scientific article; zbMATH DE number 1024452 (Why is no real title available?)
- scientific article; zbMATH DE number 3257775 (Why is no real title available?)
- An Improved Algorithm for Discrete $l_1 $ Linear Approximation
- Computational Graphs and Rounding Error
- Efficient Calculation of the Effects of Roundoff Errors
- Errata: “Efficient Calculation of the Effects of Roundoff Errors”
- Graph Transformations for Roundoff Analysis
- Linear Programming Algorithms for the Chebyshev Solution to a System of Consistent Linear Equations
- Methods for Modifying Matrix Factorizations
- Reducibility Among Floating-Point Graphs
- Roundoff Analysis by Direct Comparison of Two Algorithms
- Software for Roundoff Analysis
- Software for roundoff analysis, II
- Taylor expansion of the accumulated rounding error
This page was built for publication: Algorithms for roundoff error analysis - a relative error approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1132500)