Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Fourier”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

Rational trigonometric approximations using Fourier series partial sums

A class of approximations (S(sub N,M)) to a periodic function f which uses the ideas of Pade, or rational function, approximations based on the Fourier series representation of f, rather than on the Taylor series representation of f, is introduced and studied. Each approximation S(sub N,M) is the quotient of a trigonometric polynomial of degree N and a trigonometric polynomial of degree M. The coefficients in these polynomials are determined by requiring that an appropriate number of the Fourier coefficients of S(sub N,M) agree with those of f. Explicit expressions are derived for these coefficients in terms of the Fourier coefficients of f. It is proven that these 'Fourier-Pade' approximations converge point-wise to (f(x(exp +))+f(x(exp -)))/2 more rapidly (in some cases by a factor of 1/k(exp 2M)) than the Fourier series partial sums on which they are based. The approximations are illustrated by several examples and an application to the solution of an initial, boundary value problem for the simple heat equation is presented.

Geer, James F.↗
NASA NTRS1995

Reduction and coding of synthetic aperture radar data with Fourier transforms

Recently, aboard the Space Radar Laboratory (SRL), the two roles of Fourier Transforms for ocean image synthesis and surface wave analysis have been implemented with a dedicated radar processor to significantly reduce Synthetic Aperture Radar (SAR) ocean data before transmission to the ground. The object was to archive the SAR image spectrum, rather than the SAR image itself, to reduce data volume and capture the essential descriptors of the surface wave field. SAR signal data are usually sampled and coded in the time domain for transmission to the ground where Fourier Transforms are applied both to individual radar pulses and to long sequences of radar pulses to form two-dimensional images. High resolution images of the ocean often contain no striking features and subtle image modulations by wind generated surface waves are only apparent when large ocean regions are studied, with Fourier transforms, to reveal periodic patterns created by wind stress over the surface wave field. Major ocean currents and atmospheric instability in coastal environments are apparent as large scale modulations of SAR imagery. This paper explores the possibility of computing complex Fourier spectrum codes representing SAR images, transmitting the coded spectra to Earth for data archives and creating scenes of surface wave signatures and air-sea interactions via inverse Fourier transformations with ground station processors.

Tilley, David G.↗
NASA NTRS2006

Electro-Optical Imaging Fourier-Transform Spectrometer

An electro-optical (E-O) imaging Fourier-transform spectrometer (IFTS), now under development, is a prototype of improved imaging spectrometers to be used for hyperspectral imaging, especially in the infrared spectral region. Unlike both imaging and non-imaging traditional Fourier-transform spectrometers, the E-O IFTS does not contain any moving parts. Elimination of the moving parts and the associated actuator mechanisms and supporting structures would increase reliability while enabling reductions in size and mass, relative to traditional Fourier-transform spectrometers that offer equivalent capabilities. Elimination of moving parts would also eliminate the vibrations caused by the motions of those parts. Figure 1 schematically depicts a traditional Fourier-transform spectrometer, wherein a critical time delay is varied by translating one the mirrors of a Michelson interferometer. The time-dependent optical output is a periodic representation of the input spectrum. Data characterizing the input spectrum are generated through fast-Fourier-transform (FFT) post-processing of the output in conjunction with the varying time delay.

Chao, Tien-Hsin↗
NASA NTRS2014

Two Dimensional Symmetric Correlation Functions of the S Operator and Two Dimensional Fourier Transforms: Considering the Line Coupling for P and R Lines of Linear Molecules

