Design, implementation and testing of extended and mixed precision BLAS
From MaRDI portal
Recommendations
- Algorithm 656: an extended set of basic linear algebra subprograms: model implementation and test programs
- An extended set of FORTRAN basic linear algebra subprograms
- Exploiting fast matrix multiplication within the level 3 BLAS
- A parallel block implementation of Level-3 BLAS for MIMD vector processors
- Mixed precision algorithms in numerical linear algebra
Cited in
(43)- Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications
- Schur aggregation for linear systems and determinants
- PACF: a precision-adjustable computational framework for solving singular values
- Additive preconditioning and aggregation in matrix computations
- Infinite-precision inner product and sparse matrix-vector multiplication using Ozaki scheme with Dot2 on manycore processors
- 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
- Accurate evaluation of a polynomial and its derivative in Bernstein form
- SIMD Parallel Sparse Matrix-Vector and Transposed-Matrix-Vector Multiplication in DD Precision
- Floating-point arithmetic
- Accurate calculation of Euclidean norms using double-word arithmetic
- Super-fast validated solution of linear systems
- Efficiency of reproducible level 1 BLAS
- 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
- Accelerating BLAS and LAPACK via efficient floating point architecture design
- Accurate evaluation of a polynomial in Chebyshev form
- Acceleration of iterative refinement for singular value decomposition
- Computing prime harmonic sums
- 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
- Performance and accuracy of hardware-oriented native-, emulated- and mixed-precision solvers in FEM simulations
- Iterative refinement for symmetric eigenvalue decomposition
- More accuracy at fixed precision.
- Efficient calculations of faithfully rounded l₂-norms of n-vectors
- Matrix computations and polynomial root-finding with preprocessing
- Randomized preprocessing of homogeneous linear systems of equations
- Approximate calculation of sums. II: Gaussian type quadrature
- Iterative refinement for singular value decomposition based on matrix multiplication
- 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, validated and fast evaluation of elementary symmetric functions and its application
- Accurate quotient-difference algorithm: error analysis, improvements and applications
- Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic
- Formalization of Double-Word Arithmetic, and Comments on “Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic”
Describes a project that uses
Uses Software
This page was built for publication: Design, implementation and testing of extended and mixed precision BLAS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5461236)
