Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm timings”

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 523 records · Page 29

Attitude Determination by Using Horizon and Sun Sensors

The Pointing and Alignment Workstation (PAWS) developed by Teledyne Brown Engineering (TBE) has successfully supported the first and second Atmospheric Laboratory for Applications and Science (ATLAS 1, 2) spacelab missions for NASA. The primary PAWS objective was to provide realtime pointing information to instruments whose line of-sight is dependent on Shuttle attitude and to study/quantify the causes and effects of Shuttle and payload pointing errors. In addition to Shuttle IMU attitude information, PAWS used atmospheric science sensors data to determine the spacecraft attitude. PAWS successfully achieved these goals by acquiring and processing data during the ATLAS 1, 2 mission. This paper presents the attitude determination algorithm real time processing, and results of post mission analysis. The findings of this study include the quality of the horizon sensor and IMU measurements as well as accuracy of attitude processor algorithm.

Huang, Allen K. H.↗

Analytic derivative couplings for spin-flip configuration interaction singles and spin-flip time-dependent density functional theory

We revisit the calculation of analytic derivative couplings for configuration interaction singles (CIS), and derive and implement these couplings for its spin-flip variant for the first time. Our algorithm is closely related to the CIS analytic energy gradient algorithm and should be straightforward to implement in any quantum chemistry code that has CIS analytic energy gradients. The additional cost of evaluating the derivative couplings is small in comparison to the cost of evaluating the gradients for the two electronic states in question. Incorporation of an exchange-correlation term provides an ad hoc extension of this formalism to time-dependent density functional theory within the Tamm-Dancoff approximation, without the need to invoke quadratic response theory or evaluate third derivatives of the exchange-correlation functional. Application to several different conical intersections in ethylene demonstrates that minimum-energy crossing points along conical seams can be located at substantially reduced cost when analytic derivative couplings are employed, as compared to use of a branching-plane updating algorithm that does not require these couplings. Application to H{sub 3} near its D{sub 3h} geometry demonstrates that correct topology is obtained in the vicinity of a conical intersection involving a degenerate ground state.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Validation of the stochastic inversion algorithm for acoustic travel-time tomography: a large eddy simulation study

Acoustic tomography (AT) is explored as a remote sensing technique to obtain instantaneous snapshots of temperature and velocity fluctuations for wind energy applications. This study integrates Large Eddy Simulation (LES) with the Stochastic Inversion (SI) method to validate the algorithm’s capacity for accurate reconstruction of atmospheric fluctuations. The initial findings demonstrate the efficacy of the method in accurately capturing the predominant flow structures. Normalized L2 error evaluations further inform the algorithm’s precision, with errors accentuated in less sampled peripheral regions. The results underscore the method’s promise as a non-intrusive observational tool, with ongoing development poised to improve its precision and reliability.

17 WIND ENERGY↗

The Feasibility of Incorporating a 3D Velocity Model Into Earthquake Location Around Salt Lake City, UT Using a Physics Informed Neural Network

Earthquake location algorithms typically require travel time calculation. Doing this calculation in 3D, despite advances in algorithm efficiency and computational power, can still be prohibitively expensive in terms of resources and storage. Implementation of high-resolution 3D models in routine earthquake location would be a significant step forward in most of the world. Machine learning algorithms have potential to act as substitutes for travel time calculation algorithms or stored travel time tables. We investigate EikoNet - a physics informed neural network machine learning model that estimates travel times very quickly and comes with negligible memory-overhead. Specifically, we apply EikoNet to the Wasatch Fault Community Velocity Model (WFCVM), a highly detailed and complex 3D velocity model of the Salt Lake City, UT region. While routine locations in the area and studies of the 2020 Magna, UT earthquake sequence used a 1D velocity model, a 3D model may help better our understanding the structure of the major fault in the region. Our primary goal was to test the speed, memory requirements, and accuracy of EikoNet compared to a reference eikonal solver. We find that while the EikoNet is exceedingly fast and requires little memory overhead, achieving acceptable accuracy in estimated travel times is difficult and requires extensive computational resources.

58 GEOSCIENCES↗

Exponential Convergence of the Tracking Error in Adaptive Systems Without Persistent Excitation

Persistent excitation conditions which ensure parameter convergence in adaptive algorithms have been studied by many researchers. Here, conditions are investigated for exponential convergence of the tracking error in feedforward adaptive systems without persistent excitation. Particular attention is paid to the continuous-time LMS algorithm in the overparametrized case. Results are presented.

control↗

A fast multigrid algorithm for energy minimization under planar density constraints.

