Skip to main content
Log in

The Durand-Kerner method for trigonometric and exponential polynomials

Das Durand-Kerner-Verfahren für trigonometrische und exponentielle Polynome

  • Short Communications
  • Published:
Computing Aims and scope Submit manuscript

Abstract

The problem of finding all roots of an exponential or trigonometric equation is reduced to the determination of zeros of algebraic polynomials where the well-known Durand-Kerner algorithm can be applied. This transformation of the problem has the additional advantage that the periodicity of the original functions is eliminated and the choice of starting values is simplified.

Zusammenfassung

Die simultane Nullstellenbestimmung von exponentiellen oder trigonometrischen Gleichungen wird zurückgeführt auf die Nullstellenbestimmung von Polynomen; dazu ist das bekannte Verfahren von Durand-Kerner geeignet. Diese Transformation des Problems hat den zusätzlichen Vorteil, daß die Periodizität der Ausgangsfunktionen verschwindet und dadurch die Wahl von Startwerten vereinfacht wird.

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

Access this article

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

Instant access to the full article PDF.

References

  1. Aberth, O.: Iteration methods for finding all zeros of a polynomial simultaneously. Maths. Comput.27, 339–344 (1973).

    Google Scholar 

  2. Angelova, E. D., Semerdzhiev, Kh. I.: Methods for the simultaneous approximate derivation of the roots of algebraic, trigonometric and exponential equations. USSR Comput. Maths. Math. Phys.22, 226–232 (1982).

    Google Scholar 

  3. Durand, E.: Solutions Numériques des Equations Algébriques. Paris: Masson 1960.

    Google Scholar 

  4. Kerner, I.: Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen. Num. Math.8, 290–294 (1966).

    Google Scholar 

  5. Kjellberg, C.: Two observations on Durand-Kerner's root-finding method. BIT24, 556–559 (1984).

    Google Scholar 

  6. Makrelov, I., Semerdzhiev, Kh.: On the convergence of two methods for the simultaneous finding of all roots of exponential equations. IMA J. Num. Analysis5, 191–200 (1985).

    Google Scholar 

  7. Pasquini, L., Trigiante, D.: A globally convergent method for simultaneously finding polynomial roots. Maths. Comput.44, 135–149 (1985).

    Google Scholar 

  8. Wang, D., Wu, Y.: Some modifications of the parallel Halley iteration method and their convergence. Computing38, 75–87 (1987).

    Google Scholar 

  9. Werner, W.: On the simultaneous determination of polynomial roots. Lecture Notes in Mathematics, Vol. 953. Berlin: Springer 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Weidner, P. The Durand-Kerner method for trigonometric and exponential polynomials. Computing 40, 175–179 (1988). https://doi.org/10.1007/BF02247945

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

AMS Subject Classifications

Key words

Navigation