Solution of the large matrix equations which occur in response theory

DOI10.1016/0021-9991(88)90081-2zbMath0636.65034WikidataQ62048505 ScholiaQ62048505MaRDI QIDQ1098233

Hans Jørgen Aa. Jensen, Jeppe Olsen, Poul Jørgensen

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0021-9991(88)90081-2

zbMATH Keywords

Lanczos method; wave functions; conjugate gradient methods; linear response theory; pencil; Numerical examples; large generalized eigenvalue problems

Mathematics Subject Classification ID

65F15: Numerical computation of eigenvalues and eigenvectors of matrices

65F10: Iterative numerical methods for linear systems

Related Items

Hamilton and Jacobi come full circle: Jacobi algorithms for structured Hamiltonian eigenproblems, Linear response eigenvalue problem solved by extended locally optimal preconditioned conjugate gradient methods, Skew symmetry of a class of operators, A novel nonsymmetric \(K\)-Lanczos algorithm for the generalized nonsymmetric \(K\)-eigenvalue problems, On a class of alternating coefficient matrices quadratic eigenvalue problem, Error analysis of symplectic Lanczos method for Hamiltonian eigenvalue problem, A KQZ algorithm for solving linear-response eigenvalue equations, Schur-like forms for matrix Lie groups, Lie algebras and Jordan algebras, An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem, On doubly structured matrices and pencils that arise in linear response theory., Implementation of time-dependent density functional response equations, Canonical forms for Hamiltonian and symplectic matrices and pencils, Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory, Numerical methods for Bogoliubov-de Gennes excitations of Bose-Einstein condensates, Generalized inverse eigenvalue problems for Hermitian and \(J\)-Hamiltonian/skew-Hamiltonian matrices, Minimization principles and computation for the generalized linear response eigenvalue problem, The generalized inverse eigenvalue problem of Hamiltonian matrices and its approximation

Cites Work

• Unnamed Item
• Modification of the Liu-Davidson method for obtaining one or simultaneously several eigensolutions of a large real-symmetric matrix
• A simultaneous coordinate relaxation algorithm for large, sparse matrix eigenvalue problems
• A generalization of the Davidson's method to large nonsymmetric eigenvalue problems
• An iterative method for calculating several of the extreme eigensolutions of large real non-symmetric matrices
• The iterative calculation of several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matrices