English
Related papers

Related papers: Two Methods for Numerical Inversion of the Z-Trans…

200 papers

The two-time Green function method in quantum electrodynamics of high-Z few-electron atoms is described in detail. This method provides a simple procedure for deriving formulas for the energy shift of a single level and for the energies and…

Atomic Physics · Physics 2009-11-06 V. M. Shabaev

The quaternion Fourier transform (QFT), a generalization of the classical 2D Fourier transform, plays an increasingly active role in particular signal and colour image processing. There tends to be an inordinate degree of interest placed on…

Classical Analysis and ODEs · Mathematics 2019-03-04 Dong Cheng , Kit Ian Kou

In this paper we propose a new fast Fourier transform to recover a real nonnegative signal ${\bf x}$ from its discrete Fourier transform. If the signal ${\mathbf x}$ appears to have a short support, i.e., vanishes outside a support interval…

Numerical Analysis · Mathematics 2020-02-19 Gerlind Plonka , Katrin Wannenwetsch

This work belongs to the framework of inverse problems with linear model. The resolution of this type of problem consists in minimizing (possibly under constraints) a function of discrepancy between the measurements and a physical model of…

Information Theory · Computer Science 2021-09-28 Henri Lantéri

This paper is presented to give numerical solutions of some cases of nonlinear wave-like equations with variable coefficients by using Reduced Differential Transform Method (RDTM). RDTM can be applied most of the physical, engineering,…

Numerical Analysis · Mathematics 2014-07-21 Murat Gubes , Yildiray Keskin , Galip Oturanc

We present a novel algorithm, named the 2D-FFAST, to compute a sparse 2D-Discrete Fourier Transform (2D-DFT) featuring both low sample complexity and low computational complexity. The proposed algorithm is based on mixed concepts from…

Information Theory · Computer Science 2015-09-22 Frank Ong , Sameer Pawar , Kannan Ramchandran

With the growing demand for non-Euclidean data analysis, graph signal processing (GSP) has gained significant attention for its capability to handle complex time-varying data. This paper introduces a novel sampling method based on the joint…

General Mathematics · Mathematics 2025-06-03 Yu Zhang , Bing-Zhao Li

The short-time Fourier transform (STFT) usually computes the same number of frequency components as the frame length while overlapping adjacent time frames by more than half. As a result, the number of components of a spectrogram matrix…

Signal Processing · Electrical Eng. & Systems 2020-10-29 Daichi Kitahara

In this paper, we investigate the ``shuffle-type'' formula for special values of desingularized multiple zeta functions at integer points. It is proved by giving an iterated integral/differential expression for the desingularized multiple…

Number Theory · Mathematics 2023-02-23 Nao Komiyama , Takeshi Shinohara

Graph Fourier transform (GFT) is one of the fundamental tools in graph signal processing to decompose graph signals into different frequency components and to represent graph signals with strong correlation by different modes of variation…

Information Theory · Computer Science 2022-09-08 Cheng Cheng , Yang Chen , Jeon Yu Lee , Qiyu Sun

In this paper we have chosen to work with two different approaches to solving the inverse problem of the calculus of variation. The first approach is based on an integral representation of the Lagrangian function that uses the first…

Classical Physics · Physics 2020-08-10 Basir Ahamed Khan , Supriya Chatterjee , Golam Ali Sekh , Benoy Talukdar

Symbolic computation techniques are used to derive some closed form expressions for an analytic continuation of the Euler-Zagier zeta function evaluated at the negative integers as recently proposed by B. Sadaoui. This approach allows to…

Number Theory · Mathematics 2015-03-17 V. H. Moll , L. Jiu , C. Vignat

In distributed radar systems, when several transmitters radiate simultaneously, the reflected signals need to be distinguished at the receivers to detect various targets. If the transmit signals are in different frequency bands, they…

Signal Processing · Electrical Eng. & Systems 2024-01-02 Gokularam Muthukrishnan , S. Sruti , K. Giridhar

We revisit the Fourier transform of a Hankel function, of considerable importance in the theory of knife edge diffraction. Our approach is based directly upon the underlying Bessel equation, which admits manipulation into an alternate…

General Mathematics · Mathematics 2021-12-21 J. A. Grzesik

A generalization of the max-plus transformation, which is known as a method to derive cellular automata from integrable equations, is proposed for complex numbers. Operation rules for this transformation is also studied for general number…

Exactly Solvable and Integrable Systems · Physics 2009-11-11 Tetsu Yajima , Keisuke Nakajima , Naruyoshi Asano

Computing the Sparse Fast Fourier Transform(sFFT) of a K-sparse signal of size N has emerged as a critical topic for a long time. The sFFT algorithms decrease the runtime and sampling complexity by taking advantage of the signal inherent…

Signal Processing · Electrical Eng. & Systems 2020-12-16 Bin Li , Zhikang Jiang , Jie Chen

Using the shift-operator technique, a compact formula for the Fourier transform of a product of two Slater-type orbitals located on different atomic centers is derived. The result is valid for arbitrary quantum numbers and was found to be…

Materials Science · Physics 2009-11-13 T. A. Niehaus , R. López , J. F. Rico

A new numerical method to solve an inverse source problem for the radiative transfer equation involving the absorption and scattering terms, with incomplete data, is proposed. No restrictive assumption on those absorption and scattering…

Numerical Analysis · Mathematics 2019-04-02 Alexey V. Smirnov , Michael V. Klibanov , Loc H. Nguyen

This paper proposes a novel non-iterative method to solve power system differential algebraic equations (DAEs) using the differential transformation, a mathematical tool that can obtain power series coefficients by transformation rules…

Systems and Control · Electrical Eng. & Systems 2019-11-19 Yang Liu , Kai Sun

Truncated Fourier Transforms (TFTs), first introduced by Van der Hoeven, refer to a family of algorithms that attempt to smooth "jumps" in complexity exhibited by FFT algorithms. We present an in-place TFT whose time complexity, measured in…

Symbolic Computation · Computer Science 2013-01-30 Andrew Arnold
‹ Prev 1 8 9 10 Next ›