𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An overview of parallel algorithms for the singular value and symmetric eigenvalue problems

✍ Scribed by Michael Berry; Ahmed Sameh

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
942 KB
Volume
27
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Parallel QR Algorithm for the Symmetri
A Parallel QR Algorithm for the Symmetrical Tridiagonal Eigenvalue Problem
✍ L. Kaufman πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 478 KB

The implicit QR algorithm is a serial iterative algorithm for determining all the eigenvalues of an \(n \times n\) symmetric tridiagonal matrix \(A\). About \(3 n\) iterations, each requiring the serial application of about \(n\) similarity planar transformations, are required to reduce \(A\) to dia

A concurrent algorithm for parallel calc
A concurrent algorithm for parallel calculation of eigenvalues and eigenvectors of real symmetric matrices
✍ Ramon Carbo; LluΓ­s Molino; Blanca Calabuig πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 412 KB

Elementary Jacobi Rotations are used as the basic tools to obtain eigenvalues and eigenvectors of arbitrary real symmetric matrices. The proposed algorithm has a complete concurrent structure, that is: every eigenvalueeigenvector pair can be obtained in any order and in an independent way from the r

An algorithm for approximating the singu
An algorithm for approximating the singular triplets of complex symmetric matrices
✍ V. Simoncini; E. SjΓΆstrΓΆm πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 172 KB πŸ‘ 2 views

We present an algorithm for the approximation of the dominant singular values and corresponding right and left singular vectors of a complex symmetric matrix. The method is based on two short-term recurrences first proposed by Saunders, Simon and Yip for a non-Hermitian linear system solver. With s