Domain Decomposition Algorithms for First-Order System Least Squares Methods.

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1996
Accession Number
ADA307281

Entities

People

  • Luca F. Pavarino

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Additives (Chemicals)
  • Algorithms
  • Convergence
  • Couplings
  • Decomposition
  • Engineering
  • Equations
  • Information Operations
  • Iterations
  • Least Squares Method
  • Linear Systems
  • Mathematical Analysis
  • Navier Stokes Equations
  • Numerical Analysis
  • Poisson Equation
  • Standards
  • Stiffness

Fields of Study

  • Mathematics

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)

Technology Areas

  • Space