Accurate Sum and Dot Product
From MaRDI portal
Publication:5693174
DOI10.1137/030601818zbMath1084.65041OpenAlexW1968165559MaRDI QIDQ5693174
Shin'ichi Oishi, Takeshi Ogita, Siegfried Michael Rump
Publication date: 22 September 2005
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/85216d293b272caf6d8677990d0d636cd56934a4
numerical examplesfast algorithmscomparisonsill-conditioned problemsverified error boundsaccurate dot productaccurate summationfloating-point numbers
Related Items
Newton projection method as applied to assembly simulation ⋮ Computing enclosures for the matrix Mittag-Leffler function ⋮ Iterative refinement for symmetric eigenvalue decomposition ⋮ Convergence of Rump's method for inverting arbitrarily ill-conditioned matrices ⋮ 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 ⋮ Formalization of Double-Word Arithmetic, and Comments on “Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic” ⋮ Numerically stable, scalable formulas for parallel and online computation of higher-order multivariate central moments with arbitrary weights ⋮ Floating-point arithmetic on the test bench. How are verified numerical solutions calculated? ⋮ Super-fast validated solution of linear systems ⋮ A method of obtaining verified solutions for linear systems suited for Java ⋮ Verified computation of matrix gamma function ⋮ Computing the expected Markov reward rates with stationarity detection and relative error control ⋮ Verified computation of real powers of matrices ⋮ Verified inclusions for a nearest matrix of specified rank deficiency via a generalization of Wedin's \(\sin (\theta)\) theorem ⋮ Verified numerical computations for large-scale linear systems. ⋮ Parametric inverse of severely ill-conditioned Hermitian matrices in signal processing ⋮ High performance verified computing using C-XSC ⋮ 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 ⋮ 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 ⋮ Solvers for the verified solution of parametric linear systems ⋮ On the numerical stability of algorithmic differentiation ⋮ On the stability of Filon-Clenshaw-Curtis rules ⋮ Matrix computations and polynomial root-finding with preprocessing ⋮ Additive preconditioning and aggregation in matrix computations ⋮ 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 ⋮ The relative formulation of the quadratic programming problem in the aircraft assembly modeling ⋮ On relative errors of floating-point operations: Optimal bounds and applications ⋮ An algorithm for automatically selecting a suitable verification method for linear systems ⋮ Some issues related to double rounding ⋮ Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form ⋮ High-precision computation: mathematical physics and dynamics ⋮ Verified error bounds for solutions of Sylvester matrix equations ⋮ On design and implementation of a generic number type for real algebraic number computations based on expression dags ⋮ Stable application of Filon-Clenshaw-Curtis rules to singular oscillatory integrals by exponential transformations ⋮ Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications ⋮ Three-dimensional element configurations for the discontinuous enrichment method for acoustics ⋮ Accurate, validated and fast evaluation of elementary symmetric functions and its application ⋮ Accurate quotient-difference algorithm: error analysis, improvements and applications ⋮ Dense linear system: A parallel self-verified solver ⋮ Linear combination of independent exponential random variables ⋮ Accurate and efficient evaluation of Chebyshev tensor product surface ⋮ Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems ⋮ Convergence analysis of an algorithm for accurate inverse Cholesky factorization ⋮ Randomized preprocessing of homogeneous linear systems of equations ⋮ Compensated de Casteljau algorithm in \(K\) times the working precision ⋮ 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 ⋮ Comparing high-order multivariate AD methods ⋮ Efficiency of Reproducible Level 1 BLAS ⋮ Accurate simple zeros of polynomials in floating point arithmetic ⋮ Enclosing Chebyshev Expansions in Linear Time ⋮ Iterative refinement for singular value decomposition based on matrix multiplication ⋮ Modified error bounds for approximate solutions of dense linear systems ⋮ Numerical validation of compensated summation algorithms with stochastic arithmetic ⋮ Reproducibility strategies for parallel preconditioned conjugate gradient ⋮ Verified bounds for the determinant of real or complex point or interval matrices ⋮ Performance and energy consumption of accurate and mixed-precision linear algebra kernels on GPUs ⋮ 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 ⋮ Convergence of Rump’s method for computing the Moore-Penrose inverse ⋮ A new error-free floating-point summation algorithm ⋮ Numerical validation of compensated algorithms with stochastic arithmetic ⋮ Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues ⋮ A fast parallel high-precision summation algorithm based on AccSumK ⋮ A note on Dekker's FastTwoSum algorithm ⋮ Convergence analysis of accurate inverse Cholesky factorization ⋮ A fast and efficient algorithm for solving ill-conditioned linear systems ⋮ An accurate algorithm for evaluating rational functions ⋮ Accurate evaluation of polynomials in Legendre basis ⋮ Automatic evaluations of cross-derivatives ⋮ PACF: a precision-adjustable computational framework for solving singular values ⋮ \textsf{ORTHOPOLY}: a library for accurate evaluation of series of classical orthogonal polynomials and their derivatives ⋮ Improvement of error-free splitting for accurate matrix multiplication ⋮ Algorithm 960 ⋮ A generalized Kahan-Babuška-summation-algorithm
Uses Software
