Add to ORKGThe paper proposes a parallel algorithm to compute the eigenvalues and eigenvectors of a real symmetric matrix on a mesh multicomputer. The algorithm uses the one-sided Jacobi method and it is aimed at reducing the communication cost incurred by one-dimensional algorithms found in the literature. The performance of the proposed algorithm on a squared 2D/3D mesh multicomputer is assessed through simple analytical models of execution time. The models show that the performance improvement over one-dimensional algorithms can be very noticeable, specially for a large number of nodes
AbstractSystolic arrays have become established in principle, if not yet in practice, as a way of in...
The communication cost plays a key role in the performance of many parallel algorithms. In the parti...
An efficient parallel algorithm, farmzeroinNR, for the eigenvalue problem of a symmetric tridiagonal...
The paper proposes an algorithm for computing symmetric eigenvalues and eigenvectors that uses a one...
The paper proposes an algorithm for computing symmetric eigenvalues and eigenvectors that uses a one...
The paper proposes an algorithm for computing symmetric eigenvalues and eigenvectors that uses a one...
Parallel Jacobi-like algorithms are presented for computing a singular-value decomposition of an $m...
An algorithm to solve the eigenproblem for non-symmetric matrices on an $N \times N$ array of mesh ...
An algorithm is presented for computing the eigenvalues and eigenvectors of an n x n real symmetric...
AbstractThe computation of eigenvalues and eigenvectors of a real symmetric matrix A with distinct e...
AbstractThe computation of eigenvalues and eigenvectors of a real symmetric matrix A with distinct e...
AbstractSolving dense symmetric eigenvalue problems and computing singular value decompositions cont...
The transputer is a fast microprocessor, unique in its linking ability to provide a framework for bu...
Abstract. This paper describes a parallel implementation of the Jacobi-Davidson method to compute ei...
A new algorithm for the orthogonal reduction of a symmetric matrix to tridiagonal form is developed ...
AbstractSystolic arrays have become established in principle, if not yet in practice, as a way of in...
The communication cost plays a key role in the performance of many parallel algorithms. In the parti...
An efficient parallel algorithm, farmzeroinNR, for the eigenvalue problem of a symmetric tridiagonal...
The paper proposes an algorithm for computing symmetric eigenvalues and eigenvectors that uses a one...
The paper proposes an algorithm for computing symmetric eigenvalues and eigenvectors that uses a one...
The paper proposes an algorithm for computing symmetric eigenvalues and eigenvectors that uses a one...
Parallel Jacobi-like algorithms are presented for computing a singular-value decomposition of an $m...
An algorithm to solve the eigenproblem for non-symmetric matrices on an $N \times N$ array of mesh ...
An algorithm is presented for computing the eigenvalues and eigenvectors of an n x n real symmetric...
AbstractThe computation of eigenvalues and eigenvectors of a real symmetric matrix A with distinct e...
AbstractThe computation of eigenvalues and eigenvectors of a real symmetric matrix A with distinct e...
AbstractSolving dense symmetric eigenvalue problems and computing singular value decompositions cont...
The transputer is a fast microprocessor, unique in its linking ability to provide a framework for bu...
Abstract. This paper describes a parallel implementation of the Jacobi-Davidson method to compute ei...
A new algorithm for the orthogonal reduction of a symmetric matrix to tridiagonal form is developed ...
AbstractSystolic arrays have become established in principle, if not yet in practice, as a way of in...
The communication cost plays a key role in the performance of many parallel algorithms. In the parti...
An efficient parallel algorithm, farmzeroinNR, for the eigenvalue problem of a symmetric tridiagonal...