Parallel Jacobi algorithm for matrix diagonalisation on transputer networks
From MaRDI portal
A Jacobi type parallel algorithm for the diagonalization of a real symmetric matrix is presented and analyzed in detail for the execution on a network of transputers. The maximal efficiency is limited by 2/3 because the parallel algorithm necessitates a shuffling of slices of matrices between the processors.
Recommendations
- An improved parallel Jacobi method for diagonalizing a symmetric matrix
- A quadratically convergent parallel Jacobi process for diagonally dominant matrices with distinct eigenvalues
- Exploiting the symmetry in the parallelization of the Jacobi method
- Efficient implementation of Jacobi's diagonalization method on the DAP
- Efficient diagonalization of oversized matrices on a distributed-memory multiprocessor
Cited in
(7)- An improved parallel Jacobi method for diagonalizing a symmetric matrix
- Solving the tridiagonal linear system and Poisson's equation over a LAN-based computing platform using distributed shared memory
- Parallelising the LMTO band-structure program on transputer arrays
- On the Parallel Implementation of Jacobi and Kogbetliantz Algorithms
- Parallel matrix transpose algorithms on distributed memory concurrent computers
- Efficient implementation of Jacobi's diagonalization method on the DAP
- Distributed Jacobi joint diagonalization on clusters of personal computers
This page was built for publication: Parallel Jacobi algorithm for matrix diagonalisation on transputer networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q806955)
