Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Initial approximations in Durand-Kerner's root finding method

From MaRDI portal
Publication:1093327
Jump to:navigation, search

DOI10.1007/BF01935059zbMath0628.65038MaRDI QIDQ1093327

Heinrich Guggenheimer

Publication date: 1986

Published in: BIT (Search for Journal in Brave)


zbMATH Keywords

comparison of methodspolynomial zerosDurand- Kerner's methodEhrlich's method


Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05)


Related Items

The Durand-Kerner polynomials roots-finding method in case of multiple roots ⋮ Computing curve intersection by means of simultaneous iterations ⋮ Polynomial root finding by means of continuation ⋮ Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method ⋮ On simultaneous factoring of a polynomial ⋮ Numerical computation of polynomial zeros by means of Aberth's method



Cites Work

  • Two observations on Durand-Kerner's root-finding method
  • A modified Newton method for polynomials
  • A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1093327&oldid=13123880"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 02:22.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki