Related papers: Fourier Transform Method Of A Detailed Configurati…
The calculation of the hot plasma bound-free opacity according to the average atom models often leads to a noticeable effect of initial configuration on the shell ionization threshold. For the related problem of taking into account the…
A new method, 'Configurationally-Resolved-Super-Transition-Arrays', for calculation of the spectral absorption coefficient in hot plasmas is presented. In the new method, the spectrum of each Super-Transition-Array is evaluated as the…
A few years ago, Kurzweil and Hazak developed the Configurationally Resolved Super-Transition-Arrays (CRSTA) method for the computation of hot-plasma radiative opacity. Their approach, based on a temporal integration, is an important…
The computation of radiative opacity or emissivity of hot dense matter is a challenging task. It requires accounting for an immense number of energy levels and lines across various excitation and ionization states. Whether in local…
We present a project dedicated to hot plasma spectroscopy based on a Multi-Configuration Dirac-Fock (MCDF) code, initially developed by J. Bruneau. The code is briefly described and the use of the transition-state method for plasma…
Calculating opacities for a wide range of plasma conditions (i.e. temperature, density, element) requires detailed knowledge of the plasma configuration space and electronic structure. For plasmas composed of heavier elements, relativistic…
We propose and experimentally validate a joint estimation method for chromatic dispersion and time-frequency offset based on the fractional Fourier transform, which reduces computational complexity by more than 50% while keeping estimation…
This tutorial is designed to clarify a few misconceptions in the field of ultrafast optics. (1) Analytic signal that underlies the complex-conjugate decomposition of the field is discussed, as well as the misunderstanding between…
A hybrid model of the Deutsch-Jozsa algorithm is presented, inspired by the proposals of hybrid computation by S. Lloyd and P. van Loock et. al. The model is based on two observations made about both the discrete and continuous algorithms…
To study the dynamical behaviour of the engineering and physical systems, we often need to capture their continuous behaviour, which is modeled using differential equations, and perform the frequency-domain analysis of these systems.…
The fast algorithms in Fourier optics have invigorated multifunctional device design and advanced imaging technologies. However, the necessity for fast computations has led to limitations in the widely used conventional Fourier methods,…
Optical cavities provide high sensitivity to dispersion since their resonance frequencies depend on the index of refraction. We present a direct, broadband, and accurate measurement of the modes of a high finesse cavity using an optical…
We present a general diagrammatic approach to the construction of efficient algorithms for computing the Fourier transform of a function on a finite group. By extending work which connects Bratteli diagrams to the construction of Fast…
The Fourier Transform is one of the most important linear transformations used in science and engineering. Cooley and Tukey's Fast Fourier Transform (FFT) from 1964 is a method for computing this transformation in time $O(n\log n)$.…
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…
Calculations of the opacity of hot, dense matter require models for plasma line broadening. However, the most general theories are too complex to calculate directly and some approximation is inevitably required. The most widely-used…
Transform methods, like Laplace and Fourier, are frequently used for analyzing the dynamical behaviour of engineering and physical systems, based on their transfer function, and frequency response or the solutions of their corresponding…
For each $f\!:\!\mathbb{R}\to\mathbb{C}$ that is Henstock--Kurzweil integrable on the real line, or is a distribution in the completion of the space of Henstock--Kurzweil integrable functions in the Alexiewicz norm, it is shown that the…
The Fourier Transform is one of the most important linear transformations used in science and engineering. Cooley and Tukey's Fast Fourier Transform (FFT) from 1964 is a method for computing this transformation in time $O(n\log n)$. From a…
This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general,…