Interpolation of scattered data in R 3 using minimum lp-norm networks, 1 < p < ?
Küçük Resim Yok
Tarih
2019
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Maltepe Üniversitesi
Erişim Hakkı
CC0 1.0 Universal
info:eu-repo/semantics/openAccess
info:eu-repo/semantics/openAccess
Özet
We consider the extremal problem of interpolation of scattered data in R 3 by smooth curve networks with minimal Lp-norm of the second derivative for 1 < p < ?. The problem for p = 2 was set and solved by Nielson [1]. Andersson et al. [2] gave a new proof of Nielson’s result by using a different approach. It allowed them to set and solve the constrained extremal problem of interpolation of convex scattered data in R 3 by minimum L2-norm networks that are convex along the edges of an associated triangulation. Partial results for the unconstrained and the constrained problems were announced without proof in [3]. Here we present complete characterization of the solutions to both the unconstrained and the constrained problems for 1 < p < ?.
Açıklama
Anahtar Kelimeler
Extremal scattered data interpolation, Minimum norm networks
Kaynak
International Conference of Mathematical Sciences (ICMS 2019)
WoS Q Değeri
Scopus Q Değeri
Cilt
Sayı
Künye
Vlachkova, K. (2019). Interpolation of scattered data in R 3 using minimum lp-norm networks, 1 < p < ?. International Conference of Mathematical Sciences (ICMS 2019). s. 135.
