𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Parallel Davidson-Type Algorithm for Several Eigenvalues

✍ Scribed by Leonardo Borges; Suely Oliveira

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
277 KB
Volume
144
Category
Article
ISSN
0021-9991

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we propose a new parallelization of the Davidson algorithm adapted for many eigenvalues. In our parallelization we use a relationship between two consecutive subspaces which allows us to calculate eigenvalues in the subspace through an arrowhead matrix. Theoretical timing estimates for the parallel algorithm are developed and compared against our numerical results on the Paragon. Finally our algorithm is compared against another recent parallel algorithm for multiple eigenvalues, but based on Arnoldi: PARPACK.

πŸ“œ 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

A Parallel Algorithm for 4Γ—4 DCT
A Parallel Algorithm for 4Γ—4 DCT
✍ J. Jiang πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 175 KB

By developing a generalized 1D approach and parallel computing algorithm, this paper presents a parallel algorithm design and hardware implementation for the computation of 4\_4 DCT. This algorithm sorts all the 2D input pixel data into four groups. Each group is then forwarded to a 1D DCT arithmeti

A Parallel Algorithm for Rotating-Frame
A Parallel Algorithm for Rotating-Frame Zeugmatography
✍ C.-N. Chen; D. I. Hoult; V. J. Sank πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 373 KB

## Abstract An algorithm, which utilizes a high degree of parallel processing, has been developed for two‐dimensional rotating‐frame zeugmatography so that a picture of 256 X 256 pixels can be generated with a minicomputer system 2 sec after data accumulation. An array processor is employed as a se

A Randomized Parallel Algorithm for Plan
A Randomized Parallel Algorithm for Planar Graph Isomorphism
✍ Hillel Gazit; John H Reif πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 223 KB

We present a parallel randomized algorithm running on a CRCW PRAM, to determine whether two planar graphs are isomorphic, and if so to find the isomorphism. We assume that we have a tree of separators for each planar graph Ε½ Ε½ 2 . 1 q β‘€ which can be computed by known algorithms in O log n time with