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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Fourier-MIONet: Fourier-enhanced multiple-input neural operators for multiphase modeling of geological carbon sequestration

Geologic carbon sequestration (GCS) is a safety-critical technology that aims to reduce the amount of carbon dioxide in the atmosphere, which also places high demands on reliability. Multiphase flow in porous media is essential to understand CO 2 migration and pressure fields in the subsurface associated with GCS. However, numerical simulation for such problems in 4D is computationally challenging and expensive, due to the multiphysics and multiscale nature of the highly nonlinear governing partial differential equations (PDEs). It prevents us from considering multiple subsurface scenarios and conducting real-time optimization. Here, we develop a Fourier-enhanced multiple-input neural operator (Fourier-MIONet) to learn the solution operator of the problem of multiphase flow in porous media. Fourier-MIONet utilizes the recently developed framework of the multiple-input deep neural operators (MIONet) and incorporates the Fourier neural operator (FNO) in the network architecture. Once Fourier-MIONet is trained, it can predict the evolution of saturation and pressure of the multiphase flow under various reservoir conditions, such as permeability and porosity heterogeneity, anisotropy, injection configurations, and multiphase flow properties. Compared to the enhanced FNO (U-FNO), the proposed Fourier-MIONet has 90% fewer unknown parameters, and it can be trained in significantly less time (about 3.5 times faster) with much lower CPU memory (<15%) and GPU memory (<35%) requirements, to achieve similar prediction accuracy. In addition to the lower computational cost, Fourier-MIONet can be trained with only 6 snapshots of time to predict the PDE solutions for 30 years. Furthermore, we observed that Fourier-MIONet can maintain good accuracy when predicting out-of-distribution (OOD) data. The excellent generalizability of Fourier-MIONet is enabled by its adherence to the physical principle that the solution to a PDE is continuous over time. Furthermore, the developed Fourier-MIONet makes it possible to solve the long-time evolution of geological carbon sequestration in a large-scale three-dimensional space accurately and efficiently.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Fourier-DeepONet: Fourier-enhanced deep operator networks for full waveform inversion with improved accuracy, generalizability, and robustness

In this article, full waveform inversion (FWI) infers the subsurface structure information from seismic waveform data by solving a non-convex optimization problem. Data-driven FWI has been increasingly studied with various neural network architectures to improve accuracy and computational efficiency. Nevertheless, the applicability of pre-trained neural networks is severely restricted by potential discrepancies between the source function used in the field survey and the one utilized during training. Here, we develop a Fourier-enhanced deep operator network (Fourier-DeepONet) for FWI with the generalization of seismic sources, including the frequencies and locations of sources. Specifically, we employ the Fourier neural operator as the decoder of DeepONet, and we utilize source parameters as one input of Fourier-DeepONet, facilitating the resolution of FWI with variable sources. To test Fourier-DeepONet, we develop three new and realistic FWI benchmark datasets (FWI-F, FWI-L, and FWI-FL) with varying source frequencies, locations, or both. Our experiments demonstrate that compared with existing data-driven FWI methods, Fourier-DeepONet obtains more accurate predictions of subsurface structures in a wide range of source parameters. Moreover, the proposed Fourier-DeepONet exhibits superior robustness when handling data with Gaussian noise or missing traces and sources with Gaussian noise, paving the way for more reliable and accurate subsurface imaging across diverse real conditions.

42 ENGINEERING↗
DOE OSTI2021

Fourier Neural Networks as Function Approximators and Differential Equation Solvers

We present a Fourier neural network (FNN) that can be mapped directly to the Fourier decomposition. The choice of activation and loss function yields results that replicate a Fourier series expansion closely while preserving a straightforward architecture with a single hidden layer. The simplicity of this network architecture facilitates the integration with any other higher-complexity networks, at a data pre- or postprocessing stage. We validate this FNN on naturally periodic smooth functions and on piecewise continuous periodic functions. We showcase the use of this FNN for modeling or solving partial differential equations with periodic boundary conditions. The main advantages of the current approach are the validity of the solution outside the training region, interpretability of the trained model, and simplicity of use.

Fourier decomposition↗
NASA NTRS1979

Programs for high-speed Fourier, Mellin and Fourier-Bessel transforms

Several FORTRAN program modules for performing one-dimensional and two-dimensional discrete Fourier transforms, Mellin, and Fourier-Bessel transforms are described along with programs that realize the algebra of high speed Fourier transforms on a computer. The programs can perform numerical harmonic analysis of functions, synthesize complex optical filters on a computer, and model holographic image processing methods.

Ikhabisimov, D. K.↗
NASA NTRS1983

