On the Use of Lagrange Multipliers in Domain Decomposition for Solving Elliptic Problems

DOI10.2307/2153156zbMath0795.65073OpenAlexW4247499437MaRDI QIDQ4293958

Howard Swann

Publication date: 10 July 1994

Full work available at URL: https://doi.org/10.2307/2153156

zbMATH Keywords

Lagrange multipliersconvergenceDirichlet problemerror estimatesnumerical examplesfinite elementsecond-order elliptic equationsprimal hybrid methodnonconforming methodscell discretization methodmoment collocation

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Boundary value problems for second-order elliptic equations (35J25) Error bounds for boundary value problems involving PDEs (65N15) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Related Items

A computational multilevel approach for solving 2D Navier-Stokes equations over non-matching grids, Error estimates using the cell discretization method for steady-state convection-diffusion equations, Error estimates using the cell discretization method for some parabolic problems, A multigrid local smoother approach for a domain decomposition solver over non‐matching grids, A non-conforming finite element method for sub-meshing., Efficient parallel resolution of the simplified transport equations in mixed-dual formulation, On solenoidal high-degree polynomial approximations to solutions of the stationary Navier-Stokes equations., A computational methodology to study coupled physical processes over partitioned domains, Solution of wave propagation problems by the cell discretization method, On using the cell discretization algorithm for mixed-boundary value problems and domain decomposition, Uniform $hp$ convergence results for the mortar finite element method, On the Convergence Rate of the Cell Discretization Algorithm for Solving Elliptic Problems, Stability and convergence of nonconforming \(hp\) finite-element methods, \(hp\) submeshing via non-conforming finite element methods, On approximating the solution of the non-stationary Stokes equations using the cell discretization algorithm

Uses Software

• ELLPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Error estimates for the combined h and p versions of the finite element method
• The finite element method with Lagrangian multipliers
• High degree efficient symmetrical Gaussian quadrature rules for the triangle
• The Application of Cell Discretization to a “Circle in the Square” Model Problem
• The Lagrange Multiplier Method for Dirichlet's Problem
• The Cell Discretization Algorithm for Elliptic Partial Differential Equations
• Thep-Version of the Finite Element Method
• Cell Discretization of Nonselfadjoint Linear Elliptic Partial Differential Equations
• On the relation of the cell discretization algorithm to the primal hybrid finite element method
• Primal Hybrid Finite Element Methods for 2nd Order Elliptic Equations
• The Approximation of Solutions of Elliptic Boundary-Value Problems via the p-Version of the Finite Element Method