Muller's method

Summary

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

Key Facts

• Muller's method's instance of is recorded as root-finding algorithm^[3].
• David E. Muller is named after Muller's method^[4].
• Muller's method's Freebase ID is recorded as /m/05prvr^[5].
• Muller's method's defining formula is recorded as x_{k+1} = x_k - \frac{2f(x_k)}{w \pm \sqrt{\left(f[x_k,x_{k-1}] + f[x_k,x_{k-2}] - f[x_{k-1},x_{k-2}]\right)^2 - 4f(x_k)f[x_k, x_{k-1}, x_{k-2}]}}.^[6].
• Muller's method's Google Knowledge Graph ID is recorded as /g/120phrd1^[7].
• Muller's method's MathWorld ID is recorded as MullersMethod^[8].
• Muller's method's maintained by WikiProject is recorded as WikiProject Mathematics^[9].
• Muller's method's Microsoft Academic ID is recorded as 195412274^[10].

Body

Designation and Status

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

History and Context

David E. Muller is named after Muller's method^[4].

Why It Matters

Muller's method draws 76 Wikipedia views per month (root_finding_algorithm category, ranking #9 of 20).^[2] It has Wikipedia articles in 11 language editions, a strong signal of global cultural recognition.^[11] It is known by 4 alternative names across languages and contexts.^[12]