Upper and Lower Bounds on the Dimension of Superspline Spaces

Upper and lower bounds are provided on the dimension of bivariate polynomial superspline spaces which are defined by enforcing smoothness conditions across the interior edges of the underlying triangulation. The results generalize known bounds for classical spline spaces. As an example of the usefulness of such bounds, we show how they can be applied to analyze a new macroelement.     

Bounds on the Dimension of Trivariate Spline Spaces: A Homological Approach

We consider the vector space of globally differentiable piecewise polynomial functions defined on a three-dimensional polyhedral domain partitioned into tetrahedra. We prove new lower and upper bounds on the dimension of this space by applying homological techniques. We give an insight of different ways of approaching this problem by exploring its connections with the Hilbert series of ideals generated by powers of linear forms, fat points, the so-called Fröberg–Iarrobino conjecture, and the weak Lefschetz property.     

A method of adding–removing knots for solving smoothing problems with obstacles

We study a method of adding–removing knots that has been proposed in the literature for solving the smoothing problem with obstacles. The method uses the coefficients of natural splines in the expansion by radial basis functions. We present examples of cycling and counterexamples to possible use of some ideas. We also give some sufficient conditions for finiteness of the method.     

Construction of Cubature Formulas via Bivariate Quadratic Spline Spaces over Non-Uniform Type-2 Triangulation

In this paper, matrix representations of the best spline quasi-interpolating operator over triangular sub-domains in $S^1_2 (∆^{(2)}_{mn})$, and coefficients of splines in terms of B-net are reviewed firstly. Moreover, by means of coefficients in terms of B-net, computation of bivariate numerical cubature over triangular sub-domains with respect to variables $x$ and $y$ is transferred into summation of coefficients of splines in terms of B-net. Thus concise bivariate cubature formulas are constructed over rectangular sub-domain. Furthermore, by means of module of continuity and max-norms, error estimates for cubature formulas are derived over both sub-domains and the domain.     

贯穿剖分上样条空间维数的注记

本文利用ｂｌｏｓｓｏｍ形式的光滑拼接条件，得到了贯穿剖分上样条空间维数定理的一个新的证明方法．     

样条空间S~μ_k（△）的维数

本文考虑了欧式空间Ｒ￣ｎ中任意单纯形剖分上的样条函数空间．证明了当ｋ≥（３μ＋１）２￣（ｎ－２）＋１时，计算任意单纯形剖分Δ上的ｋ次μ阶光滑样条空间的维数，可归结为计算每个σ－关联域（ｉ－单纯形σ∈Δ）Ｒ（σ）上的２￣（ｎ－ｉ－１）μ次μ阶光滑（ｉ≤ｎ－１）样条空间的维数。这里σ－关联域Ｒ（σ）是指Δ中所有包含σ的单纯形所成的单纯形剖分．     

二元样条的积分表示及分层三角剖分下二次样条空间的维数

本文通过引入一个积分协调条件，首次给出了二元样条的一个积分表示．文中还定义了平面单连通多边形区域的所谓分层三角剖分，并确定了此剖分下二次样条空间的维数．     

多元弱样条函数空间的维数

讨论了多元弱样条一点处的维数公式及任意三角剖分下的维数公式．得到了１－型剖分下Ｗ_３^１（Ｉ₁Δ_ｍｎ^１）的维数与局部支集样条基．     

A Homological Lower Bound for Order Dimension of Lattices

We prove that if a finite lattice L has order dimension at most d, then the homology of the order complex of its proper part L vanishes in dimensions d – 1 and higher. If L can be embedded as a join-sublattice in N ^d , then L actually has the homotopy type of a simplicial complex with d vertices.     

Trivariate spline approximations of 3D Navier-Stokes equations

We present numerical approximations of the 3D steady state Navier-Stokes equations in velocity-pressure formulation using trivariate splines of arbitrary degree and arbitrary smoothness with . Using functional arguments, we derive the discrete Navier-Stokes equations in terms of -coefficients of trivariate splines over a tetrahedral partition of any given polygonal domain. Smoothness conditions, boundary conditions and the divergence-free condition are enforced through Lagrange multipliers. The pressure is computed by solving a Poisson equation with Neumann boundary conditions. We have implemented this approach in MATLAB and present numerical evidence of the convergence rate as well as experiments on the lid driven cavity flow problem.

     

