Explicit preconditioned domain decomposition schemes for solving nonlinear boundary value problems

A new class of inner-outer iterative procedures in conjunction with Picard-Newton methods based on explicit preconditioning iterative methods for solving nonlinear systems is presented. Explicit preconditioned iterative schemes, based on the explicit computation of a class of domain decomposition ge...

Full description

Saved in:
Bibliographic Details
Published in:Computers & mathematics with applications (1987) Vol. 45; no. 1; pp. 263 - 272
Main Author: Gravvanis, G.A.
Format: Journal Article
Language:English
Published: Elsevier Ltd 2003
Subjects:
Approximate factorization procedures
Approximate inverse matrix techniques
Arrow-type matrix
Domain decomposition
Parallel iterative methods
Preconditioning
Arrow-type matrix
Parallel iterative methods
Domain decomposition
Preconditioning
Approximate factorization procedures
Approximate inverse matrix techniques
ISSN:0898-1221, 1873-7668
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A new class of inner-outer iterative procedures in conjunction with Picard-Newton methods based on explicit preconditioning iterative methods for solving nonlinear systems is presented. Explicit preconditioned iterative schemes, based on the explicit computation of a class of domain decomposition generalized approximate inverse matrix techniques are presented for the efficient solution of nonlinear boundary value problems on multiprocessor systems. Applications of the new composite scheme on characteristic nonlinear boundary value problems are discussed and numerical results are given.
ISSN:0898-1221
1873-7668
DOI:10.1016/S0898-1221(03)80018-4