𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient Implementation of the Multishift $QR$ Algorithm for the Unitary Eigenvalue Problem

✍ Scribed by David, Roden J. A.; Watkins, David S.

Book ID
118215887
Publisher
Society for Industrial and Applied Mathematics
Year
2006
Tongue
English
Weight
148 KB
Volume
28
Category
Article
ISSN
0895-4798

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A parallel QR algorithm for the nonsymme
A parallel QR algorithm for the nonsymmetric eigenvalue problem
✍ Daniel Boley; Robert Maier; Joung Kim πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 973 KB

This paper describes a prototype parallel algorithm for approximating eigenvalues of a dense nonsymmetric matrix on a linear, synchronous processor array. The algorithm is a parallel implementation of the explicitly-shifted QR, employing n distributed-memory processors to deliver all eigenvalues in

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

An inexact Krylov–Schur algorithm for th
An inexact Krylov–Schur algorithm for the unitary eigenvalue problem
✍ Roden J.A. David; David S. Watkins πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 173 KB

We present an efficient inexact implicitly restarted Arnoldi algorithm to find a few eigenpairs of large unitary matrices. The approximating Krylov spaces are built using short-term recurrences derived from Gragg's isometric Arnoldi process. The implicit restarts are done by the Krylov-Schur methodo

An implementation of a divide and conque
An implementation of a divide and conquer algorithm for the unitary eigen problem
✍ Ammar, G. S.; Reichel, L.; Sorensen, D. C. πŸ“‚ Article πŸ“… 1992 πŸ› Association for Computing Machinery 🌐 English βš– 917 KB

We present a FORTRAN implementation of a divide-and-conquer method for computing the spectral resolution of a unitary upper Hessenberg matrix __H__ . Any such matrix __H__ of order __n__ , normalized so that its subdiagonal elements are nonnegative, can be written as a product of __n__ -1\* Givens m