✦ LIBER ✦

A new method for eigenvalues of nonsymmetric matrices

✍ Scribed by A.A. Shah

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 236 KB
Volume: 58
Category: Article
ISSN: 0377-0427
DOI: 10.1016/0377-0427(93)e0263-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generalizations of davidson's method for

Generalizations of davidson's method for computing eigenvalues of large nonsymmetric matrices

✍ Ronald B Morgan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 508 KB

A method for eigenvalues of sparse λ-mat

A method for eigenvalues of sparse λ-matrices

✍ Wei H. Yang 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB

A separation theorem for nonsymmetric ma

A separation theorem for nonsymmetric matrices

✍ C.A Hall; T.A Porsching 📂 Article 📅 1968 🏛 Elsevier Science 🌐 English ⚖ 143 KB

First-order autoregressive models: A met

First-order autoregressive models: A method for obtaining eigenvalues for weighting matrices

✍ Ali Abul Gasim 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 340 KB

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

Rutishauser's modified method for comput

Rutishauser's modified method for computing the eigenvalues of symmetric matrices

✍ Humberto Lima Soriano 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 931 KB