Graeffe's method

Summary

Graeffe's method is a root-finding algorithm^[1]. It draws 14 Wikipedia views per month (root_finding_algorithm category, ranking #15 of 20).^[2]

Key Facts

• Graeffe's method is credited with the discovery of Nikolai Ivanovich Lobachevsky^[3].
• Graeffe's method's instance of is recorded as root-finding algorithm^[4].
• Karl Heinrich Gräffe is named after Graeffe's method^[5].
• Germinal Pierre Dandelin is named after Graeffe's method^[6].
• Nikolai Ivanovich Lobachevsky is named after Graeffe's method^[7].
• Graeffe's method's Freebase ID is recorded as /m/0frzpr^[8].
• Graeffe's method's MathWorld ID is recorded as GraeffesMethod^[9].
• Graeffe's method's maintained by WikiProject is recorded as WikiProject Mathematics^[10].
• Graeffe's method's Microsoft Academic ID is recorded as 2778530812^[11].

Body

Designation and Status

Graeffe's method's instance of is recorded as root-finding algorithm^[4].

History and Context

Things named after include Karl Heinrich Gräffe^[5], a mathematician^[12], 1799–1873^[13], of Germany^[14], specialised in mathematics^[15]; Germinal Pierre Dandelin^[6], a mathematician^[16], 1794–1847^[17], awarded the Knight of the Order of Leopold^[18]; and Nikolai Ivanovich Lobachevsky^[7], a mathematician^[19], 1792–1856^[20], of Russian Empire^[21], awarded the Order of Saint Anna, 1st class^[22], specialised in geometry^[23].

Why It Matters

Graeffe's method draws 14 Wikipedia views per month (root_finding_algorithm category, ranking #15 of 20).^[2] It has Wikipedia articles in 6 language editions, a strong signal of global cultural recognition.^[24] It is known by 5 alternative names across languages and contexts.^[25]