Results 271 to 280 of about 13,287 (303)
Some of the next articles are maybe not open access.
2017
This chapter is devoted to the automatic adaptive mesh refinement of polytopic meshes generated based on exploiting agglomeration of a given background geometry-conforming fine mesh. In particular, we exploit mesh partitioning techniques to design the underlying coarse mesh as well as for subdividing agglomerated elements marked for refinement.
Andrea Cangiani +3 more
openaire +1 more source
This chapter is devoted to the automatic adaptive mesh refinement of polytopic meshes generated based on exploiting agglomeration of a given background geometry-conforming fine mesh. In particular, we exploit mesh partitioning techniques to design the underlying coarse mesh as well as for subdividing agglomerated elements marked for refinement.
Andrea Cangiani +3 more
openaire +1 more source
Spacetime meshing with adaptive refinement and coarsening
Proceedings of the twentieth annual symposium on Computational geometry, 2004We propose a new algorithm for constructing finite-element meshes suitable for spacetime discontinuous Galerkin solutions of linear hyperbolic PDEs. Given a triangular mesh of some planar domain Ω and a target time value T, our method constructs a tetrahedral mesh of the spacetime domain Ω X [0,T] in constant running time per tetrahedron in R3 using an
Reza Abedi +9 more
openaire +1 more source
2020
One of the advantages of element-based Galerkin methods is that they are geometrically flexible. We define geometric flexibility as the capacity of a method to handle unstructured meshes. This is important if, say, we wish to develop a general partial differential equation (PDE) solver for use in arbitrary domains (e.g., on complex geometries such as ...
openaire +1 more source
One of the advantages of element-based Galerkin methods is that they are geometrically flexible. We define geometric flexibility as the capacity of a method to handle unstructured meshes. This is important if, say, we wish to develop a general partial differential equation (PDE) solver for use in arbitrary domains (e.g., on complex geometries such as ...
openaire +1 more source
Improved adaptive mesh refinement for conformal hexahedral meshes
Advances in Engineering Software, 2016Abstract The h-refinement is a technique to achieve the mesh adaptation during a finite element simulation. Some elements are selected because the error is higher than a given threshold: they are split. This operation creates new elements where the size of the edges is divided by 2 in the zone of high error.
Gérald Nicolas +3 more
openaire +1 more source
2003
In the previous chapter the solution of linear equation systems was discussed. Often there are even optimal order methods, so that an equation system of n equations can be solved in O(n) operations. This is optimal in the sense that any method which produces an output of n numbers has at least O(n) complexity, even if the method is as simple as write ...
openaire +1 more source
In the previous chapter the solution of linear equation systems was discussed. Often there are even optimal order methods, so that an equation system of n equations can be solved in O(n) operations. This is optimal in the sense that any method which produces an output of n numbers has at least O(n) complexity, even if the method is as simple as write ...
openaire +1 more source
Adaptive Mesh Generation and Refinement
2007 8th International Conference on Electronic Measurement and Instruments, 2007An approach to the generation of unstructured surface meshes for surface models was presented. The global processor outputs a control signal to the plurality of processor elements, and, thereby, sets processor-element numbers corresponding to the plurality of processor elements as input values of the operation arrays, respectively. By assigning element
Xia Delan, Tan Guihui
openaire +1 more source
Communications in Numerical Methods in Engineering, 1998
Summary: An adaptive finite element method for the solution of three-dimensional elasto-static problems is described. The computational domain is represented by an assembly of tetrahedral elements, and the mesh adaptation is achieved by a three-dimensional bisection method using an error estimator procedure coupled with an automatic three-dimensional ...
Merrouche, A. +2 more
openaire +2 more sources
Summary: An adaptive finite element method for the solution of three-dimensional elasto-static problems is described. The computational domain is represented by an assembly of tetrahedral elements, and the mesh adaptation is achieved by a three-dimensional bisection method using an error estimator procedure coupled with an automatic three-dimensional ...
Merrouche, A. +2 more
openaire +2 more sources
Adaptive mesh refinement for computational aeroacoustics. [PDF]
, 2006 UNIVERSITY OF SOUTHAMPTON ABSTRACT FACULTY OF ENGINEERING, SCIENCE & MATHEMATICS SCHOOL OF ENGINEERING SCIENCES Doctor of Philosophy ADAPTIVE MESH REFINEMENT FOR COMPUTATIONAL AEROACOUSTICS by Xun HuangThis thesis describes a parallel block-structured adaptive mesh refinement (AMR) method that is employed to solve some computational aeroacoustic ...
openaire +1 more source
An algorithm for adaptive mesh refinement inn dimensions
Computing, 1997This paper deals with local adaptive mesh refinement in \(n\) dimensions in the context of finite element calculations. The given fast algorithm is based on simplex bisection which simplifies bookkeeping of the neighbour graph. A program in C++ is also presented.
openaire +1 more source
AMReX: Block-structured adaptive mesh refinement for multiphysics applications
International Journal of High Performance Computing Applications, 2021Weiqun Zhang +2 more
exaly