Accession Number : ADA112973

Title :   The Bit Operation Complexity of Approximate Evaluation of Matrix and Polynomial Products Using Modular Arithmetic,

Corporate Author : STANFORD UNIV CA DEPT OF COMPUTER SCIENCE

Personal Author(s) : Pan,V

PDF Url : ADA112973

Report Date : Jun 1981

Pagination or Media Count : 7

Abstract : 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.

Descriptors :   *Matrices(Mathematics), *Polynomials, *Approximation(Mathematics), Complex numbers, Real numbers, Precision, Algorithms, Stability, Multiplication, Comparison, Convolution, Vector analysis, Computations

Subject Categories : Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE