Accession Number : ADA307281
Title : Domain Decomposition Algorithms for First-Order System Least Squares Methods.
Descriptive Note : Contract rept.,
Corporate Author : INSTITUTE FOR COMPUTER APPLICATIONS IN SCIENCE AND ENGINEERING HAMPTON VA
Personal Author(s) : Pavarino, Luca F.
PDF Url : ADA307281
Report Date : JAN 1996
Pagination or Media Count : 20
Abstract : Least squares methods based on first-order systems have been recently proposed and analyzed for second-order elliptic equations and systems. They produce symmetric and positive definite discrete systems by using standard finite element spaces which are not required to satisfy the inf-sup condition. In this paper, several domain decomposition algorithms for these first-order least squares methods are studied. Some representative overlapping and substructuring algorithms are considered in their additive and multiplicative variants. The theoretical and numerical results obtained show that the classical convergence bounds (on the iteration operator) for standard Galerkin discretizations are also valid for least squares methods.
Descriptors : *ALGORITHMS, *LEAST SQUARES METHOD, MATHEMATICAL MODELS, OPTIMIZATION, MATRICES(MATHEMATICS), FINITE ELEMENT ANALYSIS, CONVERGENCE, SYSTEMS ANALYSIS, OPERATORS(MATHEMATICS), NUMERICAL METHODS AND PROCEDURES, ITERATIONS.
Subject Categories : Numerical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE