Backward differentiation formula
Summary
A backward differentiation formula, or BDF method, is an implicit linear multistep method. It differentiates the polynomial through the latest computed values and sets its slope at the new point equal to . The -step formula has order , and it is zero-stable only for . Because of their large regions of stability, BDF methods are the standard methods for stiff equations. The one-step formula is the backward Euler method.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | TDA94C2JYT |
|---|---|
| URI | m2://TDA94C2JYT |
| Kind | concept |
| Writing | W0 stub |
| MSC | 65L06, 65L04 |
| Specializes | Linear multistep method |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.