Pages that link to "Item:Q5189669"

The following pages link to Accurate Floating-Point Summation Part I: Faithful Rounding (Q5189669):

Displaying 50 items.

• Improved error bounds for floating-point products and Horner's scheme (Q285288) (← links)
• Minimizing synchronizations in sparse iterative solvers for distributed supercomputers (Q316448) (← links)
• Sharp error bounds for complex floating-point inversion (Q342874) (← links)
• TELEMAC: an efficient hydrodynamics suite for massively parallel architectures (Q365551) (← links)
• The Schur aggregation and solving ill conditioned linear systems: the convergence theorem (Q384796) (← links)
• Fast enclosure for solutions of Sylvester equations (Q389546) (← links)
• Fast interval matrix multiplication (Q451807) (← links)
• Accurate evaluation of a polynomial in Chebyshev form (Q555368) (← links)
• Accurate evaluation of a polynomial and its derivative in Bernstein form (Q611362) (← links)
• Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form (Q643356) (← 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)
• Error estimation of floating-point summation and dot product (Q766234) (← links)
• A note on Dekker's FastTwoSum algorithm (Q777498) (← 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)
• A method of obtaining verified solutions for linear systems suited for Java (Q861896) (← links)
• Randomized preprocessing of homogeneous linear systems of equations (Q968998) (← 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)
• Accurate quotient-difference algorithm: error analysis, improvements and applications (Q1738119) (← links)
• The true order of magnitude of Lamé rounding error sums (Q1865734) (← links)
• A fast parallel high-precision summation algorithm based on AccSumK (Q2074862) (← links)
• Generation of test matrices with specified eigenvalues using floating-point arithmetic (Q2129635) (← 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)
• The relative accuracy of \(\mathtt{(x+y)*(x-y)}\) (Q2293633) (← links)
• Verified bounds for the determinant of real or complex point or interval matrices (Q2297164) (← links)
• Improvement of error-free splitting for accurate matrix multiplication (Q2349545) (← links)
• Verified compilation of floating-point computations (Q2352505) (← links)
• Schur aggregation for linear systems and determinants (Q2378504) (← links)
• Accurate floating-point summation: a new approach (Q2381336) (← links)
• Computing predecessor and successor in rounding to nearest (Q2391021) (← links)
• Some issues related to double rounding (Q2434938) (← links)
• Numerical validation of compensated summation algorithms with stochastic arithmetic (Q2520678) (← links)
• Verified inclusions for a nearest matrix of specified rank deficiency via a generalization of Wedin's \(\sin (\theta)\) theorem (Q2660610) (← links)
• On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots (Q2672185) (← links)
• Efficiency of Reproducible Level 1 BLAS (Q2803590) (← links)
• CAMPARY: Cuda Multiple Precision Arithmetic Library and Applications (Q2819222) (← links)
• Efficient calculations of faithfully rounded \(l_2\)-norms of \(n\)-vectors (Q2828148) (← links)
• Error‐free transformation of matrix multiplication with a posteriori validation (Q2955990) (← links)
• Convergence analysis of accurate inverse Cholesky factorization (Q3121193) (← links)
• The Accuracy of Floating Point Summation (Q3140140) (← links)
• Fast and Stable Multivariate Kernel Density Estimation by Fast Sum Updating (Q3391268) (← links)