The design of a parallel dense linear algebra software library: Reduction to Hessenberg, tridiagonal, and bidiagonal form
bidiagonal matrixdense linear algebra computationseigenproblemsHessenberg matrixperformancereduction to normal formscalabilityScalable LAPACKsoftware librarytridiagonal matrix
Conditioning of matrices (15A12) Canonical forms, reductions, classification (15A21) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35) Packaged methods for numerical algorithms (65Y15) Complexity and performance of numerical algorithms (65Y20)
The paper discusses issues in the design of ScaLAPACK (`Scalable LAPACK'), a software library for performing dense linear algebra computations on distributed memory concurrent computers. The ScaLAPACK routines can be used for reducing matrices to Hessenberg tridiagonal, and bidiagonal forms. These routines are important in the solution of eigenproblems. Upon completion, ScaLAPACK will make available on distributed memory machines the same set of library routines that LAPACK provides for vector and shared memory architectures. The use of BLAS routines, their parallel versions (PBLAS), and the communication subprograms (BLACS) is discussed. There is a tradeoff between efficiency and software engineering considerations, such as ease of programming and simplicity of code. The implementation details, performance, and scalability of the ScaLAPACK factorization routines are presented in a separate paper. The ScaLAPACK reduction routines are currently available through netlib for all numerical data types, such as single and double precision real and complex. To obtain the routines, send the message `send index from scalapack' to netlib\@ornl.gov.
- A set of level 3 basic linear algebra subprograms
- A Storage-Efficient WY Representation for Products of Householder Transformations
- An extended set of FORTRAN basic linear algebra subprograms
- Basic Linear Algebra Subprograms for Fortran Usage
- Block reduction of matrices to condensed forms for eigenvalue computations
- Block-Cyclic Dense Linear Algebra
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 741170 (Why is no real title available?)
- scientific article; zbMATH DE number 781814 (Why is no real title available?)
- Reduction to condensed form for the eigenvalue problem on distributed memory architectures
- Software Libraries for Linear Algebra Computations on High Performance Computers
- The WY Representation for Products of Householder Matrices
- Diagonalization of complex symmetric matrices: generalized Householder reflections, iterative deflation and implicit shifts
- The singular value decomposition: anatomy of optimizing an algorithm for extreme scale
- Software Libraries for Linear Algebra Computations on High Performance Computers
- An input/output efficient algorithm for Hessenberg reduction
- Distributed-parallel proper orthogonal/dynamic mode decompositions of large flow data
- Parallel two-stage reduction to Hessenberg form using dynamic scheduling on shared-memory architectures
This page was built for publication: The design of a parallel dense linear algebra software library: Reduction to Hessenberg, tridiagonal, and bidiagonal form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1904151)
