Related papers: Calculating a function of a matrix with a real spe…
The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…
multiplication operator on a Hilbert space may be approximated with finite sections by choosing an orthonormal basis of the Hilbert space. Nonzero multiplication operators on $L^2$ spaces of functions are never compact and then such…
The method of constructing Hermite trigonometric polynomials, which interpolate the values of a certain periodic function and its derivatives up to (including ) the -th ( ) order in nodes of a uniform grid, is considered. The proposed…
This paper explores the reconstruction of a real-valued function $f$ defined over a domain $\Omega \subset \mathbb{R}^2$ using bivariate polynomials that satisfy triangular histopolation conditions. More precisely, we assume that only the…
A new scaling and recovering algorithm is proposed for simultaneously computing the matrix $\varphi$-functions that arise in exponential integrator methods for the numerical solution of certain first-order systems of ordinary differential…
We assume some standard choices for the branch cuts of a group of functions and consider the problem of then calculating the branch cuts of expressions involving those functions. Typical examples include the addition formulae for inverse…
Fourier series multiscale method, a concise and efficient analytical approach for multiscale computation, will be developed out of this series of papers. The second paper is concerned with simultaneous approximation to functions and their…
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 f be a real or complex polynomial. We give an algorithm to compute the set of generalized critical values. The algorithm uses a finite dimensional space of rational arcs along which we can reach all generalized critical values of f.
We give a representation of the classical theory of multiplicative arithmetic functions (MF)in the ring of symmetric polynomials. The basis of the ring of symmetric polynomials that we use is the isobaric basis, a basis especially sensitive…
We design a sublinear-time approximation algorithm for quadratic function minimization problems with a better error bound than the previous algorithm by Hayashi and Yoshida (NIPS'16). Our approximation algorithm can be modified to handle…
This paper shows that, for matrix multiplications and convolutions, it is possible to asymptotically replace each real multiplication with a single squaring operation. Similarly, a single complex multiplication can be replaced with 3…
This paper shows that it is possible to improve the computational cost, the memory requirements and the accuracy of Quick Fourier Transform (QFT) algorithm for power-of-two FFT (Fast Fourier Transform) just introducing a slight modification…
A numerical approach to compute tensor integrals in one-loop calculations is presented. The algorithm is based on a recursion relation which allows to express high rank tensor integrals as a function of lower rank ones. At each level of…
Explicit time advancement for continuous finite elements requires the inversion of a global mass matrix. For spectral element simulations on quadrilaterals and hexahedra, there is an accurate approximate mass matrix which is diagonal,…
This paper introduces a factorization for the inverse of discrete Fourier integral operators that can be applied in quasi-linear time. The factorization starts by approximating the operator with the butterfly factorization. Next, a…
We have developed a method for constructing spectral approximations for convolution operators of Fredholm type. The algorithm we propose is numerically stable and takes advantage of the recurrence relations satisfied by the entries of such…
We show that the existing methods for computing the f(\alpha) spectrum from a time series can be improved by using a new algorithmic scheme. The scheme relies on the basic idea that the smooth convex profile of a typical f(\alpha) spectrum…
Based on tensor neural network, we propose an interpolation method for high dimensional non-tensor-product-type functions. This interpolation scheme is designed by using the tensor neural network based machine learning method. This means…
We derive a useful expression for the matrix elements $[\frac{\partial f[A(t)]}{\partial t}]_{i j}$ of the derivative of a function $f[A(t)]$ of a diagonalizable linear operator $A(t)$ with respect to the parameter $t$. The function…