Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical 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

A hybrid point-particle force model that combines physical and data-driven approaches

Here this study improves upon the physics-based pairwise interaction extended point-particle (PIEP) model. The PIEP model leverages our physical understanding to predict fluid mediated interactions between solid particles. By considering the relative location of neighboring particles, the PIEP model is able to provide better predictions than existing drag models. While the current physical PIEP model is a powerful tool, its assumptions lead to increased error in flows with higher particle volume fractions. To reduce this error, a regression algorithm makes direct use of the results of direct numerical simulations (DNS) of an array of monodisperse solid particles subjected to uniform ambient flow at varying Reynolds numbers. The resulting statistical model and the physical PIEP model are superimposed to construct a hybrid, physics-based data-driven PIEP model. It must be noted that the performance of a pure data-driven approach without the model-form provided by the physical PIEP model is substantially inferior. The hybrid model's predictive capabilities are analyzed using additional DNS data that was not part of training the data-driven model. In every case tested, the hybrid models resulting from the regression were capable of (1) improving upon the physical PIEP model's prediction and (2) recovering underlying relevant physics from the DNS data. As the particle volume fraction increases, the physical PIEP model loses the ability to approximate the forces experienced by the particles, but the statistical model continues to produce accurate approximations.

97 MATHEMATICS AND COMPUTING↗

Single-stage gradient-based stellarator coil design: Optimization for near-axis quasi-symmetry

Here we present a new coil design paradigm for magnetic confinement in stellarators. Our approach directly optimizes coil shapes and coil currents to produce a vacuum quasi-symmetric magnetic field with a target rotational transform on the magnetic axis. This approach differs from the traditional two-stage approach in which first a magnetic configuration with desirable physics properties is found, and then coils to approximately realize this magnetic configuration are designed. The proposed single-stage approach allows us to find a compromise between confinement and engineering requirements, i.e., find easy-to-build coils with good confinement properties. Using forward and adjoint sensitivities, we derive derivatives of the physical quantities in the objective, which is constrained by a nonlinear periodic differential equation. In two numerical examples, we compare different gradient-based descent algorithms and find that incorporating approximate second-order derivative information through a quasi-Newton method is crucial for convergence. We also explore the optimization landscape in the neighborhood of a minimizer and find many directions in which the objective is mostly flat, indicating ample freedom to find simple and thus easy-to-build coils.

97 MATHEMATICS AND COMPUTING↗

Load-Displacement Relation and Gap Distribution Between Rough Surfaces: Partial Differential Equations Approach

We develop a theoretical model to predict the load-displacement relation and probability density function for gaps between contacting rough surfaces. We derive partial differential equations from the previous model (Joe et al., 2018), and extend them to the non-adhesive contact problem. The predictions of the present theory are compared with numerical results using the Green's function molecular dynamics algorithm, and a good agreement is obtained.

adhesion↗

Spline based least squares integration for two-dimensional shape or wavefront reconstruction

In this paper, we present a novel method to handle two-dimensional shape or wavefront reconstruction from its slopes. The proposed integration method employs splines to fit the measured slope data with piecewise polynomials and uses the analytical polynomial functions to represent the height changes in a lateral spacing with the pre-determined spline coefficients. The linear least squares method is applied to estimate the height or wavefront as a final result. Numerical simulations verify that the proposed method has less algorithm errors than two other existing methods used for comparison. Especially at the boundaries, the proposed method has better performance. The noise influence is studied by adding white Gaussian noise to the slope data. Finally, experimental data from phase measuring deflectometry are tested to demonstrate the feasibility of the new method in a practical measurement.

42 ENGINEERING↗

Genome dependent Cas9/gRNA search time underlies sequence dependent gRNA activity

Abstract CRISPR-Cas9 is a powerful DNA editing tool. A gRNA directs Cas9 to cleave any DNA sequence with a PAM. However, some gRNA sequences mediate cleavage at higher efficiencies than others. To understand this, numerous studies have screened large gRNA libraries and developed algorithms to predict gRNA sequence dependent activity. These algorithms do not predict other datasets as well as their training dataset and do not predict well between species. Here, to better understand these discrepancies, we retrospectively examine sequence features that impact gRNA activity in 44 published data sets. We find strong evidence that gRNA sequence dependent activity is largely influenced by the ability of the Cas9/gRNA complex to find the target site rather than activity at the target site and that this drives sequence dependent differences in gRNA activity between different species. This understanding will help guide future work to understand Cas9 activity as well as efforts to identify optimal gRNAs and improve Cas9 variants.

