backward Euler method

Summary

backward Euler method is an implicit Runge–Kutta method^[1]. It draws 222 Wikipedia views per month (implicit_runge_kutta_method category, ranking #1 of 2).^[2]

Key Facts

• backward Euler method's instance of is recorded as implicit Runge–Kutta method^[3].
• backward Euler method's instance of is recorded as Adams–Moulton methods^[4].
• Leonhard Euler is named after backward Euler method^[5].
• backward Euler method's followed by is recorded as trapezoidal rule^[6].
• backward Euler method's opposite of is recorded as Euler method^[7].
• backward Euler method's Freebase ID is recorded as /m/0j7ktb6^[8].
• backward Euler method's has characteristic is recorded as L-stability^[9].
• backward Euler method's has characteristic is recorded as number of steps^[10].
• backward Euler method's has characteristic is recorded as order of convergence^[11].
• backward Euler method's has characteristic is recorded as number of stages^[12].
• backward Euler method's defining formula is recorded as y_{n+1}=y_{n}+h f\left(t_{n+1}, y_{n+1}\right)^[13].
• backward Euler method's maintained by WikiProject is recorded as WikiProject Mathematics^[14].
• backward Euler method's Microsoft Academic ID is recorded as 768646^[15].
• backward Euler method's Butcher tableau is recorded as \begin{array}{l|l}1 & 1 \ \hline & 1 \end{array}^[16].
• backward Euler method's OpenAlex ID is recorded as C768646^[17].

Why It Matters

backward Euler method draws 222 Wikipedia views per month (implicit_runge_kutta_method category, ranking #1 of 2).^[2] It has Wikipedia articles in 7 language editions, a strong signal of global cultural recognition.^[18] It is known by 6 alternative names across languages and contexts.^[19]