An algorithm for symmetric generalized inverse eigenvalue problems
نویسندگان
چکیده
منابع مشابه
An algorithm for symmetric generalized inverse eigenvalue problems
Using QR-like decomposition with column pivoting and least squares techniques, we propose a new and ecient algorithm for solving symmetric generalized inverse eigenvalue problems, and give its locally quadratic convergence analysis. We also present some numerical experiments which illustrate the behaviour of our algorithm. Ó 1999 Elsevier Science Inc. All rights reserved. AMS classi®cation: 65...
متن کاملA New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملGeneralized inverse eigenvalue problems for symmetric arrow-head matrices
In this paper, we first give the representation of the general solution of the following inverse eigenvalue problem (IEP): Given X ∈ Rn×p and a diagonal matrix Λ ∈ Rp×p, find nontrivial real-valued symmetric arrow-head matrices A and B such that AXΛ = BX. We then consider an optimal approximation problem: Given real-valued symmetric arrow-head matrices Ã, B̃ ∈ Rn×n, find (Â, B̂) ∈ SE such that ‖Â...
متن کاملa new inexact inverse subspace iteration for generalized eigenvalue problems
in this paper, we represent an inexact inverse subspace iteration method for com- puting a few eigenpairs of the generalized eigenvalue problem ax = bx[q. ye and p. zhang, inexact inverse subspace iteration for generalized eigenvalue problems, linear algebra and its application, 434 (2011) 1697-1715 ]. in particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملAn Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
In this paper, we present an inverse free Krylov subspace method for nding some extreme eigenvalues of the symmetric de nite generalized eigenvalue problem Ax = Bx. The basic method takes a form of inner-outer iterations and involves no inversion of B or any shift-and-invert matrix A 0B. A convergence analysis is presented that leads to a preconditioning scheme for accelerating convergence thro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1999
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(99)00109-3