An optimal multivariate spline method of recovery of twice differentiable functions

A continuous quadratic polynomial spline of several variables is constructed. It solves the optimal recovery problem studied by V.F. Babenko, S.V. Borodachov, and D.S. Skorokhodov for the class of functions defined on a convex polytope in R ^d , whose second derivatives in any direction are uniformly bounded, and for a periodic analogue of this class. The information consists of the values and gradients of the function at some finite set of nodes in R ^d .     

Comonotone Adaptive Interpolating Splines

For any given data we propose the construction of an interpolating spline of class C ¹, which is either a quadratic polynomial or a linear/linear rational function between the knots, and preserves the monotonicity of the data on the sections of rational intervals. We prove the uniqueness and existence of this spline. Numerical tests show good approximation properties and flexibility due to the non-coincidence of the given data arguments and the spline knots which can be chosen freely.     

Some performances of local bivariate quadratic C1 quasi-interpolating splines on nonuniform type-2 triangulations

We investigate spline quasi-interpolants defined by C¹ bivariate quadratic B-splines on nonuniform type-2 triangulations and by discrete linear functionals based on a fixed number of triangular mesh-points either in the support or close to the support of such B-splines.We show they can approximate a real function and its partial derivatives up to an optimal order and we derive local and global upper bounds.We also present some numerical and graphical results.     

Cubature rule associated with a discrete blending sum of quadratic spline quasi-interpolants

A new cubature rule for a parallelepiped domain is defined by integrating a discrete blending sum of C¹ quadratic spline quasi-interpolants in one and two variables. We give the weights and the nodes of this cubature rule and we study the associated error estimates for smooth functions. We compare our method with cubature rules based on the tensor products of spline quadratures and classical composite Simpson’s rules.     

New spline spaces with generalized tension properties

The paper describes a new space of variable degree polynomials. This space is isomorphic to ℙ₆, possesses a Bernstein like basis and has generalized tension properties in the sense that, for limit values of the degrees, its functions approximate quadratic polynomials. The corresponding space of C ³, variable degree splines is also studied. This spline space can be profitably used in the construction of shape preserving curves or surfaces. AMS subject classification (2000)  65D07, 65D17, 65D10     

Scattered Date Interpolation from Principal Shift-Invariant Spaces

Under certain assumptions on the compactly supported function φC( ^d), we propose two methods of selecting a function s from the scaled principal shift-invariant space S^h(φ) such that s interpolates a given function f at a scattered set of data locations. For both methods, the selection scheme amounts to solving a quadratic programming problem and we are able to prove error estimates similar to those obtained by Duchon for surface spline interpolation.     

A new quadratic nonconforming finite element on rectangles

A new quadratic nonconforming finite element on rectangles (or parallelograms) is introduced. The nonconforming element consists of P₂ ⊕ Span{x²y,xy²} on a rectangle and eight degrees of freedom. Our element is essentially of seven degrees of freedom since the degree of freedom associated with the integration on rectangle is essentially of bubble‐function nature. Global basis functions are constructed for both Dirichlet and Neumann type of problems; accordingly the corresponding dimensions are counted. The local and global interpolation operators are defined. Error estimates of optimal order are derived in both broken energy and L²(Ω) norms for second‐order of elliptic problems. Brief numerical results are also shown to confirm the optimality of the presented quadratic nonconforming element. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

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.     

Solving an Integral Equation of the First Kind by Spline Approximation

A method based on a special minimum-derivative spline is proposed for solving a Fredholm integral equation of the first kind.     

Error bounds on the approximation of functions and partial derivatives by quadratic spline quasi-interpolants on non-uniform criss-cross triangulations of a rectangular domain

Given a non-uniform criss-cross triangulation of a rectangular domain Ω, we consider the approximation of a function f and its partial derivatives, by general C ¹ quadratic spline quasi-interpolants and their derivatives. We give error bounds in terms of the smoothness of f and the characteristics of the triangulation. Then, the preceding theoretical results are compared with similar results in the literature. Finally, several examples are proposed for illustrating various applications of the quasi-interpolants studied in the paper.     

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     

An alternating direction implicit method for orthogonal spline collocation linear systems

Summary An Alternating Direction Implicit method is analyzed for the solution of linear systems arising in high-order, tensor-product orthogonal spline collocation applied to some separable, second order, linear, elliptic partial differential equations in rectangles. On anNxN partition, with Jordan's selection of the acceleration parameters, the method requiresO(N ² ln ² N) arithmetic operations to produce an approximation whose accuracy, in theH ¹-norm, is that of the collocation solution.     

Spline approximation methods for multidimensional periodic pseudodifferential equations

