✦ LIBER ✦

Preconditioned iterative methods for the large sparse symmetric eigenvalue problem

✍ Scribed by D.J. Evans; J. Shanehchi

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 811 KB
Volume: 31
Category: Article
ISSN: 0045-7825
DOI: 10.1016/0045-7825(82)90007-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Preconditioned iterative algorithms for

Preconditioned iterative algorithms for large sparse unsymmetric problems

✍ G. Pini; G. Zilli 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 536 KB

An inexact inverse iteration for large s

An inexact inverse iteration for large sparse eigenvalue problems

✍ Yu-Ling Lai; Kun-Yi Lin; Wen-Wei Lin 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB 👁 2 views

In this paper, we propose an inexact inverse iteration method for the computation of the eigenvalue with the smallest modulus and its associated eigenvector for a large sparse matrix. The linear systems of the traditional inverse iteration are solved with accuracy that depends on the eigenvalue with

on hybrid preconditioning methods for la

on hybrid preconditioning methods for large sparse saddle-point problems

✍ Zeng-Qi Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 239 KB

Large sparse symmetric eigenvalue proble

Large sparse symmetric eigenvalue problems with homogeneous linear constraints: the Lanczos process with inner–outer iterations

✍ Gene H. Golub; Zhenyue Zhang; Hongyuan 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 200 KB

We study inner-outer iteration approach for large eigenproblems using the symmetric eigenproblem with homogeneous linear constraints as a concrete example. The goal is to compute the extreme eigenvalues to certain accuracy with minimum total number of inner iteration steps. We develop two stopping c

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

Preconditioned GMRES methods with incomp

Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems

✍ Jun-Feng Yin; Ken Hayami 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 581 KB

We propose to precondition the GMRES method by using the incomplete Givens orthogonalization (IGO) method for the solution of large sparse linear least-squares problems. Theoretical analysis shows that the preconditioner satisfies the sufficient condition that can guarantee that the preconditioned G