Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Lehmer–Schur_algorithm> ?p ?o }
Showing triples 1 to 38 of
38
with 100 triples per page.
- Lehmer–Schur_algorithm abstract "In mathematics, the Lehmer–Schur algorithm (named after Derrick Henry Lehmer and Issai Schur) is a root-finding algorithm extending the idea of enclosing roots like in the one-dimensional bisection method to the complex plane. It uses the Schur–Cohn test to test increasingly smaller disks for the presence or absence of roots. Alternative methods like Wilf's algorithm apply different tests to differently shaped areas but keep the idea of descent by subdivision.".
- Lehmer–Schur_algorithm wikiPageExternalLink 1979-01.pdf.
- Lehmer–Schur_algorithm wikiPageExternalLink bookcpdf.html.
- Lehmer–Schur_algorithm wikiPageExternalLink polystff.g.
- Lehmer–Schur_algorithm wikiPageID "2711954".
- Lehmer–Schur_algorithm wikiPageLength "6614".
- Lehmer–Schur_algorithm wikiPageOutDegree "20".
- Lehmer–Schur_algorithm wikiPageRevisionID "660949739".
- Lehmer–Schur_algorithm wikiPageWikiLink Analytic_function.
- Lehmer–Schur_algorithm wikiPageWikiLink Argument_principle.
- Lehmer–Schur_algorithm wikiPageWikiLink Bisection_method.
- Lehmer–Schur_algorithm wikiPageWikiLink Category:Root-finding_algorithms.
- Lehmer–Schur_algorithm wikiPageWikiLink Congruence_(geometry).
- Lehmer–Schur_algorithm wikiPageWikiLink Derrick_Henry_Lehmer.
- Lehmer–Schur_algorithm wikiPageWikiLink Holomorphic_function.
- Lehmer–Schur_algorithm wikiPageWikiLink Issai_Schur.
- Lehmer–Schur_algorithm wikiPageWikiLink Jan_van_Leeuwen.
- Lehmer–Schur_algorithm wikiPageWikiLink Mathematical_Association_of_America.
- Lehmer–Schur_algorithm wikiPageWikiLink Mathematics.
- Lehmer–Schur_algorithm wikiPageWikiLink Multiplicity_(mathematics).
- Lehmer–Schur_algorithm wikiPageWikiLink Newtons_method.
- Lehmer–Schur_algorithm wikiPageWikiLink Numerical_Recipes.
- Lehmer–Schur_algorithm wikiPageWikiLink Root-finding_algorithm.
- Lehmer–Schur_algorithm wikiPageWikiLink Rouchxc3xa9s_theorem.
- Lehmer–Schur_algorithm wikiPageWikiLink Winding_number.
- Lehmer–Schur_algorithm wikiPageWikiLinkText "Lehmer–Schur algorithm".
- Lehmer–Schur_algorithm hasPhotoCollection Lehmer–Schur_algorithm.
- Lehmer–Schur_algorithm wikiPageUsesTemplate Template:Citation.
- Lehmer–Schur_algorithm wikiPageUsesTemplate Template:Cite_check.
- Lehmer–Schur_algorithm subject Category:Root-finding_algorithms.
- Lehmer–Schur_algorithm comment "In mathematics, the Lehmer–Schur algorithm (named after Derrick Henry Lehmer and Issai Schur) is a root-finding algorithm extending the idea of enclosing roots like in the one-dimensional bisection method to the complex plane. It uses the Schur–Cohn test to test increasingly smaller disks for the presence or absence of roots. Alternative methods like Wilf's algorithm apply different tests to differently shaped areas but keep the idea of descent by subdivision.".
- Lehmer–Schur_algorithm label "Lehmer–Schur algorithm".
- Lehmer–Schur_algorithm sameAs Algorithme_de_Lehmer-Schur.
- Lehmer–Schur_algorithm sameAs m.07zjvr.
- Lehmer–Schur_algorithm sameAs Q6518935.
- Lehmer–Schur_algorithm sameAs Q6518935.
- Lehmer–Schur_algorithm wasDerivedFrom Lehmer–Schur_algorithm?oldid=660949739.
- Lehmer–Schur_algorithm isPrimaryTopicOf Lehmer–Schur_algorithm.