A SEQUENTIAL SUBSPACE PROJECTION METHOD FOR LINEAR SYMMETRIC EIGENVALUE PROBLEM
From MaRDI portal
Publication:2846482
DOI10.1142/S0217595913400034zbMath1282.65044OpenAlexW2088100009MaRDI QIDQ2846482
Chunlin Hao, Minghou Cheng, Xin Liu
Publication date: 5 September 2013
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595913400034
algorithmnumerical exampleglobal convergenceeigenvectorRayleigh quotientsymmetric eigenvalue problemmaximum eigenvaluesymmetric positive definite matrixsubspace projectionlocal convergence rate
Related Items (2)
A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors ⋮ An alternate gradient method for optimization problems with orthogonality constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
- Eigenvalue computation in the 20th century
- IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
- Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
- Fast Algorithms for Projection on an Ellipsoid
This page was built for publication: A SEQUENTIAL SUBSPACE PROJECTION METHOD FOR LINEAR SYMMETRIC EIGENVALUE PROBLEM