Given n × n matrix A, find scalar λ and nonzero vector x such that Ax = λx λ is eigenvalue and x is corresponding eigenvector A always has n eigenvalues, but they may be neither real nor distinct May need to compute only one or few eigenvalues, or all n eigenvalues May or may not need corresponding eigenvectors Michael T. Heath Parallel Numerical Algorithms 3 / 4
An algorithm is discussed for converting a class of recursive processes to a parallel system. It is ...
In this paper we review the parallel solution of sparse linear systems, usually deriving by the disc...
A new parallel Jacobi-like algorithm is developed for computing the eigenvalues of a general complex...
We survey general techniques and open problems in numerical linear algebra on parallel architectures...
This book is primarily intended as a research monograph that could also be used in graduate courses ...
In this paper we discuss the problem of computing eigenvectors for matrices in Schur form using para...
"Supported in part by the Advanced Research Projects Agency of the Department of Defense ... under C...
textThis thesis demonstrates an efficient parallel method of solving the generalized eigenvalue prob...
An algorithm to solve the eigenproblem for non-symmetric matrices on an $N \times N$ array of mesh ...
A standard approach for computing eigenvectors of a non-symmetric matrix reduced to real Schurform r...
Available from British Library Document Supply Centre- DSC:D55469/85 / BLDSC - British Library Docum...
The solution of the symmetric eigenvalue problem is a compute-intensive task in many scientific and ...
Numerical methods for finding eigenvalues and eigenvectors are separated into two groups, iterative ...
Abstract. Bisection is a parallelizable method for finding the eigenvalues of real symmetric tridiag...
The transputer is a fast microprocessor, unique in its linking ability to provide a framework for bu...
An algorithm is discussed for converting a class of recursive processes to a parallel system. It is ...
In this paper we review the parallel solution of sparse linear systems, usually deriving by the disc...
A new parallel Jacobi-like algorithm is developed for computing the eigenvalues of a general complex...
We survey general techniques and open problems in numerical linear algebra on parallel architectures...
This book is primarily intended as a research monograph that could also be used in graduate courses ...
In this paper we discuss the problem of computing eigenvectors for matrices in Schur form using para...
"Supported in part by the Advanced Research Projects Agency of the Department of Defense ... under C...
textThis thesis demonstrates an efficient parallel method of solving the generalized eigenvalue prob...
An algorithm to solve the eigenproblem for non-symmetric matrices on an $N \times N$ array of mesh ...
A standard approach for computing eigenvectors of a non-symmetric matrix reduced to real Schurform r...
Available from British Library Document Supply Centre- DSC:D55469/85 / BLDSC - British Library Docum...
The solution of the symmetric eigenvalue problem is a compute-intensive task in many scientific and ...
Numerical methods for finding eigenvalues and eigenvectors are separated into two groups, iterative ...
Abstract. Bisection is a parallelizable method for finding the eigenvalues of real symmetric tridiag...
The transputer is a fast microprocessor, unique in its linking ability to provide a framework for bu...
An algorithm is discussed for converting a class of recursive processes to a parallel system. It is ...
In this paper we review the parallel solution of sparse linear systems, usually deriving by the disc...
A new parallel Jacobi-like algorithm is developed for computing the eigenvalues of a general complex...