About: Aberth method

An Entity of Type: software, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

The Aberth method, or Aberth–Ehrlich method or Ehrlich–Aberth method, named after Oliver Aberth and Louis W. Ehrlich, is a root-finding algorithm developed in 1967 for simultaneous approximation of all the roots of a univariate polynomial. This method converges cubically, an improvement over the Durand–Kerner method, another algorithm for approximating all roots at once, which converges quadratically. (However, both algorithms converge linearly at multiple zeros.)

Property Value
dbo:abstract
  • The Aberth method, or Aberth–Ehrlich method or Ehrlich–Aberth method, named after Oliver Aberth and Louis W. Ehrlich, is a root-finding algorithm developed in 1967 for simultaneous approximation of all the roots of a univariate polynomial. This method converges cubically, an improvement over the Durand–Kerner method, another algorithm for approximating all roots at once, which converges quadratically. (However, both algorithms converge linearly at multiple zeros.) This method is used in MPSolve, which is the reference software for approximating all roots of a polynomial to an arbitrary precision. (en)
dbo:wikiPageID
  • 7378088 (xsd:integer)
dbo:wikiPageLength
  • 7125 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1109904426 (xsd:integer)
dbo:wikiPageWikiLink
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • The Aberth method, or Aberth–Ehrlich method or Ehrlich–Aberth method, named after Oliver Aberth and Louis W. Ehrlich, is a root-finding algorithm developed in 1967 for simultaneous approximation of all the roots of a univariate polynomial. This method converges cubically, an improvement over the Durand–Kerner method, another algorithm for approximating all roots at once, which converges quadratically. (However, both algorithms converge linearly at multiple zeros.) (en)
rdfs:label
  • Aberth method (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License