We investigate several numerical methods for solving the pseudodifferential equationAu=f on the n-dimensional torusT ⁿ . We examine collocation methods as well as Galerkin-Petrov methods using various periodical spline functions. The considered spline spaces are subordinated to a uniform rectangular or triangular grid. For given approximation method and invertible pseudodifferential operatorA we compute a numerical symbol ^C , resp. ^G , depending onA and on the approximation method. It turns out that the stability of the numerical method is equivalent to the ellipticity of the corresponding numerical symbol. The case of variable symbols is tackled by a local principle. Optimal error estimates are established.The second author has been supported by a grant of Deutsche Forschungsgemeinschaft under grant namber Ko 634/32-1.     

Enumeration of the bent functions of least deviation from a quadratic bent function

We study a construction of the bent functions of least deviation from a quadratic bent function, describe all these bent functions of 2k variables, and show that the quantity of them is 2 ^k (2¹ + 1) ... (2 ^k + 1). We find some lower bound on the number of the bent functions of least deviation from a bent function of the Maiorana-McFarland class.     

On Itô s formula for multidimensional Brownian motion

Consider a d-dimensional Brownian motion X = (X ¹,…,X ^d ) and a function F which belongs locally to the Sobolev space W ^1,2. We prove an extension of It? s formula where the usual second order terms are replaced by the quadratic covariations [f _k (X), X ^k ] involving the weak first partial derivatives f _k of F. In particular we show that for any locally square-integrable function f the quadratic covariations [f(X), X ^k ] exist as limits in probability for any starting point, except for some polar set. The proof is based on new approximation results for forward and backward stochastic integrals. Received: 16 March 1998 / Revised version: 4 April 1999     

Dimension elevation for Chebyshevian splines

Dimension elevation refers to the Chebyshevian version of the classical degree elevation process for polynomials or polynomial splines. In this paper, we consider the case of splines. The original spline space is based on a given Extended Chebsyhev space \mathbbE{\mathbb{E}} contained in another Extended Chebsyhev space \mathbbE^*{\mathbb{E}}^* of dimension increased by one. The original spline space, based on \mathbbE{\mathbb{E}}, is then embedded in a larger one, based on \mathbbE^*\mathbb{E}^*. Thanks to blossoms we show how to compute the new poles of any spline in the original spline space in terms of its initial poles.     

Numerical integration based on bivariate quadratic spline quasi-interpolants on bounded domains

In this paper we generate and study new cubature formulas based on spline quasi-interpolants defined as linear combinations of C ¹ bivariate quadratic B-splines on a rectangular domain Ω, endowed with a non-uniform criss-cross triangulation, with discrete linear functionals as coefficients. Such B-splines have their supports contained in Ω and there is no data point outside this domain. Numerical results illustrate the methods.     

Bivariate spline method for numerical solution of time evolution Navier‐Stokes equations over polygons in stream function formulation

We use a bivariate spline method to solve the time evolution Navier‐Stokes equations numerically. The bivariate splines we use in this article are in the spline space of smoothness r and degree 3r over triangulated quadrangulations. The stream function formulation for the Navier‐Stokes equations is employed. Galerkin's method is applied to discretize the space variables of the nonlinear fourth‐order equation, Crank‐Nicholson's method is applied to discretize the time variable, and Newton's iterative method is then used to solve the resulting nonlinear system. We show the existence and uniqueness of the weak solution in L₂(0, T; H²(Ω)) ∩ L_∞(0, T; H¹(Ω)) of the 2D nonlinear fourth‐order problem and give an estimate of how fast the numerical solution converges to the weak solution. The C¹ cubic splines are implemented in MATLAB for solving the Navier‐Stokes equations numerically. Our numerical experiments show that the method is effective and efficient. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 776–827, 2003.     

Solving Fredholm integral equations by approximating kernels by spline quasi-interpolants

We study two methods for solving a univariate Fredholm integral equation of the second kind, based on (left and right) partial approximations of the kernel K by a discrete quartic spline quasi-interpolant. The principle of each method is to approximate the kernel with respect to one variable, the other remaining free. This leads to an approximation of K by a degenerate kernel. We give error estimates for smooth functions, and we show that the method based on the left (resp. right) approximation of the kernel has an approximation order O(h ⁵) (resp. O(h ⁶)). We also compare the obtained formulae with projection methods.     

Convex Underestimation of Twice Continuously Differentiable Functions by Piecewise Quadratic Perturbation: Spline αBB Underestimators

This paper describes the construction of convex underestimators for twice continuously differentiable functions over box domains through piecewise quadratic perturbation functions. A refinement of the classical α BB convex underestimator, the underestimators derived through this approach may be significantly tighter than the classical αBB underestimator. The convex underestimator is the difference of the nonconvex function f and a smooth, piecewise quadratic, perturbation function, q. The convexity of the underestimator is guaranteed through an analysis of the eigenvalues of the Hessian of f over all subdomains of a partition of the original box domain. Smoothness properties of the piecewise quadratic perturbation function are derived in a manner analogous to that of spline construction.