A numerical method based on the Fourier-Fourier transform approach for modeling 1-D electron plasma evolution

A numerical method is presented for studying one-dimensional electron plasma evolution under typical interplanetary conditions. The method applies the Fourier-Fourier transform approach to a plasma model that is a generalization of the electrostatic Vlasov-Poisson system of equations. Conservation laws that are modified to include the plasma model generalization and also the boundary effects of nonperiodic solutions are given. A new conservation law for entropy in the transformed space is then introduced. These conservation laws are used to verify the numerical solutions. A discretization error analysis is presented. Two numerical instabilities and the methods used for their suppression are treated. It is shown that in interplanetary plasma conditions, the bump-on-tail instability produces significant excitation of plasma oscillations at the Bohm-Gross frequency and its second harmonic. An explanation of the second harmonic excitation is given in terms of wave-wave coupling during the growth phase of the instability.

Klimas, A. J.↗
DOE OSTI2021

Integrated Silicon Fourier Transform Spectrometer with Broad Bandwidth and Ultra‐High Resolution

An ultra-high resolution Fourier transform spectrometer (FTS) realized in silicon photonic platform that can operate with broad band, narrow band as well as a combination of broad band and narrow band signals is reported. The ultra-high resolution of the spectrometer is achieved by exploiting multiple techniques: a Michelson interferometer (MI) structure to increase the optical path delay (OPD), a hybrid waveguide design to reduce insertion loss, an optimized heater and air trenches to achieve higher thermal efficiency. Here, to further increase the OPD of the spectrometer to increase its resolution, a novel multiple interferometers approach is employed which combines balanced MI with N statically imbalanced MIs, thereby increasing the OPD of a single MI by factor of N + 1. An FTS spectrometer consisting of N = 2 such MIs is fabricated and experimentally characterized using unknown broad bandwidth input signal spectra of about 180 nm centered around 1550 nm, a narrow line laser input signal, and a combination of broad and narrow band signals demonstrating spectral resolution of about 0.16 nm.

Li, Ang↗
DOE OSTI2020

Novel Strategy To Analyze Fourier Transform Ion Cyclotron Resonance Mass Spectrometry Data of Biomass Pyrolysis Oil for Oligomeric Structure Assignment

Among the most prominent challenges for the analysis of biomass pyrolysis products is the characterization of the abundant oligomer fraction of bio-oil. This fraction is principally made up of pyrolytic lignins and dehydrated, highly modified sugar oligomers, called humins, in liquid phase. An emerging technique for analysis of this oligomer fraction is high-resolution Fourier transform-ion cyclotron resonance mass spectrometry (FT-ICR MS), which allows for accurate determination of C x H y O z formulae for detected oligomers. Additionally, using simple dehydration and fragmentation reaction schemes, similar formulae can be developed from cellulose-, hemicellulose- and lignin-derived oligomers, which are primary depolymerization products. In this paper, FT-ICR MS analysis is coupled with combinatoric dehydration and fragmentation modeling in order to match experimentally detected bio-oil oligomers with hypothetical pathways for their formation during pyrolysis. In this way, we present a novel strategy by which oligomeric structures can be proposed for bio-oils. Using this approach, it becomes possible to advance the understanding of both the molecular structures comprising the bio-oil oligomer fraction and the pathways by which these structures form during biomass pyrolysis reactions.

09 BIOMASS FUELS↗
DOE OSTI2020

Vacuum Pyrolysis of Hybrid Poplar Milled Wood Lignin with Fourier Transform-Ion Cyclotron Resonance Mass Spectrometry Analysis of Feedstock and Products for the Elucidation of Reaction Mechanisms

The pyrolysis of lignocellulosic materials is a promising technique to produce fuels and chemicals. It is well known that the most abundant products of lignin pyrolysis are oligomeric molecules, known as pyrolytic lignin (PL). The chemical composition of PL has been extensively studied; however, there is still an important debate whether these oligomers are produced directly from the lignin or from the recombination of monomeric pyrolytic products. Existing theories are unable to describe the effect of vacuum on the distribution of pyrolysis products. Hybrid poplar milled wood lignin (MWL) was initially isolated and thoroughly characterized by Fourier transform-ion cyclotron resonance mass spectrometry (FT-ICR MS). Chemical formulas were assigned to each oligomeric compound detected. The MWL was also subjected to vacuum pyrolysis in a modified pyroprobe at 250, 750, and 1000 mbar (absolute pressure), and the resulting liquid products were analyzed by FT-ICR MS. A new strategy to assign structural representations to the oligomeric PL products is proposed, based on the plausible pyrolysis reaction mechanisms of depolymerization/fragmentation applied to original MWL oligomer formulas. Our results support the hypothesis that PL is formed from the removal of moieties from primary lignin pyrolysis products with between three and five aromatic rings. This depolymerization/fragmentation allows the oligomers to reduce their molecular weights to the point where they can be removed from the reaction zone by direct vaporization. Furthermore, this phenomenon highlights the importance of pressure on removal mechanisms and their impact on the molecular weight of the resulting products from lignin pyrolysis.

