Asymptotically fast algorithms for the numerical muitiplication and division of polynomials with complex coefficients

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 144 LNCS, Issue , 1982, Pages 3-15

  Schönhage, Arnold ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETE FOURIER TRANSFORMS; POLYNOMIALS; TURING MACHINES;

BIT INTEGERS; BIT PRECISION; COMPLEX COEFFICIENTS; FAST ALGORITHMS; INTEGER MULTIPLICATIONS; POINTER MACHINES; POLYNOMIAL MULTIPLICATION; UNIVARIATE;

ALGEBRA; MATHEMATICAL TECHNIQUES;

ALGORITHMS; DIVISION; FOURIER TRANSFORMS; MULTIPLICATION; POLYNOMIALS; TIME ANALYSIS;

EID: 0020226762     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-11607-9_1     Document Type: Conference Paper

References (6)

1. A. Borodin, I. Munro: The computational complexity of algebraic and numeric problems. New York, American Elsevier, 1975.
2. D. E. Knuth: The art of computer programming, vol. 2: Seminumerical algorithms. 2nd edition; Reading, Mass. 1981.
3. H. T. Kung: On computing reciprocals of power series. Numer. Math. 22, 341-348 (1974).
4. A. Schönhage: Storage modification machines. SIAM J. Comp. 9, 490-508 (1980).
5. A. Schönhage, V. Strassen: Schnelle Multiplikation großer Zahlen. Computing 7, 281-292 (1971).
6. M. Sieveking: An algorithm for division of power series. Computing 10, 153-156 (1972).