The refinement of the Robert-Bonamy (RB) formalism by considering the line coupling for isotropic Raman Q lines of linear molecules developed in our previous study [Q. Ma, C. Boulet, and R. H. Tipping, J. Chem. Phys. 139, 034305 (2013)] has been extended to infrared P and R lines. In these calculations, the main task is to derive diagonal and off-diagonal matrix elements of the Liouville operator iS1 − S2 introduced in the formalism. When one considers the line coupling for isotropic Raman Q lines where their initial and final rotational quantum numbers are identical, the derivations of off-diagonal elements do not require extra correlation functions of the ^S operator and their Fourier transforms except for those used in deriving diagonal elements. In contrast, the derivations for infrared P and R lines become more difficult because they require a lot of new correlation functions and their Fourier transforms. By introducing two dimensional correlation functions labeled by two tensor ranks and making variable changes to become even functions, the derivations only require the latters' two dimensional Fourier transforms evaluated at two modulation frequencies characterizing the averaged energy gap and the frequency detuning between the two coupled transitions. With the coordinate representation, it is easy to accurately derive these two dimensional correlation functions. Meanwhile, by using the sampling theory one is able to effectively evaluate their two dimensional Fourier transforms. Thus, the obstacles in considering the line coupling for P and R lines have been overcome. Numerical calculations have been carried out for the half-widths of both the isotropic Raman Q lines and the infrared P and R lines of C2H2 broadened by N2. In comparison with values derived from the RB formalism, new calculated values are significantly reduced and become closer to measurements.

infrared radiation↗
DOE OSTI2020

Quantum Fourier transform revisited

Summary The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a particular matrix decomposition of the discrete Fourier transform (DFT) matrix. In this paper, we show that the quantum Fourier transform (QFT) can be derived by further decomposing the diagonal factors of the FFT matrix decomposition into products of matrices with Kronecker product structure. We analyze the implication of this Kronecker product structure on the discrete Fourier transform of rank‐1 tensors on a classical computer. We also explain why such a structure can take advantage of an important quantum computer feature that enables the QFT algorithm to attain an exponential speedup on a quantum computer over the FFT algorithm on a classical computer. Further, the connection between the matrix decomposition of the DFT matrix and a quantum circuit is made. We also discuss a natural extension of a radix‐2 QFT decomposition to a radix‐ d QFT decomposition. No prior knowledge of quantum computing is required to understand what is presented in this paper. Yet, we believe this paper may help readers to gain some rudimentary understanding of the nature of quantum computing from a matrix computation point of view.

Camps, Daan↗
DOE OSTI2024

Physics-constrained machine learning for electrodynamics without gauge ambiguity based on Fourier transformed Maxwell’s equations

We utilize a Fourier transformation-based representation of Maxwell’s equations to develop physics-constrained neural networks for electrodynamics without gauge ambiguity, which we label the Fourier–Helmholtz–Maxwell neural operator method. In this approach, both of Gauss’s laws and Faraday’s law are built in as hard constraints, as well as the longitudinal component of Ampère–Maxwell in Fourier space, assuming the continuity equation. An encoder–decoder network acts as a solution operator for the transverse components of the Fourier transformed vector potential, $\hat{A}_⟂(k,t)$, whose two degrees of freedom are used to predict the electromagnetic fields. This method was tested on two electron beam simulations. Among the models investigated, it was found that a U-Net architecture exhibited the best performance as it trained quicker, was more accurate and generalized better than the other architectures examined. We demonstrate that our approach is useful for solving Maxwell’s equations for the electromagnetic fields generated by intense relativistic charged particle beams and that it generalizes well to unseen test data, while being orders of magnitude quicker than conventional simulations. We show that the model can be re-trained to make highly accurate predictions in as few as 20 epochs on a previously unseen data set.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Efficient and generalizable nested Fourier-DeepONet for three-dimensional geological carbon sequestration

