𝔖 Bobbio Scriptorium
✦   LIBER   ✦

General algorithm of computation ofc-table and detection of valleys

✍ Scribed by J. Gilewicz; M. Pindor

Book ID
106554184
Publisher
Springer
Year
2010
Tongue
English
Weight
162 KB
Volume
62
Category
Article
ISSN
0041-5995

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.

Subquadratic Computation of Vector Gener
Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm
✍ Emmanuel ThomΓ© πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 371 KB

This paper describes a new algorithm for computing linear generators (vector generating polynomials) for matrix sequences, running in subquadratic time. This algorithm applies in particular to the sequential stage of Coppersmith's block Wiedemann algorithm. Experiments showed that our method can be