59 BASIC BIOLOGICAL SCIENCES↗

Coherent diffractive imaging using randomly coded masks

We experimentally demonstrate an extension to coherent diffractive imaging that encodes additional information through the use of a series of randomly coded masks, removing the need for typical object-domain constraints while guaranteeing a unique solution to the phase retrieval problem. Phase retrieval is performed using a numerical convex relaxation routine known as “PhaseCut,” an iterative algorithm known for its stability and for its ability to find the global solution, which can be found efficiently and which is robust to noise. The experiment is performed using a laser diode at 532.2 nm, enabling rapid prototyping for future X-ray synchrotron and even free electron laser experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On regularizing the ML-MCTDH equations of motion

In a recent paper [H.-D. Meyer and H. Wang, J. Chem. Phys. 148, 124105 (2018)], we have examined the regularization of the equations of motion (EOMs) of the multiconfiguration time-dependent Hartree (MCTDH) approach. We could show that the standard regularization scheme used by almost all researchers in the field is not optimal. The improved regularization allows for larger values of the regularization parameter ϵ, is less sensitive to the actual choice of ϵ, and performs the rotation of initially unoccupied single-particle functions into the “correct” direction in Hilbert space much faster than the old scheme. Here, the latter point increases both the accuracy and efficiency of time propagation for challenging problems. For simple problems, the new scheme requires some additional numerical work as compared with the old scheme, ranging from negligible to almost doubling the total numerical labor. For demanding problems, on the other hand, the additional numerical work of the new scheme is often overcompensated by less steps taken by the integrator. In the present paper, we generalize the new regularization scheme to the multi-layer (ML) extension of MCTDH. Although the principle idea of the new regularization scheme remains unaltered, it was not obvious how the new scheme should be implemented into ML-MCTDH. The ML-MCTDH EOMs are much more complicated than the MCTDH ones, and for optimal numerical performance it was necessary to derive a recursive algorithm for implementing the new regularization scheme.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Combined molecular dynamics-spin dynamics simulations of bcc iron

Using a classical model that treats translational and spin degrees of freedom on an equal footing, we study phonon-magnon interactions in BCC iron with combined molecular and spin dynamics methods. The atomic interactions are modeled via an empirical many-body potential while spin dependent interactions are established through a Hamiltonian of the Heisenberg form with a distance dependent magnetic exchange interaction obtained from first principles electronic structure calculations. The temporal evolution of translational and spin degrees of freedom was determined by numerically solving the coupled equations of motion, using an algorithm based on the second order Suzuki-Trotter decomposition of the exponential operators. By calculating Fourier transforms of space- and time-displaced correlation functions, we demonstrate that the the presence of lattice vibrations leads to noticeable softening and damping of spin wave modes. As a result of the interplay between lattice and spin subsystems, we also observe additional longitudinal spin wave excitations, with frequencies which coincide with that of the longitudinal lattice vibrations.

Perera, Meewanage Dilina↗

Simultaneous XAFS measurements of multiple samples

A four-channel ionization chamber has been designed, constructed and tested. This ionization chamber allows X-ray absorption spectra to be collected in transmission from up to four samples simultaneously. This results in spectra that are free of systematic uncertainty in relative energy alignment introduced by scan-to-scan stability of the monochromator or of numerical uncertainty associated with a post-processing alignment algorithm, allowing, in a single shot, an absolute measure of edge shift between four samples of different valence. As four samples can be measured in parallel, the time expended over the course of an experiment to cycle the measurement environment between its rest state and the measurement condition is substantially reduced. The ionization chamber is simple in design and could be implemented at virtually any XAFS beamline with a horizontal fan of radiation such as that provided by a bend magnet or wiggler.

47 OTHER INSTRUMENTATION↗

A Non-cooperative Game-based Approach to Distributed Beam Scheduling in Millimeter-Wave Networks