Geological carbon sequestration (GCS) involves injecting CO2 into subsurface geological formationsfor permanent storage. Numerical simulations could guide decisions in GCS projects by predictingCO 2 migration pathways and the pressure distribution in storage formation. However, these simula-tions are often computationally expensive due to highly coupled physics and large spatial-temporalsimulation domains. Surrogate modelling with data-driven machine learning has become a promis-ing alternative to accelerate physics-based simulations. Among these, the Fourier neural operator(FNO) has been applied to three-dimensional synthetic subsurface models. Despite its good accuracyin simulating CO 2 plume migration, it requires large computational resources in training and alsolacks generalizability. Here, to further improve performance, we have developed a nested Fourier-DeepONet by combining the expressiveness of the FNO with the modularity of a deep operatornetwork (DeepONet). This new framework is twice as efficient as a nested FNO for training and has atleast 80% lower GPU memory requirement due to its flexibility to treat temporal coordinates sepa-rately. These performance improvements are achieved without compromising prediction accuracy.In addition, the generalization and extrapolation ability of nested Fourier-DeepONet beyond thetraining range has been thoroughly evaluated. Nested Fourier-DeepONet outperformed the nestedFNO for extrapolation in time with more than 50% reduced error. It also exhibited good extrapolationaccuracy beyond the training range in terms of reservoir properties, number of wells, and injectionrate.

