Just need mathlap code

10.11 Least squares fit of piecewise-polymomial function. This exercise is on the piecewise-polynomial fitting prob lem of page 340 of the textbook. Download the file splinefit.m and run it in MATLAB/Octave to create two arrays t and y of length 100. The vector t contains 100 points in the interval [-1,1]. The first 50 points are in [-1,0, the last 50 in [0, . You are asked to find two cubic polynomials that give the best least squares fit on the intervals [-1.0 and 0.1], respectively, and satisfy the continuity constraints p(0) q(0), p'(0)-d(0): 50 100 (p(t)-Vi )2 + (q(t.)-yi)2 p(0) 0), p'(0) (0) minimize -51 subject to The variables are the coefficients .. 8. Formulate this as a constrained least squares problem minimize Ar - bl2 subject to C d and compute the solution by solving the optimality conditions C 0 In MATLAB/Octave: solA' *A, C'; C, zeros (p,p)CA'*b; d ; x = sol (1 : n); 10.11 Least squares fit of piecewise-polymomial function. This exercise is on the piecewise-polynomial fitting prob lem of page 340 of the textbook. Download the file splinefit.m and run it in MATLAB/Octave to create two arrays t and y of length 100. The vector t contains 100 points in the interval [-1,1]. The first 50 points are in [-1,0, the last 50 in [0, . You are asked to find two cubic polynomials that give the best least squares fit on the intervals [-1.0 and 0.1], respectively, and satisfy the continuity constraints p(0) q(0), p'(0)-d(0): 50 100 (p(t)-Vi )2 + (q(t.)-yi)2 p(0) 0), p'(0) (0) minimize -51 subject to The variables are the coefficients .. 8. Formulate this as a constrained least squares problem minimize Ar - bl2 subject to C d and compute the solution by solving the optimality conditions C 0 In MATLAB/Octave: solA' *A, C'; C, zeros (p,p)CA'*b; d ; x = sol (1 : n)