Related papers: Curve implicitization in the bivariate tensor-prod…

In this paper, we propose a linear method for $C^{(r,s)}$ approximation of rational B\'{e}zier curve with arbitrary degree polynomial curve. Based on weighted least-squares, the problem be converted to an approximation between two…

We prove that the inverse of a positive-definite matrix can be approximated by a weighted-sum of a small number of matrix exponentials. Combining this with a previous result [OSV12], we establish an equivalence between matrix inversion and…

Several cubature formulas on the cubic domains are derived using the discrete Fourier analysis associated with lattice tiling, as developed in \cite{LSX}. The main results consist of a new derivation of the Gaussian type cubature for the…

Bernstein's theorem (also called Hausdorff--Bernstein--Widder theorem) enables the integral representation of a completely monotonic function. We introduce a finite completely monotonic function, which is a completely monotonic function…

A matrix factorization problem is considered. The matrix to be factorized is algebraic, has dimension 2 X 2 and belongs to Moiseev's class. A new method of factorization is proposed. First, the matrix factorization problem is reduced to a…

In this work we present a method, based on the use of Bernstein polynomials, for the numerical resolution of some boundary values problems. The computations have not need of particular approximations of derivatives, such as finite…

We derive a variational model to fit a composite B\'ezier curve to a set of data points on a Riemannian manifold. The resulting curve is obtained in such a way that its mean squared acceleration is minimal in addition to remaining close the…

We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…

A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…

The construction of parametric curve and surface plays important role in computer aided geometric design (CAGD), computer aided design (CAD), and geometric modeling. In this paper, we define a new kind of blending functions associated with…

We prove a single sum formula for the linearization coefficients of the Bessel polynomials. In two special cases we show that our formula reduces indeed to Berg and Vignat's formulas in their proof of the positivity results about these…

The analytic implicit function theorem is extended. The function f of the theorem is integrated with respect to the dependent variable of the implicit function. A geometrical interpretation is given for the sub-geometry of the integral…

Bayesian inference is applied directly to the problem of unfolding. The outcome is a posterior probability density for the spectrum before smearing, defined in the multi-dimensional space of all possible spectra. Regularization consists in…

In this paper we consider plane quartics with to involutions. We compute the Dixmier invariants, the bitangents and the Matrix representation problem of these curves, showing that they have symbolic solutions for the last two questions.

In this paper, we first present an explicit expression for the inverse\emph{} of a type of matrices. As special applications, the inverse of some matrices arising from implicit time integration techniques, such as the well-known implicit…

Solving Bayesian inverse problems typically involves deriving a posterior distribution using Bayes' rule, followed by sampling from this posterior for analysis. Sampling methods, such as general-purpose Markov chain Monte Carlo (MCMC), are…

We consider the system -\Delta u_j + a(x)u_j = \mu_j u_j^3 + \be\sum_{k\ne j}u_k^2u_j, u_j>0, \qquad j=1,...,n, on a possibly unbounded domain $\Om\subset\R^N$, $N\le3$, with Dirichlet boundary conditions. The system appears in nonlinear…

We extend kernelized matrix factorization with a fully Bayesian treatment and with an ability to work with multiple side information sources expressed as different kernels. Kernel functions have been introduced to matrix factorization to…

Interested in formalizing the generation of fast running code for linear algebra applications, the authors show how an index-free, calculational approach to matrix algebra can be developed by regarding matrices as morphisms of a category…

Nested sums containing binomial coefficients occur in the computation of massive operator matrix elements. Their associated iterated integrals lead to alphabets including radicals, for which we determined a suitable basis. We discuss…