Quadrature-free spline method for two-dimensional Navier-Stokes equation

In this paper, a quadrature-free scheme of spline method for two-dimensional Navier- Stokes equation is derived, which can dramatically improve the efficiency of spline method for fluid problems proposed by Lai and Wenston（2004）. Additionally, the explicit formulation for boundary condition with up to second order derivatives is presented. The numerical simulations on several benchmark problems show that the scheme is very efficient.     

A multinomial spline approximation scheme using spline quasi-interpolants

This paper presents a multinomial spline approximation scheme based on spline quasi-interpolants. The scheme can be considered as an extension of the usual Bernstein approximation for complex exponentials. Error estimates and numerical examples are given to show that this new scheme could produce highly accurate results.     

A simple smoothing spline,III

Summary  Computational methods for spline smoothing are studied in the context of the linear smoothing spline. Comparisons are made between two efficient methods for computing the estimator using band-limited basis functions and the Kalman filter. In particular, the Kalman filter approach is shown to be an efficient method for computing under the Kimeldorf-Wahba representation for the estimator. Run time comparisons are made between band-limited B-spline and Kalman filter based algorithms.     

A collocation by spline in tension

The collocation method by spline in tension for the problem: −εy"+p(x)y=f(x), y(0)=α₀,y(1)=α₁, p(x)>0, 0<ε<<1, is derived. The method has the second order of the global uniform convergence. For the corresponding difference scheme the optimal estimate: O (h_imin(h_i, ε) is obtained. This research was supported partly by NSF and SIZ for Science of SAP Vojvodina through funds made available to the U.S.—Yugoalav Joint Board on Scientific and Tchnological Cooperation (grants JF554, JF799).     

Eulerian numbers: A spline perspective

In this paper, the spline interpretations of Eulerian numbers and refined Eulerian numbers are presented. Many classical results about Eulerian numbers can follow from the properties of B-splines directly, and some new results about the refined Eulerian numbers and descent polynomials are also derived. Specifically, the explicit and recurrence formulas for the refined Eulerian numbers and descent polynomials are obtained. This paper also provides a new approach to study Eulerian numbers.     

Non-polynomial spline method for the solution of two-dimensional linear wave equations with a nonlinear source term

In this paper, two classes of methods are developed for the solution of two space dimensional wave equations with a nonlinear source term. We have used non-polynomial cubic spline function approximations in both space directions. The methods involve some parameters, by suitable choices of the parameters, a new high accuracy three time level scheme of order O(h ⁴ + k ⁴ + τ ² + τ ² h ² + τ ² k ²) has been obtained. Stability analysis of the methods have been carried out. The results of some test problems are included to demonstrate the practical usefulness of the proposed methods. The numerical results for the solution of two dimensional sine-Gordon equation are compared with those already available in literature.     

A note on mean square spline approximation

A method of obtaining the mean-square spline approximation by the use of dynamic programming is indicated.     

A spline collocation method for parabolic pseudodifferential equations

The purpose of this paper is to examine a boundary element collocation method for some parabolic pseudodifferential equations. The basic model problem for our investigation is the two-dimensional heat conduction problem with vanishing initial condition and a given Neumann or Dirichlet type boundary condition. Certain choices of the representation formula for the heat potential yield boundary integral equations of the first kind, namely the single layer and the hypersingular heat operator equations. Both of these operators, in particular, are covered by the class of parabolic pseudodifferential operators under consideration. Moreover, the spatial domain is allowed to have a general smooth boundary curve. As trial functions the tensor products of the smoothest spline functions of odd degree (space) and continuous piecewise linear splines (time) are used. Stability and convergence of the method is proved in some appropriate anisotropic Sobolev spaces.     

A remark on translates of a box spline

We prove an express theorem on the stability of integer translates of a box spline and clear proposition 4. 10. 2 in [6] for box spline case. Also, we provide a way to construct a linear projection from L_p to the space of integer translates of a box spline. Consequently, the equivalence among the stability, global linear independence and local linear independence of translates of a box spile follows. Partially supported by ARO contract No. DAAL 4-87-0025     

