An Accurate and Efficient Algorithm for the Computation of the Characteristic Polynomial of a General Square Matrix
β Scribed by S. Rombouts; K. Heyde
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 99 KB
- Volume
- 140
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
problem of computing the transfer function matrices for regular and singular discrete two-dimensional general state-space models (2D GM) is discussed, and some programmable algorithms are developed that generalize the well-known Leverrier algorithm to 2D systems of general form. The results also sho
This paper presents an algorithm for obtaining the inverse of a tridiagonal matrix numerically. The algorithm does not require diagonal dominance in the matrix and is also computationally efficient.
Transmission disequilibrium test (TDT) is a nuclear family-based analysis that can test linkage in the presence of association. It has gained extensive attention in theoretical investigation and in practical application; in both cases, the accuracy and generality of the power computation of the TDT
## Abstract The discrete complex image method is one of the most efficient techniques used to evaluate the Green's functions of multilayered media. The usual extraction of surface waves may limit the validity of this method in the nearβfield region. The aim of this work is to handle this problem su
A contact enforcement algorithm has been developed for matrix-free quasistatic finite element techniques. Matrix-free (iterative) solution algorithms such as non-linear conjugate gradients (CG) and dynamic relaxation (DR) are desirable for large solid mechanics applications where direct linear equat