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 577 records · Page 32

Imaging Complex Subsurface Structures for Geothermal Exploration at Pirouette Mountain and Eleven-Mile Canyon in Nevada

Accurate imaging of subsurface complex structures with faults is crucial for geothermal exploration because faults are generally the primary conduit of hydrothermal flow. It is very challenging to image geothermal exploration areas because of complex geologic structures with various faults and noisy surface seismic data with strong and coherent ground-roll noise. In addition, fracture zones and most geologic formations behave as anisotropic media for seismic-wave propagation. Properly suppressing ground-roll noise and accounting for subsurface anisotropic properties are essential for high-resolution imaging of subsurface structures and faults for geothermal exploration. We develop a novel wavenumber-adaptive bandpass filter to suppress the ground-roll noise without affecting useful seismic signals. This filter adaptively exploits both characteristics of the lower frequency and the smaller velocity of the ground-roll noise than those of the signals. Consequently, this filter can effectively differentiate the ground-roll noise from the signal. We use our novel filter to attenuate the ground-roll noise in seismic data along five survey lines acquired by the U.S. Navy Geothermal Program Office at Pirouette Mountain and Eleven-Mile Canyon in Nevada, United States. We then apply our novel anisotropic least-squares reverse-time migration algorithm to the resulting data for imaging subsurface structures at the Pirouette Mountain and Eleven-Mile Canyon geothermal exploration areas. The migration method employs an efficient implicit wavefield-separation scheme to reduce image artifacts and improve the image quality. Our results demonstrate that our wavenumber-adaptive bandpass filtering method successfully suppresses the strong and coherent ground-roll noise in the land seismic data, and our anisotropic least-squares reverse-time migration produces high-resolution subsurface images of Pirouette Mountain and Eleven-Mile Canyon, facilitating accurate fault interpretation for geothermal exploration.

15 GEOTHERMAL ENERGY↗

Reliable and Efficient Parallel Processing Algorithms and Architectures for Modern Signal Processing

Least-squares (LS) estimations and spectral decomposition algorithms constitute the heart of modern signal processing and communication problems. Implementations of recursive LS and spectral decomposition algorithms onto parallel processing architectures such as systolic arrays with efficient fault-tolerant schemes are the major concerns of this dissertation. There are four major results in this dissertation. First, we propose the systolic block Householder transformation with application to the recursive least-squares minimization. It is successfully implemented on a systolic array with a two-level pipelined implementation at the vector level as well as at the word level. Second, a real-time algorithm-based concurrent error detection scheme based on the residual method is proposed for the QRD RLS systolic array. The fault diagnosis, order degraded reconfiguration, and performance analysis are also considered. Third, the dynamic range, stability, error detection capability under finite-precision implementation, order degraded performance, and residual estimation under faulty situations for the QRD RLS systolic array are studied in details. Finally, we propose the use of multi-phase systolic algorithms for spectral decomposition based on the QR algorithm. Two systolic architectures, one based on triangular array and another based on rectangular array, are presented for the multiphase operations with fault-tolerant considerations. Eigenvectors and singular vectors can be easily obtained by using the multi-pase operations. Performance issues are also considered.

Liu, Kuojuey Ray↗

Lightning Jump Algorithm Development for the GOES·R Geostationary Lightning Mapper

