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,405 records · Page 78

Development of deterministic transport methods for low energy neutrons for shielding in space

Transport of low energy neutrons associated with the galactic cosmic ray cascade is analyzed in this dissertation. A benchmark quality analytical algorithm is demonstrated for use with BRYNTRN, a computer program written by the High Energy Physics Division of NASA Langley Research Center, which is used to design and analyze shielding against the radiation created by the cascade. BRYNTRN uses numerical methods to solve the integral transport equations for baryons with the straight-ahead approximation, and numerical and empirical methods to generate the interaction probabilities. The straight-ahead approximation is adequate for charged particles, but not for neutrons. As NASA Langley improves BRYNTRN to include low energy neutrons, a benchmark quality solution is needed for comparison. The neutron transport algorithm demonstrated in this dissertation uses the closed-form Green's function solution to the galactic cosmic ray cascade transport equations to generate a source of neutrons. A basis function expansion for finite heterogeneous and semi-infinite homogeneous slabs with multiple energy groups and isotropic scattering is used to generate neutron fluxes resulting from the cascade. This method, called the FN method, is used to solve the neutral particle linear Boltzmann transport equation. As a demonstration of the algorithm coded in the programs MGSLAB and MGSEMI, neutron and ion fluxes are shown for a beam of fluorine ions at 1000 MeV per nucleon incident on semi-infinite and finite aluminum slabs. Also, to demonstrate that the shielding effectiveness against the radiation from the galactic cosmic ray cascade is not directly proportional to shield thickness, a graph of transmitted total neutron scalar flux versus slab thickness is shown. A simple model based on the nuclear liquid drop assumption is used to generate cross sections for the galactic cosmic ray cascade. The ENDF/B V database is used to generate the total and scattering cross sections for neutrons in aluminum. As an external verification, the results from MGSLAB and MGSEMI were compared to ANISN/PC, a routinely used neutron transport code, showing excellent agreement. In an application to an aluminum shield, the FN method seems to generate reasonable results.

Ganapol, Barry↗

Development of simplified airborne computations for fuel conservative descents in a time-based metered air traffic environment

The NASA has developed and flight-tested a simple flight management descent algorithm designed to improve the accuracy of delivering an airplane in a fuel-conservative manner to a metering fix at a time designated by air traffic control. This algorithm provides a three-dimensional path with terminal area time constraints (four-dimensional) for an airplane to make an idle-thrust, clean-configured (landing gear up, flaps zero, and speed brakes retracted) descent to arrive at the metering fix at a predetermined time, altitude, and airspeed. The descent path is calculated for a constant Mach/airspeed schedule from linear approximations of airplane performance with considerations given for gross weight, wind, and nonstandard pressure and temperature effects. Applications of the four-dimensional and descent planning capabilities of the algorithm to conventional airplanes is being investigated. This report describes the flight management descent algorithm and presents the results of the flight tests flown with the Terminal Configured Vehicle airplane.

Knox, C. E.↗

Tools for Analysis and Visualization of Large Time-Varying CFD Data Sets

In the second year, we continued to built upon and improve our scanline-based direct volume renderer that we developed in the first year of this grant. This extremely general rendering approach can handle regular or irregular grids, including overlapping multiple grids, and polygon mesh surfaces. It runs in parallel on multi-processors. It can also be used in conjunction with a k-d tree hierarchy, where approximate models and error terms are stored in the nodes of the tree, and approximate fast renderings can be created. We have extended our software to handle time-varying data where the data changes but the grid does not. We are now working on extending it to handle more general time-varying data. We have also developed a new extension of our direct volume renderer that uses automatic decimation of the 3D grid, as opposed to an explicit hierarchy. We explored this alternative approach as being more appropriate for very large data sets, where the extra expense of a tree may be unacceptable. We also describe a new approach to direct volume rendering using hardware 3D textures and incorporates lighting effects. Volume rendering using hardware 3D textures is extremely fast, and machines capable of using this technique are becoming more moderately priced. While this technique, at present, is limited to use with regular grids, we are pursuing possible algorithms extending the approach to more general grid types. We have also begun to explore a new method for determining the accuracy of approximate models based on the light field method described at ACM SIGGRAPH '96. In our initial implementation, we automatically image the volume from 32 equi-distant positions on the surface of an enclosing tessellated sphere. We then calculate differences between these images under different conditions of volume approximation or decimation. We are studying whether this will give a quantitative measure of the effects of approximation. We have created new tools for exploring the differences between images produced by various rendering methods. Images created by our software can be stored in the SGI RGB format. Our idtools software reads in pair of images and compares them using various metrics. The differences of the images using the RGB, HSV, and HSL color models can be calculated and shown. We can also calculate the auto-correlation function and the Fourier transform of the image and image differences. We will explore how these image differences compare in order to find useful metrics for quantifying the success of various visualization approaches. In general, progress was consistent with our research plan for the second year of the grant.

