An iterative method for calculating several of the extreme eigensolutions of large real non-symmetric matrices

DOI10.1016/0021-9991(82)90104-8zbMath0482.65022OpenAlexW2090590483MaRDI QIDQ1162792

Sten Rettrup

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0021-9991(82)90104-8

zbMATH Keywords

rate of convergenceexpansion methodcoordinate relaxationextreme eigensolutionslarge real non-symmetric matricesmultiple vector optimizationroot shifting techniquetest calculations

Mathematics Subject Classification ID

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

Related Items

Super-matrix methods, Solution of the large matrix equations which occur in response theory, Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices, turboTDDFT 2.0 -- hybrid functionals and new algorithms within time-dependent density-functional perturbation theory, Large-scale complex eigenvalue problems, A Lanczos-type algorithm for the generalized eigenvalue problem Ax=lambdaBx, Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory

Cites Work

• Unnamed Item
• A simultaneous coordinate relaxation algorithm for large, sparse matrix eigenvalue problems
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
• An iterative procedure for the calculation of the lowest real eigenvalue and eigenvector of a nonsymmetric matrix
• Modification of Nesbet's algorithm for the iterative evaluation of eigenvalues and eigenvectors of large matrices
• Acceleration of the convergence in Nesbet's algorithm for 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