✦ LIBER ✦

The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic

✍ Scribed by V. Pan

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 330 KB
Volume: 8
Category: Article
ISSN: 0898-1221
DOI: 10.1016/0898-1221(82)90052-9

No coin nor oath required. For personal study only.

✦ Synopsis

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.