Related papers: The Spectral Basis and Rational Interpolation
Given a "black box" function to evaluate an unknown rational polynomial f in Q[x] at points modulo a prime p, we exhibit algorithms to compute the representation of the polynomial in the sparsest shifted power basis. That is, we determine…
We consider the problem of interpolating a function given on scattered points using Hermite-Birkhoff formulas on the sphere and other manifolds. We express each proposed interpolant as a linear combination of basis functions, the…
As a generalization of Hermite interpolation problem, Birkhoff interpolation is an important subject in numerical approximation. This paper generalizes the existing Generalized Recursive Polynomial Interpolation Algorithm (GRPIA) that is…
The calculation of scattering amplitudes at higher orders in perturbation theory has reached a high degree of maturity. However, their usage to produce physical predictions within Monte Carlo programs is often precluded by the slow…
One commonly finds in applications of smooth radial basis functions (RBFs) that scaling the kernels so they are `flat' leads to smaller discretization errors. However, the direct numerical approach for computing with flat RBFs (RBF-Direct)…
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.…
This thesis is intended to provide an account of the theory and applications of Operational Methods that allow the "translation" of the theory of special functions and polynomials into a "different" mathematical language. The language we…
The paper deals with a special filtered approximation method, which originates interpolation polynomials at Chebyshev zeros by using de la Vall\'ee Poussin filters. These polynomials can be an useful device for many theoretical and…
Let T(x) in k[x] be a monic non-constant polynomial and write R=k[x] / (T) the quotient ring. Consider two bivariate polynomials a(x, y), b(x, y) in R[y]. In a first part, T = p^e is assumed to be the power of an irreducible polynomial p. A…
A nonstandard application of bivariate polynomial interpolation is discussed: the implicitization of a rational algebraic curve given by its parametric equations. Three different approaches using the same interpolation space are considered,…
Interpolation is a fundamental technique in scientific computing and is at the heart of many scientific visualization techniques. There is usually a trade-off between the approximation capabilities of an interpolation scheme and its…
Multivariate global polynomial approximations - such as polynomial chaos or stochastic collocation methods - are now in widespread use for sensitivity analysis and uncertainty quantification. The pseudospectral variety of these methods uses…
An analogue of the Euclidean algorithm for square matrices of size 2 with integral non-negative entries and strictly positive determinant $n$ defines a finite set $\mathcal{R}(n)$ of Euclid-reduced matrices corresponding to elements of…
Spectroscopic measurements can show distorted spectral shapes arising from a mixture of absorbing and scattering contributions. These distortions (or baselines) often manifest themselves as non-constant offsets or low-frequency…
We establish precise convergence rates for semi-discrete schemes based on Radial Basis Function interpolation, as well as approximate approximation results for such schemes. Our schemes use stationary interpolation on regular grids, with…
Finding suitable points for multivariate polynomial interpolation and approximation is a challenging task. Yet, despite this challenge, there has been tremendous research dedicated to this singular cause. In this paper, we begin by…
We consider the problem of estimating a consensus community structure by combining information from multiple layers of a multi-layer network using methods based on the spectral clustering or a low-rank matrix factorization. As a general…
Approximation/interpolation from spaces of positive definite or conditionally positive definite kernels is an increasingly popular tool for the analysis and synthesis of scattered data, and is central to many meshless methods. For a set of…
We give a complete characterization of limiting interpolation spa\-ces for the real method of interpolation using extrapolation theory. For this purpose the usual tools (e.g., Boyd indices or the boundedness of Hardy type operators) are not…
In this paper, we continue our previous work on the reduction of algebraic lattices over imaginary quadratic fields for the special case when the lattice is spanned over a two dimensional basis. In particular, we show that the…