skip to main content
10.1145/860854.860890acmconferencesArticle/Chapter ViewAbstractPublication PagesissacConference Proceedingsconference-collections
Article

Relaxed mltiplication using the middle product

Published:03 August 2003Publication History

ABSTRACT

In previous work, we have introduced the technique of relaxed power series computations. With this technique, it is possible to solve implicit equations almost as quickly as doing the operations which occur in the implicit equation. In this paper, we present a new relaxed multiplication algorithm for the resolution of linear equations. The algorithm has the same asymptotic time complexity as our previous algorithms, but we improve the space overhead in the divide and conquer model and the constant factor in the F.F.T. model.

References

  1. Cantor, D., and Kaltofen, E. On fast multiplication of polynomials over arbitrary algebras. Acta Informatica 28 (1991), 693--701. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Cooley, J., and Tukey, J. An algorithm for the machine calculation of complex Fourier series. Math. Computat. 19 (1965), 297--301.Google ScholarGoogle ScholarCross RefCross Ref
  3. Hanrot, G., Quercia, M., and Zimmermann, P. Speeding up the division and square root of power series. Research Report 3973, INRIA, July 2000. Available from http://www.inria.fr/RRRT/RR-3973.html.Google ScholarGoogle Scholar
  4. Hanrot, G., Quercia, M., and Zimmermann, P. The middle product algorithm I. speeding up the division and square root of power series. Submitted, 2002.Google ScholarGoogle Scholar
  5. Hanrot, G., and Zimmermann, P. A long note on mulders' short product. Research Report 4654, INRIA, Dec. 2002. Available from http://www.loria.fr/˜hanrot/Papers/mulders.ps.Google ScholarGoogle Scholar
  6. Karatsuba, A., and Ofman, J. Multiplication of multidigit numbers on automata. Soviet Physics Doklady 7 (1963), 595--596.Google ScholarGoogle Scholar
  7. Knuth, D. The Art of Computer Programming, 3-rd ed., vol. 2: Seminumerical Algorithms. Addison-Wesley, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Mulders, T. On short multiplication and division. AAECC 11, 1 (2000), 69--88.Google ScholarGoogle ScholarCross RefCross Ref
  9. Schönhage, A., and Strassen, V. Schnelle Multiplikation grosser Zahlen. Computing 7 7 (1971), 281--292.Google ScholarGoogle ScholarCross RefCross Ref
  10. van der Hoeven, J. Lazy multiplication of formal power series. In Proc. ISSAC '97 (Maui, Hawaii, July 1997), W. W. Küchlin, Ed., pp. 17--20. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. van der Hoeven, J. Relax, but don't be too lazy. JSC 34 (2002), 479--542. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Relaxed mltiplication using the middle product

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      ISSAC '03: Proceedings of the 2003 international symposium on Symbolic and algebraic computation
      August 2003
      284 pages
      ISBN:1581136412
      DOI:10.1145/860854
      • General Chair:
      • Hoon Hong

      Copyright © 2003 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 3 August 2003

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      ISSAC '03 Paper Acceptance Rate36of68submissions,53%Overall Acceptance Rate395of838submissions,47%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader