Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Graeffes_method> ?p ?o }
Showing triples 1 to 44 of
44
with 100 triples per page.
- Graeffes_method abstract "In mathematics, Graeffe's method or Dandelin–Graeffe method is an algorithm for finding all of the roots of a polynomial. It was developed independently by Germinal Pierre Dandelin in 1826 and Karl Heinrich Gräffe in 1837. Lobachevsky in 1834 also discovered the principal idea of the method. The method separates the roots of a polynomial by squaring them repeatedly. This squaring of the roots is done implicitly, that is, only working on the coefficients of the polynomial. Finally, Viète's formulas are used in order to approximate the roots.".
- Graeffes_method wikiPageExternalLink 221845.
- Graeffes_method wikiPageExternalLink GraeffeMethodMod.html.
- Graeffes_method wikiPageID "6134192".
- Graeffes_method wikiPageLength "9207".
- Graeffes_method wikiPageOutDegree "11".
- Graeffes_method wikiPageRevisionID "680570297".
- Graeffes_method wikiPageWikiLink Category:Root-finding_algorithms.
- Graeffes_method wikiPageWikiLink Dual_number.
- Graeffes_method wikiPageWikiLink Dual_numbers.
- Graeffes_method wikiPageWikiLink Germinal_Pierre_Dandelin.
- Graeffes_method wikiPageWikiLink Karl_Heinrich_Gräffe.
- Graeffes_method wikiPageWikiLink Lobachevsky.
- Graeffes_method wikiPageWikiLink Mathematics.
- Graeffes_method wikiPageWikiLink Newtons_method.
- Graeffes_method wikiPageWikiLink Nikolai_Lobachevsky.
- Graeffes_method wikiPageWikiLink Power_series.
- Graeffes_method wikiPageWikiLink Root-finding_algorithm.
- Graeffes_method wikiPageWikiLink Vieta_relations.
- Graeffes_method wikiPageWikiLink Vietas_formulas.
- Graeffes_method wikiPageWikiLink Vixc3xa8tes_formulas.
- Graeffes_method wikiPageWikiLinkText "Dandelin-Graeffe iteration".
- Graeffes_method wikiPageWikiLinkText "Dandelin–Gräffe method".
- Graeffes_method wikiPageWikiLinkText "Graeffe iteration".
- Graeffes_method wikiPageWikiLinkText "Graeffe's method".
- Graeffes_method hasPhotoCollection Graeffes_method.
- Graeffes_method title "Graeffe's Method".
- Graeffes_method urlname "GraeffesMethod".
- Graeffes_method wikiPageUsesTemplate Template:Math.
- Graeffes_method wikiPageUsesTemplate Template:Mathworld.
- Graeffes_method wikiPageUsesTemplate Template:Mvar.
- Graeffes_method subject Category:Root-finding_algorithms.
- Graeffes_method hypernym Algorithm.
- Graeffes_method type Software.
- Graeffes_method comment "In mathematics, Graeffe's method or Dandelin–Graeffe method is an algorithm for finding all of the roots of a polynomial. It was developed independently by Germinal Pierre Dandelin in 1826 and Karl Heinrich Gräffe in 1837. Lobachevsky in 1834 also discovered the principal idea of the method. The method separates the roots of a polynomial by squaring them repeatedly. This squaring of the roots is done implicitly, that is, only working on the coefficients of the polynomial.".
- Graeffes_method label "Graeffe's method".
- Graeffes_method sameAs Dandelin-Gräffe-Verfahren.
- Graeffes_method sameAs m.0frzpr.
- Graeffes_method sameAs Метод_Лобачевского_—_Греффе.
- Graeffes_method sameAs Q5592179.
- Graeffes_method sameAs Q5592179.
- Graeffes_method sameAs 当德兰-格拉夫方法.
- Graeffes_method wasDerivedFrom Graeffes_methodoldid=680570297.
- Graeffes_method isPrimaryTopicOf Graeffes_method.