Cubic Spline Prewavelets on the Four-Directional Mesh

Dedicated to Professor M. J. D. Powell on the occasion of his sixty-fifth birthday and his retirement. In this paper, we design differentiable, two-dimensional, piecewise polynomial cubic prewavelets of particularly small compact support. They are given in closed form, and provide stable, orthogonal decompositions of L ² (R ² ) . In particular, the splines we use in our prewavelet constructions give rise to stable bases of spline spaces that contain all cubic polynomials, whereas the more familiar box spline constructions cannot reproduce all cubic polynomials, unless resorting to a box spline of higher polynomial degree.     

Bivariate C1 Cubic Spline Spaces Over Even Stratified Triangulations

It is well-known that the basic properties of a bivariate spline space such as dimension and approximation order depend on the geometric structure of the partition. The dependence of geometric structure results in the fact that the dimension of a C ¹ cubic spline space over an arbitrary triangulation becomes a well-known open problem. In this paper, by employing a new group of smoothness conditions and conformality conditions, we determine the dimension of bivariate C ¹ cubic spline spaces over a so-called even stratified triangulation.     

Geometric interpolation by planar cubic <Emphasis Type="Italic">G</Emphasis><Superscript>1</Superscript> splines

In this paper, geometric interpolation by G ¹ cubic spline is studied. A wide class of sufficient conditions that admit a G ¹ cubic spline interpolant is determined. In particular, convex data as well as data with inflection points are included. The existence requirements are based upon geometric properties of data entirely, and can be easily verified in advance. The algorithm that carries out the verification is added. AMS subject classification (2000)  65D05, 65D07, 65D17     

Cubic Splines with Minimal Norm

Natural cubic interpolatory splines are known to have a minimal L ₂-norm of its second derivative on the C ² (or W ₂ ² ) class of interpolants. We consider cubic splines which minimize some other norms (or functionals) on the class of interpolatory cubic splines only. The cases of classical cubic splines with defect one (interpolation of function values) and of Hermite C ¹ splines (interpolation of function values and first derivatives) with spline knots different from the points of interpolation are discussed.     

An improvised collocation algorithm with specific end conditions for solving modified Burgers equation

In this work, numerical solution of nonlinear modified Burgers equation is obtained using an improvised collocation technique with cubic B‐spline as basis functions. In this technique, cubic B‐splines are forced to satisfy the interpolatory condition along with some specific end conditions. Crank–Nicolson scheme is used for temporal domain and improvised cubic B‐spline collocation method is used for spatial domain discretization. Quasilinearization process is followed to tackle the nonlinear term in the equation. Convergence of the technique is established to be of order O(h⁴ + Δt²) . Stability of the technique is examined using von‐Neumann analysis. L₂ and L_∞ error norms are calculated and are compared with those available in existing works. Results are found to be better and the technique is computationally efficient, which is shown by calculating CPU time.     

A high‐order B‐spline collocation scheme for solving a nonhomogeneous time‐fractional diffusion equation

A high‐accuracy numerical approach for a nonhomogeneous time‐fractional diffusion equation with Neumann and Dirichlet boundary conditions is described in this paper. The time‐fractional derivative is described in the sense of Riemann‐Liouville and discretized by the backward Euler scheme. A fourth‐order optimal cubic B‐spline collocation (OCBSC) method is used to discretize the space variable. The stability analysis with respect to time discretization is carried out, and it is shown that the method is unconditionally stable. Convergence analysis of the method is performed. Two numerical examples are considered to demonstrate the performance of the method and validate the theoretical results. It is shown that the proposed method is of order O(Δx⁴ + Δt^{2 ? α}) convergence, where α ∈ (0,1) . Moreover, the impact of fractional‐order derivative on the solution profile is investigated. Numerical results obtained by the present method are compared with those obtained by the method based on standard cubic B‐spline collocation method. The CPU time for present numerical method and the method based on cubic B‐spline collocation method are provided.     

Spline methods for the solution of hyperbolic equation with variable coefficients

In this study, we developed the methods based on nonpolynomial cubic spline for numerical solution of second‐order nonhomogeneous hyperbolic partial differential equation. Using nonpolynomial cubic spline in space and finite difference in time directions, we obtained the implicit three level methods of O(k² + h²) and O(k² + h⁴). The proposed methods are applicable to the problems having singularity at x = 0, too. Stability analysis of the presented methods have been carried out. The presented methods are applied to the nonhomogeneous examples of different types. Numerical comparison with Mohanty's method (Mohanty, Appl Math Comput, 165 (2005), 229–236) shows the superiority of our presented schemes. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

OnG 2 continuous cubic spline interpolation

In this paper the interpolation byG ² continuous planar cubic Bézier spline curves is studied. The interpolation is based upon the underlying curve points and the end tangent directions only, and could be viewed as an extension of the cubic spline interpolation to the curve case. Two boundary, and two interior points are interpolated per each spline section. It is shown that under certain conditions the interpolation problem is asymptotically solvable, and for a smooth curvef the optimal approximation order is achieved. The practical experiments demonstrate the interpolation to be very satisfactory. Supported in prat by the Ministry of Science and Technology of Slovenjia, and in part by the NSF and SF of National Educational Committee of China.     

Cubic algebraic spline curves design

In this paper we propose a construction method of the planar cubic algebraic spline curve with endpoint interpolation conditions and a specific analysis of its properties. The piecewise cubic algebraic curve has G ² continuous contact with the control polygon at two endpoints and is G ² continuous between each segments of itself. The process of this method is simple and clear, and provides a new way of thinking to design implicit curves.     

