Related papers: A mixed interpolation-regression method for numeri…
In this article we offer some modification of Monte-Carlo method for multiple parametric integral computation and solving of a linear integral Fredholm equation of a second kind (well posed problem). We prove that the rate of convergence of…
This paper considers filtered polynomial approximations on the unit sphere $\mathbb{S}^d\subset \mathbb{R}^{d+1}$, obtained by truncating smoothly the Fourier series of an integrable function $f$ with the help of a "filter" $h$, which is a…
We outline the super-resolution reconstruction problem posed as a maximization of probability. We then introduce an interpolation method based on polygonal pixel overlap, express it as a linear operator, and use it to improve…
To evaluate the Hadamard finite-part integrals accurately, a novel interpolatory-type quadrature is proposed in this article. In our approach, numerical divided difference is utilized to represent the high order derivatives of the…
A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient method which can avoid singularities and breakdowns in the…
Approximate solutions of linear and nonlinear integral equations using methods related to an interpolatory projection involve many integrals which need to be evaluated using a numerical quadrature formula. In this paper, we consider…
We propose a method for interpolating divergence-free continuous magnetic fields via vector potential reconstruction using Hermite interpolation, which ensures high-order continuity for applications requiring adaptive, high-order ordinary…
In this paper, we describe a numerical approach to evaluate Feynman loop integrals. In this approach the key technique is a combination of a numerical integration method and a numerical extrapolation method. Since the computation is carried…
This article is devoted to developing a theory for effective kernel interpolation and approximation in a general setting. For a wide class of compact, connected $C^\infty$ Riemannian manifolds, including the important cases of spheres and…
The fast multipole method (FMM) has had great success in reducing the computational complexity of solving the boundary integral form of the Helmholtz equation. We present a formulation of the Helmholtz FMM that uses Fourier basis functions…
Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…
This paper investigates the numerical approximation of integrals for functions in fractional Gaussian Sobolev spaces $W^s_{p}(\mathbb{R}^d,\gamma)$ with dominating mixed smoothness defined via kernel related to the fractional…
In this paper we present a novel framework for obtaining high-order numerical methods for scalar conservation laws in one-space dimension for both the homogeneous and non-homogeneous case. The numerical schemes for these two settings are…
This work is concerned with the kernel-based approximation of a complex-valued function from data, where the frequency response function of a partial differential equation in the frequency domain is of particular interest. In this setting,…
In this work, we address the problem of polynomial interpolation of non-pointwise data. More specifically, we assume that our input information comes from measurements obtained on diffuse compact domains. Although the nodal and the diffused…
We consider the classical problems of interpolating a polynomial given a black box for evaluation, and of multiplying two polynomials, in the setting where the bit-lengths of the coefficients may vary widely, so-called unbalanced…
Aims. We use Hermite splines to interpolate pressure and its derivatives simultaneously, thereby preserving mathematical relations between the derivatives. The method therefore guarantees that thermodynamic identities are obeyed even…
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial $F \in \mathbb{C}[x]$ of degree $n$ at $n$ complex-valued points can be done with $\tilde{O}(n)$ exact field operations in…
We consider interpolation-based derivative-free optimization in settings where only some derivatives are available. Such situations arise naturally in scientific computing applications involving simulations, adjoint-enabled components,…
We develop the convergence theory for a well-known method for the interpolation of functions on the real axis with rational functions. Precise new error estimates for the interpolant are de- rived using existing theory for trigonometric…