Related papers: Nonlinear Craig Interpolant Generation over Unboun…
In recent years many efforts have been devoted to finding bidiagonal factorizations of nonsingular totally positive matrices, since their accurate computation allows to numerically solve several important algebraic problems with great…
A new class of univariate stationary interpolatory subdivision schemes of dual type is presented. As opposed to classical primal interpolatory schemes, these new schemes have masks with an even number of elements and are not step-wise…
In this paper we define a family of nonlinear, stationary, interpolatory subdivision schemes with the capability of reproducing conic shapes including polynomials upto second order. Linear, non-stationary, subdivision schemes do also…
As we all known, there is still a long way for us to solve arbitrary multivariate Lagrange interpolation in theory. Nevertheless, it is well accepted that theories about Lagrange interpolation on special point sets should cast important…
We here specialize the standard matrix-valued polynomial interpolation to the case where on the imaginary axis the interpolating polynomials admit various symmetries: Positive semidefinite, Skew-Hermitian, $J$-Hermitian, Hamiltonian and…
The classical polynomial interpolation problem in several variables can be generalized to the case of points with greater multiplicities. What is known, as yet, is essentially concentrated in the Alexander-Hirschowitz Theorem which says…
The polynomial kernels are widely used in machine learning and they are one of the default choices to develop kernel-based classification and regression models. However, they are rarely used and considered in numerical analysis due to their…
Semialgebraic splines are functions that are piecewise polynomial with respect to a cell decomposition into sets defined by polynomial inequalities. We study bivariate semialgebraic splines, formulating spaces of semialgebraic splines in…
In \cite{Craig}, we introduced a syntactically defined and highly general class of calculi known as \emph{semi-analytic}. We then demonstrated that any sufficiently strong (modal) substructural logic with a semi-analytic calculus must…
Polynomial and spline quasi-interpolants (QIs) are practical and effective approximation operators. Among their remarkable properties, let us cite for example: good shape properties, easy computation and evaluation (no linear system to…
We provide elementary identities relating the three known types of non-symmetric interpolation Macdonald polynomials. In addition we derive a duality for non-symmetric interpolation Macdonald polynomials. We consider some applications of…
The Multiquadric Radial Basis Function (MQ) Method is a meshless collocation method with global basis functions. It is known to have exponentional convergence for interpolation problems. We descretize nonlinear elliptic PDEs by the MQ…
This paper contains a review of available methods for establishing improved interpolation inequalities on the sphere for subcritical exponents. Pushing further these techniques we also establish some new results, clarify the range of…
Existing structural analysis methods may fail to find all hidden constraints for a system of differential-algebraic equations with parameters if the system is structurally unamenable for certain values of the parameters. In this paper, for…
We present a new technique for the interpolation of discretely-sampled non-negat ive scalar fields across regions of missing data. Any set of basis functions can be used, though the method is fastest when they are close to orthogonal. We…
Fourier series multiscale method, a concise and efficient analytical approach for multiscale computation, will be developed out of this series of papers. In the third paper, the analytical analysis of multiscale phenomena inherent in the…
A probabilistic representation for initial value semilinear parabolic problems based on generalized random trees has been derived. Two different strategies have been proposed, both requiring generating suitable random trees combined with a…
In this paper, we tackle the parametric complete multiplicity problem for a univariate polynomial. Our approach to the parametric complete multiplicity problem has a significant difference from the classical method, which relies on repeated…
A multilevel kernel-based interpolation method, suitable for moderately high-dimensional function interpolation problems, is proposed. The method, termed multilevel sparse kernel-based interpolation (MLSKI, for short), uses both level-wise…
We study a generalization of the classical correspondence between homogeneous quadratic polynomials, quadratic forms, and symmetric/alternating bilinear forms to forms in $n$ variables. The main tool is combinatorial polarization, and the…