𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Block Krylov–Schur method for large symmetric eigenvalue problems

✍ Scribed by Yunkai Zhou; Yousef Saad

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Deflated block Krylov subspace methods f
Deflated block Krylov subspace methods for large scale eigenvalue problems
✍ Qiang Niu; Linzhang Lu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 530 KB

We discuss a class of deflated block Krylov subspace methods for solving large scale matrix eigenvalue problems. The efficiency of an Arnoldi-type method is examined in computing partial or closely clustered eigenvalues of large matrices. As an improvement, we also propose a refined variant of the A

An inexact Krylov–Schur algorithm for th
An inexact Krylov–Schur algorithm for the unitary eigenvalue problem
✍ Roden J.A. David; David S. Watkins 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 173 KB

We present an efficient inexact implicitly restarted Arnoldi algorithm to find a few eigenpairs of large unitary matrices. The approximating Krylov spaces are built using short-term recurrences derived from Gragg's isometric Arnoldi process. The implicit restarts are done by the Krylov-Schur methodo

Harmonic projection methods for large no
Harmonic projection methods for large non-symmetric eigenvalue problems
✍ Ronald B. Morgan; Min Zeng 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB 👁 2 views

The problem of finding interior eigenvalues of a large nonsymmetric matrix is examined. A procedure for extracting approximate eigenpairs from a subspace is discussed. It is related to the Rayleigh-Ritz procedure, but is designed for finding interior eigenvalues. Harmonic Ritz values and other appro

Kron's method for symmetric eigenvalue p
Kron's method for symmetric eigenvalue problems
✍ S.H. Lui 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 769 KB

Kron's method has been used successfully by engineers for over 30 years to find eigenvalues of large symmetric matrices. These matrices arise from domain decomposition of nonoverlapping domains of self-adjoint partial differential operators. This paper discusses some theoretical aspects of Kron's me