A new method for diagonalising large matrices
From MaRDI portal
Publication:4723163
DOI10.1088/0305-4470/18/9/018zbMath0615.65043OpenAlexW2054960930MaRDI QIDQ4723163
Publication date: 1985
Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/0305-4470/18/9/018
iterative methodsconvergence rateHermitian matrixnumerical comparisonsgeneralized eigenvectorssmallest generalized eigenvaluesresidual minimization/direct inversion in the iterative subspace methodground-state electronic structure
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Closed and approximate solutions to the Schrödinger, Dirac, Klein-Gordon and other equations of quantum mechanics (81Q05)
Related Items
Convergence analysis of adaptive DIIS algorithms with application to electronic ground state calculations, Super-matrix methods, Application of Advanced Diagonalization Methods to Quantum Spin Systems, Physical and numerical aspects in Lanczos and modified Lanczos calculations, Hybrid preconditioning for iterative diagonalization of ill-conditioned generalized eigenvalue problems in electronic structure calculations, Preconditioned Locally Harmonic Residual Method for Computing Interior Eigenpairs of Certain Classes of Hermitian Matrices, Accelerated block preconditioned gradient method for large scale wave functions calculations in density functional theory, Iterative diagonalization in augmented plane wave based methods in electronic structure calculations, A new iterative scheme for obtaining eigenvectors of large, real- symmetric matrices, An approximate eigensolver for self-consistent field calculations, Hybrid eigensolvers for nuclear configuration interaction calculations, Speeding up plane-wave electronic-structure calculations using graphics-processing units, Fast iterative interior eigensolver for millions of atoms, Parallel empirical pseudopotential electronic structure calculations for million atom systems, Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices, Preconditioned conjugate gradient method for the sparse generalized eigenvalue problem in electronic structure calculations, Rapid iterative method for electronic-structure eigenproblems using localised basis functions, Ab initio molecular simulations with numeric atom-centered orbitals, On Kramer–Weaire filtering method for eigenvectors, Large-scale complex eigenvalue problems, New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem, Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm
