Modification of the Liu-Davidson method for obtaining one or simultaneously several eigensolutions of a large real-symmetric matrix
DOI10.1016/0021-9991(84)90031-7zbMATH Open0543.65016OpenAlexW2041894797MaRDI QIDQ796252FDOQ796252
Authors: Nobuhiro Kosugi
Publication date: 1984
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9991(84)90031-7
Recommendations
- scientific article; zbMATH DE number 238289
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix
- A new method for diagonalising large matrices
- An integrated Davidson and multigrid solution approach for very large scale symmetric eigenvalue problems
numerical examplescomparisoneigensolutionscorrection vectorslarge real-symmetric matrixLiu-Davidson algorithmRitz iteration method
Cites Work
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- Berechnung von Eigenwerten und Eigenvektoren normaler Matrizenpaare durch Ritz‐Iteration
- Modification of Nesbet's algorithm for the iterative evaluation of eigenvalues and eigenvectors of large matrices
- The iterative calculation of several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matrices
- A simultaneous coordinate relaxation algorithm for large, sparse matrix eigenvalue problems
- Calculation of eigenvectors of large matrices
- HQRII: A fast diagonalization subroutine
- The evaluation of eigenvalues and eigenvectors of real symmetric matrices by simultaneous iteration
- The solution of natural frequency equations by relaxation methods
- Electronic wave functions II. A calculation for the ground state of the beryllium atom
Cited In (11)
- Title not available (Why is that?)
- A new iterative scheme for obtaining eigenvectors of large, real- symmetric matrices
- A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices
- Large-scale complex eigenvalue problems
- New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem
- A subspace preconditioning algorithm for eigenvector/eigenvalue computation
- Exact treatment of generalized modifications of finite-dimensional systems by the LRM approach
- Solution of the large matrix equations which occur in response theory
- Super-matrix methods
- Parallel block ILUT/ILDLT preconditioning for sparse eigenproblems and sparse linear systems
- SPINSGA: A program package for the evaluation of properties of spin-1/2 Heisenberg systems using the symmetric group approach
This page was built for publication: Modification of the Liu-Davidson method for obtaining one or simultaneously several eigensolutions of a large real-symmetric matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796252)