ISBN 9798662718821 is currently unpriced. Please contact us for pricing.
Available options are listed below:
Available options are listed below:
Domain Decomposition Algorithms for First-Order System Least Squares Methods
AUTHOR | Nasa, National Aeronautics and Space Adm; Pavarino, Luca F. |
PUBLISHER | Independently Published (06/30/2020) |
PRODUCT TYPE | Paperback (Paperback) |
Description
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. Pavarino, Luca F. Langley Research Center NASA-CR-198275, NAS 1.26:198275, ICASE-96-6 NAS1-19480; NSF ASC-89-58544; RTOP 505-90-52-01 LEAST SQUARES METHOD; GALERKIN METHOD; ALGORITHMS; FINITE ELEMENT METHOD; ELLIPTIC DIFFERENTIAL EQUATIONS; SCHWARTZ METHOD; CONVERGENCE; SCALARS; OPERATORS (MATHEMATICS)
Show More
Product Format
Product Details
ISBN-13:
9798662718821
Binding:
Paperback or Softback (Trade Paperback (Us))
Content Language:
English
More Product Details
Page Count:
26
Carton Quantity:
157
Product Dimensions:
8.50 x 0.05 x 11.02 inches
Weight:
0.19 pound(s)
Country of Origin:
US
Subject Information
BISAC Categories
Science | Space Science - General
Descriptions, Reviews, Etc.
publisher marketing
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. Pavarino, Luca F. Langley Research Center NASA-CR-198275, NAS 1.26:198275, ICASE-96-6 NAS1-19480; NSF ASC-89-58544; RTOP 505-90-52-01 LEAST SQUARES METHOD; GALERKIN METHOD; ALGORITHMS; FINITE ELEMENT METHOD; ELLIPTIC DIFFERENTIAL EQUATIONS; SCHWARTZ METHOD; CONVERGENCE; SCALARS; OPERATORS (MATHEMATICS)
Show More