Results 261 to 270 of about 56,264 (303)

Refinement strategies in adaptive meshing

IEEE Transactions on Magnetics, 1992
Two strategies for reducing the overall number of finite-element computations needed in an adaptive meshing algorithm are proposed. In the first strategy (called two-threshold refinement), numerical values of the estimated local error are used both to select the elements to be refined and to decide into how may new elements each of them will be ...
P. Fernandes, GIRDINIO, PAOLA, M. Repetto, G. Secondo   +3 more
openaire   +3 more sources

Polyhedra operators for mesh refinement

Geometric Modeling and Processing. Theory and Applications. GMP 2002. Proceedings, 2003
We study the factorization of mesh refinement rules in terms of the polyhedra operator's duality, stellation, and truncation. Using this factorization, we show that the /spl radic/3-refinement and leapfrog transformation, known from its applications in discrete mathematical chemistry, differ by a conjugation by the duality operator.
Ioannis P. Ivrissimtzis, Hans-Peter Seidel   +1 more
openaire   +1 more source

Quality Meshing with Weighted Delaunay Refinement

SIAM Journal on Computing, 2003
A new algorithm is proposed for the construction of Delaunay meshings of three-dimensional domains with boundaries.
Siu-Wing Cheng, Tamal K. Dey
openaire   +3 more sources

Multigrid for Locally Refined Meshes

SIAM Journal on Scientific Computing, 1999
A multilevel method for the solution of finite element methods on locally refined meshes is introduced. An upper bound for the condition number is given in the two-level semi-positive definite case under the additional assumption that the coefficient matrix is diagonally dominant.
openaire   +1 more source

Domain Decomposition with Local Mesh Refinement

SIAM Journal on Scientific and Statistical Computing, 1992
The authors present a preconditioned Krylov iterative algorithm which can be used to solve systems of linear equations arising from the discretization of partial differential equations. The main feature of their method lies in the combined admissibility of domain decomposition and local mesh refinements. By way of illustration, the method is applied to
William D. Gropp, David E. Keyes
openaire   +1 more source

Simultaneous Refinement and Coarsening for Adaptive Meshing

Engineering with Computers, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiang-Yang Li 0001, Shang-Hua Teng, Alper Üngör   +2 more
openaire   +2 more sources

Adaptive Mesh Refinement

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, Estivalézes, Jean-Luc, Scardovelli, Ruben   +2 more
openaire   +1 more source

On a Theory of Mesh-Refinement Processes

SIAM Journal on Numerical Analysis, 1980
A 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

Refinement operators for triangle meshes

Computer Aided Geometric Design, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Application of the Mesh Independence Principle to Mesh Refinement Strategies

SIAM Journal on Numerical Analysis, 1987
In 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