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

Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials

โœ Scribed by Joab R. Winkler, Madina Hasan, Xin Lao

Book ID
118791663
Publisher
Springer Milan
Year
2012
Tongue
English
Weight
998 KB
Volume
49
Category
Article
ISSN
0008-0624

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The calculation of the degree of an appr
The calculation of the degree of an approximate greatest common divisor of two polynomials
โœ Joab R. Winkler; Xin Lao ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 438 KB

The calculation of the degree of an approximate greatest common divisor (AGCD) of two inexact polynomials f (y) and g(y) is a non-trivial computation because it reduces to the estimation of the rank loss of a resultant matrix R( f , g). This computation is usually performed by placing a threshold on

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