Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation algorithm”

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 1,621 records · Page 90

Adaptive Activation Functions Accelerate Convergence in Deep and Physics-informed Neural Networks

We employ adaptive activation functions for regression in deep and physics-informed neural networks (PINNs) to approximate smooth and discontinuous functions as well as solutions of linear and nonlinear partial differential equations. In particular, we solve the nonlinear Klein-Gordon equation, which has smooth solutions, the nonlinear Burgers equation, which can admit high gradient solutions, and the Helmholtz equation. We introduce a scalable hyper-parameter in the activation function, which can be optimized to achieve best performance of the network as it changes dynamically the topology of the loss function involved in the optimization process. The adaptive activation function has better learning capabilities than the traditional one (fixed activation) as it improves greatly the convergence rate, especially at early training, as well as the solution accuracy. To better understand the learning process, we plot the neural network solution in the frequency domain to examine how the network captures successively different frequency bands present in the solution. We consider both forward problems, where the approximate solutions are obtained, as well as inverse problems, where parameters involved in the governing equation are identified. Our simulation results show that the proposed method is a very simple and effective approach to increase the efficiency, robustness and accuracy of the neural network approximation of nonlinear functions as well as solutions of partial differential equations, especially for forward problems. We theoretically prove that in the proposed method, gradient descent algorithms are not attracted to suboptimal critical points or local minima.

machine leaning, Bad minima, Inverse problems, Phy↗

Quantum Tensor-Product Decomposition from Choi-State Tomography

The Schmidt decomposition is the go-to tool for measuring bipartite entanglement of pure quantum states. Similarly, it is possible to study the entangling features of a quantum operation using its operator-Schmidt or tensor-product decomposition. While quantum technological implementations of the former are thoroughly studied, entangling properties on the operator level are harder to extract in the quantum computational framework because of the exponential nature of sample complexity. Here, we present an algorithm for unbalanced partitions into a small subsystem and a large one (the environment) to compute the tensor-product decomposition of a unitary the effect of which on the small subsystem is captured in classical memory, while the effect on the environment is accessible as a quantum resource. This quantum algorithm may be used to make predictions about operator nonlocality and effective open quantum dynamics on a subsystem, as well as for finding low-rank approximations and low-depth compilations of quantum circuit unitaries. We demonstrate the method and its applications on a time-evolution unitary of an isotropic Heisenberg model in two dimensions. Published by the American Physical Society 2024

Mansuroglu, Refik (ORCID:000000017352513X)↗

Single-Shot Reconstruction of Electron Beam Longitudinal Phase Space in a Laser Wakefield Accelerator

We report on a single-shot longitudinal phase-space reconstruction diagnostic for electron beams in a laser wakefield accelerator via the experimental observation of distinct periodic modulations in the angularly resolved spectra. Such modulated angular spectra arise as a result of the direct interaction between the ultrarelativistic electron beam and the laser driver in the presence of the wakefield. A constrained theoretical model for the coupled oscillator, assisted by a genetic algorithm, can recreate the experimental electron spectra and, thus, fully reconstructs the longitudinal phase-space distribution of the electron beam with a temporal resolution of approximately 1.3 fs. In particular, it reveals the slice energy spread of the electron beam, which is important to measure for applications such as x-ray free electron lasers. In our experiment, the root-mean-square energy spread retrieved is bounded at 9.9 MeV, corresponding to a 0.9%–3.0% relative spread, despite the overall GeV energy beam having approximately 100% relative energy spread.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Analytical theory for artificial satellites

A theory for generating segmented ephemerides is discussed as a means for fast generation and simple retrieval of nominal orbit data. Over a succession of finite intervals of time, the orbit is represented by a best approximation expressed by Chebyshev polynomials. Storage of coefficients tables for Chebyshev polynomials is seen as a method to reduce data and decrease transmission costs. A general algorithm was constructed and computer programs were designed. The possibility of storing an ephemeris for a few days in the on-board computer, or in microprocessors attached to the data collectors is suggested.

Deprit, A.↗

The use of series-solutions for batch and sequential estimation

Iterative methods for the approximate solution of the nonlinear state estimation problem are investigated in which the solution is retained in the form of a finite series of Chebyshev polynomials. Algorithms are presented which allow the state to be estimated from observational data in either the batch or the sequential form. The advantages of these techniques are discussed.

Feagin, T.↗

Calculations of transonic potential flows by a parameter free procedure

