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

On the arithmetic complexity of matrix Kronecker powers

โœ Scribed by Gadiel Seroussi; Fai Ma


Publisher
Elsevier Science
Year
1983
Weight
118 KB
Volume
1
Category
Article
ISSN
0167-7136

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The bit-operation complexity of approxim
โœ 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.