The two-dimensional layout optimization problem reinforced by the efficient space utilization demand has a wide spectrum of practical applications. Formulating the problem as a nonlinear minimization problem under planar equality and/or inequality density constraints, we present a linear time multigrid algorithm for solving a correction to this problem. The method is demonstrated in various graph drawing (visualization) instances.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

A generalized memory test algorithm

A general algorithm for testing digital computer memory is presented. The test checks that (1) every bit can be cleared and set in each memory work, and (2) bits are not erroneously cleared and/or set elsewhere in memory at the same time. The algorithm can be applied to any size memory block and any size memory word. It is concise and efficient, requiring the very few cycles through memory. For example, a test of 16-bit-word-size memory requries only 384 cycles through memory. Approximately 15 seconds were required to test a 32K block of such memory, using a microcomputer having a cycle time of 133 nanoseconds.

Milner, E. J.↗

Earth radiation budget measurements - Pre-ERBE, ERBE, and CERES

The paper reviews experiments dealing with the earth's radiation budget for the last two decades. Attention is focused on the major areas of concern in the satellite measurements: instrument calibration, angular dependence of the radiation leaving the atmosphere, and space and time dependence of the flux fields. It is pointed out that the current radiation-budget measurements come from the Earth Radiation Budget Experiment (ERBE) with improved calibration, estimates of the instantaneous flux, and algorithms for time interpolation. A new set of measurements will be produced from an investigation of the Clouds and the Earth's Radiant Energy System (CERES), a part of the Earth Observing System (EOS). CERES is expected to produce the radiation field from the top of the atmosphere to the earth's surface.

Barkstrom, Bruce R.↗

Modeling of the SPERT Transients Using SERPENT2 with Time Dependent Capabilities

Over the last decade, multiphysics coupled calculations have become one of the most important research topics in the area of development and enhancement of reactor analysis and simulation tools. One of the main applications of these coupled simulations is transient analysis, which may involve modeling of experiments, normal plant operation or accident scenarios. Traditionally, the reactor physics side of coupled simulations has been represented by deterministic or hybrid Monte Carlo - deterministic methods. Monte Carlo techniques are limited by their high computational cost. However increased computing power makes their application to multiphysics modeling of transients feasible. Active research is underway to develop algorithms for time dependent calculations, implement them in Monte Carlo codes, and evaluate their performance. In this paper time dependent simulations of the SPERT experiments using the Serpent2 code are presented.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

New perspectives on superparameterization for geophysical turbulence

This is a research expository paper regarding superparameterization, a class of multi-scale numerical methods designed to cope with the intermittent multi-scale effects of inhomogeneous geophysical turbulence where energy often inverse-cascades from the unresolved scales to the large scales through the effects of waves, jets, vortices, and latent heat release from moist processes. Original as well as sparse space–time superparameterization algorithms are discussed for the important case of moist atmospheric convection including the role of multi-scale asymptotic methods in providing self-consistent constraints on superparameterization algorithms and related deterministic and stochastic multi-cloud parameterizations. Test models for the statistical numerical analysis of superparameterization algorithms are discussed both to elucidate the performance of the basic algorithms and to test their potential role in efficient multi-scale data assimilation. The very recent development of grid-free seamless stochastic superparameterization methods for geophysical turbulence appropriate for “eddy-permitting” mesoscale ocean turbulence is presented here including a general formulation and illustrative applications to two-layer quasigeostrophic turbulence, and another difficult test case involving one-dimensional models of dispersive wave turbulence. This last test case has randomly generated solitons as coherent structures which collapse and radiate wave energy back to the larger scales, resulting in strong direct and inverse turbulent energy cascades.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Phase Sensor for Aligning a Segmented Telescope Mirror

A phase sensor has been developed for use in aligning a segmented telescope mirror to within a fraction of a wavelength in piston. (As used here, piston signifies displacement of a mirror segment along the optical axis of the telescope.) Such precise alignment is necessary in order to realize the full benefit of the large aperture achievable through segmentation. This phase sensor is achromatic. It is based on two-wavelength shearing interferometry, and can be modified to utilize an extended or broad-band (e.g., white) light source. The sensor optics include a ruled diffraction grating and an imaging lens. The sensor can measure the piston shift between segments as well as aberrations of the segments. It can measure the surface error of an individual segment, making it possible to compensate for the error with optimal amount(s) of piston and/or tilt. The precise capture range of the sensor depends partly on the telescope design; the largest relative piston shifts measurable by use of this sensor are of the order of 100 m. The accuracy of the sensor also depends partly on the telescope design; in general, the accuracy is sufficient to enable alignment to within approximately half a wavelength. The interferometric image is digitized and processed by a simple algorithm in real time, and the output of the algorithm can be used to maintain alignment in real time, even in the presence of atmospheric turbulence. The sensor is robust. Through calibration, it can be made insensitive to (and, hence, tolerant of) misalignments and aberrations of its own optics, most aberrations of the telescope as a whole (in contradistinction to aberrations of individual segments), and most aberrations introduced by atmospheric turbulence