We consider the distributed beam scheduling problem in mm-Wave networks where the base stations may belong to different operators and there is no centralized coordination among them. Our goal is to design distributed beam scheduling algorithms such that the network utility, which is defined as a logarithm function of the average throughput of the user equipment, can be maximized. We propose a non-cooperative game-based scheduling approach where the base stations are modeled as players that greedily maximize their own utilities. The Nash Equilibrium (NE) then provides a distributed solution to the network utility maximization problem. By employing the Lyapunov optimization, the asymptotic optimality of the proposed scheduling can be guaranteed. We prove the existence and provide sufficient conditions which guarantee the uniqueness of the NE by establishing an equivalence to the Variational Inequality (VI) problem. We also propose a parallel power adaptation algorithm which is proved to converge to the NE. Numerical results show the superiority of the proposed scheduling over several distributed baseline schemes.

99 GENERAL AND MISCELLANEOUS↗

Multilevel Techniques for Compression and Reduction of Scientific Data---The Multivariate Case

We develop a technique for multigrid adaptive reduction of data (MGARD). Special attention is given to the case of tensor product grids, where our approach permits the use of nonuniformly spaced grids in each direction, which can prove problematic for many types of data reduction methods. An important feature of our approach is the provision of guaranteed, computable bounds on the loss incurred by the reduction of the data. Many users are leery of lossy algorithms and will only consider using them provided that numerical bounds on the pointwise difference between the original and the reduced datasets are given. Accordingly, we develop techniques for bounding the loss measured in the $L^{\infty}(\Omega)$ norm, and we show that these bounds are realistic in the sense that they do not significantly overestimate the actual loss. Here, the resulting loss indicators are used to guide the adaptive reduction of the data so that the reduced dataset meets a user-prescribed tolerance or memory constraint. Illustrative numerical examples, including the reduction of data arising from the simulation of a nonlinear reaction-diffusion problem, a turbulent channel flow, and a climate simulation, are provided.

97 MATHEMATICS AND COMPUTING↗

Benchmarking treewidth as a practical component of tensor network simulations

Tensor networks are powerful factorization techniques which reduce resource requirements for numerically simulating principal quantum many-body systems and algorithms. The computational complexity of a tensor network simulation depends on the tensor ranks and the order in which they are contracted. Unfortunately, computing optimal contraction sequences (orderings) in general is known to be a computationally difficult (NP-complete) task. In 2005, Markov and Shi showed that optimal contraction sequences correspond to optimal (minimum width) tree decompositions of a tensor network’s line graph, relating the contraction sequence problem to a rich literature in structural graph theory. While treewidth-based methods have largely been ignored in favor of dataset-specific algorithms in the prior tensor networks literature, we demonstrate their practical relevance for problems arising from two distinct methods used in quantum simulation: multi-scale entanglement renormalization ansatz (MERA) datasets and quantum circuits generated by the quantum approximate optimization algorithm (QAOA). We exhibit multiple regimes where treewidth-based algorithms outperform domain-specific algorithms, while demonstrating that the optimal choice of algorithm has a complex dependence on the network density, expected contraction complexity, and user run time requirements. We further provide an open source software framework designed with an emphasis on accessibility and extendability, enabling replicable experimental evaluations and future exploration of competing methods by practitioners.

97 MATHEMATICS AND COMPUTING↗

A multiresolution adaptive wavelet method for nonlinear partial differential equations

We report the multiscale complexity of modern problems in computational science and engineering can prohibit the use of traditional numerical methods in multi-dimensional simulations. Therefore, novel algorithms are required in these situations to solve partial differential equations (PDEs) with features evolving on a wide range of spatial and temporal scales. To meet these challenges, we present a multiresolution wavelet algorithm to solve PDEs with significant data compression and explicit error control. We discretize in space by projecting fields and spatial derivative operators onto wavelet basis functions. We provide error estimates for the wavelet representation of fields and their derivatives. Then, our estimates are used to construct a sparse multiresolution discretization which guarantees the prescribed accuracy. Additionally, we embed a predictor-corrector procedure within the temporal integration to dynamically adapt the computational grid and maintain the accuracy of the solution of the PDE as it evolves. We present examples to highlight the accuracy and adaptivity of our approach.

97 MATHEMATICS AND COMPUTING↗

