A domain decomposition method with Lagrange multipliers and inexact solvers for linear elasticity (Q2706434)

From MaRDI portal





scientific article; zbMATH DE number 1579050
Language Label Description Also known as
default for all languages
No label defined
    English
    A domain decomposition method with Lagrange multipliers and inexact solvers for linear elasticity
    scientific article; zbMATH DE number 1579050

      Statements

      0 references
      0 references
      19 March 2001
      0 references
      domain decomposition
      0 references
      Lagrange multipliers
      0 references
      finite element tearing and interconnecting
      0 references
      preconditioners
      0 references
      elliptic systems
      0 references
      finite elements
      0 references
      numerical results
      0 references
      saddle point problem
      0 references
      Krylov subspace method
      0 references
      condition number
      0 references
      membrane
      0 references
      A domain decomposition method with Lagrange multipliers and inexact solvers for linear elasticity (English)
      0 references
      A domain decomposition method with Lagrange multipliers for elliptic problems is considered by first reformulating the system of the finite element method as a saddle point problem with both primal and dual variables as unknowns. The resulting linear system is solved by means of block-structured preconditioners and a suitable Krylov subspace method. This approach enables the application of inexact subdomain solvers for the positive definite subproblems.NEWLINENEWLINENEWLINEIt is shown that the condition number of the preconditioned saddle-point problem is bounded independently of the number of subregions and depends only on the number of degrees of freedom of individual local subproblems. Numerical results are presented for a plane stress cantilever membrane problem.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references