AN ASSESSMENT OF SOME PRECONDITIONING TECHNIQUES IN SHELL PROBLEMS

SUMMARY Preconditioned Krylov subspace methods have proved to be eAcient in solving large, sparse linear systems in many areas of scientific computing. The success of these methods in many cases is due to the existence of good preconditioning techniques. In problems of structural mechanics, like the analysis of heat transfer and deformation of solid bodies, iterative solution of the linear equation system can result in a significant reduction of computing time. Also many preconditioning techniques can be applied to these problems, thus facilitating the choice of an optimal preconditioning on the particular computer architecture available. However, in the analysis of thin shells the situation is not so transparent. It is well known that the stiAness matrices generated by the FE discretization of thin shells are very ill-conditioned. Thus, many preconditioning techniques fail to converge or they converge too slowly to be competitivewith direct solvers. In this study, the performance of some general preconditioning techniques on shell problems is examined. #1998 John Wiley & Sons, Ltd.

[1]  Henk A. van der Vorst,et al.  A Vectorizable Variant of some ICCG Methods , 1982 .

[2]  D. Allman.  A compatible triangular element including vertex rotations for plane elasticity analysis , 1984 .

[3]  Fast iterative solvers for finite element analysis in general and shell analysis in particular , 1996 .

[4]  V. E. Bulgakov,et al.  The use of the multi-level iterative aggregation method in 3-D finite element analysis of solid, truss, frame and shell structures , 1997 .

[5]  M. B. Reed,et al.  ROBUST PRECONDITIONERS FOR LINEAR ELASTICITY FEM ANALYSES , 1997 .

[6]  YereminA. Yu.,et al.  Factorized sparse approximate inverse preconditionings I , 1993 .

[7]  Michele Benzi,et al.  A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method , 1996, SIAM J. Sci. Comput..

[8]  Ivar Gustafsson,et al.  Completely parallelizable preconditioning methods , 1995, Numer. Linear Algebra Appl..

[9]  T. Manteuffel.  An incomplete factorization technique for positive definite linear systems , 1980 .

[10]  L. Kolotilina,et al.  Factorized Sparse Approximate Inverse Preconditionings I. Theory , 1993, SIAM J. Matrix Anal. Appl..

[11]  M. A. Ajiz,et al.  A robust incomplete Choleski‐conjugate gradient algorithm , 1984 .

[12]  M. Benzi,et al.  A comparative study of sparse approximate inverse preconditioners , 1999 .

[13]  P. Forsyth,et al.  Preconditioned conjugate gradient methods for three-dimensional linear elasticity , 1994 .

[14]  W. Greub.  Linear Algebra , 1981 .

[15]  O. Axelsson.  Iterative solution methods , 1995 .

[16]  Harri Hakula,et al.  Scale resolution, locking, and high-order finite element modelling of shells , 1996 .

[17]  F. Brezzi,et al.  On drilling degrees of freedom , 1989 .

[18]  Rolf Stenberg,et al.  A stable bilinear element for the Reissner-Mindlin plate model , 1993 .