Current work on the lightning jump algorithm to be used in GOES‐R Geostationary Lightning Mapper (GLM)'s data stream is multifaceted due to the intricate interplay between the storm tracking, GLM proxy data, and the performance of the lightning jump itself. This work outlines the progress of the last year, where analysis and performance of the lightning jump algorithm with automated storm tracking and GLM proxy data were assessed using over 700 storms from North Alabama. The cases analyzed coincide with previous semi‐objective work performed using total lightning mapping array (LMA) measurements in Schultz et al. (2011). Analysis shows that key components of the algorithm (flash rate and sigma thresholds) have the greatest influence on the performance of the algorithm when validating using severe storm reports. Automated objective analysis using the GLM proxy data has shown probability of detection (POD) values around 60% with false alarm rates (FAR) around 73% using similar methodology to Schultz et al. (2011). However, when applying verification methods similar to those employed by the National Weather Service, POD values increase slightly (69%) and FAR values decrease (63%). The relationship between storm tracking and lightning jump has also been tested in a real‐time framework at NSSL. This system includes fully automated tracking by radar alone, real‐time LMA and radar observations and the lightning jump. Results indicate that the POD is strong at 65%. However, the FAR is significantly higher than in Schultz et al. (2011) (50‐80% depending on various tracking/lightning jump parameters) when using storm reports for verification. Given known issues with Storm Data, the performance of the real‐time jump algorithm is also being tested with high density radar and surface observations from the NSSL Severe Hazards Analysis & Verification Experiment (SHAVE).

Schultz. E.↗

Agent-Based Coordination Scheme for PV Integration (ABC4PV)

Renewables and especially photovoltaics (PV) have benefitted significantly from a host of incentives and policies targeted toward enhanced integration and adoption of specific energy technologies. However, with the push to move forward into a subsidy-free market framework, behind-the-meter residential PV applications have generally struggled to retain their value (unlike utility scale and commercial projects) [1]. This project focused on developing control-theoretic solutions aimed at improving the integration and interaction of behind-the-meter residential PV with other distribution system assets (controllable and non-controllable) to enhance the integrated value of residential PV. To this end, a suite of decentralized control methodologies have been developed to enable effective coordination and control of behind-the-meter residential load customers’ PV, battery storage systems (BSS), controllable loads and other similar assets within a distribution feeder. This interaction aims at procuring energy savings and, thus, energy bill savings. The main source of savings is drawn from reducing the effect of demand charge pricing and is realized at the feeder level, assuming community level interaction and management among the aforementioned assets. Optimal control of the assets is implemented with a distributed optimization methodology, leveraging consensus-based algorithms. The results gathered from the optimal control simulations demonstrates that the savings can be duly achieved and the algorithm decision times (to dynamically control asset set points, for example) are fast. As for the overall efficiency of PV+BSS systems, to procure energy savings from curtailment of the demand charge pricing effects, the optimal control is set up so as to minimize the variance of the load for all customers, throughout a feeder and throughout time in a rolling horizon scheduling with model predictive control. The control takes into account inter-temporal electrochemical storage (battery) degradation costs: specifically, we have developed a long-term lifetime model for the BSS that weighs in the effect of the degradation factor in the dispatch formulations, thus, a considerable operating cost that affects energy decision making. The levelized cost of energy (LCOE – redefined for the purpose of quantifying asset integration effectiveness through the customers’ energy cost) is shown to be below the threshold set for the combined PV+BSS topology of $ 0.14/kWh for multiple cases of PV penetration all the way up to 50%, provided that a policy of shared ownership of and savings is in place. Further, the LCOE calculated for the case before the deployment PV+BSS systems is also achievable, i.e. the deployment of PV+BSS, if planned and scheduled optimally. will have no effect on customers’ energy costs. From the control methodology viewpoint, the developed consensus-based algorithms are shown to converge for a wide range of problem cases (spanning normal operating scenarios and contingencies), guaranteeing dispatch solutions under forecasting errors, communication break-downs and cyber-security attacks. The proposed control solutions are scalable and real-time implementable, with dispatch computations and device set-point updates converging in less than 2s in most practical instances of the above events.

14 SOLAR ENERGY↗

Quantum simulation of nuclear inelastic scattering

We present a time-dependent quantum algorithm for nuclear inelastic scattering in the time-dependent basis function on qubits approach. This algorithm aims to quantum simulate a subset of the nuclear inelastic scattering problems that are of physical interest in which the internal degrees of freedom of the reaction system are excited by time-dependent external interactions. We expect that our algorithm will enable an exponential speedup in simulating the dynamics of the subset of the inelastic scattering problems, which would also be advantageous for the applications to more complicated scattering problems. For a demonstration problem, we solve for the Coulomb excitation of the deuteron, where the quantum simulations are performed with IBM Qiskit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Topological Quantum Hashing with the Icosahedral Group

