A unified derivation of finite-difference schemes from solution matching (Q2804374)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A unified derivation of finite-difference schemes from solution matching |
scientific article; zbMATH DE number 6575165
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A unified derivation of finite-difference schemes from solution matching |
scientific article; zbMATH DE number 6575165 |
Statements
A unified derivation of finite-difference schemes from solution matching (English)
0 references
29 April 2016
0 references
finite difference schemes
0 references
higher-order methods
0 references
Burgers' equation
0 references
stability
0 references
algorithm
0 references
0 references
0 references
0.8752494
0 references
0.87490606
0 references
0.8741983
0 references
0.8740089
0 references
The paper proposes a new method for solving partial differential equations which ``views finite difference schemes as systematic ways of matching up to the operator solution'' of the equation. The stability of ``the first-order algorithm for an entire class of linear equations'' is proved.
0 references
