Related papers: Fast non-polynomial interpolation and integration …
We propose stochastic splitting algorithms for solving large-scale composite inclusion problems involving monotone and linear operators. They activate at each iteration blocks of randomly selected resolvents of monotone operators and,…
We present and analyze an approximation scheme for a class of highly oscillatory kernel functions, taking the 2D and 3D Helmholtz kernels as examples. The scheme is based on polynomial interpolation combined with suitable pre- and…
If L is a complete ortholattice, f any partial function from L^n to L, then there is a complete ortholattice L* containing L as a subortholattice, and an ortholattice polynomial with coefficients in L* which represents f on L^n. Iterating…
This paper gives some results for the logarithm of the Riemann zeta-function and its iterated integrals. We obtain a certain explicit approximation formula for these functions. The formula has some applications, which are related with the…
This article presents two methods, in parallel, of solving more complex integrals, among which is the Poisson's integral, in order to emphasize the obvious advantages of a new method of integration, which uses the supermathematics circular…
Given a convergent sequence of nodes we present a one-dimensional-holomorphic-function version of the Newton interpolation method of polynomials. It also generalises the Taylor and the Laurent formula. In other words, we present an…
We introduce a novel type of approximation spaces for functions with values in a nonlinear manifold. The discrete functions are constructed by piecewise polynomial interpolation in a Euclidean embedding space, and then projecting pointwise…
We present a method to construct a suitable contour deformation in loop momentum space for multi-loop integrals. This contour deformation can be used to perform the integration for multi-loop integrals numerically. The integration can be…
In this paper we study the consequences of overinterpolation, i.e., the situation when a function can be interpolated by polynomial, or rational, or algebraic functions in more points that normally expected. We show that in many cases such…
A trigonometric interpolation algorithm for non-periodic functions has been recently proposed and applied to study general ordinary differential equation (ODE). This paper enhances the algorithm to approximate functions in $2$-dim space.…
An algorithm for a family of self-starting high-order implicit time integration schemes with controllable numerical dissipation is proposed for both linear and nonlinear transient problems. This work builds on the previous works of the…
The polysymplectic analysis of the Short Pulse Equation known in nonlinear optics is used in order to construct a geometric polysymplectic integrator for it. The proposed scheme turns out to be much more effective than other standard…
An additive fast Fourier transform over a finite field of characteristic two efficiently evaluates polynomials at every element of an $\mathbb{F}_2$-linear subspace of the field. We view these transforms as performing a change of basis from…
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…
Let p be prime and Zpn the degree n unramified extension of the ring of p-adic integers Zp. In this paper we give an overview of some very fast algorithms for common operations in Zpn modulo p^N. Combining existing methods with recent work…
In this article, we develop a new method to approximate numerically the fractional Laplacian of functions defined on $\mathbb R$, as well as some more general singular integrals. After mapping $\mathbb R$ into a finite interval, we…
The suitable basis functions for approximating periodic function are periodic, trigonometric functions. When the function is not periodic, a viable alternative is to consider polynomials as basis functions. In this paper we will point out…
From tabulated nuclear and degenerate equations of state to photon and neutrino opacities, to nuclear reaction rates: tabulated data is ubiquitous in computational astrophysics. The dynamic range that must be covered by these tables…
In this paper we explore acceleration techniques for large scale nonconvex optimization problems with special focuses on deep neural networks. The extrapolation scheme is a classical approach for accelerating stochastic gradient descent for…
The article considers linear functions of many (n) variables - multilinear polynomials (MP). The three-steps evaluation is presented that uses the minimal possible number of floating point operations for non-sparse MP at each step. The…