Multivariate power series multiplication

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn 2005, Issue , 2005, Pages 293-300

  Schost, Éric ^a  

^a ECOLE POLYTECHNIQUE   (France)

Author keywords

Multiplication; Power series

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTATIONAL COMPLEXITY; NUMBER THEORY; POLYNOMIALS; PROBLEM SOLVING;

MULTIPLICATION; POWER SERIES;

COMPUTATION THEORY;

EID: 33749554542     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073884.1073925     Document Type: Conference Paper

References (35)

1. D. Bini, Relations between exact and approximate bilinear algorithms, Applications, Calcolo, 17(1):87-97, 1980.
2. 2.7799) complexity for n × n approximate matrix. multiplication, Inf. Proc. Lett., 8(5):234-235, 1979.
3. D. Bini, G. Lotti, and F. Romani, Approximate solutions for the bilinear form computational problem, SIAM J. Comput., 9(4):692-697, 1980.
4. C. Bischof, G. Corliss, and A. Griewank. Structured second- and higher-order derivatives through univariate Taylor series, Opt. Meth. and Soft., 2:211-232, 1993.
5. M. Blaser, The complexity of bivariate power series arithmetic. TCS, 295(1-3):65-83, 2003.
6. L. I. Bluestein, A linear filtering approach to the computation of the discrete Fourier transform. IEEE Trans. Electroacoustics, AU-18:451-455, 1970.
7. A. Bostan, P. Flajolet, B. Salvy, and É, Schost. Fast computation with two algebraic numbers, 2003.
8. A. Bostan, G. Lecerf, and É. Schost. Tellegen's principle into practice. In ISSAC'03, pages 37-44. ACM, 2003.
9. A. Bostan and É. Schost. On the complexities of multipoint evaluation and interpolation. TCS, 329(2):223-235, 2004.
10. A. Bostan and É. Schost. Polynomial evaluation and interpolation on special sets of points, J. Complexity, to appear.
11. P. Bürgisser, M. Clausen, and M. A. Shokrollahi. Algebraic complexity theory, volume 315 of Grund, der Math. Wiss. Springer, 1997.
12. D. G. Cantor and E. Kaltofen. On fast multiplication of polynomials over arbitrary algebras. Acta, Inform., 28(7):693-701, 1991.
13. R. Dvornicich and C. Traverse. Newton symmetri functions and the arithmetic of algebraically closed fields. In AAECC-5, volume 356 of LNCS, pages 216-224, Springer, 1989.
14. I. Z. Emiris and V. Y. Pan. Applications of FFT. In Algorithms and theory of computation handbook, pages 17-1-17-30, CRC, Boca Raton, FL, 1999.
15. I. Z. Emiris and V. Y. Pan, Symbolic and numeric methods for exploiting structure in constructing resultant matrices. JSC, 33(4):393-413, 2002.
16. C. M. Fiduccia and Y. Zalcstein, Algebras having linear multiplicative complexities. J. Assoc. Comput. Mach., 24(2):311-331, 1977.
17. J. von zur Gathen and J. Gerhard, Modern computer algebra. Cambridge University Press, 1999.
18. G. Hanrot and P. Zimmermann. A long note on Mulders' short product. JSC, 37(3):391-401, 2004.
19. J. van der Hoeven. Relax, but don't be too lazy, JSC, 34(6):479-542, 2002.
20. J. van der Hoeven. The Truncated Fourier Transform and applications. In ISSAC'04, pages 290-296. ACM, 2004.
21. J. van der Hoeven. Notes on the Truncated Fourier Transform, preprint, 2005.
22. G. Lecerf, Quadratic Newton iteration for systems with multiplicity, Found, of Comput. Math., 2(3):247-293, 2002.
23. G. Lecerf. Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers. J. Complexity, 19(4):564-596, 2003.
24. G. Lecerf and É. Schost, Fast multivariate power series multiplication in characteristic zero, SADIO Electronic Journal, 5(1), 2003.
25. F. S. Macaulay. Some properties of enumeration in the theory of modular systems, Proc. London Math. Soc., 26:531-555, 1927.
26. F. Mora, De nugis Groebnerialium 2: Applying Macaulay's trick in order to easily write a Gröbner basis, AAECC, 13(6):437-446, 2003.
27. T. Mulders, On short multiplications and divisions. AAECC, 11(1):69-88, 2000.
28. V. Y. Pan. New techniques for the computation of linear recurrence coefficients. Finite Fields and their Applications, 6(1):93-118, 2000.
29. L. R. Rabiner, R. W. Schafer, and C. M. Rader, The chirp z-transform algorithm and its application. Bell System Tech. J., 48:1249-1292, 1969.
30. T. Sauer. Lagrange interpolation on subgrids of tensor product grids. Math. Comp., 73:181-190, 2004.
31. A. Schönhage. Partial and total matrix multiplication. SIAM J. Comput., 10(3):434-455, 1981.
32. A. Schönhage, Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic. In Automata, languages and programming, volume 700 of LNCS, pages 410-417, Springer, 1993.
33. A. Schönhage. Bivariate polynomial multiplication patterns. In AAECC-11, volume 948 of LNCS, pages 70-81, Springer, 1995.
34. S. Winograd. Some bilinear forms whose multiplicative complexity depends on the field of constants. Math. Systems Theory, 10(2): 169-180, 1976/77.
35. R. Zippel, Effective Polynomial Computation. Kluwer Academic Publishers, 1993.