(Created page with "==1 Title, abstract and keywords<!-- Your document should start with a concise and informative title. Titles are often used in information-retrieval systems. Avoid abbreviatio...") |
m (Cinmemj moved page Draft Samper 518193948 to Lohner Baum 1992a) |
||

(One intermediate revision by the same user not shown) | |||

Line 1: | Line 1: | ||

− | == | + | ==Abstract== |

− | + | An adaptive finite element scheme for transient problems is presented. The classic h-enrichment/coarsening is employed in conjunction with a tetrahedral finite element discretization in three dimensions. A mesh change is performed every n time steps, depending on the Courant number employed and the number of ‘protective layers’ added ahead of the refined region. In order to simplify the refinement/coarsening logic and to be as fast as possible, only one level of refinement/coarsening is allowed per mesh change. A high degree of vectorizability has been achieved by pre-sorting the elements and then performing the refinement/coarsening groupwise according to the case at hand. Further reductions in CPU requirements arc realized by optimizing the identification and sorting of elements for refinement and deletion. The developed technology has been used extensively for shock-shock and shock-object interaction runs in a production mode. A typical example of this class of problems is given. | |

− | + | ||

− | An | + | |

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + |

An adaptive finite element scheme for transient problems is presented. The classic h-enrichment/coarsening is employed in conjunction with a tetrahedral finite element discretization in three dimensions. A mesh change is performed every n time steps, depending on the Courant number employed and the number of ‘protective layers’ added ahead of the refined region. In order to simplify the refinement/coarsening logic and to be as fast as possible, only one level of refinement/coarsening is allowed per mesh change. A high degree of vectorizability has been achieved by pre-sorting the elements and then performing the refinement/coarsening groupwise according to the case at hand. Further reductions in CPU requirements arc realized by optimizing the identification and sorting of elements for refinement and deletion. The developed technology has been used extensively for shock-shock and shock-object interaction runs in a production mode. A typical example of this class of problems is given.

Back to Top

Published on 01/01/1992

DOI: 10.1002/fld.1650141204

Licence: CC BY-NC-SA license

Are you one of the authors of this document?