We study an efficient algorithm to hash any single-qubit gate into a braid of Fibonacci anyons represented by a product of icosahedral group elements. By representing the group elements by braid segments of different lengths, we introduce a series of pseudogroups. Joining these braid segments in a renormalization group fashion, we obtain a Gaussian unitary ensemble of random-matrix representations of braids. With braids of length O(log{sup 2}(1/{epsilon})), we can approximate all SU(2) matrices to an average error {epsilon} with a cost of O(log(1/{epsilon})) in time. The algorithm is applicable to generic quantum compiling.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Graph-based Reversible Evaluation and Tangents Library

GRETL is a C++ library for evaluation, re-evaluation and algorithmic differentiation of functional operations on an arbitrary computational graph with limited memory usage. Similar to popular machine learning frameworks in Python, like PyTorch and JAX, it tracks and stores both operations and output data as functions are evaluated. Once this composition of functions is built up, the entire chain of operations can be back propagated to compute sensitivities of the final result with respect to any number of inputs. In contrast to most machine learning applications, memory usage becomes the bottleneck for back propagation in many physics applications, especially for time-dependent PDEs. Dynamic check pointing becomes essential. An important distinguishing feature of GRETL is its ability to limit the maximum memory usage by automatically dynamic checkpointing the data output for each graph operation (see Wang, Moin, Iaccarino, 2009). During backpropagation, parts of the graph that are no longer in memory are automatically re-evaluated from upstream checkpointed states as needed for derivative sensitivity calculations (or more precisely, for vector-Jacobian products). GRETL is particularly beneficial for applications, such as coupled multi-physics, where deriving adjoint-based sensitivities and managing checkpoint memory across modules becomes onerous. Cases which can be readily handled by the GRETL library include: different time-integration algorithms per physics (e.g., coupled predictor-corrector algorithms, IMEX, etc.), sub-cycling, asynchronous integrators, state dependent timestep sizes, iterative solvers and coupling algorithms, controller algorithms, and more.

Tupek, MichaelR [Lawrence Livermore National Labor↗

Grouper: A Compact, Streamable Triangle Mesh Data Structure

Here, we present Grouper: an all-in-one compact file format, random-access data structure, and streamable representation for large triangle meshes. Similarly to the recently published SQuad representation, Grouper represents the geometry and connectivity of a mesh by grouping vertices and triangles into fixed-size records, most of which store two adjacent triangles and a shared vertex. Unlike SQuad, however, Grouper interleaves geometry with connectivity and uses a new connectivity representation to ensure that vertices and triangles can be stored in a coherent order that enables memory-efficient sequential stream processing. We also present a linear-time construction algorithm that allows streaming out Grouper meshes using a small memory footprint while preserving the initial ordering of vertices. In this construction, we show how the problem of assigning vertices and triangles to groups reduces to a well-known NP-hard optimization problem, and present a simple yet effective heuristic solution that performs well in practice. Our array-based Grouper representation also doubles as a triangle mesh data structure that allows direct access to vertices and triangles. Storing only about two integer references per triangle-i.e., less than the three vertex references stored with each triangle in a conventional indexed mesh format-Grouper answers both incidence and adjacency queries in amortized constant time. Our compact representation enables data-parallel processing on multicore computers, instant partitioning and fast transmission for distributed processing, as well as efficient out-of-core access. We demonstrate the versatility and performance benefits of Grouper using a suite of example meshes and processing kernels.

97 MATHEMATICS AND COMPUTING↗

Adaptive Mesh Refinement for Parallel in Time Methods

The project applied the multigrid-reduction-in-time (MGRIT) algorithm to an existing sub-cycled adaptive mesh refinement (AMR) code to investigate the performance of flows dominated by inertial physics. Previous work demonstrated good performance from MGRIT+AMR applied to flows dominated by diffusive physics. Consistent with previous experience, inertial physics negatively affected convergence rates and performance. Efforts to circumvent this issue by appealing to the physics of turbulence were investigated. It has been demonstrated that scales can be effectively transferred between multigrid levels for a turbulent flow resulting in a) partial convergence observed and b) nearly identical results to sequential time-stepping. Performance improvements have not yet been demonstrated - attempts at coarsening the grid on coarser MG levels compromises the solution quality and leads to divergence. This report summarize the accomplishments for the time-frame from 10/5/2020 to 12/31/2020 with an informal no-cost-extension to 05/20/2021

