𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Implicit QR algorithms for palindromic and even eigenvalue problems

✍ Scribed by Daniel Kressner; Christian Schröder; David S. Watkins

Publisher
Springer US
Year
2008
Tongue
English
Weight
583 KB
Volume
51
Category
Article
ISSN
1017-1398

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

Vibration of fast trains, palindromic ei
Vibration of fast trains, palindromic eigenvalue problems and structure-preserving doubling algorithms
✍ Eric King-Wah Chu; Tsung-Min Hwang; Wen-Wei Lin; Chin-Tien Wu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 368 KB

The vibration of fast trains is governed by a quadratic palindromic eigenvalue problem Accurate and efficient solution can only be obtained using algorithms which preserve the structure of the eigenvalue problem. This paper reports on the successful application of the structure-preserving doubling

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