Matches in DBpedia 2015-04 for { <http://dbpedia.org/resource/Durand%E2%80%93Kerner_method> ?p ?o }
Showing triples 1 to 29 of
29
with 100 triples per page.
- Durand%E2%80%93Kerner_method abstract "In numerical analysis, the Durand–Kerner method, established 1960–66 and named after E. Durand and Immo Kerner, also called the method of Weierstrass, established 1859–91 and named after Karl Weierstrass, is a root-finding algorithm for solving polynomial equations. In other words, the method can be used to solve numerically the equation ƒ(x) = 0where ƒ is a given polynomial, which can be taken to be scaled so that the leading coefficient is 1.".
- Durand%E2%80%93Kerner_method wikiPageExternalLink thesis.html.
- Durand%E2%80%93Kerner_method wikiPageExternalLink 1891-2&seite:int=00000565.
- Durand%E2%80%93Kerner_method wikiPageExternalLink groots.html.
- Durand%E2%80%93Kerner_method wikiPageExternalLink polyroots.
- Durand%E2%80%93Kerner_method wikiPageExternalLink solve.html.
- Durand%E2%80%93Kerner_method wikiPageExternalLink techreport.php?id=26.
- Durand%E2%80%93Kerner_method wikiPageExternalLink node2.html.
- Durand%E2%80%93Kerner_method wikiPageID "3675893".
- Durand%E2%80%93Kerner_method wikiPageRevisionID "615098680".
- Durand%E2%80%93Kerner_method hasPhotoCollection Durand–Kerner_method.
- Durand%E2%80%93Kerner_method subject Category:Root-finding_algorithms.
- Durand%E2%80%93Kerner_method type Abstraction100002137.
- Durand%E2%80%93Kerner_method type Act100030358.
- Durand%E2%80%93Kerner_method type Activity100407535.
- Durand%E2%80%93Kerner_method type Algorithm105847438.
- Durand%E2%80%93Kerner_method type Event100029378.
- Durand%E2%80%93Kerner_method type Procedure101023820.
- Durand%E2%80%93Kerner_method type PsychologicalFeature100023100.
- Durand%E2%80%93Kerner_method type Root-findingAlgorithms.
- Durand%E2%80%93Kerner_method type Rule105846932.
- Durand%E2%80%93Kerner_method type YagoPermanentlyLocatedEntity.
- Durand%E2%80%93Kerner_method comment "In numerical analysis, the Durand–Kerner method, established 1960–66 and named after E. Durand and Immo Kerner, also called the method of Weierstrass, established 1859–91 and named after Karl Weierstrass, is a root-finding algorithm for solving polynomial equations. In other words, the method can be used to solve numerically the equation ƒ(x) = 0where ƒ is a given polynomial, which can be taken to be scaled so that the leading coefficient is 1.".
- Durand%E2%80%93Kerner_method label "Durand–Kerner method".
- Durand%E2%80%93Kerner_method label "Weierstraß-(Durand-Kerner)-Verfahren".
- Durand%E2%80%93Kerner_method sameAs m.09tvsd.
- Durand%E2%80%93Kerner_method sameAs Durand–Kerner_method.
- Durand%E2%80%93Kerner_method wasDerivedFrom Durand–Kerner_method?oldid=615098680.
- Durand%E2%80%93Kerner_method isPrimaryTopicOf Durand–Kerner_method.