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

A compound matrix algorithm for the computation of the Smith form of a polynomial matrix

โœ Scribed by M. Mitrouli; G. Kalogeropoulos

Publisher
Springer US
Year
1994
Tongue
English
Weight
698 KB
Volume
7
Category
Article
ISSN
1017-1398

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A parallel algorithm for achieving the S
A parallel algorithm for achieving the Smith Normal Form of an integer matrix
โœ Ingmar Neumann; Wolfgang Wilhelmi ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 815 KB

The Smith Normal Form of a matrix is a diagonal representation which contains the invariant factors of the matrix in its diagonal. In this paper, a new algorithm, which exploits parallelism by considering data dependencies, is proposed. In case of sparse matrices a high degree of parallelism can he

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.