Related papers: Two Methods for Numerical Inversion of the Z-Trans…
In this paper we extend the Zeta function regularization technique, which gives a meaningful solution to divergent power series, in order to assign finite values to divergent integral of certain transcendental functions $f(x)$. The…
We introduce two efficient algorithms for computing the partial Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to…
In many practical applications, spatial data are often collected at areal levels (i.e., block data) and the inferences and predictions about the variable at points or blocks different from those at which it has been observed typically…
Estimating camera geometry typically involves solving minimal problems formulated as systems of multivariate polynomial equations, which often pose computational challenges when using existing Gr\"obner-basis or resultant-based methods due…
This article is meant to give a lucid and widely accessible, self-contained account of a novel way of performing arithmetic operations on fuzzy intervals. Based on two formulae of generalized inversion (the first in close analogy to the…
In this paper, we focus on Fourier analysis and holographic transforms for signal representation. For instance, in the case of image processing, the holographic representation has the property that an arbitrary portion of the transformed…
This work introduces a new inversion formula for analytical functions. It is simple, generally applicable and straightforward to use both in hand calculations and for symbolic machine processing. It is easier to apply than the traditional…
Let $F(z)=z-H(z)$ with $o(H(z))\geq 2$ be a formal map from $\bC^n$ to $\bC^n$ and $G(z)$ the formal inverse of $F(z)$. In this paper, we fist study the deformation $F_t(z)=z-tH(z)$ and its formal inverse map $G_t(z)$. We then derive two…
Channel estimation is one of the most important parts in current mobile communication systems. Among the huge contributions in channel estimation studies, the discrete Fourier transform (DFT)-based channel estimation has attracted lots of…
In semiclassical theories for chaotic systems such as Gutzwiller's periodic orbit theory the energy eigenvalues and resonances are obtained as poles of a non-convergent series g(w)=sum_n A_n exp(i s_n w). We present a general method for the…
The Fast Fourier Transform is extended to functions on finite graphs whose edges are identified with intervals of finite length. Spectral and pseudospectral methods are developed to solve a wide variety of time dependent partial…
In this paper, an algorithm for Quantum Inverse Fast Fourier Transform (QIFFT) is developed to work for quantum data. Analogous to a classical discrete signal, a quantum signal can be represented in Dirac notation, application of QIFFT is a…
Finding a computationally efficient algorithm for the inverse continuous wavelet transform is a fundamental topic in applications. In this paper, we show the convergence of the inverse wavelet transform.
The Newton-Sabatier method for solving inverse scattering problem with fixed-energy phase shifts for a sperically symmetric potential is discussed. It is shown that this method is fundamentally wrong: in general it cannot be carried…
In this paper, we consider a method for fast numerical computation of the Fourier transform of a slowly decaying function with given accuracy in given ranges of the frequency. In these decades, some useful formulas for the Fourier transform…
An error analysis of a splitting method applied to the Zakharov system is given. The numerical method is a Lie-Trotter splitting in time that is combined with a Fourier collocation in space to a fully discrete method. First-order…
The truncated Fourier transform (TFT) was introduced by van der Hoeven in 2004 as a means of smoothing the "jumps" in running time of the ordinary FFT algorithm that occur at power-of-two input sizes. However, the TFT still introduces these…
The graph Fourier transform (GFT) is a fundamental tool in graph signal processing and has recently been extended to the graph fractional Fourier transform (GFRFT). Existing sampling methods in the GFRFT domain are primarily designed to…
An elementary approach for computing the values at negative integers of the Riemann zeta function is presented. The approach is based on a new method for ordering the integers and a new method for summation of divergent series. We show that…
This paper deals with the inverse problem of recovering an arbitrary number of fractional damping terms in a wave equation. We develop several approaches on uniqueness and reconstruction, some of them relying on Tauberian theorems on the…