A parameter-free computational procedure for transonic potential flows around an airfoil is presented. The method is based on an inexact, Newton-like iterative scheme, and a preconditioned minimal residual algorithm is used to solve the linear system of equations arising at each iterate. This iterative procedure is formulated so that the difficulties associated with the approximate factorization technique, namely the requirement of iteration parameters and the boundary conditions for the intermediate variable are eliminated. Numerical experiments are given for potential flows around NACA 0012 airfoil with different Mach numbers and different angles of attack. These results are then compared with those obtained by the approximate factorization techniques.

Wong, Y. S.↗

Approach trajectory planning system for maximum concealment

A computer-simulation study was undertaken to investigate a maximum concealment guidance technique (pop-up maneuver), which military aircraft may use to capture a glide path from masked, low-altitude flight typical of terrain following/terrain avoidance flight enroute. The guidance system applied to this problem is the Fuel Conservative Guidance System. Previous studies using this system have concentrated on the saving of fuel in basically conventional land and ship-based operations. Because this system is based on energy-management concepts, it also has direct application to the pop-up approach which exploits aircraft performance. Although the algorithm was initially designed to reduce fuel consumption, the commanded deceleration is at its upper limit during the pop-up and, therefore, is a good approximation of a minimum-time solution. Using the model of a powered-lift aircraft, the results of the study demonstrated that guidance commands generated by the system are well within the capability of an automatic flight-control system. Results for several initial approach conditions are presented.

Warner, David N., Jr.↗

Improved 3-D turbomachinery CFD algorithm

The building blocks of a computer algorithm developed for the time-accurate flow analysis of rotating machines are described. The flow model is a finite volume method utilizing a high resolution approximate Riemann solver for interface flux definitions. This block LU implicit numerical scheme possesses apparent unconditional stability. Multi-block composite gridding is used to orderly partition the field into a specified arrangement. Block interfaces, including dynamic interfaces, are treated such as to mimic interior block communication. Special attention is given to the reduction of in-core memory requirements by placing the burden on secondary storage media. Broad applicability is implied, although the results presented are restricted to that of an even blade count configuration. Several other configurations are presently under investigation, the results of which will appear in subsequent publications.

Janus, J. Mark↗

The multi-zone calculation of turbomachinery flows. II - The multi-zone calculation of the turbulent, two-specie flow through the SSME HPFTP first and second stage cavities

A multi-zone Navier-Stokes methodology to calculate the two-specie flow through the first and second stage cooling cavities of the Space Shuttle Main Engine (SSME) high pressure fuel turbopump (HPFTP) is developed. A simplified two-component fluid formulation is used to model the interaction of coolant and hot gas. Johnston's secant approximation is used to define an appropriate near wall velocity for use in a three-dimensional law of the wall. The basic Navier-Stokes algorithm used is a finite-volume, predictor-corrector algorithm which uses a pressure correction technique. A multi-zone method is used to partition each cavity into easily handled subdomains. The results show that coolant flow is pumped up the turbine wheel for both cavities, creating a region of large temperature gradients on the turbine shank.

Williams, M.↗

Optimal mapping of irregular finite element domains to parallel processors

Mapping the solution domain of n-finite elements into N-subdomains that may be processed in parallel by N-processors is an optimal one if the subdomain decomposition results in a well-balanced workload distribution among the processors. The problem is discussed in the context of irregular finite element domains as an important aspect of the efficient utilization of the capabilities of emerging multiprocessor computers. Finding the optimal mapping is an intractable combinatorial optimization problem, for which a satisfactory approximate solution is obtained here by analogy to a method used in statistical mechanics for simulating the annealing process in solids. The simulated annealing analogy and algorithm are described, and numerical results are given for mapping an irregular two-dimensional finite element domain containing a singularity onto the Hypercube computer.

Flower, J.↗

Performance of FFT methods in local gravity field modelling

Fast Fourier transform (FFT) methods provide a fast and efficient means of processing large amounts of gravity or geoid data in local gravity field modelling. The FFT methods, however, has a number of theoretical and practical limitations, especially the use of flat-earth approximation, and the requirements for gridded data. In spite of this the method often yields excellent results in practice when compared to other more rigorous (and computationally expensive) methods, such as least-squares collocation. The good performance of the FFT methods illustrate that the theoretical approximations are offset by the capability of taking into account more data in larger areas, especially important for geoid predictions. For best results good data gridding algorithms are essential. In practice truncated collocation approaches may be used. For large areas at high latitudes the gridding must be done using suitable map projections such as UTM, to avoid trivial errors caused by the meridian convergence. The FFT methods are compared to ground truth data in New Mexico (xi, eta from delta g), Scandinavia (N from delta g, the geoid fits to 15 cm over 2000 km), and areas of the Atlantic (delta g from satellite altimetry using Wiener filtering). In all cases the FFT methods yields results comparable or superior to other methods.

