Accession Number:

AD0767702

Title:

On Computing Reciprocals of Power Series,

Descriptive Note:

Corporate Author:

CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE

Personal Author(s):

Report Date:

1973-09-01

Pagination or Media Count:

18.0

Abstract:

Root-finding iterations are used to compute reciprocals of power series. The author shows that Sievekings algorithm is just Newton iteration applied in the field of power series. Let L sub n denote the number of non-scalar multiplications needed to compute the first n1 terms of the reciprocal. It is shown that n1 or L sub n or 4n-log base 2 n. It is conjectured that L sub n 4n - lower order terms. Modified author abstract

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE