Adaptive grid generation from harmonic maps on Reimannian manifolds
Journal of Computational Physics
An adaptive grid with directional control
Journal of Computational Physics
An object-oriented framework for block preconditioning
ACM Transactions on Mathematical Software (TOMS)
Quasi-Orthogonal Grids with Impedance Matching
SIAM Journal on Scientific Computing
Grid Generation Methods
Unstructured surface mesh adaptation using the Laplace-Beltrami target metric approach
Journal of Computational Physics
A continuum theory for unstructured mesh generation in two dimensions
Computer Aided Geometric Design
Numerical prediction of interfacial instabilities: Sharp interface method (SIM)
Journal of Computational Physics
Efficient nonlinear solvers for Laplace-Beltrami smoothing of three-dimensional unstructured grids
Computers & Mathematics with Applications
Three-dimensional elliptic grid generation with fully automatic boundary constraints
Journal of Computational Physics
Journal of Computational Physics
Journal of Computational and Applied Mathematics
Hi-index | 31.48 |
The finite element method is applied to grid smoothing in three-dimensional geometry, generalizing earlier results obtained for planar geometry. The underlying set of equations for the Cartesian components of grid coordinates, based on the notion of harmonic coordinates, has a natural variational formulation. To estimate the target metric tensor that drives the elliptic grid equations, the metric tensor components are computed on a coarse-grained grid. Numerical examples illustrating the proposed approach are presented together with results from the smoothness functional, which is used to measure the quality of the resulting grid.