Bivariate box splines and smooth pp functions on a three direction mesh

Let S denote the space of bivariate piecewise polynomial functions of degree ? k and smoothness ρ on the regular mesh generated by the three directions (1, 0), (0, 1), (1, 1). We construct a basis for S in terms of box splines and truncated powers. This allows us to determine the polynomials which are locally contained in S and to give upper and lower bounds for the degree of approximation. For $\text{ρ = ?}\text{(2k ? 2)}\text{3}\text{?}$, k ? 2 (3), the case of minimal degree k for given smoothness ρ, we identify the elements of minimal support in S and give a basis for $\text{S}{}_{\mathrm{<mtext>loc</mtext>}}\text{= {f ∈ S:}\text{supp}\text{f ? Ω}}$, with Ω a convex subset of $\text{R}$².     

On a system of piecewise linear functions with vanishing integrals on <Emphasis Type="Italic">R</Emphasis>

For an admissible sequence T we define an orthonormal system consisting of piecewise linear functions with vanishing integrals on R. Necessary and sufficient conditions on T are found for the corresponding system to be a basis in H¹(R).     

Application of wavelet bases in linear and nonlinear approximation to functions from Besov spaces

Linear and nonlinear approximations to functions from Besov spaces B _{p, q} ^σ ([0, 1]), σ > 0, 1 ≤ p, q ≤ ∞ in a wavelet basis are considered. It is shown that an optimal linear approximation by a D-dimensional subspace of basis wavelet functions has an error of order D ^{-min(σ, σ + 1/2 ? 1/p)} for all 1 ≤ p ≤ ∞ and σ > max(1/p ? 1/2, 0). An original scheme is proposed for optimal nonlinear approximation. It is shown how a D-dimensional subspace of basis wavelet functions is to be chosen depending on the approximated function so that the error is on the order of D ^?σ for all 1 ≤ p ≤ ∞ and σ > max(1/p ? 1/2, 0). The nonlinear approximation scheme proposed does not require any a priori information on the approximated function.     

Dependence of the Convergence Domain of Spectral Expansions on the Geometry of the Set of Discontinuity of the Function Being Expanded

For piecewise smooth functions, we indicate their domains of convergence and Riecz summarizability of their spectral expansions related to the Laplace operator in ? ⁿ , depending on the geometry of points of discontinuity of the function being expanded.     

A dimension series for multivariate splines

For a polyhedral subdivision Δ of a region in Euclideand-space, we consider the vector spaceC _k ^r (Δ) consisting of allC ^r piecewise polynomial functions over Δ of degree at mostk. We consider the formal power series ∑ _k≥0 dim_? C _k ^r (Δ)λ^k and show, under mild conditions on Δ, that this always has the formP(λ)/(1?λ) ^d+1, whereP(λ) is a polynomial in λ with integral coefficients which satisfiesP(0)=1,P(1)=f _d (Δ), andP′(1)=(r+1)f _d?1 ⁰ (Δ). We discuss how the polynomialP(λ) and bases for the spacesC _k ^r (Δ) can be effectively calculated by use of Gröbner basis techniques of computational commutative algebra. A further application is given to the theory of hyperplane arrangements.     

Bivariate Gonarov polynomials and integer sequences

Univariate Gonarov polynomials arose from the Gonarov interpolation problem in numerical analysis.They provide a natural basis of polynomials for working with u-parking functions,which are integer sequences whose order statistics are bounded by a given sequence u.In this paper,we study multivariate Gonarov polynomials,which form a basis of solutions for multivariate Gonarov interpolation problem.We present algebraic and analytic properties of multivariate Gonarov polynomials and establish a combinatorial relation with integer sequences.Explicitly,we prove that multivariate Gonarov polynomials enumerate k-tuples of integers sequences whose order statistics are bounded by certain weights along lattice paths in Nk.It leads to a higher-dimensional generalization of parking functions,for which many enumerative results can be derived from the theory of multivariate Gonarov polynomials.     

Bernstein-Bézier techniques for divergence of polynomial spline vector fields in ℝ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

Bernstein-Bézier techniques for analyzing polynomial spline fields in n variables and their divergence are developed. Dimension and a minimal determining set for continuous piecewise divergence-free spline fields on the Alfeld split of a simplex in ? ⁿ are obtained using the new techniques, as well as the dimension formula for continuous piecewise divergence-free splines on the Alfeld refinement of an arbitrary simplicial partition in ? ⁿ .     

Orthonormal bases associated with multi-knot piecewise linear function sequences on [0, 1)<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

