Linear algebra on high performance computers
From MaRDI portal
surveyparallel computationnumerical softwaredense matricesbanded systemsEISPACKhigh performance computersLINPACKsparse QR- factorizationsymmetric eigenvalue problems
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical linear algebra (65Fxx)
Recommendations
Cites work
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 3748409 (Why is no real title available?)
- scientific article; zbMATH DE number 3473182 (Why is no real title available?)
- scientific article; zbMATH DE number 3579922 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- scientific article; zbMATH DE number 3088452 (Why is no real title available?)
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- A pipelined Givens method for computing the QR factorization of a sparse matrix
- Basic Linear Algebra Subprograms for Fortran Usage
- Buffering for vector performance on a pipelined MIMD machine
- Error analysis of QR decompositions by Givens transformations
- Implementation of some concurrent algorithms for matrix factorization
- Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- Matrix eigensystem routines. EISPACK guide extension
- On Stable Parallel Linear System Solvers
- Rank-one modification of the symmetric eigenproblem
- Smoothing by spline functions.
- Smoothing by spline functions. II
- Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage
- Solution of sparse linear least squares problems using Givens rotations
- Some Modified Matrix Eigenvalue Problems
- Squeezing the most out of eigenvalue solvers on high-performance computers
Cited in
(20)- Dedicated hardware for linearly-scaling algorithms in condensed-matter physics
- The science of deriving dense linear algebra algorithms
- The FEAST indices -- realistic evaluation of modern software components and processor technologies
- Performance estimation of linear algebra numerical libraries
- Linear algebra software for large-scale accelerated multicore computing
- Squeezing the most out of eigenvalue solvers on high-performance computers
- A systolic algorithm for Riccati and Lyapunov equations
- scientific article; zbMATH DE number 3883499 (Why is no real title available?)
- Efficient FORTRAN implementation of the gaussian elimination and Householder reduction algorithms on the IBM 3090 vector multiprocessor
- Implementing linear algebra algorithms on a Meiko Computing Surface
- An Implicit Representation and Iterative Solution of Randomly Sketched Linear Systems
- scientific article; zbMATH DE number 4153773 (Why is no real title available?)
- Linear algebra software in IBM and CRAY computers
- Designing linear algebra algorithms on the IBM 3090 vector multiprocessor with a hierarchical memory system
- scientific article; zbMATH DE number 4092648 (Why is no real title available?)
- Block reduction of matrices to condensed forms for eigenvalue computations
- scientific article; zbMATH DE number 819139 (Why is no real title available?)
- A collection of parallel linear equations routines for the Denelcor HEP
- Linear algebra software on a vector computer
- Developing linear algebra packages on Risa/Asir for eigenproblems
This page was built for publication: Linear algebra on high performance computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1093318)
