An accurate and efficient algorithm for the computation of the characteristic polynomial of a general square matrix
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
1998
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909853512892416 |
|---|---|
| author | Rombouts, S. Heyde, K. |
| author_facet | Rombouts, S. Heyde, K. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_math_9804133 |
| institution | arXiv |
| publishDate | 1998 |
| record_format | arxiv |
| spellingShingle | An accurate and efficient algorithm for the computation of the characteristic polynomial of a general square matrix Rombouts, S. Heyde, K. Numerical Analysis Condensed Matter 65F30; 81-08 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. |
| title | An accurate and efficient algorithm for the computation of the characteristic polynomial of a general square matrix |
| topic | Numerical Analysis Condensed Matter 65F30; 81-08 |
| url | https://arxiv.org/abs/math/9804133 |