Muller's method
root-finding algorithm
Facts
3 properties- Instance of
- root-finding algorithm
- Defining formula
- 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}]}}.[3]
- Named after
- David E. Muller[2]
🏷️ Also known as
en Muller's method
es Método de Muller
fa روش مولر
fr Methode de Muller
fr Méthode de Muller
fr Méthode du Muller
fr Muller's method
he שיטת מולר
it metodo di Muller
ja ミューラーの求根アルゴリズム
ja ミューラー法
nl Methode van Muller
pl Metoda Mullera
ru метод Мюллера
tr Muller yöntemi
zh Muller法
🔖 Identifiers · 4
- Freebase ID
- /m/05prvr
- Google Knowledge Graph ID
- /g/120phrd1
- MathWorld ID
- MullersMethod
- Microsoft Academic ID (discontinued)
- 195412274
🔗 Connections
Instance of 1
Maintained by WikiProject 1
Named after 1
Press Enter · cited answer in seconds
0 sources
Summary
Muller's method is a root-finding algorithm[1].