Galerkin methods with splines for singular integral equations over (0, 1)

Summary In this paper a convergence analysis of Galerkin methods with splines for strongly elliptic singular integral equations over the interval (0, 1) is given. As trial functions we utilize smoothest polynomial splines on arbitrary meshes and continuous splines on special nonuniform partitions, multiplied by a weight function. Using inequalities of Gårding type for singular integral operators in weightedL ² spaces and the complete asymptotics of solutions at the endpoints, we provide error estimates in certain Sobolev norms.     

On spline Galerkin methods for singular integral equations with piecewise continuous coefficients

Summary This article analizes the convergence of the Galerkin method with polynomial splines on arbitrary meshes for systems of singular integral equations with piecewise continuous coefficients inL ² on closed or open Ljapunov curves. It is proved that this method converges if and, for scalar equations and equidistant partitions, only if the integral operator is strongly elliptic (in some generalized sense). Using the complete asymptotics of the solution, we provide error estimates for equidistant and for special nonuni-form partitions.     

Non-uniform exponential tension splines

We describe explicitly each stage of a numerically stable algorithm for calculating with exponential tension B-splines with non-uniform choice of tension parameters. These splines are piecewisely in the kernel of D ²(D ²–p ²), where D stands for ordinary derivative, defined on arbitrary meshes, with a different choice of the tension parameter p on each interval. The algorithm provides values of the associated B-splines and their generalized and ordinary derivatives by performing positive linear combinations of positive quantities, described as lower-order exponential tension splines. We show that nothing else but the knot insertion algorithm and good approximation of a few elementary functions is needed to achieve machine accuracy. The underlying theory is that of splines based on Chebyshev canonical systems which are not smooth enough to be ECC-systems. First, by de Boor algorithm we construct exponential tension spline of class C ¹, and then we use quasi-Oslo type algorithms to evaluate classical non-uniform C ² tension exponential splines.      

The Problem of Topologies of Grothendieck and the Class of Fréchet T-Spaces

We examine the interpolation with periodic polynomial splines of degree d and defect r (d ≦ r) on equidistant partitions of the real axis and generalize known results for r = 0. We prove necessary and sufficient conditions for the existence and a certain L²-stability of the interpolants as well as their approximation properties in the scale of the periodic SOBOLEV spaces.     

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.     

On the dimension of trivariate spline spaces with the highest order smoothness on 3D T-meshes

T-meshes are a type of rectangular partitions of planar domains which allow hanging vertices. Because of the special structure of T-meshes, adaptive local refinement is possible for splines defined on this type of meshes, which provides a solution for the defect of NURBS. In this paper, we generalize the definitions to the three-dimensional (3D) case and discuss a fundamental problem – the dimension of trivariate spline spaces on 3D T-meshes. We focus on a special case where splines are C ^d?1 continuous for degree d. The smoothing cofactor method for trivariate splines is explored for this situation. We obtain a general dimension formula and present lower and upper bounds for the dimension. At last, we introduce a type of 3D T-meshes, where we can give an explicit dimension formula.     

Sharp asymptotics of the <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> approximation error for interpolation on block partitions

Adaptive approximation (or interpolation) takes into account local variations in the behavior of the given function, adjusts the approximant depending on it, and hence yields the smaller error of approximation. The question of constructing optimal approximating spline for each function proved to be very hard. In fact, no polynomial time algorithm of adaptive spline approximation can be designed and no exact formula for the optimal error of approximation can be given. Therefore, the next natural question would be to study the asymptotic behavior of the error and construct asymptotically optimal sequences of partitions. In this paper we provide sharp asymptotic estimates for the error of interpolation by splines on block partitions in \mathbbR^d{\mathbb{R}^d} . We consider various projection operators to define the interpolant and provide the analysis of the exact constant in the asymptotics as well as its explicit form in certain cases.     

Approximation Methods by Regular Functions

This paper is a survey of approximation results and methods by smooth functions in Banach spaces. The topics considered in the paper are the following: approximation by polynomials by C^k-functions using the method of smooth partitions of unity, approximation by the fine topology, analytic approximation and regularization in Banach spaces using the infimal convolution method.     

Chains of controllable partitions of the m-dimensional cube

Controllable partitions, which arise in approximation theory, are finite partitions of compact metric spaces into subsets whose sizes fulfil a uniformity condition depending on the entropy numbers of the underlying space. We characterize a class of partitions of the cube ([0,2] ^m , d _max) which possess a controllable refinement and, in the end, give an ascending chain of controllable partitions of [0,2] ^m .     

Unified Representations of Nonlinear Splines

Golomb and Jerome's framework is modified and extended. The new framework is more general since it also handles interpolants which are not allowed to “slide” at the nodes. The space of interpolants of variable length is shown to be a smooth manifold. If the length is fixed, and there are no nodes, then the space of interpolants is a manifold. When there is at least one node, and at least one node is not on the line segment between the endpoints, then the space of interpolants of fixed length is a smooth manifold. Sufficient conditions are given which ensure the space of interpolants continues to be a smooth manifold in the presence of additional constraints such as clamping and pinning. A new fundamental finite-dimensional equation is derived. When it is solved it yields all nonlinear splines, and every nonlinear spline appears in this way. An important feature is that the same symbolic equation is used for all possible combinations of the constraints considered. It is shown how to take the solutions of the fundamental equation and use them to express the corresponding nonlinear splines in terms of a pair of elliptic functions. An inequality is derived that specifies which elliptic function appears along each section of the spline. The nonlinear splines are in a unified way shown to beC²for all possible combinations of the constraints considered.     

Smooth partitions of Anosov diffeomorphisms are weak Bernoulli

