A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices

DOI10.1016/j.jcp.2010.06.030zbMath1197.65034OpenAlexW1998920956MaRDI QIDQ2638264

Christopher R. Anderson

Publication date: 15 September 2010

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcp.2010.06.030

zbMATH Keywords

convergencenumerical resultsChebyshev polynomialseigenvectorsinverse subspace iterationsmallest eigenvalueslarge sparse Hermitian matrices

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (15)

Partial differential equations and variational methods for geometric processing of images ⋮ Modified Cheeger and ratio cut methods using the Ginzburg–Landau functional for classification of high-dimensional data ⋮ Global binary optimization on graphs for classification of high-dimensional data ⋮ On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems ⋮ Classification and image processing with a semi‐discrete scheme for fidelity forced Allen–Cahn on graphs ⋮ On Chebyshev-Davidson method for symmetric generalized eigenvalue problems ⋮ Generalizing Diffuse Interface Methods on Graphs: Nonsmooth Potentials and Hypergraphs ⋮ A block Chebyshev-Davidson method for linear response eigenvalue problems ⋮ Simplified Energy Landscape for Modularity Using Total Variation ⋮ Semi-supervised Learning for Aggregated Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix-Vector Products ⋮ Diffuse Interface Models on Graphs for Classification of High Dimensional Data ⋮ On relaxed filtered Krylov subspace method for non-symmetric eigenvalue problems ⋮ More robust Chebyshev filtering for SCF iteration, with applications in real-space DFT ⋮ Introduction: Big data and partial differential equations ⋮ Diffuse interface methods for multiclass segmentation of high-dimensional data

Uses Software

• LAPACK
• PETSc
• TRLan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modification of the Liu-Davidson method for obtaining one or simultaneously several eigensolutions of a large real-symmetric matrix
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
• Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems
• A parallel Davidson-type algorithm for several eigenvalues
• Inexact Rayleigh quotient-type methods for eigenvalue computations
• Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
• Efficient solution of the Schrödinger-Poisson equations in layered semiconductor devices
• Inexact inverse iteration for symmetric matrices
• Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
• A Chebyshev–Davidson Algorithm for Large Symmetric Eigenproblems
• A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
• Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
• LAPACK Users' Guide
• The Lanczos Algorithm with Selective Orthogonalization
• Lanczos Algorithms for Large Symmetric Eigenvalue Computations
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• Inexact Inverse Subspace Iteration with Preconditioning Applied to Non-Hermitian Eigenvalue Problems
• The method of conjugate gradients used in inverse iteration

This page was built for publication: A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices