Pages that link to "Item:Q3558689"
From MaRDI portal
The following pages link to Accurate Floating-Point Summation Part II: Sign, <i>K</i>-Fold Faithful and Rounding to Nearest (Q3558689):
Displayed 28 items.
- Fast enclosure for solutions of Sylvester equations (Q389546) (← 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)
- Fast verified solutions of linear systems (Q849174) (← 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)
- Randomized preprocessing of homogeneous linear systems of equations (Q968998) (← links)
- Iterative refinement for symmetric eigenvalue decomposition (Q1630225) (← links)
- Accurate quotient-difference algorithm: error analysis, improvements and applications (Q1738119) (← links)
- A fast parallel high-precision summation algorithm based on AccSumK (Q2074862) (← 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)
- Reproducibility strategies for parallel preconditioned conjugate gradient (Q2297141) (← links)
- Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues (Q2318500) (← links)
- Some issues related to double rounding (Q2434938) (← links)
- Efficient Calculations of Faithfully Rounded <i>l</i> <sub>2</sub> -Norms of <i>n</i> -Vectors (Q2828148) (← links)
- Error‐free transformation of matrix multiplication with a posteriori validation (Q2955990) (← links)
- Convergence analysis of accurate inverse Cholesky factorization (Q3121193) (← links)
- Enclosing Chebyshev Expansions in Linear Time (Q4960945) (← links)
- Selected Implementation Issues in Computation of the Grünwald-Letnikov Fractional-Order Difference by Means of Embedded System (Q4972774) (← links)
- Fast and accurate computation of the Euclidean norm of a vector (Q6072363) (← links)
- General framework for deriving reproducible Krylov subspace algorithms: BiCGStab case (Q6135460) (← links)
- Infinite-precision inner product and sparse matrix-vector multiplication using Ozaki scheme with Dot2 on manycore processors (Q6135463) (← links)