Interpolation of scattered data in R 3 using minimum lp-norm networks, 1 < p < ?

dc.authorid0000-0002-2159-6953en_US
dc.contributor.authorVlachkova, Krassimira
dc.date.accessioned2024-07-12T20:49:10Z
dc.date.available2024-07-12T20:49:10Z
dc.date.issued2019en_US
dc.departmentFakülteler, İnsan ve Toplum Bilimleri Fakültesi, Matematik Bölümüen_US
dc.description.abstractWe 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 < ?.en_US
dc.identifier.citationVlachkova, 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.en_US
dc.identifier.endpage136en_US
dc.identifier.isbn978-605-2124-29-1
dc.identifier.startpage135en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12415/2134
dc.institutionauthorVlachkova, Krassimira
dc.language.isoenen_US
dc.publisherMaltepe Üniversitesien_US
dc.relation.ispartofInternational Conference of Mathematical Sciences (ICMS 2019)en_US
dc.relation.publicationcategoryUluslararası Konferans Öğesi - Başka Kurum Yazarıen_US
dc.rightsCC0 1.0 Universal*
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rights.urihttp://creativecommons.org/publicdomain/zero/1.0/*
dc.snmzKY01498
dc.subjectExtremal scattered data interpolationen_US
dc.subjectMinimum norm networksen_US
dc.titleInterpolation of scattered data in R 3 using minimum lp-norm networks, 1 < p < ?en_US
dc.typeArticle
dspace.entity.typePublication

Dosyalar