Butcher tableau
Builds on Runge–Kutta methods
Definition
Let be an integer. An -stage Butcher tableau is an array with real entries: a vector , a matrix and a vector . It specifies the -stage Runge–Kutta method for with step :
Remarks
The method is explicit when for , so the tableau is strictly lower triangular and blank entries are read as . Usually for each . An embedded pair adds a second row of weights that gives a method of another order from the same stages. Example: the classical fourth-order method has , , , all other , and . Check of two order conditions: and . Non-example: an array with , and is not a Butcher tableau, since the number of weights must equal the number of stages.
Reading path
To understand this page from the ground up, read these 2 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Runge–Kutta methods concept
- Butcher tableau definition
Further reading
About this page
| Tag | 65H4W6TYKF |
|---|---|
| URI | m2://65H4W6TYKF |
| Kind | definition |
| Writing | W0 stub |
| MSC | 65L06 |
| Defines | Butcher tableau |
| Uses | Runge–Kutta methods |
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.
What links here
No page links to this page yet.