Cites work
- A generalization of the Davidson's method to large nonsymmetric eigenvalue problems
- A Lanczos-type algorithm for the generalized eigenvalue problem Ax=lambdaBx
- A method for calculating the extreme eigensolution of a real symmetric matrix of high order
- A new iterative method for solution of a large-scale general eigenvalue problem
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- A new method for diagonalising large matrices
- A simultaneous coordinate relaxation algorithm for large, sparse matrix eigenvalue problems
- Acceleration of the convergence in Nesbet's algorithm for eigenvalues and eigenvectors of large matrices
- An iterative method for calculating low lying eigenvalues of an Hermitian operator
- An iterative method for calculating several of the extreme eigensolutions of large real non-symmetric matrices
- An iterative method for finding characteristic vectors of a symmetric matrix
- An iterative procedure for the calculation of the lowest real eigenvalue and eigenvector of a nonsymmetric matrix
- Berechnung von Eigenwerten und Eigenvektoren normaler Matrizenpaare durch Ritz‐Iteration
- Calculation of eigenvectors of large matrices
- Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix
- Error bounds in the Rayleigh-Ritz approximation of eigenvectors
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- scientific article; zbMATH DE number 3425546 (Why is no real title available?)
- scientific article; zbMATH DE number 3917549 (Why is no real title available?)
- scientific article; zbMATH DE number 48198 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- Iterative eigenvalue algorithms based on convergent splittings
- Modification of Nesbet's algorithm for the iterative evaluation of eigenvalues and eigenvectors of large matrices
- Modification of the Liu-Davidson method for obtaining one or simultaneously several eigensolutions of a large real-symmetric matrix
- The eigenvalue problem \((A-\lambda B)x = 0\) for symmetric matrices of high order
- The evaluation of eigenvalues and eigenvectors of real symmetric matrices by simultaneous iteration
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- The iterative calculation of several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matrices
- The Software Scene in the Extraction of Eigenvalues from Sparse Matrices
- The solution of natural frequency equations by relaxation methods
- Variation Theorem for Excited States
Cited in
(15)- Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices
- Matrix pseudo-spectroscopy: Iterative calculation of matrix eigenvalues and eigenvectors of large matrices using a polynomial expansion of the Dirac delta function
- A parallel Davidson-type algorithm for several eigenvalues
- A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix
- Thick-restart Lanczos method for electronic structure calculations
- Robust preconditioning of large, sparse, symmetric eigenvalue problems
- Eigenmode solution of 2-D and 3-D electromagnetic cavities containing absorbing materials using the Jacobi-Davidson algorithm
- Hybrid preconditioning for iterative diagonalization of ill-conditioned generalized eigenvalue problems in electronic structure calculations
- scientific article; zbMATH DE number 4029349 (Why is no real title available?)
- Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem
- A graph based Davidson algorithm for the graph partitioning problem
- A projector augmented wave (PAW) code for electronic structure calculations. II: Pwpaw for periodic solids in a plane wave basis
- The subspace projected approximate matrix (SPAM) modification of the Davidson method
- An object-oriented C++ implementation of Davidson method for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix
- Davidson's method and preconditioning for generalized eigenvalue problems
This page was built for publication: Super-matrix methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1330633)