Stahl, Philip↗

Accelerating Time-Varying Hardware Volume Rendering Using TSP Trees and Color-Based Error Metrics

This paper describes a new hardware volume rendering algorithm for time-varying data. The algorithm uses the Time-Space Partitioning (TSP) tree data structure to identify regions within the data that have spatial or temporal coherence. By using this coherence, the rendering algorithm can improve performance when the volume data is larger than the texture memory capacity by decreasing the amount of textures required. This coherence can also allow improved speed by appropriately rendering flat-shaded polygons instead of textured polygons, and by not rendering transparent regions. To reduce the polygonization overhead caused by the use of the hierarchical data structure, we introduce an optimization method using polygon templates. The paper also introduces new color-based error metrics, which more accurately identify coherent regions compared to the earlier scalar-based metrics. By showing experimental results from runs using different data sets and error metrics, we demonstrate that the new methods give substantial improvements in volume rendering performance.

Ellsworth, David↗

An Exact Algorithm for the Linear Tape Scheduling Problem

Magnetic tapes are often considered as an outdated storage technology, yet they are still used to store huge amounts of data. Their main interests are a large capacity and a low price per gigabyte, which come at the cost of a much larger file access time than on disks. With tapes, finding the right ordering of multiple file accesses is thus key to performance. Moving the reading head back and forth along a kilometer long tape has a non-negligible cost and unnecessary movements thus have to be avoided. However, the optimization of tape request ordering has rarely been studied in the scheduling literature, much less than I/O scheduling on disks. For instance, minimizing the average service time for several read requests on a linear tape remains an open question. Therefore, in this paper, we aim at improving the quality of service experienced by users of tape storage systems, and not only the peak performance of such systems. To this end, we propose a reasonable polynomial-time exact algorithm while this problem and simpler variants have been conjectured NP-hard. We also refine the proposed model by considering U-turn penalty costs accounting for inherent mechanical accelerations. Then, we propose a low-cost variant of our optimal algorithm by restricting the solution space, yet still yielding an accurate suboptimal solution. Finally, we compare our algorithms to existing solutions from the literature on logs of the mass storage management system of a major datacenter. This allows us to assess the quality of previous solutions and the improvement achieved by our low-cost algorithm. Aiming for reproducibility, we make available the complete implementation of the algorithms used in our evaluation, alongside the dataset of tape requests that is, to the best of our knowledge, the first of its kind to be publicly released.

Honoré, Valentin↗

Evaluating Retrieval Algorithm Climate Stability: Estimating 3D Optical Thickness Bias Distributions by Cloud Type

Detecting climate trends on large spatiotemporal scales requires accurate, stable measurements and stable retrieval algorithms. We strive to estimate how time-variant retrieval algorithm biases may impact trend detection. Here we focus on the 3D cloud optical thickness (τc) bias, which is among the largest in passive cloud retrieval algorithms. If this bias is time dependent, a possibility with potential decadal changes in cloud morphology, it may obscure genuine trends in τc. Although previous studies have evaluated the cloud- and sun-view geometry-dependent 3D τc bias on small spatial scales, before our current study none have evaluated the stability of this well-known bias on climate-relevant large spatiotemporal scales. These studies must estimate large scale distributions of the 3D τc bias by cloud type and estimate how cloud type amount may change between two climate states. We employ a novel approach to estimate large scale distributions of 3D τc using a proxy of the bias that quantifies the departure of clouds from satisfying the 1D radiative transfer assumption used in passive τc retrievals. This existing globally-distributed proxy is an angular consistency metric that was developed using fused Moderate-Resolution Imaging Spectroradiometer (MODIS) and Multi-angle Imaging Spectroradiometer (MISR) measurements. Calculating the 3D τc bias and the proxy, for known cloud fields enables us to establish statistical relationships between these two quantities, which can be used to calculate large-scale distributions of the 3D τc bias. This approach limits the number of 3D radiative transfer simulations required to only those needed to estimate a statistical relationship between the 3D τc bias for known cloud fields and a proxy of the bias. It is likely that future studies will be needed to evaluate retrieval algorithm bias stability for other geophysical variables as the community develops climate data records from satellite observations and their retrievals. This must be done in addition to monitoring and correcting measurement errors and uncertainties and understanding their impact on retrieved essential climate variables.

