Matches in DBpedia 2015-04 for { <http://dbpedia.org/resource/Lehmer%E2%80%93Schur_algorithm> ?p ?o }
Showing triples 1 to 25 of
25
with 100 triples per page.
- Lehmer%E2%80%93Schur_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%E2%80%93Schur_algorithm wikiPageExternalLink 1979-01.pdf.
- Lehmer%E2%80%93Schur_algorithm wikiPageExternalLink bookcpdf.html.
- Lehmer%E2%80%93Schur_algorithm wikiPageExternalLink polystff.g.
- Lehmer%E2%80%93Schur_algorithm wikiPageID "2711954".
- Lehmer%E2%80%93Schur_algorithm wikiPageRevisionID "638773382".
- Lehmer%E2%80%93Schur_algorithm hasPhotoCollection Lehmer–Schur_algorithm.
- Lehmer%E2%80%93Schur_algorithm subject Category:Root-finding_algorithms.
- Lehmer%E2%80%93Schur_algorithm type Abstraction100002137.
- Lehmer%E2%80%93Schur_algorithm type Act100030358.
- Lehmer%E2%80%93Schur_algorithm type Activity100407535.
- Lehmer%E2%80%93Schur_algorithm type Algorithm105847438.
- Lehmer%E2%80%93Schur_algorithm type Event100029378.
- Lehmer%E2%80%93Schur_algorithm type Procedure101023820.
- Lehmer%E2%80%93Schur_algorithm type PsychologicalFeature100023100.
- Lehmer%E2%80%93Schur_algorithm type Root-findingAlgorithms.
- Lehmer%E2%80%93Schur_algorithm type Rule105846932.
- Lehmer%E2%80%93Schur_algorithm type YagoPermanentlyLocatedEntity.
- Lehmer%E2%80%93Schur_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%E2%80%93Schur_algorithm label "Algorithme de Lehmer-Schur".
- Lehmer%E2%80%93Schur_algorithm label "Lehmer–Schur algorithm".
- Lehmer%E2%80%93Schur_algorithm sameAs m.07zjvr.
- Lehmer%E2%80%93Schur_algorithm sameAs Lehmer–Schur_algorithm.
- Lehmer%E2%80%93Schur_algorithm wasDerivedFrom Lehmer–Schur_algorithm?oldid=638773382.
- Lehmer%E2%80%93Schur_algorithm isPrimaryTopicOf Lehmer–Schur_algorithm.