Lee, Jonathan E. [Department of Chemical and Envir↗
DOE OSTI2024

Highly-efficient quantum Fourier transformations for certain non-Abelian groups

Quantum Fourier transformations are an essential component of many quantum algorithms, from prime factoring to quantum simulation. While the standard Abelian QFrT is well studied, important variants corresponding to non-Abelian groups of interest have seen less development. In particular, fast non-Abelian Fourier transformations are important components for both quantum simulations of field theories as well as approaches to the non-Abelian hidden subgroup problem. In this work, we present fast quantum Fourier transformations for a number of non-Abelian groups of interest for high energy physics, B T , B O , 6 Δ ( 27 ) , Δ ( 54 ) , and Σ ( 36 × 3 ) . For each group, we derive explicit quantum circuits and estimate resource scaling for fault-tolerant implementations. Our work shows that the development of a fast Fourier transformation can substantively reduce simulation costs by an up to three orders of magnitude for the finite groups that we have investigated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1987

Fourier removal of stripe artifacts in IRAS images

By working in the Fourier plane, approximate removal of stripe artifacts in IRAS images can be effected. The image of interest is smoothed and subtracted from the original, giving the high-spatial-frequency part. This 'filtered' image is then clipped to remove point sources and then Fourier transformed. Subtracting the Fourier components contributing to the stripes in this image from the Fourier transform of the original and transforming back to the image plane yields substantial removal of the stripes.

Van Buren, Dave↗
NASA NTRS1992

Resolution properties of the Fourier method for discontinuous waves

In this paper we discuss the wave-resolution properties of the Fourier approximations of a wave function with discontinuities. It is well known that a minimum of two points per wave is needed to resolve a periodic wave function using Fourier expansions. For Chebyshev approximations of a wave function, a minimum of pi points per wave is needed. Here we obtain an estimate for the minimum number of points per wave to resolve a discontinuous wave based on its Fourier coefficients. In our recent work on overcoming the Gibbs phenomenon, we have shown that the Fourier coefficients of a discontinuous function contain enough information to reconstruct with exponential accuracy the coefficient of a rapidly converging Gegenbauer expansion. We therefore study the resolution properties of a Gegenbauer expansion where both the number of terms and the order increase.

Gottlieb, David↗
NASA NTRS1997

Exponential Approximations Using Fourier Series Partial Sums

The problem of accurately reconstructing a piece-wise smooth, 2(pi)-periodic function f and its first few derivatives, given only a truncated Fourier series representation of f, is studied and solved. The reconstruction process is divided into two steps. In the first step, the first 2N + 1 Fourier coefficients of f are used to approximate the locations and magnitudes of the discontinuities in f and its first M derivatives. This is accomplished by first finding initial estimates of these quantities based on certain properties of Gibbs phenomenon, and then refining these estimates by fitting the asymptotic form of the Fourier coefficients to the given coefficients using a least-squares approach. It is conjectured that the locations of the singularities are approximated to within O(N(sup -M-2), and the associated jump of the k(sup th) derivative of f is approximated to within O(N(sup -M-l+k), as N approaches infinity, and the method is robust. These estimates are then used with a class of singular basis functions, which have certain 'built-in' singularities, to construct a new sequence of approximations to f. Each of these new approximations is the sum of a piecewise smooth function and a new Fourier series partial sum. When N is proportional to M, it is shown that these new approximations, and their derivatives, converge exponentially in the maximum norm to f, and its corresponding derivatives, except in the union of a finite number of small open intervals containing the points of singularity of f. The total measure of these intervals decreases exponentially to zero as M approaches infinity. The technique is illustrated with several examples.

Banerjee, Nana S.↗
NASA NTRS2003

Mathematical Investigation of Gamma Ray and Neutron Absorption Grid Patterns for Homeland Defense Related Fourier Imaging Systems

Terrorist suitcase nuclear devices typically using converted Soviet tactical nuclear warheads contain several kilograms of plutonium. This quantity of plutonium emits a significant number of gamma rays and neutrons as it undergoes radioactive decay. These gamma rays and neutrons normally penetrate ordinary matter to a significant distance. Unfortunately this penetrating quality of the radiation makes imaging with classical optics impractical. However, this radiation signature emitted by the nuclear source may be sufficient to be imaged from low-flying aerial platforms carrying Fourier imaging systems. The Fourier imaging system uses a pair of co-aligned absorption grids to measure a selected range of spatial frequencies from an object. These grids typically measure the spatial frequency in only one direction at a time. A grid pair that looks in all directions simultaneously would be an improvement over existing technology. A number of grid pairs governed by various parameters were investigated to solve this problem. By examining numerous configurations, it became apparent that an appropriate spiral pattern could be made to work. A set of equations was found to describe a grid pattern that produces straight fringes. Straight fringes represent a Fourier transform of a point source at infinity. An inverse Fourier transform of this fringe pattern would provide an accurate image (location and intensity) of a point source.

Boccio, Dona↗
NASA NTRS2006

A Discussion of the Discrete Fourier Transform Execution on a Typical Desktop PC

This paper will discuss and compare the execution times of three examples of the Discrete Fourier Transform (DFT). The first two examples will demonstrate the direct implementation of the algorithm. In the first example, the Fourier coefficients are generated at the execution of the DFT. In the second example, the coefficients are generated prior to execution and the DFT coefficients are indexed at execution. The last example will demonstrate the Cooley- Tukey algorithm, better known as the Fast Fourier Transform. All examples were written in C executed on a PC using a Pentium 4 running at 1.7 Ghz. As a function of N, the total complex data size, the direct implementation DFT executes, as expected at order of N2 and the FFT executes at order of N log2 N. At N=16K, there is an increase in processing time beyond what is expected. This is not caused by implementation but is a consequence of the effect that machine architecture and memory hierarchy has on implementation. This paper will include a brief overview of digital signal processing, along with a discussion of contemporary work with discrete Fourier processing.

White, Michael J.↗
NASA NTRS2006

Rotational-translational fourier imaging system requiring only one grid pair

The sky contains many active sources that emit X-rays, gamma rays, and neutrons. Unfortunately hard X-rays, gamma rays, and neutrons cannot be imaged by conventional optics. This obstacle led to the development of Fourier imaging systems. In early approaches, multiple grid pairs were necessary in order to create rudimentary Fourier imaging systems. At least one set of grid pairs was required to provide multiple real components of a Fourier derived image, and another set was required to provide multiple imaginary components of the image. It has long been recognized that the expense associated with the physical production of the numerous grid pairs required for Fourier imaging was a drawback. Herein one grid pair (two grids), with accompanying rotation and translation, can be used if one grid has one more slit than the other grid, and if the detector is modified.

Campbell, Jonathan W.↗
DOE OSTI2022

Fourier analysis of continuous fractional diffusion synthetic acceleration schemes in slab geometry

We propose two fractional extensions of continuous diffusion synthetic acceleration (DSA) with fractional derivative order α varying over the interval 2 ≥ α ≥ 1 . We investigate the spectral properties of the corresponding continuous families of fractional preconditioners by performing Fourier analysis for a model infinite homogeneous medium problem in slab geometry. The first family results in a fractional acceleration scheme, FrDSAo, that reduces to traditional DSA for .α = 2 and scattering ratio c limiting to a unit value (c → 1) but is otherwise optimized via the Fourier analysis, to obtain the smallest possible spectral radius, for c < 1 and 2 ≥ α ≥ 1. The second family corresponds to a fractional acceleration scheme, FrDSAs, that reduces to traditional DSA for α = 2 for all values of c. The latter scheme is not optimized but has the advantage of lending itself to a more straightforward implementation. For high values of c, the results of the Fourier analysis point to the existence of an interval 2 > α > ∼1.8 where both FrDSAo and FrDSAs can achieve a lower spectral radius than DSA. For example, DSA has a spectral radius of ∼0.2246 for c = 0.9999 while FrDSAo produces a value of ∼0.1616 at α = 1.92 and FrDSAs results in ∼0.2116 at α =1.93. (author)

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Direct interpolative construction of the discrete Fourier transform as a matrix product operator

The quantum Fourier transform (QFT), which can be viewed as a reindexing of the discrete Fourier transform (DFT), has been shown to be compressible as a low-rank matrix product operator (MPO) or quantized tensor train (QTT) operator. However, the original proof of this fact does not furnish a construction of the MPO with a guaranteed error bound. Meanwhile, the existing practical construction of this MPO, based on the compression of a quantum circuit, is not as efficient as possible. We present a simple closed-form construction of the QFT MPO using the interpolative decomposition, with guaranteed near-optimal compression error for a given rank. This construction can speed up the application of the QFT and the DFT, respectively, in quantum circuit simulations and QTT applications. We also connect our interpolative construction to the approximate quantum Fourier transform (AQFT) by demonstrating that the AQFT can be viewed as an MPO constructed using a different interpolation scheme.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Fourier Analysis and Loss Modeling for Inductive Wireless Electric Vehicle Charging with Reduced Stray Field

With the growth of electric vehicle (EV) popularity, different charging options to increase user convenience and reduce charging times are being considered and researched. Among these, inductive wireless power transfer (WPT) systems for EVs are being designed to meet specifications such as stray field, power level, efficiency, misalignment tolerance, and ground clearance, which are all heavily influenced by the coil geometry. The proposed Fourier Analysis Method (FAM) is an analytical method to directly design coil geometries to meet stray field and power level requirements through an optimization of Fourier basis function coefficients. The outputs of the optimization are complex, planar coil geometries that meet the power level and stray field constraints with minimized loss factors. Contours of these potentials determine the coil conductor paths and loss models predict the system efficiency and performance over misalignment. The Fourier representation of the geometry is used to conveniently calculate the coupling over misalignment, external proximity effect loss, and ferrite loss. A 6.6 kW prototype WPT system with low stray field and high efficiency is built from the optimization results to validate the models and showcase the usefulness of the FAM design approach.

33 ADVANCED PROPULSION SYSTEMS↗
NASA NTRS2017

Structure in the 3D Galaxy Distribution. III. Fourier Transforming the Universe: Phase and Power Spectra

We demonstrate the effectiveness of a relatively straightforward analysis of the complex 3D Fourier transform of galaxy coordinates derived from redshift surveys. Numerical demonstrations of this approach are carried out on a volume-limited sample of the Sloan Digital Sky Survey redshift survey. The direct unbinned transform yields a complex 3D data cube quite similar to that from the Fast Fourier Transform of finely binned galaxy positions. In both cases, deconvolution of the sampling window function yields estimates of the true transform. Simple power spectrum estimates from these transforms are roughly consistent with those using more elaborate methods. The complex Fourier transform characterizes spatial distributional properties beyond the power spectrum in a manner different from (and we argue is more easily interpreted than) the conventional multipoint hierarchy. We identify some threads of modern large-scale inference methodology that will presumably yield detections in new wider and deeper surveys.

Galaxies↗