Convergence of the parallel chaotic waveform relaxation method for stiff systems

In this paper, we establish several algorithms for parallel chaotic waveform relaxation methods for solving linear ordinary differential systems based on some given models. Under some different assumptions on the coefficient matrix A and its multisplittings we obtain corresponding sufficient conditi...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computational and applied mathematics Vol. 151; no. 1; pp. 201 - 213
Main Authors: Yuan, Dongjin, Burrage, Kevin
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 01.02.2003
Elsevier
Subjects:
Chaotic
Convergence
Exact sciences and technology
H-matrix
Mathematics
Multisplitting
Numerical analysis
Numerical analysis. Scientific computation
Numerical linear algebra
Ordinary differential equations
Parallel
Sciences and techniques of general use
Stiff systems
Waveform relaxation
65L05
65F10
Waveform relaxation
Stiff systems
Parallel
H-matrix
Multisplitting
Chaotic
Convergence
Parallel algorithm
Convergence of numerical methods
Differential system
Convergence speed
H matrix
Numerical analysis
Sufficient condition
Linear system
Numerical solution
Relaxation method
Chaotic systems
Stiff system
ISSN:0377-0427, 1879-1778
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we establish several algorithms for parallel chaotic waveform relaxation methods for solving linear ordinary differential systems based on some given models. Under some different assumptions on the coefficient matrix A and its multisplittings we obtain corresponding sufficient conditions of convergence of the algorithms. Also a discussion on convergence speed comparison of synchronous and asynchronous algorithms is given.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0377-0427
1879-1778
DOI:10.1016/S0377-0427(02)00749-5