97 MATHEMATICS AND COMPUTING↗

Real-time simulation of supersonic inlets

A previously published real-time simulation algorithm, the matrix stability region placement (MSRP) method, is used to simulate a small perturbation model of the NASA Lewis Mach 2.5 40-60 mixed compression inlet. The model is representative of high-speed internal flow propulsion systems which can be approximated as quasi-one-dimensional flows. The resulting system of equations, which is stiff, is also simulated by the second-order Adam-Bashforth method. It is shown that the MSRP method can be used to simulate small perturbation models of high-speed internal flow propulsion systems in real time.

Mossayebi, F.↗

ResORR: A Globally Scalable and Satellite Data-Driven Algorithm for River Flow Regulation Due to Reservoir Operations

We propose a globally scalable algorithm, ResORR (Reservoir Operations driven River Regulation), to predict regulated river flow and tested it over the heavily regulated basin of the Cumberland River in the US. ResORR was found able to model regulated river flow due to upstream reservoir operations of the Cumberland River. Over a mountainous basin dominated by high rainfall, ResORR was effective in capturing extreme flooding modified by upstream hydropower dam operations. On average, ResORR improved regulated river flow simulation by more than 50% across all performance metrics when compared to a hydrologic model without a regulation module. ResORR is a timely software algorithm for understanding human regulation of surface water as satellite-estimated reservoir state is expected to improve globally with the recently launched Surface Water and Ocean Topography (SWOT) mission.

River Regulation↗

Pilot workload prediction

A predicting model of pilot workload is developed using a time-based algorithm, work-load values from previous research, and experimental data obtained by a group of experienced pilots on a Singer-Link Gat-1 instrument trainer with three degrees of motion (roll, pitch, and yaw). Each pilot performed three experimental flights presented in a counterbalanced order; each flight consisted of short, medium, or long cruise and initial approach segments. Results strongly suggest that pilots were more sensitive to the rate at which work was done than to the total amount of work accomplished. The result of predictions obtained with the model showed that the time-weighted average of the component work-load ratings were able to predict the obtained work-load ratings accurately.

Pepitone, David D.↗

Study of Heavy Flavor Mesons and Flavor-Tagged Jets with the CMS Detector

The goal of this research program is to implement heavy flavor meson triggers in heavy-ion collisions for the Compact Muon Solenoid (CMS) experiment at the Large Hadron Collider (LHC) at CERN, including algorithm design, timing studies, offline validation, and online performance monitoring. The physics analyses which can be achieved by data from these new triggers is to address one of the most important questions in the field: parton flavor dependence of jet-quenching for the understanding of the transport properties of the Quark-Gluon Plasma. This program will allow CMS to collect the highest statistics heavy flavor meson and jet data ever recorded in heavy-ion colliders. The program includes two objectives: (1) Build and maintain the heavy flavor meson and jet triggers for heavy-ion collisions and deploy the trigger algorithms for 2015-2018 PbPb and pPb run at the LHC; (2) Perform heavy flavor meson and jet physics analyses, which can be used to study the parton flavor dependence of jet quenching, to extract the elastic energy loss coefficient of the QGP, and to test whether massive quarks also participate in collective expansion dynamics in heavy-ion collisions. With the heavy flavor physics trigger developed in this project, a competitive heavy flavor physics program in heavy-ion collisions has been established in CMS. This program allows studies of the fully reconstructed and flavor identified charm, beauty, and exotic hadrons that cover the widest transverse momentum range. The novel measurements supported by the award provide new constraints on the size of the flavor dependence of parton energy loss, the value of the in-medium charm quark diffusion coefficient, the mechanism of charm and beauty quark hadronization, and provide new insights to the nature of the X(3872) hadron.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Computational Study of Flow Establishment in Hypersonic Pulse Facilities

