Paper Info
Title
A parallel chopping algorithm for ODE boundary value problems
Abstract
A chopping algorithm proposed by Russell and Christianssen [14] for the solution of linear boundary value problems (BVPs) in ordinary differential equations (ODEs) is extended. On a computer with P processors, at each stage the BVP is solved numerically on P meshes using a code based on COLNEW [1,4]. The solutions from the P processors are combined in an algorithm which chops the range of integration and poses a set of new, 'simpler' BVPs on subintervals. These are treated recursively. Experiments on three problems with boundary and turning layers show that this algorithm can be more efficient than using COLNEW directly, and without a significant loss of accuracy. It may also be used as a mesh selector for COLNEW.
Year
DOI
Venue
1993
10.1016/0167-8191(93)90013-B
PARALLEL COMPUTING
Keywords
Field
DocType
LINEAR BOUNDARY VALUE PROBLEMS,ORDINARY DIFFERENTIAL EQUATIONS,MULTIPROCESSOR SYSTEMS,CHOPPING ALGORITHM
Differential equation,Boundary value problem,Polygon mesh,Ordinary differential equation,Algorithm,Multiprocessing,Code (cryptography),Ode,Recursion,Mathematics
Journal
Volume
Issue
ISSN
19
6
0167-8191
Citations 
PageRank 
References 
7
0.76
5
Authors
2
Name
Order
Citations
PageRank
Marcin Paprzycki1939146.39
Ian Gladwell26612.63