Fast multipoint evaluation of bivariate polynomials

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

Volumn 3221, Issue , 2004, Pages 544-555

  Niisken, Michael ^a   Ziegler, Martin ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

ARITHMETIC OPERATIONS; BIVARIATE POLYNOMIALS; COST PER POINTS; INPUT SIZE; MAXIMUM DEGREE; MULTIPOINT EVALUATION; SUBLINEAR; UNIVARIATE;

POLYNOMIALS;

EID: 35048844176     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (20)

1. DARIO BINI & VICTOR Y. PAN (1994). Polynomial and matrix computations, volume 1 of Progress in theoretical computer science. Birkḧuser Verlag, Boston, Basel, Berlin. ISBN 0-8176-3786-9, 3-7643-3786-9.
2. A. BORODIN & I. MUNRO (1975). The Computational Complexity of Algebraic and Numeric Problems. Number 1 in Theory of computation series. American Elsevier Publishing Company, New York.
3. R. P. BRENT & H. T. KUNG (1978). Fast Algorithms for Manipulating Formal Power Series. Journal of the ACM 25(4), 581-595.
4. PETER BÜRGISSER, MICHAEL GLAUBEN & MOHAMMED AMIN SHOKROLLAHI (1997). Algebraic Complexity Theory. Number 315 in Grundlehren der mathematischen Wissenschaften. Springer-Verlag.
5. DON COPPERSMITH & SHMUEL WINOGRAD (1990). Matrix Multiplication via Arithmetic Progressions. Journal of Symbolic Computation 9, 251-280.
6. DAVID EPPSTEIN (2004). Re: Geometry problem: Optimal direction. Known results? Usenet news article. URL http://mathforum.org/epigone/sci.math. research/ slexyaxsle.
7. CHARLES M. FIDUCCIA (1972). Polynomial evaluation via the division algorithm: the fast Fourier transform revisited. In Proceedings of the Fourth Annual ACM Symposium on the Theory of Computing, Denver CO, 88-93. ACM Press.
8. JOACHIM VON ZUR GATHEN (1990). Functional Decomposition of Polynomials: the Tame Case. Journal of Symbolic Computation 9, 281-299.
9. JOACHIM VON ZUR GATHEN & JÜRGEN GERHARD (2003). Modern Computer Algebra. Cambridge University Press, Cambridge, UK, 2nd edition. ISBN 0-521-82646-2. URL http://www-math.upb.de/~aggathen/mca/. First edition 1999.
10. ELLIS HOROWITZ (1972). A fast method for interpolation using preconditioning. Information Processing Letters 1, 157-163.
11. XIAOHAN HUANG & VICTOR Y. PAN (1998). Fast Rectangular Matrix Multiplication and Applications. Journal of Complexity 14, 257-299. ISSN 0885-064X.
12. SURESH K. LODHA & RON GOLDMAN (1997). A unified approach to evaluation algorithms for multivariate polynomials. Mathematics of Computation 66(220), 1521-1559. ISSN 0025-5718. URL http://www.ams.org/mcom/1997-66-220/ S0025-5718-97-00862-4.
13. A. M. ODLYZKO & ARNOLD SCHÖNHAGE (1988). Fast algorithms for multiple evaluations of the Riemann zeta function. Transactions of the American Mathematical Society 309(2), 797-809.
14. V. YA. PAN (1966). (1(127)), 103-134.
15. V. YA. PAN, Methods of computing values of polynomials, Russian Mathematical Surveys 21 (1966), 105-136.
16. ARNOLD SCHÖNHAGE (1977). Schnelle Multiplikation von Polynomen Über Körpern der Charakteristik 2. Acta Informatica 7, 395-398.
17. ARNOLD SCHÖNHAGE & VOLKER STRASSEN (1971). Schnelle Multiplikation großer Zahlen. Computing 7, 281-292.
18. VOLKER STRASSEN (1969). Gaussian Elimination is not Optimal. Numerische Mathematik 13, 354-356.
19. MARTIN ZIEGLER (a). Fast Relative Approximation of Potential Fields. 140149. URL http://www.springerlink. com/openurl.asp?genre=article&issn= 0302-9743&volume=2748&spage=140.
20. MARTIN ZIEGLER (b). Quasi-optimal Arithmetic for Quaternion Polynomials. 705715. URL http : //www. springerlink. com/openurl. asp?genre=article&issn= 0302-9743&volume=2906&spage=705.