Results 221 to 230 of about 48,887 (264)
Some of the next articles are maybe not open access.
Simultaneous Refinement and Coarsening for Adaptive Meshing
Engineering with Computers, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiang-Yang Li 0001 +2 more
openaire +2 more sources
2022
The numerical simulation of flows with interfaces is a vast topic, with applications ranging from environment, geophysics to fundamental physics and engineering.
Vincent, Stéphane +2 more
openaire +1 more source
The numerical simulation of flows with interfaces is a vast topic, with applications ranging from environment, geophysics to fundamental physics and engineering.
Vincent, Stéphane +2 more
openaire +1 more source
On a Theory of Mesh-Refinement Processes
SIAM Journal on Numerical Analysis, 1980A general theory of mesh-refinement processes is developed. The fundamental structure is a locally finite, rooted tree with nodes representing the subdivision cells. The possible meshes then constitute a distributive lattice. Under mild conditions on the given cell-size and error-indicator functions a local Pareto-type optimality property is introduced
openaire +1 more source
Mesh generation and mesh refinement procedures for the analysis of concrete shells
Advances in Engineering Software, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Roman Lackner, Herbert A Mang
exaly +3 more sources
Refinement operators for triangle meshes
Computer Aided Geometric Design, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
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
Application of the Mesh Independence Principle to Mesh Refinement Strategies
SIAM Journal on Numerical Analysis, 1987In structure the algorithm proposed here resembles the coarse-to-fine portion of a multigrid method for boundary-value problems for nonlinear elliptic equations. Starting with the coarsest grid and proceeding to the finest, a small number of Newton iterations is performed on each grid and the approximate solution is imbedded into the next finer grid ...
Allgower, E. L., Böhmer, K.
openaire +1 more source
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
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
Sparse parallel Delaunay mesh refinement
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures, 2007The authors recently introduced the technique of sparse mesh refinement to produce the first near-optimal sequential time bounds of O(n lg L/s+m) for inputs in any fixed dimension with piecewiselinear constraining (PLC) features. This paper extends that work to the parallel case, refining the same inputs in time O(lg(L/s) lgm) on an EREW PRAM while ...
Benoît Hudson +2 more
openaire +1 more source