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

A fast implicit QR eigenvalue algorithm for companion matrices

โœ Scribed by D.A. Bini; P. Boito; Y. Eidelman; L. Gemignani; I. Gohberg

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
354 KB
Volume
432
Category
Article
ISSN
0024-3795

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

A fast iterative algorithm for eigenvalu
A fast iterative algorithm for eigenvalue determination
โœ R.P. West; M.N. Pavloviฤ‡ ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 755 KB

The task of establishing analytically the natural frequencies of vibration of a partially embedded beam gives rise to a particular difficulty because, frequently, the modes are clustered in close proximity to each other Due to this, and the fact that the exact formulated solution is in the form of a