Non-uniform spline recovery from small degree polynomial approximation
نویسندگان
چکیده
منابع مشابه
Non-uniform spline recovery from small degree polynomial approximation
We investigate the sparse spikes deconvolution problem onto spaces of algebraic polynomials. Our framework encompasses the measure reconstruction problem from a combination of noiseless and noisy moment measurements. We study a TV-norm regularization procedure to localize the support and estimate the weights of a target discrete measure in this frame. Furthermore, we derive quantitative bounds ...
متن کاملNON-POLYNOMIAL QUARTIC SPLINE SOLUTION OF BOUNDARY-VALUE PROBLEM
Quartic non-polynomial spline function approximation in off step points is developed, for the solution of fourth-order boundary value problems. Using consistency relation of such spline and suitable choice of parameter,we have obtained second, fourth and sixth orders methods. Convergence analysis of sixth order method has been given. The methods are illustrated by some examples, to verify the or...
متن کاملNon-polynomial Spline Method for Solving Coupled Burgers Equations
In this paper, non-polynomial spline method for solving Coupled Burgers Equations are presented. We take a new spline function. The stability analysis using Von-Neumann technique shows the scheme is unconditionally stable. To test accuracy the error norms 2L, L are computed and give two examples to illustrate the sufficiency of the method for solving such nonlinear partial differential equation...
متن کاملDegree of Simultaneous Coconvex Polynomial Approximation
Let f 2 C 1 ?1; 1] change its convexity nitely many times in the interval, say s times, at Y s : ?1 < y s < < y 1 < 1. We estimate the degree of simultaneous approximation of f and its derivative by polynomials of degree n, which change convexity exactly at the points Y s , and their derivatives. We show that provided n is suuciently large, depending on the location of the points Y s , the rate...
متن کاملThe Degree of Coconvex Polynomial Approximation
Let f ∈ C[−1, 1] change its convexity finitely many times in the interval, say s times, at Ys : −1 < y1 < · · · < ys < 1. We estimate the degree of approximation of f by polynomials of degree n, which change convexity exactly at the points Ys. We show that provided n is sufficiently large, depending on the location of the points Ys, the rate of approximation is estimated by the third Ditzian–To...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2015
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2015.05.034