Smooth interpolation of a mesh of curves

The interpolation of a mesh of curves by a smooth regularly parametrized surface with one polynomial piece per facet is studied. Not every mesh with a well-defined tangent plane at the mesh points has such an interpolant: the curvature of mesh curves emanating from mesh points with an even number of neighbors must satisfy an additional vertex enclosure constraint. The constraint is weaker than previous analyses in the literature suggest and thus leads to more efficient constructions. This is illustrated by an implemented algorithm for the local interpolation of a cubic curve mesh by a piecewise [bi]quarticC ¹ surface. The scheme is based on an alternative sufficient constraint that forces the mesh curves to interpolate second-order data at the mesh points. Rational patches, singular parametrizations, and the splitting of patches are interpreted as techniques to enforce the vertex enclosure constraint.Communicated by Wolfgang Dahmen.     

Bivariate Hermite interpolation on the exponential curve

Periodica Mathematica Hungarica - We study Hermite interpolation problems on the exponential curve $$y=e^x$$ in $$\mathbb {R}^2$$ . We construct some kind of regular Hermite interpolation schemes...     

Optimal sampling and curve interpolation via wavelets

We propose a wavelet-based method for determining optimal sampling positions and inferring underlying functions based on the samples when it is known that the underlying function is Lipschitz. We first propose a Lipschitz regularity-based statistical model for data which are sampled from a Lipschitz curve. And then we propose a wavelet-based interpolation method for generating a Lipschitz curve given a set of points, and derive the optimal sampling positions.     

Optimization of parameters for curve interpolation by cubic splines

In this paper, we present an interpolation method for curves from a data set by means of the optimization of the parameters of a quadratic functional in a space of parametric cubic spline functions. The existence and the uniqueness of this problem are shown. Moreover, a convergence result of the method is established in order to justify the method presented. The aforementioned functional involves some real non-negative parameters; the optimal parametric curve is obtained by the suitable optimization of these parameters. Finally, we analyze some numerical and graphical examples in order to show the efficiency of our method.     

Smooth surface reconstruction via natural neighbour interpolation of distance functions

We present an algorithm to reconstruct smooth surfaces of arbitrary topology from unorganised sample points and normals. The method uses natural neighbour interpolation, works in any dimension and accommodates non-uniform samples. The reconstructed surface interpolates the data points and is implicitly represented as the zero set of some pseudo-distance function. It can be meshed so as to satisfy a user-defined error bound, which makes the method especially relevant for small point sets. Experimental results are presented for surfaces in .     

Planar curve interpolation by piecewise conics of arbitrary type

Five points in general position inR ² always lie on a unique conic, and three points plus two tangents also have a unique interpolating conic, the type of which depends on the data. These well-known facts from projective geometry are generalized: an odd number 2n+1≥5 of points inR ², if they can be interpolated at all by a smooth curve with nonvanishing curvature, will have a uniqueGC ² interpolant consisting of pieces of conics of varying type. This interpolation process reproduces conics of arbitrary type and preserves strict convexity. Under weak additional assumptions its approximation order is ?(h ⁵), whereh is the maximal distance of adjacent data pointsf(t _i ) sampled from a smooth and regular planar curvef with nonvanishing curvature. Two algorithms for the construction of the interpolant are suggested, and some examples are presented.     

Smooth strongly convex interpolation and exact worst-case performance of first-order methods

We show that the exact worst-case performance of fixed-step first-order methods for unconstrained optimization of smooth (possibly strongly) convex functions can be obtained by solving convex programs. Finding the worst-case performance of a black-box first-order method is formulated as an optimization problem over a set of smooth (strongly) convex functions and initial conditions. We develop closed-form necessary and sufficient conditions for smooth (strongly) convex interpolation, which provide a finite representation for those functions. This allows us to reformulate the worst-case performance estimation problem as an equivalent finite dimension-independent semidefinite optimization problem, whose exact solution can be recovered up to numerical precision. Optimal solutions to this performance estimation problem provide both worst-case performance bounds and explicit functions matching them, as our smooth (strongly) convex interpolation procedure is constructive. Our works build on those of Drori and Teboulle (Math Program 145(1–2):451–482, 2014) who introduced and solved relaxations of the performance estimation problem for smooth convex functions. We apply our approach to different fixed-step first-order methods with several performance criteria, including objective function accuracy and gradient norm. We conjecture several numerically supported worst-case bounds on the performance of the fixed-step gradient, fast gradient and optimized gradient methods, both in the smooth convex and the smooth strongly convex cases, and deduce tight estimates of the optimal step size for the gradient method.     

