A block Chebyshev-Davidson method for solving symmetric eigenvalue problems
From MaRDI portal
Publication:2885707
zbMATH Open1249.65077MaRDI QIDQ2885707FDOQ2885707
Publication date: 1 June 2012
Published in: Journal on Numerical Methods and Computer Applications (Search for Journal in Brave)
Recommendations
convergencenumerical resultspreconditioningeigenvalueeigenvectorsymmetric matrixextreme eigenvaluesblock Chebyshev-Davidson method
Cited In (14)
- On local quadratic convergence of inexact simplified Jacobi-Davidson method for interior eigenpairs of Hermitian eigenproblems
- A block preconditioned steepest descent method for symmetric eigenvalue problems
- A Chebyshev–Davidson Algorithm for Large Symmetric Eigenproblems
- Title not available (Why is that?)
- On Chebyshev-Davidson method for symmetric generalized eigenvalue problems
- Revisiting the (block) Jacobi subspace rotation method for the symmetric eigenvalue problem
- On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems
- Refining-strategy of block Davidson method for solving large sparse eigenproblems
- A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems
- Title not available (Why is that?)
- A block Chebyshev-Davidson method for linear response eigenvalue problems
- A Chebyshev locally optimal block preconditioned conjugate gradient method for product and standard symmetric eigenvalue problems
- Title not available (Why is that?)
- A distributed block Chebyshev-Davidson algorithm for parallel spectral clustering
This page was built for publication: A block Chebyshev-Davidson method for solving symmetric eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2885707)
