The following pages link to Accurate Sum and Dot Product (Q5693174):
Displayed 50 items.
- Minimizing synchronizations in sparse iterative solvers for distributed supercomputers (Q316448) (← links)
- Numerically stable, scalable formulas for parallel and online computation of higher-order multivariate central moments with arbitrary weights (Q333360) (← links)
- Floating-point arithmetic on the test bench. How are verified numerical solutions calculated? (Q335016) (← links)
- Parametric inverse of severely ill-conditioned Hermitian matrices in signal processing (Q378616) (← links)
- High performance verified computing using C-XSC (Q382427) (← links)
- The Schur aggregation and solving ill conditioned linear systems: the convergence theorem (Q384796) (← links)
- Fast enclosure for solutions of Sylvester equations (Q389546) (← links)
- Solvers for the verified solution of parametric linear systems (Q411424) (← links)
- On the numerical stability of algorithmic differentiation (Q411440) (← links)
- High-precision computation: mathematical physics and dynamics (Q449457) (← links)
- Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems (Q521243) (← links)
- Accurate evaluation of a polynomial in Chebyshev form (Q555368) (← links)
- Accurate evaluation of a polynomial and its derivative in Bernstein form (Q611362) (← links)
- Matrix computations and polynomial root-finding with preprocessing (Q624343) (← links)
- An algorithm for automatically selecting a suitable verification method for linear systems (Q633151) (← links)
- Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form (Q643356) (← links)
- Verified error bounds for solutions of Sylvester matrix equations (Q651215) (← links)
- On design and implementation of a generic number type for real algebraic number computations based on expression dags (Q655162) (← links)
- Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications (Q662894) (← links)
- Accurate, validated and fast evaluation of elementary symmetric functions and its application (Q668592) (← links)
- A robust algorithm for geometric predicate by error-free determinant transformation (Q714616) (← links)
- Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic (Q714626) (← links)
- A note on Dekker's FastTwoSum algorithm (Q777498) (← links)
- A generalized Kahan-Babuška-summation-algorithm (Q817033) (← links)
- Computing enclosures for the matrix Mittag-Leffler function (Q831239) (← links)
- Fast verified solutions of linear systems (Q849174) (← links)
- Algorithms for accurate, validated and fast polynomial evaluation (Q849175) (← links)
- Adaptive and efficient algorithm for 2D orientation problem (Q849176) (← links)
- Inversion of extremely ill-conditioned matrices in floating-point (Q849178) (← links)
- Iterative refinement for ill-conditioned linear systems (Q849192) (← links)
- Super-fast validated solution of linear systems (Q861871) (← links)
- A method of obtaining verified solutions for linear systems suited for Java (Q861896) (← links)
- Dense linear system: A parallel self-verified solver (Q941827) (← links)
- Randomized preprocessing of homogeneous linear systems of equations (Q968998) (← links)
- Accurate simple zeros of polynomials in floating point arithmetic (Q1004779) (← links)
- A new error-free floating-point summation algorithm (Q1029843) (← links)
- Iterative refinement for symmetric eigenvalue decomposition (Q1630225) (← links)
- Formal verification of a floating-point expansion renormalization algorithm (Q1687723) (← links)
- Stable application of Filon-Clenshaw-Curtis rules to singular oscillatory integrals by exponential transformations (Q1731608) (← links)
- Accurate quotient-difference algorithm: error analysis, improvements and applications (Q1738119) (← links)
- Linear combination of independent exponential random variables (Q1739381) (← links)
- Accurate and efficient evaluation of Chebyshev tensor product surface (Q1992395) (← links)
- Compensated de Casteljau algorithm in \(K\) times the working precision (Q2009574) (← links)
- A fast parallel high-precision summation algorithm based on AccSumK (Q2074862) (← links)
- PACF: a precision-adjustable computational framework for solving singular values (Q2101911) (← links)
- \textsf{ORTHOPOLY}: a library for accurate evaluation of series of classical orthogonal polynomials and their derivatives (Q2102504) (← links)
- Compensated summation and dot product algorithms for floating-point vectors on parallel architectures: error bounds, implementation and application in the Krylov subspace methods (Q2151619) (← links)
- Convergence analysis of an algorithm for accurate inverse Cholesky factorization (Q2257609) (← links)
- Iterative refinement for singular value decomposition based on matrix multiplication (Q2293602) (← links)
- Modified error bounds for approximate solutions of dense linear systems (Q2293605) (← links)