Accurate Floating-Point Summation Part I: Faithful Rounding
From MaRDI portal
Publication:5189669
DOI10.1137/050645671zbMath1185.65082OpenAlexW2002064155MaRDI QIDQ5189669
Shin'ichi Oishi, Takeshi Ogita, Siegfried Michael Rump
Publication date: 10 March 2010
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050645671
algorithmnumerical exampleserror analysiscondition numberhigh accuracydistillationerror-free transformationfloating-point numbersfaithful roundingmaximally accurate summationXBLASextended and mixed precision basic linear algebra subprograms
Roundoff error (65G50) Numerical computation of matrix norms, conditioning, scaling (65F35) Software, source code, etc. for problems pertaining to linear algebra (15-04) Software, source code, etc. for problems pertaining to numerical analysis (65-04) Error analysis and interval analysis (65G99)
Related Items (59)
Generation of test matrices with specified eigenvalues using floating-point arithmetic ⋮ Improved error bounds for floating-point products and Horner's scheme ⋮ Iterative refinement for symmetric eigenvalue decomposition ⋮ Schur aggregation for linear systems and determinants ⋮ Minimizing synchronizations in sparse iterative solvers for distributed supercomputers ⋮ Fast verified solutions of linear systems ⋮ Algorithms for accurate, validated and fast polynomial evaluation ⋮ Adaptive and efficient algorithm for 2D orientation problem ⋮ Inversion of extremely ill-conditioned matrices in floating-point ⋮ Iterative refinement for ill-conditioned linear systems ⋮ Compensated summation and dot product algorithms for floating-point vectors on parallel architectures: error bounds, implementation and application in the Krylov subspace methods ⋮ Computing predecessor and successor in rounding to nearest ⋮ Sharp error bounds for complex floating-point inversion ⋮ A method of obtaining verified solutions for linear systems suited for Java ⋮ TELEMAC: an efficient hydrodynamics suite for massively parallel architectures ⋮ Further analysis of Kahan’s algorithm for the accurate computation of $2\times 2$ determinants ⋮ Verified inclusions for a nearest matrix of specified rank deficiency via a generalization of Wedin's \(\sin (\theta)\) theorem ⋮ The Schur aggregation and solving ill conditioned linear systems: the convergence theorem ⋮ Accurate evaluation of a polynomial and its derivative in Bernstein form ⋮ Fast enclosure for solutions of Sylvester equations ⋮ On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots ⋮ Computation of the unit in the first place (ufp) and the unit in the last place (ulp) in precision-\(p\) base \(\beta\) ⋮ Floating-point arithmetic ⋮ Formal verification of a floating-point expansion renormalization algorithm ⋮ Fast and accurate computation of the Euclidean norm of a vector ⋮ Error‐free transformation of matrix multiplication with a posteriori validation ⋮ Finding normal binary floating-point factors efficiently ⋮ On computing high-dimensional Riemann theta functions ⋮ On relative errors of floating-point operations: Optimal bounds and applications ⋮ Some issues related to double rounding ⋮ Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form ⋮ Fast interval matrix multiplication ⋮ Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications ⋮ Primitive Floats in Coq ⋮ Computing Enclosures for the Matrix Exponential ⋮ Accurate, validated and fast evaluation of elementary symmetric functions and its application ⋮ Accurate quotient-difference algorithm: error analysis, improvements and applications ⋮ Convergence analysis of an algorithm for accurate inverse Cholesky factorization ⋮ Randomized preprocessing of homogeneous linear systems of equations ⋮ Approximate Calculation of Sums II: Gaussian Type Quadrature ⋮ Accurate evaluation of a polynomial in Chebyshev form ⋮ A robust algorithm for geometric predicate by error-free determinant transformation ⋮ Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic ⋮ Efficiency of Reproducible Level 1 BLAS ⋮ Enclosing Chebyshev Expansions in Linear Time ⋮ The relative accuracy of \(\mathtt{(x+y)*(x-y)}\) ⋮ Verified bounds for the determinant of real or complex point or interval matrices ⋮ Selected Implementation Issues in Computation of the Grünwald-Letnikov Fractional-Order Difference by Means of Embedded System ⋮ CAMPARY: Cuda Multiple Precision Arithmetic Library and Applications ⋮ Fast and Stable Multivariate Kernel Density Estimation by Fast Sum Updating ⋮ Efficient Calculations of Faithfully Rounded l 2 -Norms of n -Vectors ⋮ Error estimation of floating-point summation and dot product ⋮ A fast parallel high-precision summation algorithm based on AccSumK ⋮ A note on Dekker's FastTwoSum algorithm ⋮ Lagrangian Flux Calculation Through a Fixed Planar Curve for Scalar Conservation Laws ⋮ Convergence analysis of accurate inverse Cholesky factorization ⋮ Improvement of error-free splitting for accurate matrix multiplication ⋮ Verified compilation of floating-point computations ⋮ A Radix-Independent Error Analysis of the Cornea-Harrison-Tang Method
Uses Software
This page was built for publication: Accurate Floating-Point Summation Part I: Faithful Rounding
