𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on the Wolovich method of extraction of a greatest common divisor of two polynomial matrices

✍ Scribed by Solak, M.

Book ID
115539568
Publisher
IEEE
Year
1985
Tongue
English
Weight
161 KB
Volume
30
Category
Article
ISSN
0018-9286

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

[Lecture Notes in Computer Science] Nume
[Lecture Notes in Computer Science] Numerical Analysis and Its Applications Volume 3401 || Two Resultant Based Methods Computing the Greatest Common Divisor of Two Polynomials
✍ Li, Zhilin; Vulkov, Lubin; WaΕ›niewski, Jerzy πŸ“‚ Article πŸ“… 2005 πŸ› Springer Berlin Heidelberg 🌐 German βš– 134 KB

This Book Constitutes The Thoroughly Refereed Post-proceedings Of The Third International Conference On Numerical Analysis And Its Applications, Naa 2004, Held In Rousse, Bulgaria In June/july 2004. The 68 Revised Full Papers Presented Together With 8 Invited Papers Were Carefully Selected During Tw

A carry-free algorithm for finding the g
A carry-free algorithm for finding the greatest common divisor of two integers
✍ George B. Purdy πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 503 KB

We investigate a variant of the so-called "binary" algorithm for finding the GCD (greatest common divisor) of two numbers which requires no comparisons. We show that when implemented with carry-save hardware, it can be used to find the modulo B inverse of an n-bit binary integer in a time proportion