Beam-Based Diagnostics of Electric Guide Fields and Lattice Parameters for Run-1 of the Muon g-2 Storage Ring at Fermilab

A portion of the Muon g-2 Storage Ring electric system, which provides vertical beam focusing, exhibited an unexpected time dependence that produced a characteristic evolution of the stored beam during Run-1 of the Muon g-2 Experiment at Fermilab (E989). A method to reconstruct the Run-1 electric guide fields has been developed, which is based on a numerical model of the muon storage ring and optimization algorithms supported by COSY INFINITY. This method takes beam profile measurements from the Muon g-2 straw tracking detectors as input, and it produces a full reconstruction of the time-dependent fields. The fields can then be used for the reproduction of detailed beam tracking simulations and the calculation of ring lattice parameters for acceptance studies and systematic error evaluations.

43 PARTICLE ACCELERATORS↗

HAIMOS Ensemble Forecasts for Intra-day and Day- Ahead GHI, DNI and Ramps

The objective of this research is to develop a hybrid physics-based/data-driven forecast model to improve direct normal and global horizontal irradiance (DNI and GHI) prediction for horizons ranging from 1 to 72 hours. Project objectives also address key gaps in state-of-the-art solar forecasting: accurate probabilistic solar forecasts and the forecasting of large irradiance ramps (ramp onset and magnitude). The proposed model ensembles Numerical Weather Prediction (NWP) forecasts, determinist physics-based algorithms, and new-generation cloud cover products (high-resolution rapid refresh satellite images and Large Eddy Simulations). The result is the Hybrid Adaptive Input Model Objective Selection (HAIMOS) ensemble model. HAIMOS blends state of the art machine learning methodologies with physics-based models for cloud cover and cloud optical depth forecasts. The technical activities followed a two-pronged strategy. First, the preprocessing of data, the selection of inputs to the nonlinear approximators, the type of approximator and objective functions, and post-processing ensembling techniques included in HAIMOS were all optimized adaptively to find the best model for a specific goal (reduce DNI/GHI forecast error, improve the prediction of ramp onset, etc.). Second, a large effort was put in improving cloud identification and the forecast of cloud cover and cloud optical depth. To this end, new-generation cloud parametrization products were developed in this work. These include improved algorithms to assist in cloud identification, cloud classification and cloud parametrization from satellite images – three key factors in the accuracy of 1 to 6-hours irradiance forecasts and prediction of ramp onset. Furthermore, we also included cloud information extracted from high resolution rapid refresh satellite images (GOES-16) and Large Eddy Simulations (LES). LES was used to model the atmosphere in detail over locations of interest and produce cloud optical depth forecasts. Once these data streams were validated, they were used as input data to the HAIMOS forecast. The model was developed using data from several climatologically distinct locations with potential for high solar penetration. In the last year of the project, we conducted a validation campaign according to the guidelines stipulated by the Topic Area 1 project as described in the FOA. This effort brings, for the first time, proven machine-learning methodologies for generating state-of-the-art solar forecasts interweaved with detailed physics-based models for cloud detection, and cloud optical depth forecasts. HAIMOS will generate accurate irradiance probabilistic forecast to assist in reducing solar generation prediction error. Globally optimized solar forecast models are more likely to impact solar energy stakeholders. The goal of this project was to increase the state-of-the-art forecast skill from their present values of 10 to 35%. At the end of the project, we achieved between 30% and 50% forecast skill across a wide range of horizons for both GHI and DNI.

14 SOLAR ENERGY↗

Multi-modal Energy-optimal Trip Scheduling in Real-time (METS-R) for Transportation Hubs (Final Report)

