𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix

✍ Scribed by J. H. Reif

Book ID
120137141
Publisher
Springer
Year
2001
Tongue
English
Weight
141 KB
Volume
29
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.