On large scale nonlinear network optimization
Mathematical Programming: Series A and B
Linear network optimization: algorithms and codes
Linear network optimization: algorithms and codes
LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems
ACM Transactions on Mathematical Software (TOMS)
Linear complexity hexahedral mesh generation
Proceedings of the twelfth annual symposium on Computational geometry
Combinatorial optimization
A generalized length strategy for direct optimization in planar grid generation
Mathematics and Computers in Simulation
Grid generation: past, present, and future
Applied Numerical Mathematics - Special issue on numerical grid generation-technologies for advanced simulations
Full-FAS multigrid grid generation algorithms
Applied Numerical Mathematics - Special issue on numerical grid generation-technologies for advanced simulations
A Framework for Variational Grid Generation: Conditioning the Jacobian Matrix with Matrix Norms
SIAM Journal on Scientific Computing
Some experiences on orthogonal grid generation
Applied Numerical Mathematics - Applied and computational mathematics: Selected papers of the third panamerican workshop Trujillo, Peru, 24-28 April 2000
Finite Element Mesh Generation
Finite Element Mesh Generation
Mesh Generation: Application to Finite Elements
Mesh Generation: Application to Finite Elements
Mathematics and Computers in Simulation
An active set strategy to generate quadrilateral grids
Journal of Computational and Applied Mathematics
Block decomposition techniques in the generation of adaptive grids
Mathematics and Computers in Simulation
| Hi-index | 0.01 |
The grid generation problem considers the question of the computation of a grid Q over a given domain Ω from the knowledge of Q on the boundary ∂Ω. It is usually given in terms of the computation of the grid vertices belonging to the interior of Ω, that in the direct optimization formulation are computed as the minimizer of a particular minimization problem. In this paper the grid generation problem is reformulated as a network optimization problem on a particular graph, that is a nonlinear minimum cost flow problem, where in place of the standard Euclidean vector norm is proposed the use of the well-known vector p-norm, where p ≥ 1. Some results coming from our numerical experience on the examples proposed in the Rogue's Gallery of Grids are reported.