DOUBLING ALGORITHM FOR THE DISCRETIZED BETHE-SALPETER EIGENVALUE PROBLEM

Files

No files are attached to this item.

View at the publisher (DOI) ›

Date

2019-09-01

Journal Title

MATHEMATICS OF COMPUTATION

Volume, issue and pages

Vol. 88, No. 319, pp. 2325–2350

ISSN

0025-5718

Language

English

Abstract

The discretized Bethe-Salpeter eigenvalue problem arises in the Green's function evaluation in many body physics and quantum chemistry. Discretization leads to a matrix eigenvalue problem for H is an element of C-2n(x2n) with a Hamiltonian-like structure. After an appropriate transformation of H to a standard symplectic form, the structure-preserving doubling algorithm, originally for algebraic Riccati equations, is extended for the discretized Bethe-Salpeter eigenvalue problem. Potential breakdowns of the algorithm, due to the ill condition or singularity of certain matrices, can be avoided with a double-Cayley transform or a three-recursion remedy. A detailed convergence analysis is conducted for the proposed algorithm, especially on the benign effects of the double-Cayley transform. Numerical results are presented to demonstrate the efficiency and the structure-preserving nature of the algorithm.

Collections

Articles
Full item page Statistics

Cite this item

Guo, Z.-C., Chu, E. K.-W., & Lin, W.-W. (2019). DOUBLING ALGORITHM FOR THE DISCRETIZED BETHE-SALPETER EIGENVALUE PROBLEM. MATHEMATICS OF COMPUTATION, 88(319), 2325–2350. https://doi.org/10.1090/mcom/3398

BibTeX RIS

Citation generated in APA 7th edition style; please check it before use.

Share

Permanent link: https://ir.lib.nycu.edu.tw/handle/11536/152424