We investigate two classes of orthonormal bases for L^2（[0, 1）^n）. The exponential parts of those bases are multi-knot piecewise linear functions which are called spectral sequences. We characterize the multi-knot piecewise linear spectral sequences and give an application of the first class of piecewise linear spectral sequences.     

On the action of the complex Monge-Ampère operator on piecewise linear functions

The action of the mixed complex Monge-Ampère operator (h ₁, …, h _k ) ? dd ^c h ₁ ∧ … ∧ dd ^c h _k on piecewise linear functions h _i is considered. The language of Monge-Ampère operators is used to transfer results on mixed volumes and tropical varieties to a broader context, which arises under the passage from polynomials to exponential sums. In particular, it is proved that the value of the Monge-Ampère operator depends only on the product of the functions h _i .     

Curves and Surfaces Construction Based on New Basis with Exponential Functions

By incorporating two exponential functions into the cubic Bernstein basis functions, a new class of λμ-Bernstein basis functions is constructed. Based on these λμ-Bernstein basis functions, a kind of λμ-Bézier-like curve with two shape parameters, which include the cubic Bernstein-Bézier curve, is proposed. The C ¹ and C ² continuous conditions for joining two λμ-Bézier-like curves are given. By using tensor product method, a class of rectangular Bézier-like patches with four shape parameters is shown. The G ¹ and G ² continuous conditions for joining two rectangular Bézier-like patches are derived. By incorporating three exponential functions into the cubic Bernstein basis functions over triangular domain, a new class of λμη-Bernstein basis functions over triangular domain is also constructed. Based on the λμη-Bernstein basis functions, a kind of triangular λμη-Bézier-like patch with three shape parameters, which include the triangular Bernstein-Bézier cubic patch, is presented. The conditions for G ¹ continuous smooth joining two triangular λμη-Bézier-like patches are discussed. The shape parameters serve as tension parameters and have a predictable adjusting role on the curves and patches.     

Approximation of Piecewise Affine Homeomorphisms by Diffeomorphisms

We prove that any countably piecewise affine homeomorphism from an open set of ?² can be approximated, together with its inverse, by diffeomorphisms in the W ^1,p and the L ^∞ norms.     

Finite element method for a class of parabolic integro-differential equations with interfaces

In this paper, convergence of finite element method for a class of parabolic integro-differential equations with discontinuous coefficients are analyzed. Optimal L ²(L ²) and L ² (H ¹) norms are shown to hold when the finite element space consists of piecewise linear functions on a mesh that do not require to fit exactly to the interface. Both continuous time and discrete time Galerkin methods are discussed for arbitrary shape but smooth interfaces.     

On a quadrature algorithm for the piecewise linear wavelet collocation applied to boundary integral equations

In this paper, we consider a piecewise linear collocation method for the solution of a pseudo‐differential equation of order r=0, ?1 over a closed and smooth boundary manifold. The trial space is the space of all continuous and piecewise linear functions defined over a uniform triangular grid and the collocation points are the grid points. For the wavelet basis in the trial space we choose the three‐point hierarchical basis together with a slight modification near the boundary points of the global patches of parametrization. We choose linear combinations of Dirac delta functionals as wavelet basis in the space of test functionals. For the corresponding wavelet algorithm, we show that the parametrization can be approximated by low‐order piecewise polynomial interpolation and that the integrals in the stiffness matrix can be computed by quadrature, where the quadrature rules are composite rules of simple low‐order quadratures. The whole algorithm for the assembling of the matrix requires no more than O(N [logN]³) arithmetic operations, and the error of the collocation approximation, including the compression, the approximative parametrization, and the quadratures, is less than O(N^?(2?r)/2). Note that, in contrast to well‐known algorithms by Petersdorff, Schwab, and Schneider, only a finite degree of smoothness is required. In contrast to an algorithm of Ehrich and Rathsfeld, no multiplicative splitting of the kernel function is required. Beside the usual mapping properties of the integral operator in low order Sobolev spaces, estimates of Calderón–Zygmund type are the only assumptions on the kernel function. Copyright © 2003 John Wiley & Sons, Ltd.     

Characterizing Convexity of a Function by Its Fréchet and Limiting Second-Order Subdifferentials

The Fréchet and limiting second-order subdifferentials of a proper lower semicontinuous convex function \(\varphi: \mathbb R^n\rightarrow\bar{\mathbb R}\) have a property called the positive semi-definiteness (PSD)—in analogy with the notion of positive semi-definiteness of symmetric real matrices. In general, the PSD is insufficient for ensuring the convexity of an arbitrary lower semicontinuous function φ. However, if φ is a C ^1,1 function then the PSD property of one of the second-order subdifferentials is a complete characterization of the convexity of φ. The same assertion is valid for C ¹ functions of one variable. The limiting second-order subdifferential can recognize the convexity/nonconvexity of piecewise linear functions and of separable piecewise C ² functions, while its Fréchet counterpart cannot.     

Calculus of variations on time scales: weak local piecewise Crd solutions with variable endpoints

A nonlinear calculus of variations problem on time scales with variable endpoints is considered. The space of functions employed is that of piecewise rd-continuously Δ-differentiable functions (C¹_prd). For this problem, the Euler-Lagrange equation, the transversality condition, and the accessory problem are derived as necessary conditions for weak local optimality. Assuming the coercivity of the second variation, a corresponding second order sufficiency criterion is established.     

Some mathematical results on a system of transport equations with an algebraic constraint describing fixed-bed adsorption of gases

This paper deals with a system of two equations which describes heatless adsorption of a gaseous mixture with two species. When one of the components is inert, we obtain an existence result of a weak solution satisfying some entropy condition under some simplifying assumptions. The proposed method makes use of a Godunov-type scheme. Uniqueness is proved in the class of piecewise C¹ functions.     

Uniform grid approximation of nonsmooth solutions with improved convergence for a singularly perturbed convection-diffusion equation with characteristic layers

A mixed boundary value problem for a singularly perturbed elliptic convection-diffusion equation with constant coefficients in a square domain is considered. Dirichlet conditions are specified on two sides orthogonal to the flow, and Neumann conditions are set on the other two sides. The right-hand side and the boundary functions are assumed to be sufficiently smooth, which ensures the required smoothness of the desired solution in the domain, except for neighborhoods of the corner points. Only zero-order compatibility conditions are assumed to hold at the corner points. The problem is solved numerically by applying an inhomogeneous monotone difference scheme on a rectangular piecewise uniform Shishkin mesh. The inhomogeneity of the scheme lies in that the approximating difference equations are not identical at different grid nodes but depend on the perturbation parameter. Under the assumptions made, the numerical solution is proved to converge ?-uniformly to the exact solution in a discrete uniform metric at an O(N ^?3/2ln² N) rate, where N is the number of grid nodes in each coordinate direction.     

On the Complexity of Self-Validating Numerical Integration and Approximation of Functions with Singularities

We consider the complexity of numerical integration and piecewise polynomial at approximation of bounded functions from a subclass ofC^k([a, b]\Z), whereZis a finite subset of [a, b]. Using only function values or values of derivatives, we usually cannot guarantee that the costs for obtaining an error less thanεare bounded byO(ε^−1/k) and we may have much higher costs. The situation changes if we also allow “realistic” estimates of ranges of functions or derivatives on intervals as observations. A very simple algorithm now yields an error less thanεwithO(ε^−1/k)-costs and an analogous result is also obtained for uniform approximation with piecewise polynomials. In a practical implementation, estimation of ranges may be done efficiently with interval arithmetic and automatic differentiation. The cost for each such evaluation (also of ranges of derivatives) is bounded by a constant times the cost for a function evaluation. The mentioned techniques reduce the class of integrands, but still allow numerical integration of functions from a wide class withO(ε^−1/k) arithmetical operations and guaranteed precisionε.     

A finite volume method on general surfaces and its error estimates

In this paper, we study a finite volume method and its error estimates for the numerical solution of some model second order elliptic partial differential equations defined on a smooth surface. The discretization is defined via a surface mesh consisting of piecewise planar triangles and piecewise polygons. The optimal error estimates of the approximate solution are proved in both the H¹ and L² norms which are of first order and second order respectively under mesh regularity assumptions. Some numerical tests are also carried out to experimentally verify our theoretical analysis.     

The Richardson scheme for the singularly perturbed parabolic reaction-diffusion equation in the case of a discontinuous initial condition

The Dirichlet problem for a singularly perturbed parabolic reaction-diffusion equation with a piecewise continuous initial condition in a rectangular domain is considered. The higher order derivative in the equation is multiplied by a parameter ?², where ? ∈ (0, 1]. When ? is small, a boundary and an interior layer (with the characteristic width ?) appear, respectively, in a neighborhood of the lateral part of the boundary and in a neighborhood of the characteristic of the reduced equation passing through the discontinuity point of the initial function; for fixed ?, these layers have limited smoothness. Using the method of additive splitting of singularities (induced by the discontinuities of the initial function and its low-order derivatives) and the condensing grid method (piecewise uniform grids that condense in a neighborhood of the boundary layers), a finite difference scheme is constructed that converges ?-uniformly at a rate of O(N ^?2ln² N + n ₀ ^?1 ), where N + 1 and N ₀ + 1 are the numbers of the mesh points in x and t, respectively. Based on the Richardson technique, a scheme that converges ?-uniformly at a rate of O(N ^?3 + N ₀ ^?2 ) is constructed. It is proved that the Richardson technique cannot construct a scheme that converges in ?-uniformly in x with an order greater than three.