Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Lehmer–Schur_algorithm> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items 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 wikiPageID "2711954".
- Lehmer–Schur_algorithm wikiPageRevisionID "592170896".
- 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 "Algorithme de Lehmer-Schur".
- Lehmer–Schur_algorithm label "Lehmer–Schur algorithm".
- Lehmer–Schur_algorithm sameAs Lehmer%E2%80%93Schur_algorithm.
- Lehmer–Schur_algorithm sameAs Algorithme_de_Lehmer-Schur.
- Lehmer–Schur_algorithm sameAs Q6518935.
- Lehmer–Schur_algorithm sameAs Q6518935.
- Lehmer–Schur_algorithm wasDerivedFrom Lehmer–Schur_algorithm?oldid=592170896.