Related papers: A mixed interpolation-regression method for numeri…
A new construction of an absorbing boundary condition for indefinite Helmholtz problems on unbounded domains is presented. This construction is based on a near-best uniform rational interpolant of the inverse square root function on the…
We investigate the numerical approximation of integrals over $\mathbb{R}^d$ equipped with the standard Gaussian measure $\gamma$ for integrands belonging to the Gaussian-weighted Sobolev spaces $W^\alpha_p(\mathbb{R}^d, \gamma)$ of mixed…
Spectral approximation by polynomials on the unit ball is studied in the frame of the Sobolev spaces $W^{s}_p(\ball)$, $1<p<\infty$. The main results give sharp estimates on the order of approximation by polynomials in the Sobolev spaces…
In this article, numerical integration is formulated as evaluation of a matrix function of a matrix that is obtained as a projection of the multiplication operator on a finite-dimensional basis. The idea is to approximate the continuous…
We present a nonlinear interpolation technique for parametric fields that exploits optimal transportation of coherent structures of the solution to achieve accurate performance. The approach generalizes the nonlinear interpolation procedure…
We present two developments for the numerical integration of a function over the Brillouin zone. First, we introduce a nonuniform grid, which we refer to as the Farey grid, that generalizes regular grids. Second, we introduce…
We give a new probabilistic algorithm for interpolating a "sparse" polynomial f given by a straight-line program. Our algorithm constructs an approximation f* of f, such that their difference probably has at most half the number of terms of…
Provided a special function of one variable and some of its derivatives can be accurately computed over a finite range, a method is presented to build a series of polynomial approximations of the function with a defined relative error over…
Our starting point is a basic problem in Hermite interpolation theory, namely determining the least degree of a homogeneous polynomial that vanishes to some specified order at every point of a given finite set. We solve this problem if the…
Orthogonal Laurent polynomials in the unit circle and the theory of Toda-like integrable systems are connected using the Gauss--Borel factorization of a Cantero-Moral-Velazquez moment matrix, which is constructed in terms of a complex…
The recursive Neville algorithm allows one to calculate interpolating functions recursively. Upon a judicious choice of the abscissas used for the interpolation (and extrapolation), this algorithm leads to a method for convergence…
We establish a new perturbation theory for orthogonal polynomials using a Riemann--Hilbert approach and consider applications in numerical linear algebra and random matrix theory. This new approach shows that the orthogonal polynomials with…
An improved method is presented for the numerical evaluation of multi-loop integrals in dimensional regularization. The technique is based on Mellin-Barnes representations, which have been used earlier to develop algorithms for the…
The semi-Lagrangian method using the hybrid-cubic-rational interpolation function [M. Ida, Comput. Fluid Dyn. J. 10 (2001) 159] is modified to a conservative method by incorporating the concept discussed in [R. Tanaka et al., Comput. Phys.…
We present the powerful module-intersection integration-by-parts (IBP) method, suitable for multi-loop and multi-scale Feynman integral reduction. Utilizing modern computational algebraic geometry techniques, this new method successfully…
The Fourier extension method, also known as the Fourier continuation method, is a method for approximating non-periodic functions on an interval using truncated Fourier series with period larger than the interval on which the function is…
Equivalence between algebraic equations of motion may be detected by using a $p$-adic method, methods using factorization and linear algebra, or by systematic computer search of suitable Tschirnhausen transformations. Here, we show standard…
Nonsymmetric interpolation Laurent polynomials in $n$ variables are introduced, with the interpolation points depending on $q$ and on a $n$-tuple of parameters $\tau=(\tau_1,\ldots,\tau_n)$. When $\tau_i=st^{n-i}$ Okounkov's $3$-parameter…
In this paper we propose a new efficient interpolation tool, extremely suitable for large scattered data sets. The partition of unity method is used and performed by blending Radial Basis Functions (RBFs) as local approximants and using…
Shuffled linear regression (SLR) seeks to estimate latent features through a linear transformation, complicated by unknown permutations in the measurement dimensions. This problem extends traditional least-squares (LS) and Least Absolute…