Some studies on nonpolynomial interpolation and error analysis
Introduction
Interpolation is the process of constructing a continuous curve through the known points of a function. Let be a continuous function on an interval and be the known distinct points and values of function in the interval. Generally, the interpolation between points is carried out with polynomial or spline of lower degree of the form . For nonpolynomial interpolation, Sloan [1] introduced interpolating function of the formwhere is a set of linearly independent real-valued continuous functions on , and coefficients are determined by the interpolation conditions. As a special case of (1.1), we consider nonpolynomial interpolating function of the formThis reduces to a polynomial interpolating function in the limit as . Runge’s phenomenon states that Lagrange’s interpolation, where is a polynomial of degree i in (1.1), cannot guarantee the uniform convergence as and high order polynomial interpolation is unstable [2]. In order to mitigate the Runge’s phenomenon, to make the interpolation curve stable and smooth, polynomial spline is introduced. The polynomial spline interpolation uses low degree polynomials in each of the intervals and constrains the polynomial pieces such that they fit smoothly together. The convergence of some cubic spline interpolation schemes are discussed in [3], and spline interpolation and smoothing on hyperspheres is presented in [4]. There is considerable evidence [5], [6], [7], [8], [9], [10] that the presence of a parameter in nonpolynomial spline gives better results, in terms of maximum absolute error of approximation, than the polynomial spline, to approximate the numerical solution of differential equations of given boundary value problems. At the same time we found that methods based on nonpolynomial splines are more accurate and require less time in comparison to numerical methods based on polynomial spline interpolation. It is also well known that the algorithms developed using higher order splines give better results than the algorithms developed using lower order splines [11]. The main results presented here provide sufficient scope to obtain solutions of interpolation problems with more accuracy and less computational effort. In the literature we find that the solutions of nonpolynomial spline with only uniform step size have been discussed, but here, in this work we generalize it for uniform as well as non uniform step size situations. In this work we explore following matters which are not available so far in literature: (1) There is no discussion to obtain optimal value of a parameter as there is no general error analysis result for nonpolynomial interpolation and hence we propose solution to this problem. (2) We propose nonpolynomial interpolation with multiple parameters, determination of these parameters and general error analysis result for nonpolynomial interpolation. (3) We introduce Hermite nonpolynomial interpolation with multiple parameters, determination of those parameters and general error analysis result for Hermite nonpolynomial interpolation. (4) We establish theoretical relationship among nonpolynomial, polynomial interpolation and the Fourier series representation. (5) We propose solution to Runge’s phenomenon through nonpolynomial interpolation.
There are various important applications of interpolation like curve fitting, extrapolation, computer graphics, to approximate solutions of boundary value problems, Empirical Mode Decomposition (EMD), and Wang [12] proposed cubic spline wavelet bases for Sobolev space and multilevel interpolation. In EMD interpolation is used to obtain upper and lower envelopes of underlying time series to derive Intrinsic Mode Functions (IMFs). Properties of the IMFs may change by changing the interpolation methods. The EMD, proposed in seminal paper by Huang et al. [13], is an adaptive data-analysis method to analyze stationary as well as non stationary time series. The EMD decomposes a signal into a set of finite band-limited IMFs and final residue as a trend of signal. An IMF is a function that must satisfy two conditions: (1) in the complete range of time series, the number of extrema (i.e. maxima and minima) and the number of zero crossings are equal or differ at most by one. (2) At any point of time in the complete range of time series, the average of the values of upper and lower envelopes, obtained by the interpolation of local maxima and the local minima, is zero.
The first condition ensure that IMFs are narrow band signals and the second condition is necessary to ensure that the instantaneous frequency does not have redundant fluctuations because of asymmetric waveforms.
An ensemble EMD (EEMD) was proposed by Wu and Huang [14] to solve the irregular distribution of local extrema problem. This approach consists of sifting an ensemble of white noise added signal and considers the mean as the final true result. The reason for addition of finite amplitude white noise is to obtain relatively uniform distribution of local maxima and minima such that the upper and lower envelope can be properly identified. The EEMD is computationally very expensive as compare to EMD.
The Compact EMD (CEMD) was proposed by Chu et al. [15] to reduce mode mixing, end effect, and detrend uncertainty present in EMD, and to reduce computation complexity of EEMD as well. The IMFs generated by EMD are dependent on distribution of local extrema of signal and the type of spline used for upper and lower envelope interpolation, and the traditional EMD uses cubic spline for upper and lower envelope interpolation. Singh et al. [16] proposed nonpolynomial cubic spline to obtain upper and lower envelope interpolation in EMD algorithm to reduce mode mixing and detrend uncertainty.
The first aim of present work is to explore nonpolynomial interpolation with multiple parameters and device a method to determine these parameters. The second aim is to extend the results of error analysis of classical polynomial interpolation to derive results of error analysis for nonpolynomial interpolation, and to show that nonpolynomial interpolation generate less error in approximation than polynomial one. The third aim is to study which type of interpolating spline and boundary condition is better and produces minimum error in same order. This paper is organized as follows: the nonpolynomial cubic spline and the Hermite nonpolynomial cubic spline interpolations are discussed in Section 2. Theoretical relationship among nonpolynomial, polynomial interpolation and the Fourier series is discussed in Section 3. Section 4 introduces the error analysis for the case of nonpolynomial and Hermite nonpolynomial interpolations. Simulation results are given in Section 5. Section 6 presents conclusions.
Section snippets
Nonpolynomial spline interpolation
If a time series from a physical object or a function is available, spline interpolation is an approach to generate a spline that approximates that time series. For a given knot vectors on interval , the splines of degree n form a vector space. The space of all natural cubic splines, for instance, is a subspace of the space of all cubic splines.
A cubic spline function , interpolating a function defined on , is such that: (a) In each subinterval is a
Nonpolynomial, polynomial interpolation and the Fourier series representation
In this section, we establish the relationship among nonpolynomial, polynomial interpolation and the Fourier series, and propose the nonpolynomial function with n parameters of the form:and this nonpolynomial interpolation belongs to the class . From (3.1), it can be easily seen that:
The error analysis in nonpolynomial interpolation
We generalize the existing results of error analysis in polynomial interpolations and propose following results for error analysis in nonpolynomial interpolations. Theorem 4.1 Let be any function and be distinct nodes in the interval . If nonpolynomial function interpolates , and at the nodes , then such thatwhere is independent of . Proof If for any then theorem is
Example 1
To compare the maximum absolute error (MAE) in interpolation among polynomial cubic spline (PCS), nonpolynomial cubic spline (NPCS) and Hermite NPCS (HNPCS) with various boundary conditions (BCs), 50 time series consisting of sum of constant, linearly increasing and various sinusoids, for example, are used as follows:
Table 1 shows comparison of MAE among PCS, NPCS and HNPCS for few signals, whereas Fig. 1,
Conclusion
We introduced nonpolynomial and Hermite nonpolynomial interpolation with multiple parameters and developed method to determine optimal value of parameters which generate minimum error in approximation. We established theoretical relationship among nonpolynomial, polynomial interpolation and the Fourier series representation of any periodic signal. We have proposed generalized error analysis results for nonpolynomial and Hermite nonpolynomial interpolations as extension of classical error
Acknowledgments
The authors would like to express their appreciation to the anonymous reviewers for their valuable suggestions. The authors would like to express sincere thanks to Jaypee Institute of Information Technology Noida, for providing all required resources and permitting to carry out research at department of electrical engineering, Indian Institute of Technology Delhi (IITD). The authors also would like to thank IITD for providing resources and technical supports required throughout this study.
References (20)
Nonpolynomial interpolation
J. Approx. Theory
(1983)The use of cubic splines in the numerical solution of a system of second-order boundary value problem
Comput. Math. Appl.
(2001)- et al.
Nonpolynomial spline approach to the solution of a system of second-order boundary-value problems
Appl. Math. Comput.
(2006) - et al.
Numerical solution of a system of fourth order boundary value problems using cubic non-polynomial spline method
Appl. Math. Comput.
(2007) - et al.
Computational techniques for solving differential equations by quadratic
Quartic Octic Spline Adva. Eng. Softw.
(2008) - et al.
Polynomial and nonpolynomial spline approaches to the numerical solution of second order boundary value problems
Appl. Math. Comput.
(2007) - et al.
Quintic nonpolynomial spline method for the solution of a special second-order boundary-value problem with engineering application
Comput. Math. Appl.
(2011) - et al.
Sextic spline method for the solution of a system of obstacle problems
Appl. Math. Comput.
(2007) On the Stability of Interpolation
J. Comput. Math.
(1983)On the convergence of some cubic spline interpolation schemes
SIAM J. Numer. Anal.
(1986)
Cited by (27)
Novel generalized Fourier representations and phase transforms
2020, Digital Signal Processing: A Review JournalAn in-situ self-calibration method for non-contact full-field strain measurement
2020, Measurement: Journal of the International Measurement ConfederationCitation Excerpt :The reason is explained in Fig. 2, where the responses at points 1 and 2 are known but that at point A is unknown. Interpolation is not suitable for predicting the response at point A from those at points 1 and 2 because the vibration routes, such tr1, tr2, and tr3, between points 1 and 2 are multiple and uncertain [33]. Modal expansion is very effective for estimating the response at point A because the mode shapes are continuous and determined by the inherent structural properties.
Detection of apnea events from ECG segments using Fourier decomposition method
2020, Biomedical Signal Processing and ControlCitation Excerpt :From the decomposed signal, statistical moments are computed in [23] and fed to an ELM for classification. However, the EMD and its related algorithms [24–27] suffer from mode-mixing, aliasing and end-effect artifacts, convergence, stability to noise perturbation, the dependence of IMFs on the number of sifting process, and the stopping criteria. To overcome these issues related to EMD, the Fourier decomposition method (FDM) is proposed in [28,29] which is completely based on the Fourier theory and zero-phase filtering.
An efficient removal of power-line interference and baseline wander from ECG signals by employing Fourier decomposition technique
2020, Biomedical Signal Processing and ControlCitation Excerpt :Modified versions of these algorithms [24–29] have been proposed to increase the convergence speed and in order to improve their performance in presence of noise. Another approach is to consider signal decomposition techniques like empirical mode decomposition (EMD) and its variant algorithms [30–33], eigenvalue decomposition (EVD) [34], synchrosqueezed wavelet transforms (SSWT) [35] and variational mode decomposition (VMD) [36]. These techniques are very useful in dealing with non-stationary and non-linear real life signals.
An improved empirical mode decomposition method based on the cubic trigonometric B-spline interpolation algorithm
2018, Applied Mathematics and ComputationCitation Excerpt :In addition, there is some improvement aimed at the EMD algorithm itself, which improves the interpolation method during the EMD iteration processing, such as B-spline interpolation based EMD(B-EMD) [13,19,25] and cardinal spline interpolation based EEMD(C-EEMD) [14]. In addition, to reduce mode mixing and detrend uncertainty, [23,24] proposed a method which uses non-polynomial cubic spline interpolation to obtain upper and lower envelopes which improves orthogonality among IMFs. This article aims at the EMD method itself and modifies the interpolation method of the envelope which is constructed based on the cubic trigonometric B-spline interpolation method.
An improved signal envelope estimation method for analysis of acoustic signals emitted by remotely piloted helicopters
2018, Applied AcousticsCitation Excerpt :Hence, a compromise should be made between desired characteristics. In order to control interpolations, some references suggest shape parameters that generate a family of curves [26–28]. In search of an interpolation method that can provide a suitable family of curves, the Catmull-Rom spline is investigated in this paper.