09 BIOMASS FUELS↗
DOE OSTI2023

Linear-depth quantum circuits for loading Fourier approximations of arbitrary functions

Abstract The ability to efficiently load functions on quantum computers with high fidelity is essential for many quantum algorithms, including those for solving partial differential equations and Monte Carlo estimation. In this work, we introduce the Fourier series loader (FSL) method for preparing quantum states that exactly encode multi-dimensional Fourier series using linear-depth quantum circuits. Specifically, the FSL method prepares a (Dn)-qubit state encoding the 2 Dn -point uniform discretization of aD-dimensional function specified by aD-dimensional Fourier series. A free parameter,m, which must be less thann, determines the number of Fourier coefficients, 2 D ( m + 1 ) , used to represent the function. The FSL method uses a quantum circuit of depth at most 2 ( n − 2 ) + ⌈ log 2 ( n − m ) ⌉ + 2 D ( m + 1 ) + 2 − 2 D ( m + 1 ) , which is linear in the number of Fourier coefficients, and linear in the number of qubits (Dn) despite the fact that the loaded function’s discretization is over exponentially many (2 Dn ) points. The FSL circuit consists of at most D n + 2 D ( m + 1 ) + 1 − 1 single-qubit and D n ( n + 1 ) / 2 + 2 D ( m + 1 ) + 1 − 3 D ( m + 1 ) − 2 two-qubit gates; we present a classical compilation algorithm with runtime O ( 2 3 D ( m + 1 ) ) to determine the FSL circuit for a given Fourier series. The FSL method allows for the highly accurate loading of complex-valued functions that are well-approximated by a Fourier series with finitely many terms. We report results from noiseless quantum circuit simulations, illustrating the capability of the FSL method to load various continuous 1D functions, and a discontinuous 1D function, on 20 qubits with infidelities of less than 10 −6 and 10 −3 , respectively. We also demonstrate the practicality of the FSL method for near-term quantum computers by presenting experiments performed on the Quantinuum H1-1 and H1-2 trapped-ion quantum computers: we loaded a complex-valued function on 3 qubits with a fidelity of over 95 % , as well as various 1D real-valued functions on up to 6 qubits with classical fidelities ≈99%, and a 2D function on 10 qubits with a classical fidelity ≈94%.

Physics↗
DOE OSTI2025

Multiplexing and Demultiplexing Signals for Radiography Application Using the Discrete Fourier Transform

Our goal is to develop an X-ray phase-contrast imaging system that can provide excellent soft tissue contrast of phase, attenuation, and small-angle scatter. We propose to replace the common system of G0, G1, and G2 gradings with a biprism array to replace the G1 grading and introduce a novel X-ray tube designed to replace the motion of the phase stepping grading G2. The proposed X-ray tube uses temporal multiplexing to provide simultaneous virtual “electronic phase stepping.” In this work the discrete Fourier transform is used to separate from the composite measurement individual X-ray phase contrast measurements sampled at different frequencies. The method performs a discrete Fourier transform of a composite refence sequence to obtain using the frequency amplitudes calibration factors needed to extract the X-ray phase contrast measurement amplitudes from the composite image. The composite reference sequence is the sum of the individual sequences, at different frequencies, with amplitudes of one. The method takes the discrete Fourier transform of this composite reference sequence; whereby, the amplitude of each frequency component is compared with the total sum of its stand-alone sequence amplitude. A calibration factor is determined so that the amplitude of this composite reference frequency times the calibration factor must equal the total sum of the sequence amplitude—the zero-frequency amplitude of the discrete Fourier transform of its stand-alone sequence. To demultiplex the composite measured signal these calibration factors are multiplied by the amplitudes of the frequency components of the discrete Fourier transform of the composite X-phase-contrast measurement to obtain the amplitude of each frequency encoded measurement. Using these calibration factors, we demonstrate with the discrete Fourier transform in Mathematica the extraction of individual images from a composite image that one would expect obtaining from our proposed new X-ray phase contrast imaging system. We then demonstrate as an example how using images from X-ray phase contrast data one can calculate phase, attenuation and the dark field images using grading phase step data supplied to use from Microworks, GmbH in Karlsruhe, Germany.