Smooth submanifolds intersecting any analytic curve in a discrete set

We construct examples of C smooth submanifolds in ⁿ and ⁿ of codimension 2 and 1, which intersect every complex, respectively real, analytic curve in a discrete set. The examples are realized either as compact tori or as properly imbedded Euclidean spaces, and are the graphs of quasianalytic functions. In the complex case, these submanifolds contain real n-dimensional tori or Euclidean spaces that are not pluripolar while the intersection with any complex analytic disk is polar.Mathematics Subject Classification (2000): 32U15, 53A07, 26E10, 32U05D. Coman and E. A. Poletsky were supported by NSF grants.     

Analysis of stationary subdivision schemes for curve design based on radial basis function interpolation

This paper provides a large family of interpolatory stationary subdivision schemes based on radial basis functions (RBFs) which are positive definite or conditionally positive definite. A radial basis function considered in this study has a tension parameter λ>0 such that it provides design flexibility. We prove that for a sufficiently large , the proposed 2L-point (L∈N) scheme has the same smoothness as the well-known 2L-point Deslauriers-Dubuc scheme, which is based on 2L-1 degree polynomial interpolation. Some numerical examples are presented to illustrate the performance of the new schemes, adapting subdivision rules on bounded intervals in a way of keeping the same smoothness and accuracy of the pre-existing schemes on R. We observe that, with proper tension parameters, the new scheme can alleviate undesirable artifacts near boundaries, which usually appear to interpolatory schemes with irregularly distributed control points.     

Zero-pole interpolation for meromophic matrix functions on an algebraic curve and transfer functions of 2D systems

We formulate and solve the problem of constructing a meromorphic bundle map over a compact Riemann surface X having a prescribed zero-pole structure (including directional information). The output bundle together with the zero-pole data is prespecified while the input bundle and the bundle map are to be determined. The Riemann surface X is assumed to be (birationally) embedded as an irreducible algebraic curve in ² and both input and output bundles are assumed to be equal to the kernels of determinantal representations for X. In this setting the solution can be found as the joint transfer function of a Livsic-Kravitsky two-operator commutative vessel (2D input-output dynamical system). Also developed is the basic theory of two-operator commutative vessels and the correct analogue of the transfer function for such a system (a meromorphic bundle map between input and output bundles defined over an algebraic curve associated with the vessel) together with a state space realization, a Mittag-Leffler type interpolation theorem and the state space similarity theorem for such bundle mappings. A more abstract version of the zero-pole interpolation problem is also presented.     

smooth群的smooth同态

在smooth群的基础上通过模糊函数给出了smooth群的同态概念,并对它的一些性质进行了讨论,得到了许多漂亮的结果。     

Smooth格和强Smooth格

引入了强smooth格的概念,讨论了smooth格与强smooth格的一些基本性质,证明了强smooth格可用保任意交和Scott闭集之并的映射嵌入到某方体[0,1]X之中.     

On the trigonometric interpolation and the entire interpolation

In this paper, we study a kind of interpolation problems on a given nodal set by trigonometric polynomials of order n and entire functions of exponential type according as the nodal set is respectively. We established some equivalent conditions and found the explicit forms of some interpolation functions on the interpolation problems. As a special case, the explicit forms of fundamential functions of (0,m)-interpolat on by trigonometric case or entire functions case (in B² _σ) respectively, if they exist, may follow from our results. Besides, we also considered the convergence of the interpolation functions at above stated. Suported by the Natural Youth Science Foundation of Beijing Normal University.     

The proper interpolation space for multivariate Birkhoff interpolation

Multivariate Birkhoff interpolation problem has many important applications, such as in finite element method. In this paper two algorithms are given to compute the basis of the minimal interpolation space and the lower interpolation space respectively for an arbitrary given node set and the corresponding interpolation conditions on each node. We can get the monomial basis, Newton-type basis as well as Lagrange-type basis. The interpolation polynomial can be derived from the basis directly.     

Smooth Groups

A group is called smooth if it has a finite maximal chain of subgroups in which any two intervals of the same length are isomorphic (as lattices). We show that every finite smooth group G is a semidirect product of a p-group by a cyclic group; in particular, G is soluble. We determine the exact structure of G if G is not a p-group.