Abstract
Two simple algorithms for the diagonalization of a set of sparse symmetric matrices of the form A+{Δk}k=1L for large values of L are proposed and investigated. The numerical strategies economize computer resources by requiring the reconstruction of the Lanczos basis for a small number of times compared to L. Each member of the set {Δk}k=1L is assumed to have a smaller number of nonzero elements compared to A. Both numerical procedures are derived from the Lanczos algorithm and use periodically a recursion to obtain the Lanczos vectors. Tests are conducted with both random symmetric matrices and with DVR Hamiltonians containing parametric potentials. The performance of the algorithms in terms of numerical accuracy, stability, and CPU time is studied as a function of two properties of the matrix set {Δk}k=1L.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