A linear approach to shape preserving spline approximation

This paper deals with the approximation of a given large scattered univariate or bivariate data set that possesses certain shape properties, such as convexity, monotonicity, and/or range restrictions. The data are approximated for instance by tensor-product B-splines preserving the shape characteristics present in the data.Shape preservation of the spline approximant is obtained by additional linear constraints. Constraints are constructed which are local linear sufficient conditions in the unknowns for convexity or monotonicity. In addition, it is attractive if the objective function of the resulting minimisation problem is also linear, as the problem can then be written as a linear programming problem. A special linear approach based on constrained least squares is presented, which in the case of large data reduces the complexity of the problem sets in contrast with that obtained for the usual ₂-norm as well as the -norm.An algorithm based on iterative knot insertion which generates a sequence of shape preserving approximants is given. It is investigated which linear objective functions are suited to obtain an efficient knot insertion method.     

Quadratic spline interpolation with coinciding interpolation and spline grids

In this paper the quadratic spline interpolation with coinciding interpolation and spline grids for continuous functions is considered. The theorems mainly concern error estimations which allow to formulate a convergence statement. To get such results it is assumed that the function to be interpolated is suitably smooth or possesses a special behavior. A best approximation property and a statement about the solution of boundary value problems using quadratic spline functions are added.     

Notes on spline functions IV: A cardinal spline analogue of the theorem of the brothers Markov

A cardinal spline analog of the Markov theorem is given. It is applied to derive the necessary conditions for a function to be the limit of its cardinal spline interpolents as their degree trends to infinity. Sufficient conditions for this to happen are given in [8]. Sponsored by the United States Army under Contract No. DA-31-124-ARO-D-462.     

A spline interpolation technique that preserves mass budgets

The usual practice of forcing budget models by linear interpolations of mean data does not produce a forcing whose mean is the data value required. The usual third-order spline is modified into a fourth-order spline, called mc-spline, to cope with this issue.The technique provides a smooth and faithful continuous interpolation of the original data that is well suited for its graphical representations or for the forcing of numerical models.     

Perfect spline approximation

Our study of perfect spline approximation reveals: (i) it is closely related to ΣΔ modulation used in one-bit quantization of bandlimited signals. In fact, they share the same recursive formulae, although in different contexts; (ii) the best rate of approximation by perfect splines of order r with equidistant knots of mesh size h is h^r−1. This rate is optimal in the sense that a function can be approximated with a better rate if and only if it is a polynomial of degree <r.The uniqueness of best approximation is studied, too. Along the way, we also give a result on an extremal problem, that is, among all perfect splines with integer knots on , (multiples of) Euler splines have the smallest possible norms.     

Three-monotone spline approximation

For r≥3, n∈N and each 3-monotone continuous function f on [a,b] (i.e., f is such that its third divided differences [x₀,x₁,x₂,x₃]f are nonnegative for all choices of distinct points x₀,…,x₃ in [a,b]), we construct a spline s of degree r and of minimal defect (i.e., s∈C^r−1[a,b]) with n−1 equidistant knots in (a,b), which is also 3-monotone and satisfies ‖f−s‖_L∞[a,b]≤cω₄(f,n⁻¹,[a,b])_∞, where ω₄(f,t,[a,b])_∞ is the (usual) fourth modulus of smoothness of f in the uniform norm. This answers in the affirmative the question raised in [8, Remark 3], which was the only remaining unproved Jackson-type estimate for uniform 3-monotone approximation by piecewise polynomial functions (ppfs) with uniformly spaced fixed knots.Moreover, we also prove a similar estimate in terms of the Ditzian–Totik fourth modulus of smoothness for splines with Chebyshev knots, and show that these estimates are no longer valid in the case of 3-monotone spline approximation in the L_p norm with p<∞. At the same time, positive results in the L_p case with p<∞ are still valid if one allows the knots of the approximating ppf to depend on f while still being controlled.These results confirm that 3-monotone approximation is the transition case between monotone and convex approximation (where most of the results are “positive”) and k-monotone approximation with k≥4 (where just about everything is “negative”).