Fast Diagonalization of Large and Dense Complex Symmetric Matrices, with Applications to Quantum Reaction Dynamics

DOI10.1137/S1064827594269056zbMath0891.65036OpenAlexW2009031688MaRDI QIDQ4376232

Publication date: 10 February 1998

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1064827594269056

zbMATH Keywords

eigenvalues parallel computation eigenvectors Schrödinger equation supercomputers Householder transformations QR-algorithm skew symmetric reaction dynamics complex Hermitian complex symmetric diagonalization

Mathematics Subject Classification ID

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 (7)

Toward scalable many-body calculations for nuclear open quantum systems using the Gamow shell model ⋮ A note on the determinant formulas computation of generalized inverse matrix Padé approximation. ⋮ On solving complex-symmetric eigenvalue problems arising in the design of axisymmetric VCSEL devices ⋮ Fast direct solvers for some complex symmetric block Toeplitz linear systems ⋮ An iterative method for solving the spectral problem of complex symmetric matrices ⋮ Approximate antilinear eigenvalue problems and related inequalities ⋮ Diagonalization of complex symmetric matrices: generalized Householder reflections, iterative deflation and implicit shifts

Uses Software

This page was built for publication: Fast Diagonalization of Large and Dense Complex Symmetric Matrices, with Applications to Quantum Reaction Dynamics