AN ADAPTIVE UNSTRUCTURED TRI-TREE ITERATIVE SOLVER FOR MIXED FINITE ELEMENT FORMULATION OF THE STOKES EQUATIONS

✍ Scribed by S. Ø. WILLE

• Publisher: John Wiley and Sons
• Year: 1996
• Tongue: English
• Weight: 839 KB
• Volume: 22
• Category: Article
• ISSN: 0271-2091
• DOI: 10.1002/(sici)1097-0363(19960515)22:9<899::aid-fld385>3.0.co;2-l

✦ Synopsis

An iterative adaptive equation solver for solving the implicit Stokes equations simultaneously with hi-tree grid generation is developed. The tri-tree grid generator builds a hierarchical grid structure which is mapped to a finite element grid at each hierarchical level. For each hierarchical fiNte element grid the Stokes equations are solved. The approximate solution at each level is projected onto the next finer grid and used as a start vector for the iterative equation solver at the finer level. When the finest grid is reached, the equation solver is iterated until a tolerated solution is reached.

In order to reduce the o v d l work, the element matrices are integrated analytically beforehand. The efficiency and behaviour of the present adaptive method are compared with those of the previously developed iterative equation solver which is preconditioned by incomplete LU factorization with coupled node fill-in.

The efficiency of the incomplete coupled node fill-in preconditioner is shown to be largely dependent on the global node numbering. The preconditioner is therefore tested for the natural node ordering of the tri-tree grid generator and for different ways of sorting the nodes.