XBLAS

swMATH11672MaRDI QIDQ23612FDOQ23612

Author name not available (Why is that?)

Cited In (43)

• Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications
• Verified bounds for least squares problems and underdetermined linear systems
• Schur aggregation for linear systems and determinants
• Additive preconditioning and aggregation in matrix computations
• PACF: a precision-adjustable computational framework for solving singular values
• Accurate and efficient evaluation of Chebyshev tensor product surface
• Mixed precision algorithms in numerical linear algebra
• Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues
• On the numerical stability of algorithmic differentiation
• Design, implementation and testing of extended and mixed precision BLAS
• An accurate algorithm for evaluating rational functions
• Accurate Floating-Point Summation Part I: Faithful Rounding
• Accurate evaluation of a polynomial and its derivative in Bernstein form
• Super-fast validated solution of linear systems
• Improvement of error-free splitting for accurate matrix multiplication
• Stochastic arithmetic in multiprecision
• Accurate evaluation of polynomials in Legendre basis
• Algorithms for accurate, validated and fast polynomial evaluation
• Convergence of Rump's method for inverting arbitrarily ill-conditioned matrices
• Accurate evaluation of a polynomial in Chebyshev form
• Computing prime harmonic sums
• Strassen's Algorithm for Tensor Contraction
• Compensated summation and dot product algorithms for floating-point vectors on parallel architectures: error bounds, implementation and application in the Krylov subspace methods
• A new error-free floating-point summation algorithm
• Supporting Mixed-domain Mixed-precision Matrix Multiplication within the BLIS Framework
• Verified numerical computations for large-scale linear systems.
• Iterative refinement for symmetric eigenvalue decomposition
• Ultimately Fast Accurate Summation
• More accuracy at fixed precision.
• Efficient calculations of faithfully rounded \(l_2\)-norms of \(n\)-vectors
• Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
• Matrix computations and polynomial root-finding with preprocessing
• Efficient scaling for complex division
• Randomized preprocessing of homogeneous linear systems of equations
• Iterative refinement for singular value decomposition based on matrix multiplication
• Performance and energy consumption of accurate and mixed-precision linear algebra kernels on GPUs
• Radial basis function approximation methods with extended precision floating point arithmetic
• Accurate floating-point summation: a new approach
• Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form
• Accurate solution of dense linear systems I: Algorithms in rounding to nearest
• Accurate quotient-difference algorithm: error analysis, improvements and applications
• Accurate, validated and fast evaluation of elementary symmetric functions and its application
• Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic

This page was built for software: XBLAS