Partitioning strategies in Runge-Kutta type methods (Q4031992)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 151883
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning strategies in Runge-Kutta type methods |
scientific article; zbMATH DE number 151883 |
Statements
Partitioning strategies in Runge-Kutta type methods (English)
0 references
3 May 1993
0 references
Runge-Kutta methods
0 references
stability
0 references
numerical results
0 references
performance
0 references
stiff systems
0 references
stiffness
0 references
system
0 references
nonlinear
0 references
partitioning strategies
0 references
dynamic partitioning
0 references
0.8901776671409607
0 references
0.8332939743995667
0 references
0.8332414627075195
0 references
0.832099437713623
0 references
The difficulty of predicting possible stiffness when solving numerically a given initial-value problem for a system of nonlinear ordinary differential equations has led to the development of software package based on partitioned numerical methods which in some way exploit the structure of the problem. This paper presents a survey of existing partitioning strategies (intervalwise partitioning; fixed partitioning into subsystems). These two strategies are then combined to obtain a dynamic partitioning: on each subinterval the resulting algorithm automatically selects the stiff components, i.e. the given system is split locally. The authors focus their discussion on weakly coupled problems. Three examples are used to illustrate the performance and the reliability of this approach.
0 references
