Skip to main content
SpringerLink
Log in

Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary

n(lg2 n−2) multiplications and divisions are necessary to compute the set of elementary symmetric functions inn indeterminates. This lower bound and similar ones for the computational complexity of various evaluation and interpolation problems are obtained by introducing ideas and results from algebraic geometry.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literatur

  1. Borodin, A., Munro, I.: Evaluating polynomials at many points. Information Processing Letters (1971), 66–68. North-Holland Publishing Company.

  2. Brauer, A.: On addition chains. Bull. Amer. Math. Soc.45 (1939).

  3. Cooley, J. W., Tukey, J. W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput.19 (90), 297–301 (April 1965).

    Google Scholar 

  4. Matsumara, H.: Commutative algebra, New York Benjamin 1970.

    Google Scholar 

  5. Motzkin, T. S.: Evaluation of polynomials and evaluation of rational functions. Bull. Amer. Math. Soc.61, 163 (1955).

    Google Scholar 

  6. Mumford, D.: Introduction to algebraic geometry. Harvard Lecture Notes.

  7. Pan, V. Ya.: Methods of computing values of polynomials. Russian Math. Surveys21, 105–136 (1966).

    Google Scholar 

  8. Paterson, M., Stockmeyer, L.: Bounds on the evaluation time for rational polynomials. I. E. E. E. Conference Record of the 12th Ann. Symp. of Switching and Automata Theory, 140–143 (1971).

  9. Shafarevich, I. R.: Foundations of algebraic geometry. Russian Math. Surveys24, (6), 1–178 (1969).

    Google Scholar 

  10. Strassen, V.: Berechnung und Programm I. Acta Informatica 1972.

  11. Strassen, V.: Berechnungen in partiellen Algebren endlichen Typs. Computing 1972/73.

  12. Strassen, V.: Vermeidung von Divisionen. Crelle J. für die reine und angew. Mathematik 1973.

  13. Strassen, V.: Evaluation of rational functions. Complexity of Computer Computations, Plenum Press 1972.

  14. van der Waerden, B. L.: Zur algebraischen Geometrie. XIV. Math. Annalen115 (4), 619–642 (1938).

    Google Scholar 

  15. van der Waerden, B. L.: Einführung in die algebraische Geometrie. Berlin: Springer 1939.

    Google Scholar 

  16. van der Waerden, B. L.: Algebra I. Achte Auflage der Modernen Algebra. H. T. 12. Springer 1972.

  17. Moenck, R., Borodin, A.: Fast modular transforms via division. Proc. 13th Annual IEEE Symp. on Switching and Automata Theory, 90–96 (1972).

  18. Sieveking, M.: An algorithm for division of powerseries. Zur Veröffentlichung bei Computing eingereicht.

Download references

Author information

Authors and Affiliations

  1. Seminar für angewandte Mathematik der Universität Zürich, Freiestr. 36, CH-8032, Zürich, Schweiz

    Volker Strassen

Authors
  1. Volker Strassen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Strassen, V. Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten. Numer. Math. 20, 238–251 (1973). https://doi.org/10.1007/BF01436566

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01436566

Search

Navigation