کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9511653 | 1342115 | 2005 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A class of network optimization methods for planar grid generation
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات محاسباتی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A class of network optimization methods for planar grid generation A class of network optimization methods for planar grid generation](/preview/png/9511653.png)
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Numerical Mathematics - Volume 52, Issue 4, March 2005, Pages 363-379
Journal: Applied Numerical Mathematics - Volume 52, Issue 4, March 2005, Pages 363-379
نویسندگان
N. Egidi, P. Maponi,