On the complexities of multipoint evaluation and interpolation

Theoretical Computer Science

Volumn 329, Issue 1-3, 2004, Pages 223-235

  Bostan, Alin ^a   Schost, Éric ^a  

^a ECOLE POLYTECHNIQUE   (France)

Author keywords

Complexity; Interpolation; Polynomial evaluation

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; FUNCTION EVALUATION; INTERPOLATION; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

COMPLEXITY; INTERPOLATION ALGORITHMS; POLYNOMIAL EVALUATIONS; PROGRAM TRANSPOSITION;

COMPUTATIONAL COMPLEXITY;

EID: 10044251437     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.09.002     Document Type: Article

References (29)

1. A. V Aho, K. Steiglitz, J.D. Ullman, Evaluating polynomials at fixed sets of points, SIAM J. Comput. 4 (4) (1975) 533-539.
2. M. Ben-Or, P. Tiwari, A deterministic algorithm for sparse multivariate polynomial interpolation, in: STOC'88, ACM Press, New York, 1988, pp. 301-309.
3. D. Bini, V.Y. Pan, Polynomial and matrix computations, Progr. Theoret. Comput. Sci. 1 (1994).
4. J.L. Bordewijk, Inter-reciprocity applied to electrical networks, Appl. Sci. Res. B 6 (1956) 1-74.
5. A. Borodin, R. Moenck, Fast modular transforms, J. Comput. System Sci. 8 (1974) 366-386.
6. A. Bostan, G. Lecerf, É. Schost, Tellegen's principle into practice, in: ISSAC'03, ACM Press, New York, 2003, pp. 37-44.
7. A. Bostan, É. Schost, Evaluation and interpolation on special sets of points, Tech. Report, École Polytechnique, 2003.
8. R.P. Brent, Multiple-precision zero-finding methods and the complexity of elementary function evaluation, Anal. Comput. Complexity (1975) 151-176.
9. P. Bürgisser, M. Clausen, M.A. Shokrollahi, Algebraic complexity theory, Grundlehren Math. Wiss. 315 (1997).
10. J. Canny, E. Kaltofen, L. Yagati, Solving systems of non-linear polynomial equations faster, in: ISSAC'89, ACM Press, New York, 1989, pp. 121-128.
11. D.G. Cantor, E. Kaltofen, On fast multiplication of polynomials over arbitrary algebras, Acta Inform. 28 (7) (1991) 693-701.
12. C.M. Fiduccia, Polynomial evaluation via the division algorithm: the fast Fourier transform revisited, in: Conf. Record, Fourth Ann. ACM Symp. on Theory of Computing, 1972, pp. 88-93.
13. T. Finck, G. Heinig, K. Rost, An inversion formula and fast algorithms for Cauchy-Vandermonde matrices, Linear Algebra Appl. 183 (1993) 179-191.
14. J. von zur Gathen, J. Gerhard, Modern Computer Algebra, 1st ed., Cambridge University Press, Cambridge, 1999.
15. I. Gohberg, V. Olshevsky, Complexity of multiplication with vectors for structured matrices, Linear Algebra Appl. 202 (1994) 163-192.
16. I. Gohberg, V. Olshevsky, Fast algorithms with preprocessing for matrix-vector multiplication problems, J. Complexity 10 (4) (1994) 411-427.
17. V. Grolmusz, Computing elementary symmetric polynomials with a subpolynomial number of multiplications, SIAM J. Comput. 32 (6) (2003) 1475-1487.
18. E. Kaltofen, Challenges of symbolic computation: my favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey, J. Symbolic Comput. 29 (6) (2000) 891-919.
19. E. Kaltofen, L. Yagati, Improved sparse multivariate polynomial interpolation algorithms, in: ISSAC'88, Lecture Notes in Computer Science, Vol. 358, Springer, Berlin, 1989, pp. 467-474.
20. J.D. Lipson, Chinese remainder algorithm and interpolation algorithms, in: Proc. of Second ACM Symp. of Symbolic and Algebraic Manipulation, ACM Press, New York, 1971, pp. 372-391.
21. R.T. Moenck, A. Borodin, Fast modular transforms via division, Thirteenth Ann. IEEE Symp. on Switching and Automata Theory, University Maryland, College Park, MD, 1972, pp. 90-96.
22. V.Y. Pan, On computations with dense structured matrices, in: ISSAC'89, ACM Press, New York, 1989, pp. 34-42.
23. V.Y. Pan, Structured Matrices and Polynomials, Birkhäuser Boston Inc., Boston, MA, 2001.
24. A. Schönhage, The fundamental theorem of algebra in terms of computational complexity, Tech. Report, University of Tübingen, 1982.
25. A. Schönhage, V. Strassen, Schnelle Multiplikation großer Zahlen, Computing 7 (1971) 281-292.
26. V. Strassen, Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten, Numerische Mathematik 20 (1972/73) 238-251.
27. V. Strassen, Vermeidung von Divisionen, J. Reine Angew. Math. 264 (1973) 184-202.
28. B. Tellegen, A general network theorem, with applications, Tech. Report, Vol. 7, Philips Research, 1952, pp. 259-269.
29. R. Zippel, Interpolating polynomials from their values, J. Symbolic Comput. 9 (3) (1990) 375-403.