Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn construction of a new interpolation tool: cubic $q$-spline
50
0
0.0
(
0
)
Authors
Orli Herscovici
Ask ChatGPT about the research
No Arabic abstract
This work presents a new interpolation tool, namely, cubic $q$-spline. Our new analogue generalizes a well known classical cubic spline. This analogue, based on the Jackson $q$-derivative, replaces an interpolating piecewise cubic polynomial function by $q$-polynomials of degree three at most. The parameter $q$ provides a solution flexibility.
rate research
Read More
In this paper, we investigate the problem of designing compact support interpolation kernels for a given class of signals. By using calculus of variations, we simplify the optimization problem from an infinite nonlinear problem to a finite dimensional linear case, and then find the optimum compact support function that best approximates a given filter in the least square sense (l2 norm). The benefit of compact support interpolants is the low computational complexity in the interpolation process while the optimum compact support interpolant gaurantees the highest achivable Signal to Noise Ratio (SNR). Our simulation results confirm the superior performance of the proposed splines compared to other conventional compact support interpolants such as cubic spline.
The goal of this paper is to design compact support basis spline functions that best approximate a given filter (e.g., an ideal Lowpass filter). The optimum function is found by minimizing the least square problem ($ell$2 norm of the difference between the desired and the approximated filters) by means of the calculus of variation; more precisely, the introduced splines give optimal filtering properties with respect to their time support interval. Both mathematical analysis and simulation results confirm the superiority of these splines.
Several results on constrained spline smoothing are obtained. In particular, we establish a general result, showing how one can constructively smooth any monotone or convex piecewise polynomial function (ppf) (or any $q$-monotone ppf, $qgeq 3$, with one additional degree of smoothness) to be of minimal defect while keeping it close to the original function in the ${mathbb L}_p$-(quasi)norm. It is well known that approximating a function by ppfs of minimal defect (splines) avoids introduction of artifacts which may be unrelated to the original function, thus it is always preferable. On the other hand, it is usually easier to construct constrained ppfs with as little requirements on smoothness as possible. Our results allow to obtain shape-preserving splines of minimal defect with equidistant or Chebyshev knots. The validity of the corresponding Jackson-type estimates for shape-preserving spline approximation is summarized, in particular we show, that the ${mathbb L}_p$-estimates, $pge1$, can be immediately derived from the ${mathbb L}_infty$-estimates.
This paper describes the analysis of Lagrange interpolation errors on tetrahedrons. In many textbooks, the error analysis of Lagrange interpolation is conducted under geometric assumptions such as shape regularity or the (generalized) maximum angle condition. In this paper, we present a new estimation in which the error is bounded in terms of the diameter and projected circumradius of the tetrahedron. Because we do not impose any geometric restrictions on the tetrahedron itself, our error estimation may be applied to any tetrahedralizations of domains including very thin tetrahedrons.
We present the error analysis of Lagrange interpolation on triangles. A new textit{a priori} error estimate is derived in which the bound is expressed in terms of the diameter and circumradius of a triangle. No geometric conditions on triangles are imposed in order to get this type of error estimates.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
