Selective refinement/derefinement algorithms for sequences of nested triangulations

DOI10.1002/NME.1620281212MaRDI QIDQ3355193zbMATH OpenOpenAlexWikidataFDO

Authors Maria-Cecilia Rivara

Publication date 1989

Published in International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nme.1620281212

zbMATH Keywords

mesh refinement algorithmmultigrid algorithmsselective refinement/derefinement algorithmstriangulations

Mathematics Subject Classification ID

Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)

Recommendations

• Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
• Adaptive techniques for unstructured nested meshes
• Efficient refinement/derefinement algorithm of nested meshes to solve evolution problems
• Mesh Refinement Processes Based on the Generalized Bisection of Simplices
• A 3-D refinement algorithm suitable for adaptive and multi-grid techniques

Cites work

• Multigrid methods II. Proceedings of the 2nd European Conference on Multigrid Methods held at Cologne (Federal Republic of Germany), October 1-4, 1985

Cited in

(24)

• Lepp-bisection algorithms, applications and mathematical properties
• On the adjacencies of triangular meshes based on skeleton-regular partitions
• A recursive approach to local mesh refinement in two and three dimensions
• On global and local mesh refinements by a generalized conforming bisection algorithm
• An adaptive boundary-element approach to 3D transient free-surface flow of viscous fluids
• Adaptive unstructured volume remeshing. I: The method
• Three-dimensional transient free-surface rotating creeping flow
• 3D anisotropic mesh adaptation by mesh modification
• Non-degeneracy study of the 8-tetrahedra longest-edge partition
• Least-squares finite element solution of Euler equations with H-type mesh refinement and coarsening on triangular elements
• Multithread parallelization of LEPP-bisection algorithms
• Efficient refinement/derefinement algorithm of nested meshes to solve evolution problems
• Efficient simulation of parameter‐dependent vehicle dynamics
• scientific article; zbMATH DE number 1050959 (Why is no real title available?)
• USING LONGEST-SIDE BISECTION TECHNIQUES FOR THE AUTOMATIC REFINEMENT OF DELAUNAY TRIANGULATIONS
• Adaptive Unstructured Mesh Refinement of Supersonic Channel Flows
• The fractal behaviour of triangular refined/derefined meshes
• Non-equivalent partitions of \(d\)-triangles with Steiner points
• A multi-level adaptive mesh refinement method for level set simulations of multiphase flow on unstructured meshes
• On local and global bisection-type mesh refinements in C programming language
• A study on Delaunay terminal edge method
• Longest-edge \(n\)-section algorithms: properties and open problems
• Local modification of meshes for adaptive and/or multigrid finite-element methods
• Numerical solution of partial differential equations with Powell-Sabin splines

This page was built for publication: Selective refinement/derefinement algorithms for sequences of nested triangulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3355193)