A Neumann-Neumann Domain Decomposition Algorithm for Solving Plate and Shell Problems

We present a new Neumann-Neumann-type preconditioner of large scale linear systems arising from plate and shell problems. The advantage of the new method is a smaller coarse space than those of earlier methods of the authors; this improves parallel scalability. A new abstract framework for Neumann-N...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on numerical analysis 1998-04, Vol.35 (2), p.836-867
Main Authors: Le Tallec, Patrick, Mandel, Jan, Vidrascu, Marina
Format: Article
Language:English
Subjects:
Algorithms
Approximation
Computational mathematics
Decomposition
Decomposition methods
Degrees of freedom
Engineering
Hematocrit
Interpolation
Methods
Parallel plates
Rotation
Stiffness
Triangulation
Values
Vertices
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a new Neumann-Neumann-type preconditioner of large scale linear systems arising from plate and shell problems. The advantage of the new method is a smaller coarse space than those of earlier methods of the authors; this improves parallel scalability. A new abstract framework for Neumann-Neumann preconditioners is used to prove almost optimal convergence properties of the method. The convergence estimates are independent of the number of subdomains, coefficient jumps between subdomains, and depend only polylogarithmically on the number of elements per subdomain. We formulate and prove an approximate parametric variational principle for Reissner-Mindlin elements as the plate thickness approaches zero, which makes the results applicable to a large class of nonlocking elements in everyday engineering use. The theoretical results are confirmed by computational experiments on model problems as well as examples from real world engineering practice.
ISSN:0036-1429
1095-7170
DOI:10.1137/S0036142995291019