SEARCH · Search NASA
Results for “algorithmic differentiation”
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.
Estimating Ice Water Content for Winter Storms from Millimeter-Wavelength Radar Measurements Using a Synthesis of Polarimetric and Dual-Frequency Radar Observations
The potential of millimeter-wavelength radar-based ice water content (IWC) estimation is demonstrated using a Ka-band Scanning Polarimetric Radar (KASPR) for the U.S. northeast coast winter storms. Two IWC relations for Ka-band polarimetric radar measurements are proposed: one that uses a combination of the radar reflectivity Z and the estimated total number concentration of snow particles N t and the other based on the joint use of Z, specific differential phase K DP , and the degree of riming f rim . A key element of the algorithms is to obtain the “Rayleigh-equivalent” value of Z measured at the Ka band, i.e., the corresponding Z at a longer radar wavelength for which Rayleigh scattering takes place. This is achieved via polarimetric retrieval of the mean volume diameter D m and incorporating the relationship between the dual-wavelength ratio DWR S/Ka and D m . Those techniques allow for retrievals from single millimeter-wavelength radar measurements and do not necessarily require the dual-wavelength ratio (DWR) measurements, if the DWR–D m relation and Rayleigh assumption for Ka-band K DP are valid. Comparison between the quasivertical profile product obtained from KASPR and the columnar vertical profile product generated from the nearby WSR-88D S-band radar measurements demonstrates that the DWR S/Ka can be estimated from the two close radars without the need for collocated radar beams and synchronized antenna scanning and can be used for determining the Rayleigh-equivalent value of Z. As a result, the performance of the suggested techniques is evaluated for seven winter storms using surface disdrometer and snow accumulation measurements.
Effect of GPS Manipulation to Traditional and Next Generation Relay Protection
This project’s objective is to test the effect of GPS timing variations on relay protection algorithms to determine vulnerabilities and the associated hazards to the electric grid. This will focus on differential protection which utilizes peer to peer communication between substations to determine if the current is not equivalent. This requires the use of GPS to sync the two substations and can be vulnerable to GPS manipulation. However, the effects of GPS manipulation are not a commonly known risk. Therefore, this LDRD will address the risks of GPS manipulation for such a widely implemented technology. For differential protection a GPS resilient architecture was implemented and tested for differential protective relays through a direct serial fiber connection between the two relays. This allows for one relay to be the master and provide synchronization outside of timestamp for differential protection.
Achieving algorithmic resilience for temporal integration through spectral deferred corrections
Spectral deferred corrections (SDC) is an iterative approach for constructing higher-order-accurate numerical approximations of ordinary differential equations. SDC starts with an initial approximation of the solution defined at a set of Gaussian or spectral collocation nodes over a time interval and uses an iterative application of lower-order time discretizations applied to a correction equation to improve the solution at these nodes. Each deferred correction sweep increases the formal order of accuracy of the method up to the limit inherent in the accuracy defined by the collocation points. In this paper, we demonstrate that SDC is well suited to recovering from soft (transient) hardware faults in the data. A strategy where extra correction iterations are used to recover from soft errors and provide algorithmic resilience is proposed. Specifically, in this approach the iteration is continued until the residual (a measure of the error in the approximation) is small relative to the residual of the first correction iteration and changes slowly between successive iterations. Here, we demonstrate the effectiveness of this strategy for both canonical test problems and a comprehensive situation involving a mature scientific application code that solves the reacting Navier-Stokes equations for combustion research.
jaxhps: An elliptic PDE solver built with machine learning in mind
Elliptic partial differential equations (PDEs) can model many physical phenomena, such as electrostatics, acoustics, wave propagation, and diffusion. In scientific machine learning settings, a high-throughput PDE solver may be required to generate a training dataset, run in the inner loop of an iterative algorithm, or interface directly with a deep neural network. To provide value to machine learning users, such a PDE solver must be compatible with standard automatic differentiation frameworks, scale efficiently when run on graphics processing units (GPUs), and maintain high accuracy for a large range of input parameters. We have designed the jaxhps package with these use-cases in mind by implementing a highly efficient and accurate solver for elliptic problems with native hardware acceleration and automatic differentiation support.
Final Technical Report "Multiscale Simulation Algorithms for Biochemical Systems"
Biochemical systems are inherently multiscale and stochastic. In microscopic systems formed by living cells, the small numbers of reactant molecules can result in dynamical behavior that is discrete and stochastic rather than continuous and deterministic. An analysis tool that respects these dynamical characteristics is the stochastic simulation algorithm (SSA, Gillespie, 1976), a numerical simulation procedure that is essentially exact for chemical systems that are spatially homogeneous or well stirred. Despite recent improvements, as a procedure that simulates every reaction event, the SSA is necessarily inefficient for most realistic problems. There are two main reasons for this, both arising from the multiscale nature of the underlying problem: (1) stiffness, i.e. the presence of multiple timescales, the fastest of which are stable; and (2) the need to include in the simulation both species that are present in relatively small quantities and should be modeled by a discrete stochastic process, and species that are present in larger quantities and are more efficiently modeled by a deterministic differential equation (or at some scale in between). This project has focused on the development of fast and adaptive algorithms, and the fun- damental theory upon which they must be based, for the multiscale simulation of biochemical systems. Areas addressed by this project include: (1) Theoretical and practical foundations for ac- celerated discrete stochastic simulation (tau-leaping); (2) Dealing with stiffness (fast reactions) in an efficient and well-justified manner in discrete stochastic simulation; (3) Development of adaptive multiscale algorithms for spatially homogeneous discrete stochastic simulation; (4) Development of high-performance SSA algorithms.
Characterization of Used Nuclear Fuel with Multivariate Analysis for Process Monitoring
The Multi-Isotope Process (MIP) Monitor combines gamma spectroscopy and multivariate analysis to detect anomalies in various process streams in a nuclear fuel reprocessing system. Measured spectra are compared to models of nominal behavior at each measurement location to detect unexpected changes in system behavior. In order to improve the accuracy and specificity of process monitoring, fuel characterization may be used to more accurately train subsequent models in a full analysis scheme. This paper presents initial development of a reactor-type classifier that is used to select a reactor-specific partial least squares model to predict fuel burnup. Nuclide activities for prototypic used fuel samples were generated in ORIGEN-ARP and used to investigate techniques to characterize used nuclear fuel in terms of reactor type (pressurized or boiling water reactor) and burnup. A variety of reactor type classification algorithms, including k-nearest neighbors, linear and quadratic discriminant analyses, and support vector machines, were evaluated to differentiate used fuel from pressurized and boiling water reactors. Then, reactor type-specific partial least squares models were developed to predict the burnup of the fuel. Using these reactor type-specific models instead of a model trained for all light water reactors improved the accuracy of burnup predictions. The developed classification and prediction models were combined and applied to a large dataset that included eight fuel assembly designs, two of which were not used in training the models, and spanned the range of the initial 235U enrichment, cooling time, and burnup values expected of future commercial used fuel for reprocessing. Error rates were consistent across the range of considered enrichment, cooling time, and burnup values. Average absolute relative errors in burnup predictions for validation data both within and outside the training space were 0.0574% and 0.0597%, respectively. The errors seen in this work are artificially low, because the models were trained, optimized, and tested on simulated, noise-free data. However, these results indicate that the developed models may generalize well to new data and that the proposed approach constitutes a viable first step in developing a fuel characterization algorithm based on gamma spectra.
Mineral classification map using MF and SAM techniques: A case study in the Nohwa Island, Korea
The purpose of this study is to map pyprophyllite distribution at surface of the Nohwa deposit, Korea by using Advanced Spaceborne Thermal Emission and Reflectance Radiometer (ASTER) data. For this, combined Spectral Angle Mapper (SAM), and Matched Filtering (MF) technique based on mathematical algorithm was applied. The regional distribution of high-grade and low-grade pyrophyllite in the Nohwa deposit area could be differentiated by this method. The results of this study show that ASTER data analysis using combination of SAM and MF techniques will assist in exploration of pyrophyllite at the exposed surface.
Domain decomposition solution of nonlinear two-dimensional parabolic problems by random trees
A domain decomposition method is developed for the numerical solution of nonlinear parabolic partial differential equations in any space dimension, based on the probabilistic representation of solutions as an average of suitable multiplicative functionals. Such a direct probabilistic representation requires generating a number of random trees, whose role is that of the realizations of stochastic processes used in the linear problems. First, only few values of the sought solution inside the space-time domain are computed (by a Monte Carlo method on the trees). An interpolation is then carried out, in order to approximate interfacial values of the solution inside the domain. Thus, a fully decoupled set of sub-problems is obtained. The algorithm is suited to massively parallel implementation, enjoying arbitrary scalability and fault tolerance properties. Pruning the trees is shown to increase appreciably the efficiency of the algorithm. Numerical examples conducted in 2D, including some for the KPP equation, are given.
A trust-region algorithm for the optimization of PSA processes using reduced-order modeling
The last few decades have seen a considerable increase in the applications of adsorptive gas separation technologies, such as pressure swing adsorption (PSA); the applications range from bulk separations to trace contaminant removal. PSA processes are based on solid-gas equilibrium and operate under periodic transient conditions [1]. Bed models for these processes are therefore defined by coupled nonlinear partial differential and algebraic equations (PDAEs) distributed in space and time with periodic boundary conditions that connect the processing steps together and high nonlinearities arising from non-isothermal effects and nonlinear adsorption isotherms. As a result, the optimization of such systems for either design or operation represents a significant computational challenge to current nonlinear programming algorithms. Model reduction is a powerful methodology that permits systematic generation of cost-efficient low-order representations of large-scale systems that result from discretization of such PDAEs. In particular, low-dimensional approximations can be obtained from reduced order modeling (ROM) techniques based on proper orthogonal decomposition (POD) and can be used as surrogate models in the optimization problems. In this approach, a representative ensemble of solutions of the dynamic PDAE system is constructed by solving a higher-order discretization of the model using the method of lines, followed by the application of Karhunen-Loeve expansion to derive a small set of empirical eigenfunctions (POD modes). These modes are used as basis functions within a Galerkin's projection framework to derive a low-order DAE system that accurately describes the dominant dynamics of the PDAE system. This approach leads to a DAE system of significantly lower order, thus replacing the one obtained from spatial discretization before and making optimization problem computationally efficient [2]. The ROM methodology has been successfully applied to a 2-bed 4-step PSA process used for separating a hydrogen-methane mixture in [3]. The reduced order model developed was successfully used to optimize this process to maximize hydrogen recovery within a trust-region. We extend this approach in this work to develop a rigorous trust-region algorithm for ROM-based optimization of PSA processes. The trust-region update rules and sufficient decrease condition for the objective is used to determine the size of the trust-region. Based on the decrease in the objective function and error in the ROM, a ROM updation strategy is designed [4, 5]. The inequalities and bounds are handled in the algorithm using exact penalty formulation, and a non-smooth trust-region algorithm by Conn et al. [6] is used to handle non-differentiability. To ensure that the first order consistency condition is met and the optimum obtained from ROM-based optimization corresponds to the optimum of the original problem, a scaling function, such as one proposed by Alexandrov et al. [7], is incorporated in the objective function. Such error control mechanism is also capable of handling numerical inconsistencies such as unphysical oscillations in the state variable profiles. The proposed methodology is applied to optimize a PSA process to concentrate CO{sub 2} from a nitrogen-carbon dioxide mixture. As in [3], separate ROMs are developed for each operating step with different POD modes for each state variable. Numerical results will be presented for optimization case studies which involve maximizing CO{sub 2} recovery, feed throughput or minimizing overall power consumption.
A probabilistic graphical model approach to stochastic multiscale partial differential equations
We develop a probabilistic graphical model based methodology to efficiently perform uncertainty quantification in the presence of both stochastic input and multiple scales. Both the stochastic input and model responses are treated as random variables in this framework. Their relationships are modeled by graphical models which give explicit factorization of a high-dimensional joint probability distribution. The hyperparameters in the probabilistic model are learned using sequential Monte Carlo (SMC) method, which is superior to standard Markov chain Monte Carlo (MCMC) methods for multi-modal distributions. Finally, we make predictions from the probabilistic graphical model using the belief propagation algorithm. Numerical examples are presented to show the accuracy and efficiency of the predictive capability of the developed graphical model.
Implementation of Material and Geometry Criticality Search in RMC Code
RMC is a continuous-energy Reactor Monte Carlo neutron and photon transport code being developed by Department of Engineering Physics at Tsinghua University, Beijing. For the use of simulation of reactor control or design of reactor with unknown material and geometry parameters, an accurate and efficient method of eigenvalue search is implemented in RMC code. The eigenvalue search focuses on two types of parameters. One is nuclide atom density, called material search, which includes the fuel density, enrichment or boron concentration. Perturbation theory of Monte Carlo Code, like differential operator method and adjoint-weighted perturbation method has been widely researched in sensitivity and uncertainty study. For material search, the perturbation algorithm needs to coupled with flexible material control block and optimized strategy. The other type of parameter is surface position, called geometry search, which includes fuel rod diameter, pitch and control rod position. MC21 iterated on surface position based on bisection method or regula-falsi method, and directly recalculated k-eff until it converged to target error interval. In this paper, the differential operator method, improved Newton-Raphson method is introduced. Based on these methods, the global material search is implemented. Then based on material search and finite method, global geometry search is implement. Finally, fuel enrichment, boron concentration and control rod position in normal PWR assembly are searched. The results show that RMC can search material and geometry parameters accurately and efficiently. In this paper, global eigenvalue search of material and geometry parameters have been implemented in RMC code. They are based on the differential operator method in Monte Carlo perturbation theory. The differential operator method samples δk/δρ{sub r}, δ{sup 2}k/δρ{sub r}{sup 2} along with k-eff estimator. Therefore it won't take up too much additional computational resource. For homogeneous material search, fission source effect has little effect of accuracy and can be ignored. The results of fuel enrichment and boron concentration searches in assembly show that improved Newton-Raphson method can iterate efficiently until k-eff is in the error interval. Based on material search and finite difference formula, the geometry parameter, like control rod axial position, can iterate until k-eff is in the error interval. However, the tiny perturbed region may not contain enough tracks to simulate. Besides, the large number density's relative change up to -1 may cause underestimation of Δk-eff, and then slope of k-x curve. This will cause non-convergence for Newton- Raphson method. (authors)
Measurement of the inclusive jet cross-sections in proton-proton collisions at $\sqrt{s}=8$ TeV with the ATLAS detector
Inclusive jet production cross-sections are measured in proton-proton collisions at a centre-of-mass energy of √s=8 TeV recorded by the ATLAS experiment at the Large Hadron Collider at CERN. The total integrated luminosity of the analysed data set amounts to 20.2 fb -1 . Double-differential cross-sections are measured for jets defined by the anti-k t jet clustering algorithm with radius parameters of R = 0.4 and R = 0.6 and are presented as a function of the jet transverse momentum, in the range between 70 GeV and 2.5 TeV and in six bins of the absolute jet rapidity, between 0 and 3.0. The measured cross-sections are compared to predictions of quantum chromodynamics, calculated at next-to-leading order in perturbation theory, and corrected for non-perturbative and electroweak effects. The level of agreement with predictions, using a selection of different parton distribution functions for the proton, is quantified. Tensions between the data and the theory predictions are observed.
Higher-order phase shift reconstruction approach
Purpose: Biological soft tissues encountered in clinical and preclinical imaging mainly consists of atoms of light elements with low atomic numbers and their elemental composition is nearly uniform with little density variation. Hence, x-ray attenuation contrast is relatively poor and cannot achieve satisfactory sensitivity and specificity. In contrast, x-ray phase-contrast provides a new mechanism for soft tissue imaging. The x-ray phase shift of soft tissues is about a thousand times greater than the x-ray absorption over the diagnostic x-ray energy range, yielding a higher signal-to-noise ratio than the attenuation contrast counterpart. Thus, phase-contrast imaging is a promising technique to reveal detailed structural variation in soft tissues, offering a high contrast resolution between healthy and malignant tissues. Here the authors develop a novel phase retrieval method to reconstruct the phase image on the object plane from the intensity measurements. The reconstructed phase image is a projection of the phase shift induced by an object and serves as input to reconstruct the 3D refractive index distribution inside the object using a tomographic reconstruction algorithm. Such x-ray refractive index images can reveal structural features in soft tissues, with excellent resolution differentiating healthy and malignant tissues. Methods: A novel phase retrieval approach is proposed to reconstruct an x-ray phase image of an object based on the paraxial Fresnel-Kirchhoff diffraction theory. A primary advantage of the authors' approach is higher-order accuracy over that with the conventional linear approximation models, relaxing the current restriction of slow phase variation. The nonlinear terms in the autocorrelation equation of the Fresnel diffraction pattern are eliminated using intensity images measured at different distances in the Fresnel diffraction region, simplifying the phase reconstruction to a linear inverse problem. Numerical experiments are performed to demonstrate the accuracy and stability of the proposed approach. Results: The proposed reconstruction formula is a generalization of the transport of intensity equation (TIE). It has the second-order accuracy compared to the linear model used in the conventional phase retrieval approach. The numerical experiments demonstrate that the accuracy and stability of the proposed phase reconstruction method outperforms the TIE-based reconstruction method. Conclusions: A novel approach has been proposed to retrieve an x-ray phase shift image induced by an object from intensity images measured at different distances in the Fresnel diffraction region. The authors' approach has the second-order accuracy and is able to retrieve the phase shift of an object stably, overcoming the restriction of slow phase variation assumed by the conventional phase retrieval techniques.
Solving differential‐algebraic equations in power system dynamic analysis with quantum computing
Abstract Power system dynamics are generally modeled by high dimensional non‐linear differential‐algebraic equations (DAEs) given a large number of components forming the network. These DAEs' complexity can grow exponentially due to the increasing penetration of distributed energy resources, whereas their computation time becomes sensitive due to the increasing interconnection of the power grid with other energy systems. This paper demonstrates the use of quantum computing algorithms to solve DAEs for power system dynamic analysis. We leverage a symbolic programming framework to equivalently convert the power system's DAEs into ordinary differential equations (ODEs) using index reduction methods and then encode their data into qubits using amplitude encoding. The system non‐linearity is captured by Hamiltonian simulation with truncated Taylor expansion so that state variables can be updated by a quantum linear equation solver. Our results show that quantum computing can solve the power system's DAEs accurately with a computational complexity polynomial in the logarithm of the system dimension. We also illustrate the use of recent advanced tools in scientific machine learning for implementing complex computing concepts, that is, Taylor expansion, DAEs/ODEs transformation, and quantum computing solver with abstract representation for power engineering applications.
Doppler characteristics of sea clutter.
Doppler radars can distinguish targets from clutter if the target's velocity along the radar line of sight is beyond that of the clutter. Some targets of interest may have a Doppler shift similar to that of clutter. The nature of sea clutter is different in the clutter and exo-clutter regions. This behavior requires special consideration regarding where a radar can expect to find sea-clutter returns in Doppler space and what detection algorithms are most appropriate to help mitigate false alarms and increase probability of detection of a target. This paper studies the existing state-of-the-art in the understanding of Doppler characteristics of sea clutter and scattering from the ocean to better understand the design and performance choices of a radar in differentiating targets from clutter under prevailing sea conditions.
Primal-Dual Differentiable Programming for Distribution System Critical Load Restoration: Preprint
Swift and reliable critical load restoration (CLR) can help make a distribution system resilient towards extreme events. To optimally achieve that, alongside practical concerns such as limiting online computational burden, some studies leverage model-free reinforcement learning (RL) to train control policies. Despite the advantages provided by RL algorithms, these approaches suffer from two issues: 1) the lack of a proper mechanism for constraint enforcement, and 2) poor sample efficiency. Therefore, in this paper, a primal-dual differentiable programming (PDDP) method is developed for guiding the training leading to a constraint-satisfying policy. Additionally, the model-based nature of the proposed method aims at improving sample efficiency. The experiment on a CLR problem demonstrates that PDDP can effectively train a control policy that both achieves desirable performance and satisfies required constraints.
Massively parallel solvers for elliptic partial differential equations in numerical weather and climate prediction
The demand for substantial increases in the spatial resolution of global weather and climate prediction models makes it essential to use numerically efficient and highly scalable algorithms to solve the equations of large-scale atmospheric fluid dynamics. For stability and efficiency reasons, several of the operational forecasting centres, in particular the Met Office and the European Centre for Medium-Range Weather Forecasts (ECMWF) in the UK, use semi-implicit semi-Lagrangian time-stepping in the dynamical core of the model. The additional burden with this method is that a three-dimensional elliptic partial differential equation (PDE) for the pressure correction has to be solved at every model time step and this often constitutes a significant proportion of the time spent in the dynamical core. In global models, this PDE must be solved in a thin spherical shell. To run within tight operational time-scales, the solver has to be parallelized and there seems to be a (perceived) misconception that elliptic solvers do not scale to large processor counts and hence implicit time-stepping cannot be used in very high-resolution global models. After reviewing several methods for solving the elliptic PDE for the pressure correction and their application in atmospheric models, we demonstrate the performance and very good scalability of Krylov subspace solvers and multigrid algorithms for a representative model equation with more than 1010 unknowns on 65 536 cores on the High-End Computing Terascale Resource (HECToR), the UK's national supercomputer. Here, we tested and optimized solvers from two existing numerical libraries (the Distributed and Unified Numerics Environment (DUNE) and Parallel High Performance Preconditioners (hypre)) and implemented both a conjugate gradient solver and a geometric multigrid algorithm based on a tensor-product approach, which exploits the strong vertical anisotropy of the discretized equation. We study both weak and strong scalability and compare the absolute solution times for all methods; in contrast to one-level methods, the multigrid solver is robust with respect to parameter variations.