Smoothness and Convex Area Functionals—Revisited

Authors:
P. Barrera Sánchez;J. J. Cortés;F. J. Domínguez-Mota;G. González Flores;J. G. Tinoco-Ruiz
Affiliations:
pbs@hp.fciencias.unam.mx and jjcaa1@gmail.com and gfgf@hp.fciencias.unam.mx;-;dmota@umich.mx and jtinoco@umich.mx;-;-
Venue:
SIAM Journal on Scientific Computing
Year:
2010

Citing 7
Cited 0

Curvilinear grids of convex quadrilaterals

USSR Computational Mathematics and Mathematical Physics
A variational form of the Winslow grid generator

Journal of Computational Physics
Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization

ACM Transactions on Mathematical Software (TOMS)
Smooth and convex grid generation over general plane regions

Mathematics and Computers in Simulation
A Framework for Variational Grid Generation: Conditioning the Jacobian Matrix with Matrix Norms

SIAM Journal on Scientific Computing
Newton's Method for Large Bound-Constrained Optimization Problems

SIAM Journal on Optimization
Adaptive discrete harmonic grid generation

Mathematics and Computers in Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce two new functionals within the context of the variational grid generation problem: an area functional and a smoothness functional. Both of them are based on an improved adaptive algorithm which focuses on the most folded grid cells. It is shown that when they are minimized in order to generate smooth and convex grids on irregular planar regions the optimization process converges notably faster than it does with other functionals previously reported.