This paper presents a study of the temporal evolution of the combustion flowfield established by the interaction of ram-accelerator-type projectiles with an explosive gas mixture accelerated to hypersonic speeds in an expansion tube. The Navier-Stokes equations for a chemically reacting gas are solved in a fully coupled manner using an implicit, time accurate algorithm. The solution procedure is based on a spatially second order, total variation diminishing (TVD) scheme and a temporally second order, variable-step, backward differentiation formula method. The hydrogen-oxygen chemistry is modeled with a 9-species, 19-step mechanism. The accuracy of the solution method is first demonstrated by several benchmark calculations. Numerical simulations of expansion tube flowfields are then presented for two different configurations. In particular, the development of the shock-induced combustion process is followed. In one case, designed to ensure ignition only in the boundary layer, the lateral extent of the combustion front during the initial transient phase was surprisingly large. The time histories of the calculated thrust and drag forces on the ram accelerator projectile are also presented.

Yungster, S.↗

Charging Decision Making for Automated Electric Vehicles

Abstract: Overview/Significance With the emerging of autonomous driving and its application in electric vehicles, the charging decision making should be taken over by the vehicles. Autonomous electric vehicles will require the capability to make charging decisions according to the battery energy state, the travel demand and also the available charging infrastructure. The introduction of autonomous driving technology would remove the challenge of co-locating charging infrastructure with driver destinations and presents a driver-free method for EVs to reach nearby charging stations. This will significantly change the charging behavior of electric vehicles. EV driver will no longer need to be present at charging stations for charging actions. Automated EVs can drive to nearby charging stations to perform charging actions by themselves when necessary. Meanwhile, connected vehicles technology makes electric vehicles have the capability to sense and obtain pertinent information from nearby charging station networks and then calculate the corresponding costs and availability for charging. All these promising capabilities bring new opportunities to construct an automatic charging decision making system and improve energy efficiency of charging actions for automatic electric vehicles. Abstract: Methodology This research introduces optimization tools and case studies on charging decision making for automated electric vehicles under personal usage scenario. The designed optimization tools aim to provide charging strategies, i.e. the optimal choice of charging station outside home and the amount of charged energy, by considering constraints from personal daily itineraries and existing charging infrastructure. Abundant real world EV data is utilized to construct stochastic energy consumption prediction model under realistic driving conditions. Advanced dynamic programming technology is utilized to model and solve the potential multi-stage decision making process by considering realistic uncertainties of EV energy cost and dynamics of itinerary information. Large-scale simulation studies using Chicago itinerary data are demonstrated to illustrate energy benefits from automatic charging decision making for future autonomous EVs. Abstract: Results/Conclusions Optimal automatic charging decision making and its energy benefits have been studied for personal automated electric vehicles. A data-driven method based on large amount of real-world data and the corresponding real-time update algorithm have been proposed to construct multi-channel stochastic energy consumption prediction model. Based on the energy cost prediction, dynamic multi-stage charging decision-making models are established for optimal strategies during a daily itinerary. Derived charging strategies can minimize the monetary and energy cost of charging actions for autonomous vehicles. Simulations and case studies show the potential ability of autonomous electric vehicles to reduce the range anxiety and charging infrastructure dependency. Automatic charging decision making can mitigate the pain from electric vehicle charging necessity outside home. In conclusion, automated electric vehicles equipped with an appropriate automatic charging decision making system will help EV driver to relieve from heavy time cost of recharging, reduce the energy cost of performing charging actions and improve the energy efficiency in future electrified transportation system.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

H ∞ Control for Energy Dispatch in Autonomous Nanogrid With Communication Delays

