๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient and stable structure preserving algorithm for computing the eigenvalues of a Hamiltonian matrix

โœ Scribed by Yan Qing-you; Xiong Xi-wen

Publisher
Springer
Year
2002
Tongue
English
Weight
915 KB
Volume
23
Category
Article
ISSN
0253-4827

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Short note: An integrable numerical algo
Short note: An integrable numerical algorithm for computing eigenvalues of a specially structured matrix
โœ Jian-Qing Sun; Xing-Biao Hu; Hon-Wah Tam ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 123 KB

This paper is motivated by some recent work of Fukuda, Ishiwata, Iwasaki, and Nakamura (Inverse Problems 2009; 25:015007). We first design an algorithm for computing the eigenvalues of a specially structured matrix from the discrete Bogoyavlensky Lattice 2 (dBL2) system. A Lax representation for the

An Accurate and Efficient Algorithm for
An Accurate and Efficient Algorithm for the Computation of the Characteristic Polynomial of a General Square Matrix
โœ S. Rombouts; K. Heyde ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 99 KB

An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant quantum Monte-Carlo methods.