It is shown that smooth partitions are weak Bernoulli forC ² measure preserving Anosov diffeomorphisms. A related type of coding is defined and an invariant discussed. Supported by the Sloan Foundation and NSF GP-14519.     

The Qualocation Method for Symm's Integral Equation on a Polygon

This paper discusses the convergence of the qualocation method for Symm's integral equation on closed polygonal boundaries in IR². Qualocation is a Petrov-Galerkin method in which the outer integrals are performed numerically by special quadrature rules. Before discretisation a nonlinear parametrisation of the polygon is introduced which varies more slowly than arc-length near each corner and leads to a transformed integral equation with a regular solution. We prove that the qualocation method using smoothest splines of any order k on a uniform mesh (with respect to the new parameter) converges with optimal order O (h^k). Furthermore, the method is shown to produce superconvergent approximations to linear functionals, retaining the same high convergence rates as in the case of a smooth curve.     

On the Interpolation by Discrete Splines with Equidistant Nodes

In this paper we consider equidistant discrete splines S(j), j , which may grow as O(|j|^s) as |j|→∞. Such splines are relevant for the purposes of digital signal processing. We give the definition of the discrete B-splines and describe their properties. Discrete splines are defined as linear combinations of shifts of the B-splines. We present a solution to the problem of discrete spline cardinal interpolation of the sequences of power growth and prove that the solution is unique within the class of discrete splines of a given order.     

Calibration relations for nonpolynomial splines

Nonpolynomial (X, A, ϕ)-splines of the third order and the special case of B _ϕ-splines of class C² are studied. For such splines calibration relations are obtained, owing to which the coordinate splines on the original grid is represented in terms of the coordinate splines on a refined grid. A nonlinear mapping (ℝ⁴)⁹ ↦ ℝ⁴ and locally orthogonal chains of vectors are used for this purpose. Bibliography: 22 titles. __________ Translated from Problemy Matematicheskogo Analiza, No. 34, 2006, pp. 39–54.     

The convergence of even degree spline collocation solution for potential problems in smooth domains of the plane

Summary In this article we derive new error estimates for collocation solution of potential type problems by using even degree smooth splines as trial functions. It turns out that for smooth potentials the assured convergence is of the same order as by using splines of the odd degreed+1. Some numerical examples which conform the theoretical results are presented. Present address: (1. 7. 1988–31. 12. 1988) Department of Mathematics, University of Maryland, College Park, MD 20742, USA     

Partitioning Sets of Triples into Small Planes

We study partitions of the set of all ₃ ^v triples chosen from a v-set intopairwise disjoint planes with three points per line. Our partitions may contain copies of PG(2,2) only (Fano partitions) or copies of AG(2, 3) only (affine partitions)or copies of some planes of each type (mixed partitions).We find necessary conditions for Fano or affine partitions to exist. Such partitions are already known in severalcases: Fano partitions for v = 8 and affine partitions for v = 9 or 10. We constructsuch partitions for several sporadic orders, namely, Fano partitions for v = 14, 16, 22, 23, 28, andan affine partition for v = 18. Using these as starter partitions, we prove that Fano partitionsexist for v = 7 ⁿ + 1, 13 ⁿ + 1,27 ⁿ + 1, and affine partitions for v = 8 ⁿ + 1,9 ⁿ + 1, 17 ⁿ + 1. In particular, both Fano and affine partitionsexist for v = 3⁶ⁿ + 1. Using properties of 3-wise balanced designs, weextend these results to show that affine partitions also exist for v = 3²ⁿ .Similarly, mixed partitions are shown to exist for v = 8 ⁿ ,9 ⁿ , 11 ⁿ + 1.     

The information cocycle andɛ-bounded codes

We shall prove here that Bowen’s bounded codes lead to a cocycle-coboundary equation which can be exploited in various ways: through central limit theorems, through the related information variance or through a certain group invariant. Another result which emerges is that it is impossible to boundedly code two Markov automorphisms when one is of maximal type and the other is not. The functions which appear in the above cited cocycle-coboundary equation may belong to variousL ^p spaces. We devote a section to this problem. Finally we show that the information cocycle associated with small smooth partitions of aC ² Anosov diffeomorphism preserving a smooth probability is, in a sense, canonical.     

On the variational characterization and convergence of bivariate splines

It is shown that bivariate interpolatory splines defined on a rectangleR can be characterized as being unique solutions to certain variational problems. This variational property is used to prove the uniform convergence of bivariate polynomial splines interpolating moderately smooth functions at data which includes interpolation to values on a rectangular grid. These results are then extended to bivariate splines defined on anL-shaped region.This research was supported by a University of Kansas General Research Grant.     

On the use of splines for the numerical solution of nonlinear two-point boundary value problems

Cubic splines on splines and quintic spline interpolations are used to approximate the derivative terms in a highly accurate scheme for the numerical solution of two-point boundary value problems. The storage requirement is essentially the same as for the usual trapezoidal rule but the local accuracy is improved fromO(h ³) to eitherO(h ⁶) orO(h ⁷), whereh is the net size. The use of splines leads to solutions that reflect the smoothness of the slopes of the differential equations.     

Some extremal properties of multivariate polynomial splines in the metric Lp(ℝd)

We constructed a kind of continuous multivariate spline operators as the approximation tools of the multivariate functions on the (?^d instead of the usual multivariate cardinal interpolation operators of splines, and obtained the approximation error by this kind of spline operators. Meantime, by the results, we also obtained that the spaces of multivariate polynomial splines are weakly asyrnptotically optimal for the Kolrnogorov widths and the linear widths of some anisotropic Sobolev classes of smooth functions on (?^d in the metric L_p((?^d).