Improved error bounds for inner products in floating-point arithmetic
From MaRDI portal
Publication:2848614
DOI10.1137/120894488zbMATH Open1279.65052OpenAlexW1984470719MaRDI QIDQ2848614FDOQ2848614
Authors: Claude-Pierre Jeannerod, Siegfried M. Rump
Publication date: 26 September 2013
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/120894488
Recommendations
error boundmatrix multiplicationrounding error analysisunit in the first placefloating-point inner product
Cited In (33)
- Error bounds on complex floating-point multiplication
- Numerical validation of compensated algorithms with stochastic arithmetic
- Improved error bounds for floating-point products and Horner's scheme
- Evaluation schemes in the ring of quaternionic polynomials
- Error estimates for the summation of real numbers with application to floating-point summation
- A Framework for Error-Bounded Approximate Computing, with an Application to Dot Products
- Generation of test matrices with specified eigenvalues using floating-point arithmetic
- Improvement of error-free splitting for accurate matrix multiplication
- Title not available (Why is that?)
- A priori worst case error bounds for floating-point computations
- On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic
- Backward error analysis of the shift-and-invert Arnoldi algorithm
- Error Analysis of TT-Format Tensor Algorithms
- Error estimation of floating-point summation and dot product
- Improving Floating-Point Numbers: A Lazy Approach to Adaptive Accuracy Refinement for Numerical Computations
- A Class of Fast and Accurate Summation Algorithms
- Adaptive Precision Sparse Matrix–Vector Product and Its Application to Krylov Solvers
- Precision-aware deterministic and probabilistic error bounds for floating point summation
- Verified numerical computations for large-scale linear systems.
- Floating-point arithmetic on the test bench. How are verified numerical solutions calculated?
- Homoclinic chaos in a perennial grass model
- Rigorous domain triangulation for the finite element computation
- Stochastic rounding and its probabilistic backward error analysis
- Mixed-precision conjugate gradient algorithm using the groupwise update strategy
- Formal verification of a floating-point expansion renormalization algorithm
- On relative errors of floating-point operations: optimal bounds and applications
- Inner product rounding error analysis in the presence of underflow
- Sharp estimates for perturbation errors in summations
- Extension of accurate numerical algorithms for matrix multiplication based on error-free transformation
- Error bounds on complex floating-point multiplication with an FMA
- A New Approach to Probabilistic Rounding Error Analysis
- Probabilistic Error Analysis for Inner Products
- \(LU\) factorization of any matrix
Uses Software
This page was built for publication: Improved error bounds for inner products in floating-point arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848614)