A multi-grid algorithm for mixed problems with penalty (Q749331)

From MaRDI portal





scientific article; zbMATH DE number 4172601
Language Label Description Also known as
default for all languages
No label defined
    English
    A multi-grid algorithm for mixed problems with penalty
    scientific article; zbMATH DE number 4172601

      Statements

      A multi-grid algorithm for mixed problems with penalty (English)
      0 references
      1990
      0 references
      The author develops a multigrid algorithm for the finite element approximation of mixed problems with penalty by the MINI element. Previously the Mindlin-Reissner plate model was applied in a mixed method with penalty [the author, A multigrid algorithm for mixed problems with penalty. Bochum: Univ. Bochum, Abt. f. Math., Diss. (1989; Zbl 0696.73043)] giving an optimal convergence rate uniformly with respect to the plate thickness. It enabled to avoid spurious phenomena like locking. Here it is proved that the convergence rate in a given multigrid algorithm is bounded away from 1 independently of the mesh size and of the thickness parameter. This aim is obtained by using smoothing procedures with an appropriate t-dependence. The convergence also holds when another finite element used in fluid mechanics is considered. This mathematical paper is addressed to scientists working in the theory of the finite element method and for theoreticians who develop numerical models for practical use.
      0 references
      Jacobi relaxation
      0 references
      mixed problems
      0 references
      penalty
      0 references
      MINI element
      0 references
      convergence rate
      0 references
      smoothing procedures
      0 references
      appropriate t-dependence
      0 references
      0 references
      0 references

      Identifiers

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