Explicit single step methods with optimal order of convergence for partial differential equations (Q1807653)
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: Explicit single step methods with optimal order of convergence for partial differential equations |
scientific article; zbMATH DE number 1367735
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Explicit single step methods with optimal order of convergence for partial differential equations |
scientific article; zbMATH DE number 1367735 |
Statements
Explicit single step methods with optimal order of convergence for partial differential equations (English)
0 references
20 July 2000
0 references
The author defines a class of methods for the time-discretization of linear time-dependent partial differential equations on the framework of explicit Runge-Kutta methods. The bounding conditions of the original problem are incorporated to the full scheme in order to get the optimal order of convergence. The results are illustrated numerically.
0 references
method of lines
0 references
order reduction
0 references
numerical examples
0 references
explicit single step methods
0 references
time-discretization
0 references
explicit Runge-Kutta methods
0 references
convergence
0 references
0.7910313010215759
0 references
0.78496253490448
0 references
0.7809826135635376
0 references
