Reduction to condensed form for the eigenvalue problem on distributed memory architectures
From MaRDI portal
(Redirected from Publication:1201010)
Recommendations
- A fully parallel condensation method for generalized eigenvalue problems on distributed memory computers
- A Parallel Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem on Distributed Memory Architectures
- A sparse nonsymmetric eigensolver for distributed memory architectures
- Publication:4860203
- Efficient eigenvalue and singular value computations on shared memory machines
- The cost of eigenvalue computation on distributed-memory MIMD multiprocessors
- Orthogonal reduction of dense matrices to bidiagonal form on computers with distributed memory architectures
- Publication:4860206
Cited in
(7)- Gaussian quadrature for matrix valued functions on the real line
- Orthogonal reduction of dense matrices to bidiagonal form on computers with distributed memory architectures
- An input/output efficient algorithm for Hessenberg reduction
- Block reduction of matrices to condensed forms for eigenvalue computations
- An optimal multicast algorithm for cube-connected cycles
- Parallel algorithms for reduction of a general matrix to upper Hessenberg form on a shared memory multiprocessor
- The design of a parallel dense linear algebra software library: Reduction to Hessenberg, tridiagonal, and bidiagonal form
This page was built for publication: Reduction to condensed form for the eigenvalue problem on distributed memory architectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201010)