Related papers: Laguerre polynomials and the inverse Laplace trans…
In this paper, we propose a numerical method of computing an integral whose integrand is a slowly decaying oscillatory function. In the proposed method, we consider a complex analytic function in the upper-half complex plane, which is…
For a given wave function one can define a quantity $\mu_E$ having a meaning of its inverse spatial size. The Laplace transform of the distribution function $P(\mu_E)$ is calculated analytically for a 1D disordered sample with a finite…
The purpose of this paper is to introduce several new convolution operators, generated by some known probability densities. By using the inverse Fourier transform and taking inverse steps (in the analogues of the classical procedures used…
For a division ring $\mathbb F$, the polynomials $f\in\mathbb F$ can be evaluated "on the left" and "on the right" giving rise to left and right Lagrange interpolation problems. The problems containig interpolation conditions of the same…
We discuss a pointwise numerical differentiation formula on multivariate scattered data, based on the coefficients of local polynomial interpolation at Discrete Leja Points, written in Taylor's formula monomial basis. Error bounds for the…
Matrix functions are a central topic of linear algebra, and problems requiring their numerical approximation appear increasingly often in scientific computing. We review various limited-memory methods for the approximation of the action of…
We study approximations to the Moreau envelope -- and infimal convolutions more broadly -- based on Laplace's method, a classical tool in analysis which ties certain integrals to suprema of their integrands. We believe the connection…
We investigate some conditions under which the Lebesgue constants or Lebesgue functions are bounded for the classical Lagrange polynomial interpolation on a compact subset of $\mathbb R$. In particular, relationships of such boundedness…
We prove a multivariate Lagrange-Good formula for functionals of uncountably many variables and investigate its relation with inversion formulas using trees. We clarify the cancellations that take place between the two aforementioned…
I show that the general implicit-function problem (or parametrized fixed-point problem) in one complex variable has an explicit series solution given by a trivial generalization of the Lagrange inversion formula. I give versions of this…
Graph-based approximation methods are of growing interest in many areas, including transportation, biological and chemical networks, financial models, image processing, network flows, and more. In these applications, often a basis for the…
In this paper, positive solutions to the Laplace equation with 1-dimensional circular singularities are investigated. First, we establish $L^p$ integrability estimates for such solutions $u$ near the singularities, in comparison with…
We introduce the Schur class of functions, discrete analytic on the integer lattice in the complex plane. As a special case, we derive the explicit form of discrete analytic Blaschke factors and solve the related basic interpolation…
In this paper we investigate polynomial interpolation using orthogonal polynomials. We use weight functions associated with orthogonal polynomials to define a weighted form of Lagrange interpolation. We introduce an upper bound of error…
In this paper, the discontinuous Petrov--Galerkin approximation of the Laplace eigenvalue problem is discussed. We consider in particular the primal and ultra weak formulations of the problem and prove the convergence together with a priori…
We address the problem of evaluating an $L$-function when only a small number of its Dirichlet coefficients are known. We use the approximate functional equation in a new way and find that is possible to evaluate the $L$-function more…
We give an algorithm to compute weighted Ehrhart functions of lattice polytopes for polynomial weights using Lagrange interpolation. We show how to compute generating functions of polynomials using those of unit cubes and Eulerian numbers,…
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…
In this paper, we introduce a novel semi-analytical method for solving a broad class of initial value problems involving differential, integro-differential, and delay equations, including those with fractional and variable-order…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…