相关论文: Generalized $C^1$ quadratic B-splines generated by…

Using neural networks to solve variational problems, and other scientific machine learning tasks, has been limited by a lack of consistency and an inability to exactly integrate expressions involving neural network architectures. We address…

Let G be a graph whose edges are labeled by positive integers. Label each vertex with an integer and suppose if two vertices are joined by an edge, the vertex labels are congruent to each other modulo the edge label. The set of vertex…

In this paper we study scalar multivariate subdivision schemes with general integer expanding dilation matrix. Our main result yields simple algebraic conditions on the symbols of such schemes that characterize their polynomial…

In the classical theory of cubic interpolation splines there exists an algorithm which works with only $O\left( n\right)$ arithmetic operations. Also, the smoothing cubic splines may be computed via the algorithm of Reinsch which reduces…

We generalize the submodel of nonlinear CP^1 models. The generalized models include higher order derivatives. For the systems of higher order equations, we construct a B\"acklund-like transformation of solutions and an infinite number of…

Although Galerkin discretizations have been intensively employed in the IgA context, an efficient implementation requires special numerical quadrature rules when constructing the system of equations. To avoid this issue, isogeometric…

The regularity of refinable functions has been analysed in an extensive literature and is well-understood in two cases: 1) univariate 2) multivariate with an isotropic dilation matrix. The general (non-isotropic) case offered a great…

We use a construction which we call generalized cylinders to give a new proof of the fundamental theorem of hypersurface theory. It has the advantage of being very simple and the result directly extends to semi-Riemannian manifolds and to…

We discuss the direct use of cubic-matrix splines to obtain continuous approximations to the unique solution of matrix models of the type $Y''(x) = f(x,Y(x))$. For numerical illustration, an estimation of the approximation error, an…

We introduce a finite element construction for use on the class of convex, planar polygons and show it obtains a quadratic error convergence estimate. On a convex n-gon satisfying simple geometric criteria, our construction produces 2n…

We describe a new algorithm for computing Whitney stratifications of complex projective varieties. The main ingredients are (a) an algebraic criterion, due to L\^e and Teissier, which reformulates Whitney regularity in terms of conormal…

A standard construction in approximation theory is mesh refinement. For a simplicial or polyhedral mesh D in R^k, we study the subdivision D' obtained by subdividing a maximal cell of D. We give sufficient conditions for the module of…

BSplines are one of the most promising curves in computer graphics. They are blessed with some superior geometric properties which make them an ideal candidate for several applications in computer aided design industry. In this article,…

We establish several fundamental properties of analysis-suitable T-splines which are important for design and analysis. First, we characterize T-spline spaces and prove that the space of smooth bicubic polynomials, defined over the extended…

Given a system of triangles in the plane $\mathbb{R}^2$ along with given data of function and gradient values at the vertices, we describe the general pattern of local linear methods invoving only four smooth standard shape functions which…

On some specified convex supporting sets of spheres, we find a generalized longitude function whose level sets are totally geodesic. Given an arbitrary (weakly) harmonic map into spheres, the composition of the generalized longitude…

We study geodesically convex (g-convex) problems that can be written as a difference of Euclidean convex functions. This structure arises in several optimization problems in statistics and machine learning, e.g., for matrix scaling,…

We show that parametric context-sensitive L-systems with affine geometry interpretation provide a succinct description of some of the most fundamental algorithms of geometric modeling of curves. Examples include the Lane-Riesenfeld…

This paper studies generalized semi-infinite programs (GSIPs) defined with polyhedral parameter sets. Assume these GSIPs are given by polynomials. We propose a new approach to solve them as a disjunctive program. This approach is based on…

This paper provides a survey of spherical designs and their applications, with a particular emphasis on the perspective of ``numerical analysis''. A set \(X_N\) of \(N\) points on the unit sphere \(\mathbb{S}^d\) is called a…