Linear algebra software for large-scale accelerated multicore computing
From MaRDI portal
BLASCholesky factorizationdistributed memory systemseigenproblemLAPACKLDLT decompositionlinear algebra softwareLU factorizationmulticore systemsQR factorizationsingular value problemsparse linear algebra
Direct numerical methods for linear systems and matrix inversion (65F05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Computational methods for sparse matrices (65F50) Packaged methods for numerical algorithms (65Y15)
Recommendations
- Software Libraries for Linear Algebra Computations on High Performance Computers
- Publication:4938107
- scientific article; zbMATH DE number 434716
- Linear algebra software on a vector computer
- Numerical linear algebra algorithms and software
- scientific article; zbMATH DE number 44896
- Parallel accurate linear algebra subroutines
- Numerical Linear Algebra for High-Performance Computers
- A key for reusable parallel linear algebra software
- Linear algebra on high performance computers
Cites work
- A Black Box Generalized Conjugate Gradient Solver with Inner Iterations and Variable-Step Preconditioning
- A Divide-and-Conquer Algorithm for the Bidiagonal SVD
- A Fast Reordering Algorithm for Parallel Sparse Triangular Solution
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- A fully asynchronous multifrontal solver using distributed dynamic scheduling
- A Numerical Method for Solving Fredholm Integral Equations of the First Kind Using Singular Values
- A set of level 3 basic linear algebra subprograms
- A Storage-Efficient WY Representation for Products of Householder Transformations
- A Vectorizable Variant of some ICCG Methods
- Accelerating Linear System Solutions Using Randomization Techniques
- Accelerating scientific computations with mixed precision algorithms
- Accelerating the reduction to upper Hessenberg, tridiagonal, and bidiagonal forms through hybrid GPU-based computing
- Accuracy and Stability of Numerical Algorithms
- Accurate Symmetric Indefinite Linear Equation Solvers
- Aggregation Methods for Solving Sparse Triangular Systems on Multiprocessors
- Algorithm 807
- An extended set of FORTRAN basic linear algebra subprograms
- Average-Case Stability of Gaussian Elimination
- Basic Linear Algebra Subprograms for Fortran Usage
- Block reduction of matrices to condensed forms for eigenvalue computations
- CALU: A communication optimal LU factorization algorithm
- Communication-avoiding symmetric-indefinite factorization
- Communication-optimal parallel and sequential QR and LU factorizations
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Efficient eigenvalue and singular value computations on shared memory machines
- Efficient High Accuracy Solutions with ${\text{GMRES}}(m)$
- Error bounds from extra-precise iterative refinement
- Factors impacting performance of multithreaded sparse triangular solve
- Fine-grained parallel incomplete LU factorization
- Flexible conjugate gradients
- Flexible Inner-Outer Krylov Subspace Methods
- GMRESR: a family of nested GMRES methods
- Historical Development of the Newton–Raphson Method
- scientific article; zbMATH DE number 192975 (Why is no real title available?)
- Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
- Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
- Improving the Accuracy of Computed Eigenvalues and Eigenvectors
- Improving the Accuracy of Computed Singular Values
- Inexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration
- Iterative Refinement in Floating Point
- LAPACK Users' Guide
- Locality of Reference in LU Decomposition with Partial Pivoting
- Mixed-Precision Cholesky QR Factorization and Its Case Studies on Multicore CPU with Multiple GPUs
- Multicolor ICCG Methods for Vector Computers
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- New insights in GMRES-like methods with variable preconditioners
- Noise radiation from a ducted rotor in a swirling-translating flow
- On asynchronous iterations
- On parallelism and convergence of incomplete LU factorizations
- On the reduction of a symmetric matrix to tridiagonal form
- Optimal Parallel Solution of Sparse Triangular Systems
- Parallel algorithms for solving linear systems with sparse triangular matrices
- Parallel two-stage reduction to Hessenberg form using dynamic scheduling on shared-memory architectures
- Partitioned triangular tridiagonalization
- Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers
- Principal component analysis in linear systems: Controllability, observability, and model reduction
- Relaxation strategies for nested Krylov methods
- Scalable Parallel Preconditioning with the Sparse Approximate Inverse of Triangular Matrices
- Solving Sparse Linear Systems with Sparse Backward Error
- SOLVING SPARSE TRIANGULAR LINEAR SYSTEMS ON PARALLEL COMPUTERS
- Stability of Methods for Matrix Inversion
- The effect of ordering on preconditioned conjugate gradients
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- The multishift QR algorithm. I: Maintaining well-focused shifts and level 3 performance
- The multishift QR algorithm. II: Aggressive early deflation
- The WY Representation for Products of Householder Matrices
- Using Mixed Precision for Sparse Matrix Computations to Enhance the Performance while Achieving 64-bit Accuracy
Cited in
(14)- New integration methods for perturbed ODEs based on symplectic implicit Runge-Kutta schemes with application to solar system simulations
- Supporting theory for a block approximate inverse preconditioner
- ViennaCL-linear algebra library for multi- and many-core architectures
- scientific article; zbMATH DE number 1501542 (Why is no real title available?)
- Accelerating the solution of linear systems by iterative refinement in three precisions
- Iterative ILU preconditioners for linear systems and eigenproblems
- PLASMA: Parallel linear algebra software for multicore using OpenMP
- Accelerating numerical dense linear algebra calculations with GPUs
- scientific article; zbMATH DE number 4184914 (Why is no real title available?)
- Convergence Analysis of a Mixed Precision Parareal Algorithm
- Vectorization of a Thread-Parallel Jacobi Singular Value Decomposition Method
- Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning
- Heterogenous Acceleration for Linear Algebra in Multi-coprocessor Environments
- A mixed precision Jacobi SVD algorithm
This page was built for publication: Linear algebra software for large-scale accelerated multicore computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740076)
