相关论文: Generalized $C^1$ quadratic B-splines generated by…
We formulate as an inverse problem the construction of sparse parametric continuous curve models that fit a sequence of contour points. Our prior is incorporated as a regularization term that encourages rotation invariance and sparsity. We…
Generalizing tensor-product splines to smooth functions whose control nets outline topological polyhedra, bi-cubic polyhedral splines form a piecewise polynomial, first-order differentiable space that associates one function with each…
A new differential-recurrence relation for the B-spline functions of the same degree is proved. From this relation, a recursive method of computing the coefficients of B-spline functions of degree $m$ in the Bernstein-B\'{e}zier form is…
Gaussian processes~(Kriging) are interpolating data-driven models that are frequently applied in various disciplines. Often, Gaussian processes are trained on datasets and are subsequently embedded as surrogate models in optimization…
A new robust algorithm for the numerical computation of biarcs, i.e. $G^1$ curves composed of two arcs of circle, is presented. Many algorithms exist but are based on geometric constructions, which must consider many geometrical…
For the space $\mathcal{S}$ of $C^3$ quintics on the Powell-Sabin 12-split of a triangle, we determine the simplex splines in $\mathcal{S}$ and the six symmetric simplex spline bases that reduce to a B-spline basis on each edge, have a…
This paper proposes a strategy to solve the problems of the conventional s-version of finite element method (SFEM) fundamentally. Because SFEM can reasonably model an analytical domain by superimposing meshes with different spatial…
A fast algorithm for B-splines in mixed models is presented. B-splines have local support and are computational attractive, because the corresponding matrices are sparse. A key element of the new algorithm is that the local character of…
Locally refined spline surfaces (LRB) is a representation well suited for scattered data approximation. When a data set has local details in some areas and is largely smooth in other, LR B-splines allow the spatial distribution of degrees…
The physical consistency of the match of piecewise-$C^0$ metrics is discussed. The mathematical theory of gravitational discontinuity hypersurfaces is generalized to cover the match of regularly discontinuous metrics. The mean-value…
This paper proposes to generalize linear subdivision schemes to nonlinear subdivision schemes for curve and surface modeling by refining vertex positions together with refinement of unit control normals at the vertices. For each round of…
Given a graphical model (GM), computing its partition function is the most essential inference task, but it is computationally intractable in general. To address the issue, iterative approximation algorithms exploring certain local…
In this paper, we introduce a novel non-linear uniform subdivision scheme for the generation of curves in $\mathbb{R}^n$, $n\geq2$. This scheme is distinguished by its capacity to reproduce second-degree polynomial data on non-uniform grids…
In this work, we present some new integration formulas for any order of accuracy as an application of the B-spline relations obtained in [1]. The resulting rules are defined as a perturbation of the trapezoidal integration method. We prove…
This paper further develops the Method of Matched Sections (MMS), a robust numerical framework for the solution of boundary value problems governed by partial differential equations. It demonstrates its unique applicability to the…
This paper pursues a twofold goal. First, we introduce and study in detail a new notion of variational analysis called generalized metric subregularity, which is a far-going extension of the conventional metric subregularity conditions. Our…
Multivariate piecewise polynomial functions (or splines) on polyhedral complexes have been extensively studied over the past decades and find applications in diverse areas of applied mathematics including numerical analysis, approximation…
Let $R$ be a commutative ring with identity and $G$ a graph. \emph{An extending generalized spline} on $G$ is a vertex labeling $f \in \prod_{v} M_v$ such that at each edge $e=uv$ there is an $R$-module $M_{uv}$ together with homomorphisms…
This paper develops a generalization of the line-search sequential quadratic programming (SQP) algorithm with $\ell_1$-merit function that uses objective and constraint function approximations with tunable accuracy to solve smooth…
This paper derives new algorithms for signomial programming, a generalization of geometric programming. The algorithms are based on a generic principle for optimization called the MM algorithm. In this setting, one can apply the…