Explicit single step methods with optimal order of convergence for partial differential equations (Q1807653): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q126569889, #quickstatements; #temporary_batch_1719533733942 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0168-9274(98)00132-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2091564990 / rank | |||
Normal rank | |||
Latest revision as of 11:00, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Explicit single step methods with optimal order of convergence for partial differential equations |
scientific article |
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
