Towards the construction of an eigenvalue engine
From MaRDI portal
This paper presents a new algorithm for the computation of the eigenvalues of real symmetric matrices. The concurrent implementation is described and the algorithm is expressed in terms of a collection of communicating processes. This implementation is suitable for distributed systems, like transputers, network of transputers, multiprocessor supercomputers or sets of interconnected SIMD machines.
Recommendations
- A parallel algorithm for the dense symmetric eigenvalue problem on a transputer array
- Some algorithms for the solution of the symmetric eigenvalue problem on a multiprocessor electronic computer
- A comparison of two parallel algorithms for the symmetric eigenproblem
- scientific article; zbMATH DE number 1526541
- Finding eigenvalues and eigenvectors of unsymmetric matrices using a distributed-memory multiprocessor
Cited in
(5)- A parallel algorithm for the dense symmetric eigenvalue problem on a transputer array
- Optimizing the computation of eigenvalues using graphics processing units
- scientific article; zbMATH DE number 4078633 (Why is no real title available?)
- Some parallel procedures for computing the eigenvalues of a real symmetric matrix
- Implementing the one-sided Jacobi method on a 2D/3D mesh multicomputer
This page was built for publication: Towards the construction of an eigenvalue engine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111334)
