Penalized Versus Constrained Generalized Eigenvalue Problems
نویسندگان
چکیده
منابع مشابه
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.
متن کاملA Symplectic Perspective on Constrained Eigenvalue Problems
The Maslov index is a powerful tool for computing spectra of selfadjoint, elliptic boundary value problems. This is done by counting intersections of a fixed Lagrangian subspace, which designates the boundary condition, with the set of Cauchy data for the differential operator. We apply this methodology to constrained eigenvalue problems, in which the operator is restricted to a (not necessaril...
متن کاملSolving inverse cone-constrained eigenvalue problems
We compare various algorithms for constructing a matrix of order n whose Pareto spectrum contains a prescribed set Λ = {λ1, . . . , λp} of reals. In order to avoid overdetermination one assumes that p does not exceed n2. The inverse Pareto eigenvalue problem under consideration is formulated as an underdetermined system of nonlinear equations. We also address the issue of computing Lorentz spec...
متن کاملCone-constrained eigenvalue problems: theory and algorithms
Equilibria in mechanics or in transportation models are not always expressed through a system of equations, but sometimes they are characterized by means of complementarity conditions involving a convex cone. This work deals with the analysis of cone-constrained eigenvalue problems. We discuss some theoretical issues like, for instance, the estimation of the maximal number of eigenvalues in a c...
متن کاملThe Jacobi-Davidson Method for Eigenvalue and Generalized Eigenvalue Problems
We consider variants of Davidson's method for the iterative computation of one or more eigenvalues and their corresponding eigenvectors of an n n matrix A. The original Davidson method 3], for real normal matrices A, may be viewed as an accelerated Gauss-Jacobi method, and the success of the method seems to depend quite heavily on diagonal dominance of A 3, 4, 17]. In the hope to enlarge the sc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Graphical Statistics
سال: 2017
ISSN: 1061-8600,1537-2715
DOI: 10.1080/10618600.2016.1172017