๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

QRT: A QR-Based Tridiagonalization Algorithm for Nonsymmetric Matrices

โœ Scribed by Sidje, Roger B.; Burrage, K.

Book ID
118215846
Publisher
Society for Industrial and Applied Mathematics
Year
2005
Tongue
English
Weight
281 KB
Volume
26
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