Wilhelms, Jane↗

Neutronics Calculation Advances at Los Alamos: Manhattan Project to Monte Carlo

The history and advances of neutronics calculations at Los Alamos during the Manhattan Project through the present are reviewed. Substantial improvements to neutron diffusion methods and the invention of both the Monte Carlo neutron transport methods in 1947 and deterministic discrete ordinates Sn in 1953 were all made at Los Alamos just after the Manhattan Project. We briefly summarize early simpler and more approximate neutronics methods and then describe the need to better predict neutronics behavior through consideration of theoretical equations, models and algorithms, experimental measurements, and available computing capabilities and their limitations. This paper briefly covers key advances in deterministic methods during the Manhattan Project. These capabilities, coupled with increasing postwar defense needs and the invention of electronic computing with the Electronic Numeric Integrator and Computer, known as ENIAC, and the Mathematical Analyzer Numerical Integrator and Automatic Computer Model, known as MANIAC, led to the creation of Monte Carlo and deterministic discrete ordinates neutronics transport methods. We note the important role that the scientific comradery between the Los Alamos scientists played in the process. This paper briefly covers the early methods, algorithms, computers, and electronic and women pioneers that enabled Monte Carlo to spread to all areas of science. We focus heavily on these early developments and the subsequent creation of the MCNP® code, advances in its associated nuclear data, and its applications to problems of national defense at Los Alamos.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Insights into the origin of halo mass profiles from machine learning

ABSTRACT The mass distribution of dark matter haloes is the result of the hierarchical growth of initial density perturbations through mass accretion and mergers. We use an interpretable machine-learning framework to provide physical insights into the origin of the spherically-averaged mass profile of dark matter haloes. We train a gradient-boosted-trees algorithm to predict the final mass profiles of cluster-sized haloes, and measure the importance of the different inputs provided to the algorithm. We find two primary scales in the initial conditions (ICs) that impact the final mass profile: the density at approximately the scale of the haloes’ Lagrangian patch RL ($R\sim 0.7\, R_L$) and that in the large-scale environment (R ∼ 1.7 RL). The model also identifies three primary time-scales in the halo assembly history that affect the final profile: (i) the formation time of the virialized, collapsed material inside the halo, (ii) the dynamical time, which captures the dynamically unrelaxed, infalling component of the halo over its first orbit, (iii) a third, most recent time-scale, which captures the impact on the outer profile of recent massive merger events. While the inner profile retains memory of the ICs, this information alone is insufficient to yield accurate predictions for the outer profile. As we add information about the haloes’ mass accretion history, we find a significant improvement in the predicted profiles at all radii. Our machine-learning framework provides novel insights into the role of the ICs and the mass assembly history in determining the final mass profile of cluster-sized haloes.

79 ASTRONOMY AND ASTROPHYSICS↗

A Reproducible Validation of Algorithms for Estimating Array Tilt and Azimuth from Photovoltaic Power Time Series

In this research, we assess the viability of four different, publicly available algorithms for estimating the azimuth and tilt parameters of solar photovoltaic systems using only the associated AC power time series data and site latitude-longitude coordinates. In this work, we curated a benchmarking data set of 44 fixed-tilt systems, comprising 275 measured AC power inverter data streams, with known azimuth and tilt parameters. Additionally, we isolated test cases in the data set with real- world issues, including shading and clipping, to determine how algorithm performance varies based on the presence of these phenomena. Using this data set for benchmarking, we evaluated the estimated vs. actual system characteristics for each algorithm, as well as the associated algorithm execution time using a standardized benchmarking process. The two highest performing algorithms were the Solar Data Tools and the PVWatts 5- based methods, which both achieved a median absolute error of approximately 5 and 1 degrees for azimuth and tilt, respectively. During run time analysis, the SDT method was approximately 5 times faster than the PVWatts 5-based method, with the median execution time for a stream varying between 6 and 8 seconds vs. a median run time of 31 seconds for the PVWatts 5-based method.

azimuth↗

Benchmark Solutions for Radiation Transport in Stochastic Media with Inhomogeneous Material Statistics

