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

Applied Mathematics and Computation

Volumn 282, Issue , 2016, Pages 204-215

  Roshan Zamir, Z ^a   Sukhorukova, N ^a  

^a SWINBURNE UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

Convex optimisation; Linear least squares problems; Non singularity analysis; Polynomial splines; Signal approximation

Indexed keywords

CONVEX OPTIMIZATION; MATRIX ALGEBRA; OPTIMIZATION; POLYNOMIAL APPROXIMATION; POLYNOMIALS; SIGNAL PROCESSING; SURFACE RECONSTRUCTION;

CONVEX OPTIMISATION; LINEAR LEAST SQUARES PROBLEMS; NONSINGULARITY; POLYNOMIAL SPLINES; SIGNAL APPROXIMATION;

LEAST SQUARES APPROXIMATIONS;

EID: 84959441041     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2016.02.011     Document Type: Article

References (16)

1. G. Golub, and C. Van Loan Matrix Computations Johns Hopkins Studies in the Mathematical Sciences 1996 Johns Hopkins University Press
2. C.L. Lawson, and R.J. Hanson Solving Least Squares Problems Classics in Applied Mathematics 15 1995 Society for Industrial and Applied Mathematics (SIAM) Philadelphia, PA
3. A. Bjorck The calculation of linear least squares problems Acta Numer.a 13 2004 1 53
4. G. Nürnberger Approximation by Spline Functions 1989 Springer-Verlag Berlin Heidelberg
5. G. Meinardus, G. Nürnberger, M. Sommer, and H. Strauss Algorithms for piecewise polynomials and splines with free knots Math. Comput. 53 1989 235 247
6. L. Schumaker Uniform approximation by Chebyshev spline functions. II: Free knots SIAM J. Numer. Anal. 5 1968 647 656
7. N. Sukhorukova, and J. Ugon Characterization theorem for best linear spline approximation with free knots Dyn. Contin. Discret. Impuls. Syst. 17 5 2010 687 708
8. N. Sukhorukova, J. Ugon, Characterization theorem for best polynomial spline approximation with free knots (2014). arXiv: 1412.2323.
9. G. Nürnberger, L. Schumaker, M. Sommer, and H. Strauss Uniform approximation by generalized splines with free knots J. Approx. Theory 59 2 1989 150 169 http://dx.doi.org/10.1016/0021-9045(89)90150-0
10. P. Borwein, I. Daubechies, V. Totik, and G. Nürnberger Bivariate segment approximation and free knot splines: Research problems 96-4 Constr. Approx. 12 4 1996 555 558
11. Z.R. Zamir, N. Sukhorukova, H. Amiel, A. Ugon, and C. Philippe Optimization-based features extraction for k-complex detection M. Nelson, T. Hamilton, M. Jennings, J. Bunder, Proceedings of the 11th Biennial Engineering Mathematics and Applications Conference, (EMAC-2013) 55 2014 C384 C398
12. Z.R. Zamir, N. Sukhorukova, H. Amiel, A. Ugon, C. Philippe, Convex optimization-based methods for k-complex detection, (2014). in press.
13. S. Boyd, and L. Vandenberghe Convex Optimization 2010 Cambridge University Press New York, NY, USA
14. A. Bjõrck Numerical Methods for Least Squares Problems Handbook of Numerical Analysis 1996 Society for Industrial and Applied Mathematics
15. L.N. Trefethen, and D. Bau Numerical Linear Algebra Miscellaneous Bks 1997 Cambridge University Press
16. D. Moloney, N. Sukhorukova, P. Vamplew, J. Ugon, G. Li, G. Beliakov, C. Philippe, H. Amiel, and A. Ugon Detecting k-complexes for sleep stage identification using nonsmooth optimization ANZIAM J. 52 2011 319 332