XBLAS
From MaRDI portal
Cited in
(75)- 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
- PACF: a precision-adjustable computational framework for solving singular values
- Additive preconditioning and aggregation in matrix computations
- Accurate and efficient evaluation of Chebyshev tensor product surface
- On the numerical stability of algorithmic differentiation
- Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues
- An accurate algorithm for evaluating rational functions
- Mixed precision algorithms in numerical linear algebra
- Design, implementation and testing of extended and mixed precision BLAS
- Accurate evaluation of a polynomial and its derivative in Bernstein form
- Accurate Floating-Point Summation Part I: Faithful Rounding
- Ultimately fast accurate summation
- Accurate floating-point summation. II: Sign, K-fold faithful and rounding to nearest
- 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
- MPFR
- mctoolbox
- LBNL
- SAM
- dfp
- MAPM
- advanpix
- ARPREC
- Algorithm 524
- DLASQ
- exflib
- BLIS
- AggDef2
- HDLASQ
- na20
- CRlibm
- PRECISE
- OpenBLAS
- MPACK
- CholQR
- QD
- Algorithm 908
- Algorithm 978
- Compqd
- k-ep
- Computing prime harmonic sums
- ExBLAS
- tpls
- Compensated summation and dot product algorithms for floating-point vectors on parallel architectures: error bounds, implementation and application in the Krylov subspace methods
- Strassen's Algorithm for Tensor Contraction
- A new error-free floating-point summation algorithm
- Iterative refinement for symmetric eigenvalue decomposition
- Supporting Mixed-domain Mixed-precision Matrix Multiplication within the BLIS Framework
- Verified numerical computations for large-scale linear systems.
- More accuracy at fixed precision.
- Efficient calculations of faithfully rounded l₂-norms of n-vectors
- Matrix computations and polynomial root-finding with preprocessing
- funm
- Algorithm 1014
- Efficient scaling for complex division
- Randomized preprocessing of homogeneous linear systems of equations
- Iterative refinement for singular value decomposition based on matrix multiplication
- CPFloat
- ReproBLAS
- Radial basis function approximation methods with extended precision floating point arithmetic
- Performance and energy consumption of accurate and mixed-precision linear algebra kernels on GPUs
- Accurate floating-point summation: a new approach
- Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form
- Accurate, validated and fast evaluation of elementary symmetric functions and its application
- Accurate solution of dense linear systems I: Algorithms in rounding to nearest
- Accurate quotient-difference algorithm: error analysis, improvements and applications
- ORTHOPOLY
- Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic
This page was built for software: XBLAS
