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

AbstractThe 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