Parallel initial-value algorithms for singularly perturbed boundary-value problems

Parallel algorithms for computing asymptotic approximations to the solutions of many singularly perturbed boundary-value problems are considered. Numerical techniques, called parallel-initial-value methods, are proposed which permit several natural computation decompositions into independent tasks....

Full description

Saved in:
Bibliographic Details
Published inJournal of optimization theory and applications Vol. 73; no. 3; pp. 501 - 517
Main Authors Gasparo, M. G., Macconi, M.
Format Journal Article
LanguageEnglish
Published New York, NY Springer 01.06.1992
Subjects
Online AccessGet full text
ISSN0022-3239
1573-2878
DOI10.1007/BF00940053

Cover

More Information
Summary:Parallel algorithms for computing asymptotic approximations to the solutions of many singularly perturbed boundary-value problems are considered. Numerical techniques, called parallel-initial-value methods, are proposed which permit several natural computation decompositions into independent tasks. The number of disposable independent processors is taken into account to design suitable parallel schemes. The reliability and performance of the proposed schemes are demonstrated using a CRAY Y-MP 8/432 multiprocessor. (O.G.)
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0022-3239
1573-2878
DOI:10.1007/BF00940053