Accurately solving implicit Monte Carlo (IMC) thermal photon transport problems with mixed material cells is important in realistic applications. The production IMC package at LLNL treats mixed material cells arising from ALE remap and hydrodynamics using the same approximate model. The new Imp IMC thermal photon transport package currently under development has both a material interface reconstruction (MIR) algorithm and a Levermore-Pomraning (LP) stochastic medium algorithm for treating mixed material cells. Existing stochastic medium algorithms for treating mixed material cells in IMC lack a complete theoretical basis. The IMC LP algorithm implementation has been demonstrated to reproduce published deterministic LP solutions for the particular case of spatially homogeneous material statistics. Realistic simulations will include spatially inhomogeneous material statistics (material mean chord lengths). In a previous investigation, the LP-model for transport in binary stochastic media in rod geometry was generalized to accommodate spatially varying material chord lengths, i.e., the mixing statistics were allowed to be nonhomogeneous. Analytical solutions were obtained and used to produce a verifi cation suite for the Imp IMC Levermore-Pomraning implementation for different spatial variations of the chord lengths. However, the accuracy of the LP model when the mixing statistics are nonhomogeneous has not been assessed and leaves open the question of whether local accuracy is improved or further degraded when chord lengths are not uniform. This shortcoming is rectifi ed here by developing benchmark analytic solutions for transport in binary Markovian stochastic mixtures in rod geometry with nonhomogeneous mixing statistics, using spatially varying chord lengths considered in the previous investigation based on the LP model. Methods for sampling a nonhomogeneous Poisson process (NHPP) are first described and used to construct individual realizations of the binary mixtures in rod geometry. Analytic solutions are then obtained for the forward and backward directed fluxes on a given realization, now viewed as a deterministic medium with alternating layers of the two materials with known interface locations. Finally, material averaged scalar fluxes are obtained using these sampling schemes with spatially linear and quadratic chord lengths and used to assess the accuracy of the previously obtained LP-model results.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Data Remapping Between One Dimensional Meshes [Slides]

Remapping involves two meshes (source and target), where a discrete set of field values (data) is available on only one of the meshes (source mesh). Since the source and target mesh can be different, we need to find an approximation of the field on the target mesh using the data available on the source mesh. We will consider two algorithms for this problem: point-wise remap and conservative remap.

79 ASTRONOMY AND ASTROPHYSICS↗

Nonlinear estimation theory applied to the interplanetary orbit determination problem.

Martingale theory and appropriate smoothing properties of Loeve (1953) have been used to develop a modified Gaussian second-order filter. The performance of the filter is evaluated through numerical simulation of a Jupiter flyby mission. The observations used in the simulation are on-board measurements of the angle between Jupiter and a fixed star taken at discrete time intervals. In the numerical study, the influence of each of the second-order terms is evaluated. Five filter algorithms are used in the simulations. Four of the filters are the modified Gaussian second-order filter and three approximations derived by neglecting one or more of the second-order terms in the equations. The fifth filter is the extended Kalman-Bucy filter which is obtained by neglecting all of the second-order terms.

Tapley, B. D.↗

Accuracies of three computationally efficient algorithms for computing atmospheric transmittances

Three algorithms for calculating polychromatic atmospheric transmittance functions have been tested using a set of eleven distinct temperature profiles in order to compare transmittance accuracies achievable by the three methods. The comparison of rms errors demonstrates that the iterative method of McMillin and Fleming (1976) is the most accurate of the efficient algorithms currently available for gases with constant mixing ratios; its accuracy approaches that of the spectroscopic parameters and the computational approximations used in the ground-truth line-by-line calculations. The method of Arking et al. (1974), while less accurate, has the advantage of being perfectly general and easily adapted to cases where spectral bandwidths are varied

Mcmillin, L. M.↗

A study of the geographic coverage properties of a satellite borne Doppler lidar wind velocity measuring system

Geographic coverage frequency and geographic shot density for a satellite borne Doppler lidar wind velocity measuring system are measured. The equations of motion of the light path on the ground were derived and a computer program devised to compute shot density and coverage frequency by latitude-longitude sections. The equations for the coverage boundaries were derived and a computer program developed to plot these boundaries, thus making it possible, after an application of a map coloring algorithm, to actually see the areas of multiple coverage. A theoretical cross-swath shot density function that gives close approximations in certain cases was also derived. This information should aid in the design of an efficient data-processing system for the Doppler lidar.

Pate, T. H.↗

Space shuttle propulsion parameter estimation using optional estimation techniques

A regression analyses on tabular aerodynamic data provided. A representative aerodynamic model for coefficient estimation. It also reduced the storage requirements for the "normal' model used to check out the estimation algorithms. The results of the regression analyses are presented. The computer routines for the filter portion of the estimation algorithm and the :"bringing-up' of the SRB predictive program on the computer was developed. For the filter program, approximately 54 routines were developed. The routines were highly subsegmented to facilitate overlaying program segments within the partitioned storage space on the computer.

