𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fully parallel method for the singular eigenvalue problem

✍ Scribed by Kuiyuan Li; J. Uvah; Shengbian Zhao


Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
302 KB
Volume
49
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

✦ Synopsis


In this paper, a fully parallel method for finding some or all finite eigenvalues of a real symmetric matrix pencil (A, B) is presented, where A is a symmetric tridiagonal matrix and B is a diagonal matrix with bl > 0 and bi :> 0, i = 2,3,...,n. The method is based on the homotopy continuation with rank 2 perturbation. It is shown that there are exactly m disjoint, smooth homotopy paths connecting the trivial eigenvalues to the desired eigenvalues, where m is the number of finite eigenvalues of (A, B). It is Mso shown that the homotopy curves are monotonic and easy to follow.


πŸ“œ SIMILAR VOLUMES


A parallel QR algorithm for the nonsymme
✍ 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