On global and local mesh refinements by a generalized conforming bisection algorithm
We examine a generalized conforming bisection (GCB-)algorithm which allows both global and local nested refinements of the triangulations without generating hanging nodes. It is based on the notion of a mesh density function which prescribes where and how much to refine the mesh. Some regularity pro...
| Autores: | , , |
|---|---|
| Tipo de documento: | artigo |
| Estado: | Versão publicada |
| Data de publicação: | 2010 |
| País: | España |
| Recursos: | Basque Center for Applied Mathematics (BCAM) |
| Repositório: | BIRD. BCAM's Institutional Repository Data |
| OAI Identifier: | oai:bird.bcamath.org:20.500.11824/636 |
| Acesso em linha: | http://hdl.handle.net/20.500.11824/636 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Conforming longest-edge bisection algorithm Finite element method High aspect ratio elements Nested triangulations Zlmal's minimum angle condition |
| Resumo: | We examine a generalized conforming bisection (GCB-)algorithm which allows both global and local nested refinements of the triangulations without generating hanging nodes. It is based on the notion of a mesh density function which prescribes where and how much to refine the mesh. Some regularity properties of generated sequences of refined triangulations are proved. Several numerical tests demonstrate the efficiency of the proposed bisection algorithm. It is also shown how to modify the GCB-algorithm in order to generate anisotropic meshes with high aspect ratios. |
|---|