This report summarizes the work performed under the award number EE0008524. The project develops the Multi-modal Energy-optimal Trip Scheduling in Real-time (METS-R) platform as the next-generation transportation solution based on autonomous electric vehicles (AEV) serving passenger trips from and to urban transportation hubs, to substantially reduce transportation energy consumption. Extensive data collection and analyses were first conducted to understand the demand patterns and energy consumption of hub-based on-road trips. Then, a data-driven framework that consists of an analytical module and a simulation module was proposed. For the analytical module, five planning + operation tools were developed to support the planning and energy-efficient operations of urban AEV services: the charging station planning that robotically allocates charging supplies based on the stationary charging demand distribution; the transit planning and demand adaptive scheduling model that efficiently generates\ candidate transit routes from hubs to other places and dynamically adjusts the transit time table to fit the current demand; the online energy-efficient routing that learns the energy-optimal paths from observations of link-level energy consumption in real-time; the hub-based ridesharing that matches trip requests together with account for the uncertainty of future trip demand and vehicle supply; and finally, the integrated demand prediction and anomaly detection pipeline that leverages the flight/train time table and support other planning/operation tools. To demonstrate the performance of these tools, a scalable high-performance agent-based simulator was built. We divided the urban space into multiple service zones where each zone was considered as an agent for passenger generation and vehicle charging. Two types of AEV agents were coded to model two types of mobility services: AEV taxi and AEV transit. For the AEV taxi, the team implemented the functions of pickup/drop-off passengers, energy-efficient routing, ridesharing, fleet rebalancing, and recharging. For the AEV bus, the team implemented the functions of demand-adaptive route scheduling, passenger boarding, and recharging. A high-performance computing framework was introduced to receive various profiling information (such as link energy updates, vehicle speed) from the simulator instances and communicate the operational commands back to the instances. The numerical experiments show that each of the proposed operational algorithms can reduce energy consumption and improve system efficiency. Furthermore, there exists the need to collectively consider multiple planning + operational strategies as multiple strategies can influence each other in terms of performance impacts. Recommendations for future work related to AEV planning and simulation are discussed.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Savings in Action: Lessons from Observed and Modeled Residential Solar Plus Storage Systems

The electric grid is rapidly evolving as small-scale, demand-side resources play increasingly important roles in grid operations and decarbonization. Maximizing the potential of demand-side resources involves incentivizing electricity customers to use those resources in ways that benefit the broader electrical grid. These incentives depend largely on the electricity cost savings that customers can realize from demand-side resource adoption. Determining these potential cost savings is a complex task. Cost savings depend on numerous factors, including the characteristics of different technologies, the algorithms that control these devices, system performance, customer behavior, electricity rate structures, and climatic factors. Another challenge is that estimated cost savings are frequently based on modeled rather than observed system performance, particularly in the academic literature. In this study, we begin to fill the gap in empirical research of demand-side resources using data from a new construction residential community equipped with rooftop solar and storage (S+S) in Arizona. We use these data to analyze the factors that determine customer electricity cost savings and emissions impacts of S+S in the real world. We then compare these data to modeled system performance to understand how models deviate from real-world outcomes. Based on these findings, we explore ways to improve such models and, conversely, use modeled results to suggest improvements to actual S+S deployment. The results of these analyses can be summarized in four key findings: 1) rate structures play a central role in the grid and customer value of demand-side resources; 2) certain customers can benefit more from demand-side resource adoption than others; 3) modeled battery dispatch and sizing reveals opportunities for additional cost savings; and 4) optimal dispatches can reduce grid emissions while maximizing bill savings.

14 SOLAR ENERGY↗

Overlapping Domain Coupling of Multidimensional and System Codes in NEAMS - Pronghorn and SAM

This report describes the implementation and testing of domain-overlapping coupling of the Pronghorn and SAM codes. Both Pronghorn and SAM are codes developed by the DOE Nuclear Energy Advanced Modeling and Simulation (NEAMS) program for analysis of advanced nuclear reactors. Pronghorn focuses on analyzing multi-dimensional core flow conditions, while SAM focuses on analysis of the entire system including, among other components, piping, pumps, and heat exchangers. It is desirable for many advanced reactor thermal-hydraulics simulations to couple Pronghorn and SAM to obtain self-consistent solutions in the core and the system. The domain-overlapping coupling approach provides a robust and numerically efficient candidate for this coupling. We describe the algorithm for obtaining self-consistent solutions between a SAM network of flow channels and an overlapped multi-dimensional Pronghorn domain. The algorithm is tested for a variety of simple canonical test problems and a model of the Molten Salt Reactor Experiment (MSRE). Results demonstrate that the domain overlapping coupling approach provides consistent pressure, mass flow rate, enthalpy, and passive scalar distributions between Pronghorn and SAM and converges reliably and efficiently (at most 15 iterations, usually much less than 10) for the considered test problems.

97 MATHEMATICS AND COMPUTING↗