MacCormack method
Builds on Conservation lawFinite difference methodLax–Wendroff method
Definition
Let be smooth, and consider the conservation law . Fix and , put , and let approximate . The MacCormack method computes from in two steps.
- Predictor, with a forward difference: .
- Corrector, with a backward difference: .
Remarks
Example: for and , the predictor gives . Putting this into the corrector gives which is the Lax–Wendroff method; so the method is second-order accurate and stable for in this case. Non-example: using a forward difference in the corrector as well gives, for , the scheme , whose Taylor expansion leaves the error term , so it is only first order. The order of the one-sided differences may be reversed (backward in the predictor, forward in the corrector); alternating the two orders from step to step is common.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Conservation law concept
- Finite difference method concept
- Lax–Wendroff method concept
- MacCormack method definition
Further reading
About this page
| Tag | 5R9ZRK8YB5 |
|---|---|
| URI | m2://5R9ZRK8YB5 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 65M06, 35L65 |
| Defines | MacCormack method |
| Uses | Conservation law, Finite difference method, Lax–Wendroff method |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- 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.