Accurate Sum and Dot Product
From MaRDI portal
Publication:5693174
numerical examplesill-conditioned problemsfast algorithmscomparisonsverified error boundsaccurate dot productaccurate summationfloating-point numbers
Recommendations
- Ultimately fast accurate summation
- Accurate and Efficient Floating Point Summation
- Fast and accurate floating point summation with application to computational geometry
- Accurate Floating-Point Summation Part I: Faithful Rounding
- Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic
Cited in
(only showing first 100 items - show all)- High performance verified computing using C-XSC
- A fast and efficient algorithm for solving ill-conditioned linear systems
- Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form
- Accurate, validated and fast evaluation of elementary symmetric functions and its application
- Verified computation of matrix gamma function
- Accurate solution of dense linear systems I: Algorithms in rounding to nearest
- Accurate quotient-difference algorithm: error analysis, improvements and applications
- Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic
- The Schur aggregation and solving ill conditioned linear systems: the convergence theorem
- Fast enclosure for solutions of Sylvester equations
- Formalization of Double-Word Arithmetic, and Comments on “Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic”
- Parallel algorithms for rounding exact evaluation of sums of products
- Reducing floating point error in dot product using the superblock family of algorithms
- Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications
- Dense linear system: A parallel self-verified solver
- Some issues related to double rounding
- Schur aggregation for linear systems and determinants
- PACF: a precision-adjustable computational framework for solving singular values
- Additive preconditioning and aggregation in matrix computations
- Correct rounding and a hybrid approach to exact floating-point summation
- Computing enclosures for the matrix Mittag-Leffler function
- A generalized Kahan-Babuška-summation-algorithm
- scientific article; zbMATH DE number 3907664 (Why is no real title available?)
- Infinite-precision inner product and sparse matrix-vector multiplication using Ozaki scheme with Dot2 on manycore processors
- Accurate and efficient evaluation of Chebyshev tensor product surface
- Stable application of Filon-Clenshaw-Curtis rules to singular oscillatory integrals by exponential transformations
- On the numerical stability of algorithmic differentiation
- Three-dimensional element configurations for the discontinuous enrichment method for acoustics
- Solvers for the verified solution of parametric linear systems
- Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues
- Numerical validation of compensated algorithms with stochastic arithmetic
- An accurate algorithm for evaluating rational functions
- Rounding error using low precision approximate random variables
- Verified error bounds for solutions of Sylvester matrix equations
- The exact dot product as basic tool for long interval arithmetic
- Verified bounds for the determinant of real or complex point or interval matrices
- Iterative refinement for ill-conditioned linear systems
- Accurate evaluation of a polynomial and its derivative in Bernstein form
- Scalar fused multiply-add instructions produce floating-point matrix arithmetic provably accurate to the penultimate digit
- Floating-point arithmetic
- Compensated de Casteljau algorithm in \(K\) times the working precision
- A robust algorithm for geometric predicate by error-free determinant transformation
- \textsf{ORTHOPOLY}: a library for accurate evaluation of series of classical orthogonal polynomials and their derivatives
- scientific article; zbMATH DE number 58444 (Why is no real title available?)
- Ultimately fast accurate summation
- Accurate floating-point summation. II: Sign, \(K\)-fold faithful and rounding to nearest
- Super-fast validated solution of linear systems
- Adaptive and efficient algorithm for 2D orientation problem
- Error‐free transformation of matrix multiplication with a posteriori validation
- Efficiency of reproducible level 1 BLAS
- Systolic super summation
- Accurate and efficient algorithms for floating point computation
- Accurate and Efficient Floating Point Summation
- Improvement of error-free splitting for accurate matrix multiplication
- Accurate evaluation of polynomials in Legendre basis
- Algorithms for accurate, validated and fast polynomial evaluation
- Inversion of extremely ill-conditioned matrices in floating-point
- Convergence of Rump's method for inverting arbitrarily ill-conditioned matrices
- Accurate simple zeros of polynomials in floating point arithmetic
- General framework for deriving reproducible Krylov subspace algorithms: BiCGStab case
- The relative formulation of the quadratic programming problem in the aircraft assembly modeling
- Fast and accurate computation of the Euclidean norm of a vector
- Convergence analysis of an algorithm for accurate inverse Cholesky factorization
- Minimizing synchronizations in sparse iterative solvers for distributed supercomputers
- Accurate evaluation of a polynomial in Chebyshev form
- Linear combination of independent exponential random variables
- Verified computation of real powers of matrices
- Compensated summation and dot product algorithms for floating-point vectors on parallel architectures: error bounds, implementation and application in the Krylov subspace methods
- Numerical validation of compensated summation algorithms with stochastic arithmetic
- A Class of Fast and Accurate Summation Algorithms
- scientific article; zbMATH DE number 4094781 (Why is no real title available?)
- Automatic evaluations of cross-derivatives
- A new error-free floating-point summation algorithm
- Reproducibility strategies for parallel preconditioned conjugate gradient
- Comparing high-order multivariate AD methods
- Iterative refinement for symmetric eigenvalue decomposition
- Convergence of Rump's method for computing the Moore-Penrose inverse.
- 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.
- Floating-point arithmetic on the test bench. How are verified numerical solutions calculated?
- An algorithm for automatically selecting a suitable verification method for linear systems
- Efficient calculations of faithfully rounded \(l_2\)-norms of \(n\)-vectors
- Matrix computations and polynomial root-finding with preprocessing
- Algorithm 960
- A fast dot-product algorithm with minimal rounding errors
- Convergence analysis of accurate inverse Cholesky factorization
- Selected implementation issues in computation of the Grünwald-Letnikov fractional-order difference by means of embedded system
- Computing the Sign of a Dot Product Sum
- Fast verified solutions of linear systems
- A method of obtaining verified solutions for linear systems suited for Java
- Verified error bounds for matrix decompositions
- Newton projection method as applied to assembly simulation
- A note on Dekker's FastTwoSum algorithm
- On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots
- High-precision computation: mathematical physics and dynamics
- Accurate Horner methods in real and complex floating-point arithmetic
- Randomized preprocessing of homogeneous linear systems of equations
- Computing the expected Markov reward rates with stationarity detection and relative error control
- Enclosing Chebyshev expansions in linear time
- Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
This page was built for publication: Accurate Sum and Dot Product
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5693174)
