Papalocal
Loading…
Papalocal · Things
Work

Lehmer–Schur algorithm

Lehmer–Schur algorithm is a root-finding algorithm.

All 4 facts, and where they come from

Facts

4 facts · 0 confirmed by two sources · 0 cited · 4 from one source

What it is
algorithm One source
root-finding algorithm One source
Named after
Issai Schur One source
Derrick Henry Lehmer One source

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 17, 2026 · revision 2570714943
Described as
root-finding algorithm
What it is
algorithm; root-finding algorithm
Named after
Issai Schur; Derrick Henry Lehmer
Wikipedias with a page
2

Wikidata item Q6518935 (wikidata.org/wiki/Q6518935), public domain (CC0). Copied 2026-11-17.

What Wikipedia says · copied November 17, 2026 · revision 1313683434

In mathematics, the Lehmer–Schur algorithm (named after Derrick Henry Lehmer and Issai Schur) is a root-finding algorithm for complex polynomials, 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.

From the Wikipedia article “Lehmer–Schur algorithm” (en.wikipedia.org/wiki/Lehmer–Schur_algorithm), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

People connected 1

Known for it