𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A computing scheme for the Jacobi process

✍ Scribed by V.N. Kublanovskaya

Publisher
Elsevier Science
Year
1964
Weight
123 KB
Volume
4
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Efficient Algorithms for Computing the J
Efficient Algorithms for Computing the Jacobi Symbol
✍ S.M. Eikenberry; J.P. Sorenson πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 464 KB

We present two new algorithms for computing the Jacobi Symbol: the right-shift and left-shift k-ary algorithms. For inputs of at most n bits in length, both algorithms take O(n 2 / log n) time and O(n) space. This is asymptotically faster than the traditional algorithm, which is based in Euclid's al

A Jacobi-type method for computing balan
A Jacobi-type method for computing balanced realizations
✍ U. Helmke; K. HΓΌper πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 162 KB

A new numerical scheme for computing balancing coordinate transformations in linear systems theory is presented. The method is closely related to the Jacobi method for diagonalizing symmetric matrices. Here the minimization of the sum of traces of the Gramians by orthogonal and nonorthogonal Jacobi-