Source record↗

Research on output feedback control of systems with ill-conditioned dynamics

The accuracy of a two time scale approach to the output feedback regulator design problem is examined. An approximate quadratic performance index which reflects a two time scale decomposition of the system dynamics is developed. A sequential numerical algorithm is defined which obtains output feedback gains minimizing a broad class of performance indices, including the standard LQ case. A procedure for optimally zeroing selected gain elements in an output feedback gain matrix is developed and demonstrated. A summary of conference and journal publications from this research is also provided.

Calise, A. J.↗

An implicit flux-difference splitting scheme for three-dimensional, incompressible Navier-Stokes solutions to leading edge vortex flows

A new, implicit finite-difference scheme designed to solve the conservative, flux-difference split Navier-Stokes equations is used to compute incompressible vortex flows around delta wings. The completely vectorizable hybrid algorithm is constructed in delta form for steady state solutions independent of the time-step sizes. The scheme combines approximate factorization in crossflow planes with a symmetric planar Gauss-Seidel relaxation in the remaining spatial direction. The governing equations are solved in curvilinear, body-fitted coordinates for treating complex geometries. The computed flow field results are compared with other theoretical and experimental data.

Hartwich, P.-M.↗

Multisensor comparison of ice concentration estimates in the marginal ice zone

Aircraft remote sensing data collected during the 1984 summer Marginal Ice Zone Experiment in the Fram Strait are used to compare ice concentration estimates derived from synthetic aperture radar (SAR) imagery, passive microwave imagery at several frequencies, aerial photography, and spectral photometer data. The comparison is carried out not only to evaluate SAR performance against more established techniques but also to investigate how ice surface conditions, imaging geometry, and choice of algorithm parameters affect estimates made by each sensor.Active and passive microwave sensor estimates of ice concentration derived using similar algorithms show an rms difference of 13 percent. Agreement between each microwave sensor and near-simultaneous aerial photography is approximately the same (14 percent). The availability of high-resolution microwave imagery makes it possible to ascribe the discrepancies in the concentration estimates to variations in ice surface signatures in the scene.

Burns, B. A.↗

A space-marching method for the computation of viscous internal flows

A space-marching method has been developed to compute 3-D viscous flows in internal geometries. The Navier-Stokes equations have been posed as an initial-value problem by neglecting the effects of streamwise diffusion and treating the streamwise pressure gradient as a known source term. The fully coupled system of equations has been solved by a noniterative algorithm at each streamwise step of the computation. A low Mach number formulation of the equations has been used to compute incompressible flow fields. A computer program has been written to implement all aspects of the space-marching algorithm. The program is modular and is easily adapted to the widely varying geometries of internal flows. The space-marching algorithm has been tested by computing simple flows with known analytical solutions. The method has been used to predict complex 3-D turbulent flows. The algorithm is stable and very economical. A single sweep of the flow field by the space-marching method is approximately equivalent to one time-step of the time-marching method.

Govindan, T. R.↗

The effects of longitudinal roughness elements upon the turbulent boundary layer

Velocity profiles and bursting statistics were measured in the presence of cylindrical longitudinal roughness elements (LREs) and compared to similar work by Johansen and Smith (1986). An algorithm was devised to detect low speed streaks (LSS) from the hot-wire rake data, allowing an estimation of the LREs' ability to reduce spatial randomness of the sublayer structure. The velocity profiles agree with Johansen and Smith's result that the effects of the LREs are felt only for y(+) less than about 15. The analysis of the bursting statistics and LSS algorithm output shows that the flow relaxes back to a flat plate boundary layer between the LREs. A crude first approximation is that the LREs simply impose the no-slip boundary condition at an elevation equivalent to their diameter. While the LREs might serve as a nucleation site for the LSS, spatial randomness of the structure is affected only very close to the LREs.

Blackwelder, R. F.↗

On the parallel solution of parabolic equations

Parallel algorithms for the solution of linear parabolic problems are proposed. The first of these methods is based on using polynomial approximation to the exponential. It does not require solving any linear systems and is highly parallelizable. The two other methods proposed are based on Pade and Chebyshev approximations to the matrix exponential. The parallelization of these methods is achieved by using partial fraction decomposition techniques to solve the resulting systems and thus offers the potential for increased time parallelism in time dependent problems. Experimental results from the Alliant FX/8 and the Cray Y-MP/832 vector multiprocessors are also presented.

Gallopoulos, E.↗