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

Multivariate polynomial products over modular rings using residue arithmetic

โœ Scribed by Singh, B.; Siddiqi, M.U.

Book ID
119790094
Publisher
IEEE
Year
1995
Tongue
English
Weight
331 KB
Volume
43
Category
Article
ISSN
1053-587X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The bit-operation complexity of approxim
The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic
โœ V. Pan ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 330 KB

The approximate evaluation with a given precision of matrix and polynomial products is performed using modular arithmetic. The resulting algorithms are numerically stable. At the same time they are as fast as or faster than the algorithms with arithmetic operations over real or complex numbers.