Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
From MaRDI portal
Publication:3558689
DOI10.1137/07068816XzbMath1190.65074MaRDI QIDQ3558689
Shin'ichi Oishi, Takeshi Ogita, Siegfried Michael Rump
Publication date: 6 May 2010
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
algorithmnumerical exampleserror analysishigh accuracysigndistillationerror-free transformationsdirected roundingfloating-point numbersrounding to nearestfaithful rounding\(K\)-fold accuracymaximally accurate summationXBLAS
Related Items (28)
Iterative refinement for symmetric eigenvalue decomposition ⋮ Fast verified solutions of linear systems ⋮ 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 ⋮ Accurate evaluation of a polynomial and its derivative in Bernstein form ⋮ Fast enclosure for solutions of Sylvester equations ⋮ Fast and accurate computation of the Euclidean norm of a vector ⋮ Error‐free transformation of matrix multiplication with a posteriori validation ⋮ General framework for deriving reproducible Krylov subspace algorithms: BiCGStab case ⋮ Infinite-precision inner product and sparse matrix-vector multiplication using Ozaki scheme with Dot2 on manycore processors ⋮ Some issues related to double rounding ⋮ Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form ⋮ Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications ⋮ 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 ⋮ Accurate evaluation of a polynomial in Chebyshev form ⋮ A robust algorithm for geometric predicate by error-free determinant transformation ⋮ Enclosing Chebyshev Expansions in Linear Time ⋮ Reproducibility strategies for parallel preconditioned conjugate gradient ⋮ Selected Implementation Issues in Computation of the Grünwald-Letnikov Fractional-Order Difference by Means of Embedded System ⋮ Efficient Calculations of Faithfully Rounded l 2 -Norms of n -Vectors ⋮ Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues ⋮ A fast parallel high-precision summation algorithm based on AccSumK ⋮ Convergence analysis of accurate inverse Cholesky factorization
Uses Software
This page was built for publication: Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