An O(h6) cubic spline interpolating procedure for harmonic functions

An O(h⁶) method for the interpolation of harmonic functions in rectangular domains is described and analyzed, The method is based on an earlier cubic spline technique [N. Papamichael and J.R. Whiteman, BIT 14 , 452–459 (1974)], and makes use of recent results concerning the a posteriori correction of interpolatory cubic splines.     

Interpolation Scheme for Planar Cubic <Emphasis Type="Italic">G</Emphasis><Superscript>2</Superscript> Spline Curves

In this paper a method for interpolating planar data points by cubic G ² splines is presented. A spline is composed of polynomial segments that interpolate two data points, tangent directions and curvatures at these points. Necessary and sufficient, purely geometric conditions for the existence of such a polynomial interpolant are derived. The obtained results are extended to the case when the derivative directions and curvatures are not prescribed as data, but are obtained by some local approximation or implied by shape requirements. As a result, the G ² spline is constructed entirely locally.     

Asymptotics for Global Measures of Accuracy of Splines

We obtain central limit theorems for the stochastic parts of L_p-norms of smoothed cubic spline estimators. The proofs are based on the observation that the variance term of the cubic spline is approximately of a form corresponding to a kernel estimator.     

C2-rational cubic spline involving tension parameters

In the present paper, C¹-piecewise rational cubic spline function involving tension parameters is considered which produces a monotonie interpolant to a given monotonie data set. It is observed that under certain conditions the interpolant preserves the convexity property of the data set. The existence and uniqueness of a C²-rational cubic spline interpolant are established. The error analysis of the spline interpolant is also given.     

Quadratic spline-on-spline

Recently Dolezal and Tewarson [2], and Papamichael and Soares [3] have considered the cubic spline-on-spline for the purpose of the approximating the derivatives y⁽²⁾,y⁽³⁾, and y⁽⁴⁾. In this paper their ideas have been extended and the quadratic spline-on-spline has been established for the same purpose. This technique yields better results than the traditional process using a single quadratic spline.     

Local behaviour of the first derivative of a deficient cubic spline interpolator

Considering a given functionf ∈C ⁴ and its unique deficient cubic spline interpolant, which match the given function and its derivative at mid point between the successive mesh point, we have obtained in the present paper asymptotically precise estimate fors′ -f′.     

Shape preserving interpolation by cubic G1 splines in $${\mathbb{R}^3}$$

In this paper, G ¹ continuous cubic spline interpolation of data points in , based on a discrete approximation of the strain energy, is studied. Simple geometric conditions on data are presented that guarantee the existence of the interpolant. The interpolating spline is regular, loop-, cusp- and fold-free.      

Univariate cubic L 1 interpolating splines based on the first derivative and on 5-point windows: analysis, algorithm and shape-preserving properties

In this paper, univariate cubic L ₁ interpolating splines based on the first derivative and on 5-point windows are introduced. Analytical results for minimizing the local spline functional on 5-point windows are presented and, based on these results, an efficient algorithm for calculating the spline coefficients is set up. It is shown that cubic L ₁ splines based on the first derivative and on 5-point windows preserve linearity of the original data and avoid extraneous oscillation. Computational examples, including comparison with first-derivative-based cubic L ₁ splines calculated by a primal affine algorithm and with second-derivative-based cubic L ₁ splines, show the advantages of the first-derivative-based cubic L ₁ splines calculated by the new algorithm.     

A fourth‐order H1‐Galerkin mixed finite element method for Kuramoto–Sivashinsky equation

A H¹‐Galerkin mixed finite element method is applied to the Kuramoto–Sivashinsky equation by using a splitting technique, which results in a coupled system. The method described in this article may also be considered as a Petrov–Galerkin method with cubic spline space as trial space and piecewise linear space as test space, since the second derivative of a cubic spline is a linear spline. Optimal‐order error estimates are obtained without any restriction on the mesh for both semi‐discrete and fully discrete schemes. The advantage of this method over that presented in Manickam et al., Comput. Math. Appl. vol. 35(6) (1998) pp. 5–25; for the same problem is that the size (i.e., (n + 1) × (n + 1)) of each resulting linear system is less than half of the size of the linear system of the earlier method, where n is the number of subintervals in the partition. Further, there is a requirement of less regularity on exact solution in this method. The results are validated with numerical examples. Finally, instability behavior of the solution is numerically captured with this method.     

A class of difference scheme for solving telegraph equation by new non-polynomial spline methods

In this paper, by using a new non-polynomial parameters cubic spline in space direction and compact finite difference in time direction, we get a class of new high accuracy scheme of O(τ⁴ + h²) and O(τ⁴ + h⁴) for solving telegraph equation if we suitably choose the cubic spline parameters. Meanwhile, stability condition of the difference scheme has been carried out. Finally, numerical examples are used to illustrate the efficiency of the new difference scheme.     

Cubic spline interpolation of functions with high gradients in boundary layers

The cubic spline interpolation of grid functions with high-gradient regions is considered. Uniform meshes are proved to be inefficient for this purpose. In the case of widely applied piecewise uniform Shishkin meshes, asymptotically sharp two-sided error estimates are obtained in the class of functions with an exponential boundary layer. It is proved that the error estimates of traditional spline interpolation are not uniform with respect to a small parameter, and the error can increase indefinitely as the small parameter tends to zero, while the number of nodes N is fixed. A modified cubic interpolation spline is proposed, for which O((ln N/N)⁴) error estimates that are uniform with respect to the small parameter are obtained.