𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Inexact inverse iteration for symmetric matrices

✍ Scribed by Jörg Berns-Müller; Ivan G. Graham; Alastair Spence

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
306 KB
Volume
416
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

New choices of preconditioning matrices
New choices of preconditioning matrices for generalized inexact parameterized iterative methods
✍ Yang Cao; Mei-Qun Jiang; Lin-Quan Yao 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 280 KB

For large sparse saddle point problems, Chen and Jiang recently studied a class of generalized inexact parameterized iterative methods (see [F. Chen, Y.-L. Jiang, A generalization of the inexact parameterized Uzawa methods for saddle point problems, Appl. Math. Comput. 206 (2008) 765-771]). In this

Inverse eigenproblem for -symmetric matr
Inverse eigenproblem for -symmetric matrices and their approximation
✍ Yongxin Yuan 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 464 KB

## Canonical correlation decomposition (CCD) Best approximation a b s t r a c t In this paper, we first give the solvability condition for the following inverse eigenproblem (IEP): given a set of vectors {x i } m i=1 in C n and a set of complex numbers {λ i } m i=1 , find a matrix A ∈ GSC n×n such