42 ENGINEERING↗
NASA NTRS2012

Causal Correlation Functions and Fourier Transforms: Application in Calculating Pressure Induced Shifts

By adopting a concept from signal processing, instead of starting from the correlation functions which are even, one considers the causal correlation functions whose Fourier transforms become complex. Their real and imaginary parts multiplied by 2 are the Fourier transforms of the original correlations and the subsequent Hilbert transforms, respectively. Thus, by taking this step one can complete the two previously needed transforms. However, to obviate performing the Cauchy principal integrations required in the Hilbert transforms is the greatest advantage. Meanwhile, because the causal correlations are well-bounded within the time domain and band limited in the frequency domain, one can replace their Fourier transforms by the discrete Fourier transforms and the latter can be carried out with the FFT algorithm. This replacement is justified by sampling theory because the Fourier transforms can be derived from the discrete Fourier transforms with the Nyquis rate without any distortions. We apply this method in calculating pressure induced shifts of H2O lines and obtain more reliable values. By comparing the calculated shifts with those in HITRAN 2008 and by screening both of them with the pair identity and the smooth variation rules, one can conclude many of shift values in HITRAN are not correct.

correlation function↗
DOE OSTI2021

Tuning Multigrid Methods with Robust Optimization and Local Fourier Analysis

Local Fourier analysis is a useful tool for predicting and analyzing the performance of many efficient algorithms for the solution of discretized PDEs, such as multigrid and domain decomposition methods. The crucial aspect of local Fourier analysis is that it can be used to minimize an estimate of the spectral radius of a stationary iteration, or the condition number of a preconditioned system, in terms of a symbol representation of the algorithm. In practice, this is a “minimax” problem, minimizing with respect to solver parameters the appropriate measure of work, which involves maximizing over the Fourier frequency. Often, several algorithmic parameters may be determined by local Fourier analysis in order to obtain efficient algorithms. Analytical solutions to minimax problems are rarely possible beyond simple problems; the status quo in local Fourier analysis involves grid sampling, which is prohibitively expensive in high dimensions. In this paper, we propose and explore optimization algorithms to solve these problems efficiently. Finally, several examples, with known and unknown analytical solutions, are presented to show the effectiveness of these approaches.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1976

The application of an optical Fourier spectrum analyzer on detecting defects in mass-produced satellite photographs

Various defects in mass-produced pictures transmitted to earth from a satellite are investigated. It is found that the following defects are readily detectable via Fourier spectrum analysis: (1) bit slip, (2) breakup causing loss of image, and (3) disabled track at the top of the imagery. The scratches made on the film during mass production, which are difficult to detect by visual observation, also show themselves readily in Fourier spectrum analysis. A relation is established between the number of scratches, their width and depth and the intensity of their Fourier spectra. Other defects that are found to be equally suitable for Fourier spectrum analysis or visual (image analysis) detection are synchronous loss without blurring of image, and density variation in gray scale. However, the Fourier spectrum analysis is found to be unsuitable for detection of such defects as pin holes, annotation error, synchronous loss with blurring of images, and missing image in the beginning of the work order. The design of an automated, real time system, which will reject defective films, is treated.

Athale, R.↗
NASA NTRS1990

Fourier analysis and signal processing by use of the Moebius inversion formula

A novel Fourier technique for digital signal processing is developed. This approach to Fourier analysis is based on the number-theoretic method of the Moebius inversion of series. The Fourier transform method developed is shown also to yield the convolution of two signals. A computer simulation shows that this method for finding Fourier coefficients is quite suitable for digital signal processing. It competes with the classical FFT (fast Fourier transform) approach in terms of accuracy, complexity, and speed.

Reed, Irving S.↗
NASA NTRS1991

The fractional Fourier transform and applications

This paper describes the 'fractional Fourier transform', which admits computation by an algorithm that has complexity proportional to the fast Fourier transform algorithm. Whereas the discrete Fourier transform (DFT) is based on integral roots of unity e exp -2(pi)i/n, the fractional Fourier transform is based on fractional roots of unity e exp -2(pi)i(alpha), where alpha is arbitrary. The fractional Fourier transform and the corresponding fast algorithm are useful for such applications as computing DFTs of sequences with prime lengths, computing DFTs of sparse sequences, analyzing sequences with noninteger periodicities, performing high-resolution trigonometric interpolation, detecting lines in noisy images, and detecting signals with linearly drifting frequencies. In many cases, the resulting algorithms are faster by arbitrarily large factors than conventional techniques.

Bailey, David H.↗