This paper proposes an optimal controller and estimator for energy dispatch to balance the power supply and demand considering communication delays. The proposed algorithm involves modeling an autonomous nanogrid (ANG) consisting of distributed energy resources, energy storage systems, loads, an $H$ ∞ controller with a reference power modulation technique, and a state estimator. The ANG was developed to express the dynamic supply-demand energy balance of a nanogird system. Reference power modulation was designed to generate the desired ESS power based on the imbalanced energy. Random communication delays were modeled using a stochastic variable satisfying the Bernoulli random binary distribution. The optimal $H$ ∞ controller and estimator were developed using a linear matrix inequality approach to exponentially stabilize the closed-loop system. Simulations were performed using real daily demand forecasts obtained from the Korea Meteorological Administration to demonstrate the effectiveness of the proposed real-time optimization algorithm.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A finite element model of conduction, convection, and phase change near a solid/melt interface

Detailed understanding of heat transfer and fluid flow is required for many aerospace thermal systems. These systems often include phase change and operate over a range of accelerations or effective gravitational fields. An approach to analyzing such systems is presented which requires the simultaneous solution of the conservation laws of energy, momentum, and mass, as well as an equation of state. The variable property form of the governing equations are developed in two-dimensional Cartesian coordinates for a Newtonian fluid. A numerical procedure for solving the governing equations is presented and implemented in a computer program. The Galerkin form of the finite element method is used to solve the spatial variation of the field variables, along with the implicit Crank-Nicolson time marching algorithm. Quadratic Langrangian elements are used for the internal energy and the two components of velocity. Linear Lagrangian elements are used for the pressure. The location of the solid/liquid interface as well as the temperatures are determined form the calculated internal energy and pressure. This approach is quite general in that it can describe heat transfer without phase change, phase change with a sharp interface, and phase change without an interface. Analytical results from this model are compared to those of other researchers studying transient conduction, convection, and phase change and are found to be in good agreement. The numerical procedure presented requires significant computer resources, but this is not unusual when compared to similar studies by other researchers. Several methods are suggested to reduce the computational times.

Viterna, Larry A.↗

TU-AB-303-11: Predict Parotids Deformation Applying SIS Epidemiological Model in H&N Adaptive RT

Purpose: The aim is to investigate the use of epidemiological models to predict morphological variations in patients undergoing radiation therapy (RT). The susceptible-infected-susceptible (SIS) deterministic model was applied to simulate warping within a focused region of interest (ROI). Hypothesis is to consider each voxel like a single subject of the whole sample and to treat displacement vector fields like an infection. Methods: Using Raystation hybrid deformation algorithms and automatic re-contouring based on mesh grid, we post-processed 360 MVCT images of 12 H&N patients treated with Tomotherapy. Study focused on parotid glands, identified by literature and previous analysis, as ROI more susceptible to warping in H&N region. Susceptible (S) and infectious (I) cases were identified in voxels with inter-fraction movement respectively under and over a set threshold. IronPython scripting allowed to export positions and displacement data of surface voxels for every fraction. A MATLAB homemade toolbox was developed to model the SIS. Results: SIS model was validated simulating organ motion on QUASAR phantom. Applying model in patients, within a [0–1cm] range, a single voxel movement of 0.4cm was selected as displacement threshold. SIS indexes were evaluated by MATLAB simulations. Dynamic time warping algorithm was used to assess matching between model and parotids behavior days of treatments. The best fit of the model was obtained with contact rate of 7.89±0.94 and recovery rate of 2.36±0.21. Conclusion: SIS model can follow daily structures evolutions, making possible to compare warping conditions and highlighting challenges due to abnormal variation and set-up errors. By epidemiology approach, organ motion could be assessed and predicted not in terms of average of the whole ROI, but in a voxel-by-voxel deterministic trend. Identifying anatomical region subjected to variations, would be possible to focus clinic controls within a cohort of pre-selected patients eligible for adaptive RT. The research is partially co-funded by the Italian Research Grant: Dose warping methods for IGRT and Adaptive RT: dose accumulation based on organ motion and anatomical variations of the patients during radiation therapy treatments,MoH (GR-2010-2318757) and Tecnologie Avanzate S.r.l.(Italy)

60 APPLIED LIFE SCIENCES↗