Related papers: Recursive algorithms for computing Birkhoff interp…
This paper proposes an efficient symbolic-numeric method to compute the integrals in the successive Galerkin approximation (SGA) of the Hamilton-Jacobi-Bellman (HJB) equation. A solution of the HJB equation is first approximated with a…
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…
We present an entirely new geometric and probabilistic approach to synchronization of correspondences across multiple sets of objects or images. In particular, we present two algorithms: (1) Birkhoff-Riemannian L-BFGS for optimizing the…
In this work, we study the Hermite interpolation on $n$-dimensional non-equally spaced, rectilinear grids over a field $\Bbbk $ of characteristic zero, given the values of the function at each point of the grid and the partial derivatives…
In this work we show how to get advantage from the Riemann--Hilbert analysis in order to obtain information about the matrix orthogonal polynomials and functions of second kind associated with a weight matrix. We deduce properties for the…
We present a new rational approximation algorithm based on the empirical interpolation method for interpolating a family of parametrized functions to rational polynomials with invariant poles, leading to efficient numerical algorithms for…
We present a new closed form for the interpolating polynomial of the general univariate Hermite interpolation that requires only calculation of polynomial derivatives, instead of derivatives of rational functions. This result is used to…
An effective solution to the problem of Hermite $G^1$ interpolation with a clothoid curve is provided. At the beginning the problem is naturally formulated as a system of nonlinear equations with multiple solutions that is generally…
In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm…
Gaussian radial basis functions can be an accurate basis for multivariate interpolation. In practise, high accuracies are often achieved in the flat limit where the interpolation matrix becomes increasingly ill-conditioned. Stable…
This paper introduces the recursive sweeping preconditioner for the numerical solution of the Helmholtz equation in 3D. This is based on the earlier work of the sweeping preconditioner with the moving perfectly matched layers (PMLs). The…
We introduce a family of piecewise-exponential functions that have the Hermite interpolation property. Our design is motivated by the search for an effective scheme for the joint interpolation of points and associated tangents on a curve…
Zeilberger's algorithm provides a method to compute recurrence and differential equations from given hypergeometric series representations, and an adaption of Almquist and Zeilberger computes recurrence and differential equations for…
Motivated by classical results of approximation theory, we define an Hermite-type interpolation in terms of $n$-dimensional subspaces of the space of $n$ times continuously differentiable functions. In the main result of this paper, we…
Many matching, tracking, sorting, and ranking problems require probabilistic reasoning about possible permutations, a set that grows factorially with dimension. Combinatorial optimization algorithms may enable efficient point estimation,…
The interpolation-regression approximation is a powerful tool in numerical analysis for reconstructing functions defined on square or triangular domains from their evaluations at a regular set of nodes. The importance of this technique lies…
We present algorithms for computing the reduced Gr\"{o}bner basis of the vanishing ideal of a finite set of points in a frame of ideal interpolation. Ideal interpolation is defined by a linear projector whose kernel is a polynomial ideal.…
We introduce an interpolation--regression operator for polynomial approximation on the unit sphere $\mathbb{S}^2$ from discrete samples. The approximant is a spherical polynomial of degree $r$ which interpolates the data on a prescribed…
In this paper we propose a fast algorithm for trivariate interpolation, which is based on the partition of unity method for constructing a global interpolant by blending local radial basis function interpolants and using locally supported…
The aim of this work is to show how symbolic computation can be used to perform multivariate Lagrange, Hermite and Birkhoff interpolation and help us to build more realistic interpolating functions. After a theoretical introduction in which…