Abstract
A construction of linear sufficient convexity conditions for polynomial tensor-product spline functions is presented. As the main new feature of this construction, the obtained conditions are asymptotically necessary: increasing the number of linear inequalities in a suitable manner adapts them to any finite set of strongly convex spline surfaces. Based on the linear constraints we formulate least-squares approximation of scattered data by spline surfaces as a quadratic programming problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
