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

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1981
Accession Number
ADA112973

Entities

People

  • V. Pan

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Arithmetic
  • Complex Numbers
  • Computations
  • Computer Science
  • Computers
  • Convolution
  • Interpolation
  • Military Research
  • Notation
  • Numbers
  • Polynomials
  • Signal Processing
  • Test And Evaluation
  • Theory Of Computation
  • Transitions

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Computer Programming and Software Development.