✦ LIBER ✦

A new algorithm for computing eigenpairs of matrices

✍ Scribed by Hossein Aminikhah; Ali Jamalian

Book ID: 108201003
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 398 KB
Volume: 54
Category: Article
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2011.01.043

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing Approximate Eigenpairs of Symm

Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices

✍ Gansterer, Wilfried N.; Ward, Robert C.; Muller, Richard P.; Goddard, William A. 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 317 KB

The refined harmonic Arnoldi method and

The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices

✍ Zhongxiao Jia 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 174 KB

A block Arnoldi-Chebyshev method for com

A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices

✍ Miloud Sadkane 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 599 KB

An algorithm for computing correlation m

An algorithm for computing correlation matrices

✍ Wright, William R. 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 282 KB

Computations of eigenpair subsets with t

Computations of eigenpair subsets with the MRRR algorithm

✍ Osni A. Marques; Beresford N. Parlett; Christof Vömel 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

An algorithm for computing functions of

An algorithm for computing functions of triangular matrices

✍ P. Filipponi 📂 Article 📅 1981 🏛 Springer Vienna 🌐 English ⚖ 173 KB