Convergence of the parallel chaotic waveform relaxation method for stiff systems (Q1861322)
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: Convergence of the parallel chaotic waveform relaxation method for stiff systems |
scientific article; zbMATH DE number 1882248
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convergence of the parallel chaotic waveform relaxation method for stiff systems |
scientific article; zbMATH DE number 1882248 |
Statements
Convergence of the parallel chaotic waveform relaxation method for stiff systems (English)
0 references
16 March 2003
0 references
Ideas for the numerical solution of stiff linear systems of ordinary differential equations are presented, where the dimension is assumed to be very large. Specifically the authors propose to use the waveform relaxation technique to decompose the full system into smaller subsystems. On a parallel computer, each subsystem is then solved on its own processor. The computation is performed in an asynchronous way, so each processor can work independently of the others. Three different concrete realizations of this concept are introduced and analyzed with respect to their convergence behaviour: A fundamental asynchronous parallel multisplitting scheme, a relaxed variant of this, and a more complex overlapping multisplitting method. Numerical examples are given.
0 references
multisplitting
0 references
waveform relaxation
0 references
stiff systems
0 references
parallel algorithm
0 references
convergence
0 references
numerical examples
0 references
0 references
0 references
0.9378837
0 references
0.9018284
0 references
0.89489615
0 references
0.88193905
0 references
0.87397605
0 references
0.87244296
0 references
0.8704421
0 references