A Lower Bound for Pseudodimension in Terms of Topological Dimension

Mathematical Notes -     

On Stable Local Bases for Bivariate Polynomial Spline Spaces

Stable locally supported bases are constructed for the spaces \cal S _d ^r (\triangle) of polynomial splines of degree d≥ 3r+2 and smoothness r defined on triangulations \triangle , as well as for various superspline subspaces. In addition, we show that for r≥ 1 , in general, it is impossible to construct bases which are simultaneously stable and locally linearly independent. February 2, 2000. Date revised: November 27, 2000. Date accepted: March 7, 2001.     

A Family of Spline Quasi-Interpolants on the Sphere

In this paper, we construct a local quasi-interpolant Q for fitting a function f defined on the sphere S. We first map the surface S onto a rectangular domain and next, by using the tensor product of polynomial splines and 2-periodic trigonometric splines, we give the expression of Qf. The use of trigonometric splines is necessary to enforce some boundary conditions which are useful to ensure the C ² continuity of the associated surface. Finally, we prove that Q realizes an accuracy of optimal order.     

Lower Bounds for Local Versions of Dimension Reductions

We consider the problem of embedding vectors from an arbitrary Euclidean space into a low-dimensional Euclidean space while preserving, up to a small distortion, a subset of the distances. In particular, preserving only the distance of each vector to a small number of its nearest neighbors. We show that even when the subset of distances we wish to preserve is very small, the problem does not become easier than when one is required to preserve all the distances. Supported in part by the Israel Science Foundation.     

Bounds on the dimensions of trivariate spline spaces

We derive upper and lower bounds on the dimensions of trivariate spline spaces defined on tetrahedral partitions. The results hold for general partitions, and for all degrees of smoothness r and polynomial degrees d.      

Dimension of -splines on type-6 tetrahedral partitions

We consider a linear space of piecewise polynomials in three variables which are globally smooth, i.e. trivariate C¹-splines of arbitrary polynomial degree. The splines are defined on type-6 tetrahedral partitions, which are natural generalizations of the four-directional mesh. By using Bernstein–Bézier techniques, we analyze the structure of the spaces and establish formulae for the dimension of the smooth splines on such uniform type partitions.     

Spline Techniques for the Numerical Solution of Singular Perturbation Problems

One-dimensional singularly-perturbed two-point boundary-value problems arising in various fields of science and engineering (for instance, fluid mechanics, quantum mechanics, optimal control, chemical reactor theory, aerodynamics, reaction-diffusion processes, geophysics, etc.) are treated. Either these problems exhibits boundary layer(s) at one or both ends of the underlying interval or they possess oscillatory behavior depending on the nature of the coefficient of the first derivative term. Some spline difference schemes are derived for these problems using splines in compression and splines in tension. Second-order uniform convergence is achieved for both kind of schemes. By making use of the continuity of the first-order derivative of the spline function, a tridiagonal system is obtained which can be solved efficiently by well-known algorithms. Numerical examples are given to illustrate the theory.     

有限域上一类等维码的下界

等维码凭借其在随机线性网络编码中的良好的差错控制得到广泛研究,对于给定维数和最小距离的等维码所含码字的最大个数目前还没有一般性结果.Tuvi Etzion和Alexander Vardy给出了一定等维码所含码字最大个数的上界和下界,首先利用对偶空间构造等维码C(n,M,2k,k),达到了此类码所含码字的下界,然后具体构造了最优等维码C(7,41,4,2).     

Parity Dimension for Graphs - A Linear Algebraic Approach

For a graph G with closed neighborhood matrix N , the parity dimension of G , denoted PD( G ), is the dimension of the null space of N over the field ${cal Z}_2$ . Equivalently, the number of vertex sets S in G with the property that S dominates each vertex an even number of times is 2 k for some value of k , and PD( G ) = k . Using primarily linear algebraic techniques, we investigate the parity dimension of graphs.