相关论文: Detection of large-scale noisy multi-periodic patt…

We give a fairly comprehensive review of wavelets and of their application to density-functional theory (DFT) and to our recent application of a wavelet-based version of linear-response time-dependent DFT (LR-TD-DFT). Our intended audience…

Vector-valued discrete Fourier transforms (DFTs) and ambiguity functions are defined. The motivation for the definitions is to provide realistic modeling of multi-sensor environments in which a useful time-frequency analysis is essential.…

We consider the problem of finding the Discrete Fourier Transform (DFT) of $N-$ length signals with known frequency support of size $k$. When $N$ is a power of 2 and the frequency support is a spectral set, we provide an $O(k \log k)$…

Static correlation is a difficult problem for density-functional theory (DFT) as it arises in cases of degenerate or quasi-degenerate states where a multideterminantal wave function provides the simplest reasonable first approximation to…

Frequency estimation is a fundamental problem in many areas. The well-known A&M and its variant estimators have established an estimation framework by iteratively interpolating the discrete Fourier transform (DFT) coefficients. In general,…

In this paper, we propose the Fourier frequency vector (FFV), inherently, associated with multidimensional Fourier transform. With the help of FFV, we are able to provide physical meaning of so called negative frequencies in…

In this paper, we present two variations of an algorithm for signal reconstruction from one-bit or two-bit noisy observations of the discrete Fourier transform (DFT). The one-bit observations of the DFT correspond to the sign of its real…

Nonlinear distortion experienced by signals during their propagation through optical fibers strongly limits the throughput of optical communication systems. Recently, a strong research focus has been dedicated to nonlinearity mitigation and…

Density functional theory (DFT) is an essential building block for modern theoretical physics, chemistry, and engineering, especially those concerning electronic properties. Through decades of development, various program packages for…

In his monograph Chebyshev and Fourier Spectral Methods, John Boyd claimed that, regarding Fourier spectral methods for solving differential equations, ``[t]he virtues of the Fast Fourier Transform will continue to improve as the relentless…

The short-time Fourier transform (STFT) is widely used for analyzing non-stationary signals. However, its performance is highly sensitive to its parameters, and manual or heuristic tuning often yields suboptimal results. To overcome this…

In the past decade, classical dynamical density functional theory (DDFT) has been developed and widely applied to the Brownian dynamics of interacting colloidal particles. One of the possible derivation routes of DDFT from the microscopic…

The Fast Fourier Transform (FFT) is the most efficiently known way to compute the Discrete Fourier Transform (DFT) of an arbitrary n-length signal, and has a computational complexity of O(n log n). If the DFT X of the signal x has only k…

We develop the uniform sparse Fast Fourier Transform (usFFT), an efficient, non-intrusive, adaptive algorithm for the solution of elliptic partial differential equations with random coefficients. The algorithm is an adaption of the sparse…

Linear-scaling implementations of density functional theory (DFT) reach their intended efficiency regime only when applied to systems having a physical size larger than the range of their Kohn-Sham density matrix (DM). This causes a problem…

Optical spectrum analysis is the cornerstone of spectroscopic sensing, optical network performance monitoring, and hyperspectral imaging. While conventional high-performance spectrometers used to perform such analysis are often large…

Classical Density Functional Theory (DFT) is a statistical-mechanical framework to analyze fluids, which accounts for nanoscale fluid inhomogeneities and non-local intermolecular interactions. DFT can be applied to a wide range of…

By viewing the nonuniform discrete Fourier transform (NUDFT) as a perturbed version of a uniform discrete Fourier transform, we propose a fast, stable, and simple algorithm for computing the NUDFT that costs $\mathcal{O}(N\log…

Digital filters for recursively computing the discrete Fourier transform (DFT) and estimating the frequency spectrum of sampled signals are examined, with an emphasis on magnitude-response and numerical stability. In this tutorial-style…

The article presents a computationally effective algorithm for calculating the multiresolution discrete Fourier transform (MrDFT). The algorithm is based on the idea of reducing the computational complexity which was introduced by Wen and…