Yolanda Shea↗

A semi-implicit integration scheme for the stress update of viscoSCRAM

This report documents three improvements made to the implementation of a historically significant material model used in W13 for simulations involving components made of PBX9501. ViscoSCRAM combines linear viscoelasticity with isotropic damage evolution based on fracture mechanics concepts. The original implementation was focused on short duration transient events, thus an explicit update scheme was used. For longer duration simulations which employ relatively larger time step sizes the explicit update scheme is inadequate. This work presents a new semi-implicit update scheme suitable for simulations using relatively large time steps. The algorithm solves a nonlinear system of equations to ensure that the stress, damaged state, and internal (Maxwell) stresses are in agreement with implicit update equations at the end of each increment. The crack growth is advanced in time using a subincremental explicit scheme, thus the entire implementation is semi-implicit. Additionally, modifications to the crack growth kinetics are proposed and implemented obviating the need for an empirical tensile damage growth rate (TDGR) multiplier used in previous implementations. Finally, an automatic time stepping algorithm is implemented to adjust the time step size based on error estimates for the generalized Maxwell model update scheme. Model parameters are fit to existing data and example problems are simulated using both new and legacy implementations to assess comparative advantages and disadvantages.

Engineering(42)↗

Parallel Simulation of Unsteady Turbulent Flames

Time-accurate simulation of turbulent flames in high Reynolds number flows is a challenging task since both fluid dynamics and combustion must be modeled accurately. To numerically simulate this phenomenon, very large computer resources (both time and memory) are required. Although current vector supercomputers are capable of providing adequate resources for simulations of this nature, the high cost and their limited availability, makes practical use of such machines less than satisfactory. At the same time, the explicit time integration algorithms used in unsteady flow simulations often possess a very high degree of parallelism, making them very amenable to efficient implementation on large-scale parallel computers. Under these circumstances, distributed memory parallel computers offer an excellent near-term solution for greatly increased computational speed and memory, at a cost that may render the unsteady simulations of the type discussed above more feasible and affordable.This paper discusses the study of unsteady turbulent flames using a simulation algorithm that is capable of retaining high parallel efficiency on distributed memory parallel architectures. Numerical studies are carried out using large-eddy simulation (LES). In LES, the scales larger than the grid are computed using a time- and space-accurate scheme, while the unresolved small scales are modeled using eddy viscosity based subgrid models. This is acceptable for the moment/energy closure since the small scales primarily provide a dissipative mechanism for the energy transferred from the large scales. However, for combustion to occur, the species must first undergo mixing at the small scales and then come into molecular contact. Therefore, global models cannot be used. Recently, a new model for turbulent combustion was developed, in which the combustion is modeled, within the subgrid (small-scales) using a methodology that simulates the mixing and the molecular transport and the chemical kinetics within each LES grid cell. Finite-rate kinetics can be included without any closure and this approach actually provides a means to predict the turbulent rates and the turbulent flame speed. The subgrid combustion model requires resolution of the local time scales associated with small-scale mixing, molecular diffusion and chemical kinetics and, therefore, within each grid cell, a significant amount of computations must be carried out before the large-scale (LES resolved) effects are incorporated. Therefore, this approach is uniquely suited for parallel processing and has been implemented on various systems such as: Intel Paragon, IBM SP-2, Cray T3D and SGI Power Challenge (PC) using the system independent Message Passing Interface (MPI) compiler. In this paper, timing data on these machines is reported along with some characteristic results.

Menon, Suresh↗

Advanced MHD Algorithm for Solar and Space Science: lst Year Semi Annual Progress Report

We report progress for the development of MH4D for the first and second quarters of FY2004, December 29, 2002 - June 6, 2003. The present version of MH4D can now solve the full viscous and resistive MHD equations using either an explicit or a semi-implicit time advancement algorithm. In this report we describe progress in the following areas. During the two last quarters we have presented poster at the EGS-AGU-EUG Joint Assembly in Nice, France, April 6-11, 2003, and a poster at the 2003 International Sherwood Theory Conference in Corpus Christi, Texas, April 28-30 2003. In the area of code development, we have implemented the MHD equations and the semi-implicit algorithm. The new features have been tested.

Schnack, Dalton D.↗