Forsberg, Rene↗

Variable gamma computations for a forward-firing Space Shuttle Main Engine

A procedure for solving an axisymmetric SSME nozzle exhausting with an equivalent mass flow of two nozzles is presented for the return-to-launch-site (RTLS) maneuver for an engine-out case. The algorithm incorporates a two-species variable gamma formulation along with diffusion terms associated with a species conservation equation. Coupling of this algorithm is accomplished explicitly to the Navier-Stokes PARC2DR and PARC3DR codes. Axisymmetric results indicate a very complicated flowfield with a bow shock extending to approximately 570 radii in front of the nozzle, and low temperatures on what would be an external tank (ET) aft of the nozzle.

Saladino, A. J.↗

A first determination of the surface density of galaxy clusters at very low x-ray fluxes

We present the first results of a serendipitous search for clusters of galaxies in deep ROSAT position sensitive proportional counter (PSPC) pointed observations at high Galactic latitude. The survey is being carried out using a wavelet-based detection algorithm which is not biased against extended, low surface brightness sources. A new flux-diameter limited sample of 10 cluster candidates has been created from approximately 3 deg(exp 2) surveyed area. Preliminary CCD observations have revealed that a large fraction of these candidates correspond to a visible enhancement in the galaxy surface density, and several others have been identified from other surveys. We believe these sources to be either low- to moderate-redshift groups or intermediate- to high-redshift clusters. We show X-ray and optical images of some of the clusters identified to date. We present, for the first time, the derived number density of the galaxy clusters to a flux limit of 1 x 10(exp -14) ergs cm(exp -2) s(exp -1) (0.5-2.0 keV). This extends the log N-log S of previous cluster surveys by more than one decade in flux. Results are compared to theoretical predictions for cluster number counts.

Rosati, Piero↗

Simulation of Transverse Modes in Vertical-Cavity Surface-Emitting Lasers

An approximation to the Maxwell-Semiconductor Bloch equations is solved for the transverse modes of vertical-cavity surface-emitting lasers. A finite-difference algorithm will be used to calculate the detailed time evolution of the transverse mode profiles of VCSELs. Effects of pumping current and refractive index profiles will be investigated.

Goorjian, Peter M. P.↗

Relationship Between Surface Reflectance in the Visible and Mid-IR used in MODIS Aerosol Algorithm-Theory

Data from the Moderate Resolution Imaging Spectroradiometer (MODIS) instrument that flies in polar orbit on the Terra platform, are used to derive the aerosol optical thickness and properties over land and ocean. The relationships between visible reflectance (at blue, rho(sub blue), and red, rho(sub red)) and mid-infrared (at 2.1 microns, rho(sub 2.1)) are used in the MODIS aerosol retrieval algorithm to derive global distribution of aerosols over the land. These relations have been established from a series of measurements indicating that rho(sub blue) is approximately 0.5 rho(sub red) is approximately 0.25 rho(sub 2.1). Here we use a model to describe the transfer of radiation through a vegetation canopy composed of randomly oriented leaves to assess the theoretical foundations for these relationships. Calculations for a wide range of leaf area indices and vegetation fractions show that rho(sub blue) is consistently about 1/4 of rho(sub 2.1) as used by MODIS for the whole range of analyzed cases, except for very dark soils, such as those found in burn scars. For its part, the ratio rho(sub red)/rho(sub 2.1) varies from less than the empirically derived value of 1/2 for dense and dark vegetation, to more than 1/2 for bright mixture of soil and vegetation. This is in agreement with measurements over uniform dense vegetation, but not with measurements over mixed dark scenes. In the later case the discrepancy is probably mitigated by shadows due to uneven canopy and terrain on a large scale. It is concluded that the value of this ratio should ideally be made dependent on the land cover type in the operational processing of MODIS data, especially over dense forests.

Kaufman, Yoram J.↗

Maxwell-Bloch Equations Modeling of Ultrashort Optical Pulse Propagation in Semiconductor Materials

An algorithm has been developed that solves the semiconductor Maxwell-Bloch equations, without making the standard slowly-varying envelope (SVEA) and rotating-wave (RWA) approximations. It is applied to study the propagation of ultrashort pulses in semiconductor materials. The results include many-body effects due to the Coulomb interaction among the charge carriers as well as the nonlinear effects resulting from spectral hole-burning.

Goorjian, Peter M.↗