A truncated-CG style method for symmetric generalized eigenvalue problems
From MaRDI portal
Publication:818183
DOI10.1016/J.CAM.2005.10.006zbMATH Open1090.65042OpenAlexW2009964554MaRDI QIDQ818183FDOQ818183
Authors: C. G. Baker, P.-A. Absil, K. A. Gallivan 
Publication date: 24 March 2006
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2005.10.006
Recommendations
- Conjugate gradient methods for the Rayleigh quotient minimization of generalized eigenvalue problems
- scientific article; zbMATH DE number 1507107
- New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem
- An algorithm for the symmetric generalized eigenvalue problem
- Partial solution of large symmetric generalized eigenvalue problems by nonlinear optimization of a modified Rayleigh quotient
global convergencetrust-region algorithmgeneralized eigenvalue problemsuperlinear convergenceRayleigh quotientextreme eigenvaluesleftmost eigenpairtruncated conjugate gradient methodrightmost eigenpair
Cites Work
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- Templates for the Solution of Algebraic Eigenvalue Problems
- Trust-region methods on Riemannian manifolds
- Numerical Optimization
- Title not available (Why is that?)
- Optimization Techniques on Riemannian Manifolds
- Matrix algorithms. Vol. 2: Eigensystems
- Trust Region Methods
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Title not available (Why is that?)
- The inexact, inexact perturbed, and quasi-Newton methods are equivalent models
- Numerical methods for large eigenvalue problems
- A Trace Minimization Algorithm for the Generalized Eigenvalue Problem
- Title not available (Why is that?)
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
- Inexact Rayleigh quotient-type methods for eigenvalue computations
- The trace minimization method for the symmetric generalized eigenvalue problem
- A Grassmann--Rayleigh quotient iteration for computing invariant subspaces
- A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
- Cubically Convergent Iterations for Invariant Subspace Computation
- Inexact Newton preconditioning techniques for large symmetric eigenvalue problems
- Newton’s Method for Optimization Problems with Equality Constraints
- Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue method
- The effects of inexact solvers in algorithms for symmetric eigenvalue problems
- Asymptotic Convergence of Conjugate Gradient Methods for the Partial Symmetric Eigenproblem
- Convergence Analysis of Inexact Rayleigh Quotient Iteration
- The convergence of Jacobi–Davidson iterations for Hermitian eigenproblems
- Inexact inverse iteration for generalized eigenvalue problems
- Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems
- New iterative methods for solution of the eigenproblem
- An orthogonal accelerated deflation technique for large symmetric eigenproblems
- The Dynamics of Rayleigh Quotient Iteration
- Title not available (Why is that?)
- Computational Science – ICCS 2005
Cited In (25)
- A subspace accelerated truncated Newton algorithm for solving the extreme eigenvalue of a large-scale sparse symmetric matrix
- Rayleigh quotient minimization method for symmetric eigenvalue problems
- Double-variable trace maximization for extreme generalized singular quartets of a matrix pair: a geometric method
- A trust-region method for \(H_2\) model reduction of bilinear systems on the Stiefel manifold
- New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
- A geometric nonlinear conjugate gradient method for stochastic inverse eigenvalue problems
- Newton's method for the parameterized generalized eigenvalue problem with nonsquare matrix pencils
- A Rayleigh-Ritz style method for large-scale discriminant analysis
- On optimizing the sum of the Rayleigh quotient and the generalized Rayleigh quotient on the unit sphere
- Newton-KKT interior-point methods for indefinite quadratic programming
- A Riemannian Fletcher-Reeves conjugate gradient method for doubly stochastic inverse eigenvalue problems
- Conjugate gradient methods for the Rayleigh quotient minimization of generalized eigenvalue problems
- Computing eigenelements of real symmetric matrices via optimization
- Goal-oriented optimal approximations of Bayesian linear inverse problems
- Riemannian trust-region method for the maximal correlation problem
- A Riemannian optimization approach for solving the generalized eigenvalue problem for nonsquare matrix pencils
- Trace-penalty minimization for large-scale eigenspace computation
- Computing symplectic eigenpairs of symmetric positive-definite matrices via trace minimization and Riemannian optimization
- An unconstrained global optimization framework for real symmetric eigenvalue problems
- Computational Science – ICCS 2005
- A Riemannian subspace limited-memory SR1 trust region method
- GPU-accelerated LOBPCG method with inexact null-space filtering for solving generalized eigenvalue problems in computational electromagnetics analysis with higher-order FEM
- A Quasi-Separable Approach to Solve the Symmetric Definite Tridiagonal Generalized Eigenvalue Problem
- A generalized eigenvalues classifier with embedded feature selection
- An Implicit Riemannian Trust-Region Method for the Symmetric Generalized Eigenproblem
Uses Software
This page was built for publication: A truncated-CG style method for symmetric generalized eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q818183)
