Lax–Friedrichs method
Builds on Conservation lawFinite difference method
Definition
Let be continuous, and consider the conservation law for . Fix and , and put . Let denote the approximation of at and . The Lax–Friedrichs method is the explicit scheme
Remarks
It is in conservation form with the numerical flux Its truncation error is of first order in when is fixed.
Example: for with , the scheme reads . If , both weights lie in and sum to . So , and the scheme is stable in the maximum norm.
Non-example: the forward-time centred-space scheme differs only in the first term. For with , it multiplies the Fourier mode by , of modulus greater than when . So it is unstable for every .
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Conservation law concept
- Finite difference method concept
- Lax–Friedrichs method definition
Further reading
About this page
| Tag | 53H8EVRC1J |
|---|---|
| URI | m2://53H8EVRC1J |
| Kind | definition |
| Writing | W0 stub |
| MSC | 65M06, 65M08, 35L65 |
| Defines | Lax–Friedrichs method |
| Uses | Conservation law, Finite difference method |
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.