Backward Euler and its scalar stability
Backward Euler sets y_(k+1)=y_k+h f(t_(k+1),y_(k+1)), usually requiring an implicit solve.
Key knowledge
Backward Euler sets y_(k+1)=y_k+h f(t_(k+1),y_(k+1)), usually requiring an implicit solve. Its one-step defect is O(h²) for smooth solutions. On y′=λy it gives R(z)=1/(1−z), z=hλ, and is stable when |1−z|≥1, including Re z≤0.
Conditions and scope
- h>0; the nonlinear implicit equation must be solved to adequate accuracy and may have more than one solution.
- A large stable step need not be accurate; scalar stability is not a blanket nonlinear-system theorem.
Sources · 2
References
Sources retain their recorded scope. A source link alone does not establish verification of every statement.
Evidence and review
Table6.6.1 AM1 and Example6.6.1 equations6.6.9–10; FNC Absolute stability Example11.3.2 equations11.3.8–9.
2026-10-10 · Independent AI editorial review: All241 compact claims, hypotheses, displayed equations/conventions and all596 origin semantic links read; entire241-entry author exact-source inspection matrix and declared limitations reviewed. Prior105 actual inherited Mathematics/Information records read for whole-inventory breadth. Targeted independent primary sections are listed below; this does NOT claim every cited source body or every proof was independently re-read. This is AI reference-content review, not human disciplinary certification, exhaustive textbook reproduction or experimental replication. Receipt: mathematics-information-independent-content-review.1.
Entry details
Permanent link to this entry ↗- Record identity
- math-backward-euler-method
- Revision
- university-core.1
- Structured reference record
- University core expansion