Linear least squares problems involving fixed knots polynomial splines and their singularity study

DOI10.1016/j.amc.2016.02.011zbMath1410.65034arXiv1503.01176OpenAlexW2132324790MaRDI QIDQ1731083

Z. Roshan Zamir, Nadezda Sukhorukova

Publication date: 20 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.01176

zbMATH Keywords

polynomial splinesconvex optimisationlinear least squares problemssignal approximationnon-singularity analysis

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Convex programming (90C25) Applications of mathematical programming (90C90) Numerical optimization and variational techniques (65K10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (3)

Chebyshev approximation by linear combinations of fixed knot polynomial splines with weighting functions ⋮ Generalised rational approximation and its application to improve deep learning classifiers ⋮ Convex optimisation-based methods for K-complex detection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convex optimisation-based methods for K-complex detection
• Uniform approximation by generalized splines with free knots
• Bivariate segment approximation and free knot splines: Research Problems 96-4
• DETECTING K-COMPLEXES FOR SLEEP STAGE IDENTIFICATION USING NONSMOOTH OPTIMIZATION
• Algorithms for Piecewise Polynomials and Splines with Free Knots
• The calculation of linear least squares problems
• Uniform Approximation by Chebyshev Spline Functions. II: Free Knots

This page was built for publication: Linear least squares problems involving fixed knots polynomial splines and their singularity study