Search NASA⌕ Search

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.

At least 991 records · Page 55

A gyrokinetic collision operator for magnetized Lorentz plasmas

A gyrocenter collision operator for magnetized Lorentz plasmas is derived using the Fokker-Plank method. The gyrocenter collision operator consists of drift and diffusion terms in the gyrocenter coordinates, including the diffusion of the gyrocenter, which does not exist for the collision operator in the particle phase space coordinates. The gyrocenter collision operator also depends on the transverse electric field explicitly, which is crucial for the correct treatment of collisional effects and transport in the gyrocenter coordinates. The gyrocenter collision operator derived is applied to calculate the particle and heat transport fluxes in a magnetized Lorentz plasma with an electric field. The particle and heat transport fluxes calculated from our gyrocenter collision operator agree exactly with the classical Braginskii's result [S. I. Braginskii, Reviews of Plasma Physics (Consultants Bureau, New York, 1965), Vol. 1, p. 205: P. Helander and D. J. Sigmar, Collisional Transport in Magnetized Plasmas (Cambridge University, Cambridge, 2002), p. 65], which validates the correctness of our collision operator. To calculate the transport fluxes correctly, it is necessary to apply the pullback transformation associated with gyrocenter coordinate transformation in the presence of collisions, which also serves as a practical algorithm for evaluating collisional particle and heat transport fluxes in the gyrocenter coordinates.

42 ENGINEERING↗

Nuclear Power Plant Ontology in OWL Format

This document describes an ontology for Nuclear Power Plant sites for use in software developed by Peng Yue of George Mason University, the intelligent Geospatial Feature Discovery System (iGFDS). The ontology was developed from unclassified and open sources available on the Web, primarily from Wikipedia. Figures 1 and 2 are screenshots of the Protégé application showing the classes of the Nuclear Power Plant Ontology which was developed in the OWL format. The ontology contains supplemental information that is not shown in these screenshots and that appears as “comments” in the Annotations window. For example, “SteamGenerator” and “SecondaryCoolant” only apply to “PWR” reactors. The ontology is based on general professional knowledge of Nuclear Power Plant operation and contains a number of components necessary for understanding and modeling the functionality of a Nuclear Power Plant. The content of the ontology is not limited to equipment and buildings that can be typically observed in the imagery. The things that can be seen are often the higher level items (CoolingTower, TurbineBuilding, ContainmentBuilding, etc.). It should be pointed out that PWR plants will be much easier to identify, generally, compared to BWR plants, due to the characteristic containment structure. The information on the TransformerYard was obtained from other sources not associated specifically with Nuclear Power Plants This ontology has to be viewed as a starting point of development ontologies for assisting with identification of Nuclear Power Plant sites with the GMU software. It can be a model for ontologies for other industrial sites. The classes and relations in the ontology have to be rearranged in a way that is most suitable for feature detection. Also the classes pertaining to visible components or signs of operation of a nuclear power plant will have to be linked to classes and properties of the objects in imagery that can be detected by image processing algorithms. Note that the current ontology does not contain statements about anything that is not present at a Nuclear Power Plant site, for example, “a Nuclear Power Plant DOES NOT HAVE a large pile of coal or other raw materials”, which would help logically to differentiate it from other types of power plants.

Ward, Richard C.↗

Machine Learning-Based Classification of Lignocellulosic Biomass from Pyrolysis-Molecular Beam Mass Spectrometry Data

High-throughput analysis of biomass is necessary to ensure consistent and uniform feedstocks for agricultural and bioenergy applications and is needed to inform genomics and systems biology models. Pyrolysis followed by mass spectrometry such as molecular beam mass spectrometry (py-MBMS) analyses are becoming increasingly popular for the rapid analysis of biomass cell wall composition and typically require the use of different data analysis tools depending on the need and application. Here, the authors report the py-MBMS analysis of several types of lignocellulosic biomass to gain an understanding of spectral patterns and variation with associated biomass composition and use machine learning approaches to classify, differentiate, and predict biomass types on the basis of py-MBMS spectra. Py-MBMS spectra were also corrected for instrumental variance using generalized linear modeling (GLM) based on the use of select ions relative abundances as spike-in controls. Machine learning classification algorithms e.g., random forest, k-nearest neighbor, decision tree, Gaussian Naïve Bayes, gradient boosting, and multilayer perceptron classifiers were used. The k-nearest neighbors (k-NN) classifier generally performed the best for classifications using raw spectral data, and the decision tree classifier performed the worst. After normalization of spectra to account for instrumental variance, all the classifiers had comparable and generally acceptable performance for predicting the biomass types, although the k-NN and decision tree classifiers were not as accurate for prediction of specific sample types. Gaussian Naïve Bayes (GNB) and extreme gradient boosting (XGB) classifiers performed better than the k-NN and the decision tree classifiers for the prediction of biomass mixtures. The data analysis workflow reported here could be applied and extended for comparison of biomass samples of varying types, species, phenotypes, and/or genotypes or subjected to different treatments, environments, etc. to further elucidate the sources of spectral variance, patterns, and to infer compositional information based on spectral analysis, particularly for analysis of data without a priori knowledge of the feedstock composition or identity.

59 BASIC BIOLOGICAL SCIENCES↗

Efficient Floating-Point Arithmetic on Fault-Tolerant Quantum Computers

We propose a novel floating-point encoding scheme that builds on prior work involving fixed-point encodings. We encode floating-point numbers using Two's Complement fixed-point mantissas and Two's Complement integral exponents. We used our proposed approach to develop quantum algorithms for fundamental arithmetic operations, such as bit-shifting, reciprocation, multiplication, and addition. We prototyped and investigated the performance of the floating-point encoding scheme on quantum computer simulations by performing reciprocation on randomly drawn inputs and by solving first-order ordinary differential equations, while varying the number of qubits in the encoding. We observed rapid convergence to the exact solutions as we increased the number of qubits and a significant reduction in the number of ancilla qubits required for reciprocation when compared with similar approaches.

Serrallés, José Cruz [Weill Cornell Med. Coll.]↗

EXPANDED VERY LARGE ARRAY OBSERVATIONS OF GALACTIC SUPERNOVA REMNANTS: WIDE-FIELD CONTINUUM AND SPECTRAL-INDEX IMAGING

The radio continuum emission from the Galaxy has a rich mix of thermal and non-thermal emission. This very richness makes its interpretation challenging since the low radio opacity means that a radio image represents the sum of all emission regions along the line of sight. These challenges make the existing narrowband radio surveys of the Galactic plane difficult to interpret: e.g., a small region of emission might be a supernova remnant (SNR) or an H II region, or a complex combination of both. Instantaneous wide bandwidth radio observations in combination with the capability for high-resolution spectral-index mapping can be directly used to disentangle these effects. Here we demonstrate simultaneous continuum and spectral-index imaging capability at the full continuum sensitivity and resolution using newly developed wide-band wide-field imaging algorithms. Observations were conducted in the L and C bands with a total bandwidth of 1 and 2 GHz, respectively. We present preliminary results in the form of a full-field continuum image covering the wide-band sensitivity pattern of the EVLA centered on a large but poorly studied SNR (G55.7 + 3.4) and relatively narrower field continuum and spectral-index maps of three fields containing SNR and diffused thermal emission. We demonstrate that spatially resolved spectral-index maps differentiate regions with emission of different physical origins (spectral-index variation across composite SNRs and separation of thermal and non-thermal emission), superimposed along the line of sight. The wide-field image centered on the SNR G55.7+3.4 also demonstrates the excellent wide-field wide-band imaging capability of the EVLA.

79 ASTRONOMY AND ASTROPHYSICS↗

Fast and Scalable FFT-Based GPU-Accelerated Algorithms for Block-Triangular Toeplitz Matrices with Application to Linear Inverse Problems Governed by Autonomous Dynamical Systems

In this work, we present an efficient and scalable algorithm for performing matrix-vector multiplications (matvecs) for block Toeplitz matrices. Such matrices, which are shift-invariant with respect to their blocks, arise in the context of solving inverse problems governed by autonomous systems, and time-invariant systems in particular. In this article, we consider inverse problems that infer unknown parameters from observational data of a linear time-invariant dynamical system given in the form of partial differential equations (PDEs). Matrix-free Newton-conjugate-gradient methods are often the gold standard for solving these inverse problems, but they require numerous actions of the Hessian on a vector. Matrix-free adjoint-based Hessian matvecs require solution of a pair of linearized forward/adjoint PDE solves per Hessian action, which may be prohibitive for large-scale inverse problems. Time invariance of the forward PDE problem leads to a block Toeplitz structure of the discretized parameter-to-observable (p2o) map defining the mapping from inputs (parameters) to outputs (observables) of the PDEs. This block Toeplitz structure enables us to exploit two key properties: (1) compact storage of the p2o map and its adjoint, and (2) efficient fast Fourier transform–based Hessian matvecs. The proposed algorithm is mapped onto large multi-GPU clusters and achieves more than 80% of peak bandwidth on NVIDIA A100 GPUs. Excellent weak scaling is shown for up to 48 A100 GPUs. For the targeted problems, the implementation executes Hessian matvecs within fractions of a second, which is orders of magnitude faster than can be achieved by conventional matrix-free Hessian matvecs via forward/adjoint PDE solves.

97 MATHEMATICS AND COMPUTING↗

Special issue: Advanced stencil-code engineering

Here, stencil codes are compute-intensive algorithms, in which data points arranged in a large grid are being recomputed repeatedly from the values of data points in a predefined neighborhood. This fixed neighborhood pattern is called a stencil. Stencils codes see wide-spread use in computing the discrete solutions of partial differential equations and systems composed of such equations.

97 MATHEMATICS AND COMPUTING↗

Online randomized interpolative decomposition with a posteriori error estimator for temporal PDE data reduction

Traditional low-rank approximation is a powerful tool for compressing large data matrices that arise in simulations of partial differential equations (PDEs), but suffers from high computational cost and requires several passes over the PDE data. The compressed data may also lack interpretability thus making it difficult to identify feature patterns from the original data. Here, to address these issues, we present an online randomized algorithm to compute the interpolative decomposition (ID) of large-scale data matrices in situ. Compared to previous randomized IDs that used the QR decomposition to determine the column basis, we adopt a streaming ridge leverage score-based column subset selection algorithm that dynamically selects proper basis columns from the data and thus avoids an extra pass over the data to compute the coefficient matrix of the ID. In particular, we adopt a single-pass error estimator based on the non-adaptive Hutch++ algorithm to provide real-time error approximation for determining the best coefficients. As a result, our approach only needs a single pass over the original data and thus is suitable for large and high-dimensional matrices stored outside of core memory or generated in PDE simulations. A strategy to improve the accuracy of the reconstructed data gradient, when desired, within the ID framework is also presented. We provide numerical experiments on turbulent channel flow and ignition simulations, and on the NSTX Gas Puff Image dataset, comparing our algorithm with the offline ID algorithm to demonstrate its utility in real-world applications.

Column subset selection↗

Limited-memory adaptive snapshot selection for proper orthogonal decomposition

Reduced order models are useful for accelerating simulations in many-query contexts, such as optimization, uncertainty quantification, and sensitivity analysis. However, offline training of reduced order models can have prohibitively expensive memory and floating-point operation costs in high-performance computing applications, where memory per core is limited. To overcome this limitation for proper orthogonal decomposition, we propose a novel adaptive selection method for snapshots in time that limits offline training costs by selecting snapshots according an error control mechanism similar to that found in adaptive time-stepping ordinary differential equation solvers. The error estimator used in this work is related to theory bounding the approximation error in time of proper orthogonal decomposition-based reduced order models, and memory usage is minimized by computing the singular value decomposition using a single-pass incremental algorithm. Results for a viscous Burgers’ test problem demonstrate convergence in the limit as the algorithm error tolerances go to zero; in this limit, the full order model is recovered to within discretization error. The resulting method can be used on supercomputers to generate proper orthogonal decomposition-based reduced order models, or as a subroutine within hyperreduction algorithms that require taking snapshots in time, or within greedy algorithms for sampling parameter space.

97 MATHEMATICS AND COMPUTING↗

The Random Ray Method for neutral particle transport

A new approach to solving partial differential equations (PDEs) based on the method of characteristics (MOC) is presented. The Random Ray Method (TRRM) uses a stochastic rather than deterministic discretization of characteristic tracks to integrate the phase space of a problem. TRRM is potentially applicable in a number of transport simulation fields where long characteristic methods are used, such as neutron transport and gamma ray transport in reactor physics as well as radiative transfer in astrophysics. In this study, TRRM is developed and then tested on a series of exemplar reactor physics benchmark problems. The results show extreme improvements in memory efficiency compared to deterministic MOC methods, while also reducing algorithmic complexity, allowing for a sparser computational grid to be used while maintaining accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Distributed Sensor Coordination for Advanced Energy Systems

The ability to collect key system level information is critical to the safe, efficient and reliable operation of advanced energy systems. With recent advances in sensor development, it is now possible to push some level of decision making directly to computationally sophisticated sensors, rather than wait for data to arrive to a massive centralized location before a decision is made. This type of approach relies on networked sensors (called “agents” from here on) to actively collect and process data, and provide key control decisions to significantly improve both the quality/relevance of the collected data and the associating decision making. The technological bottlenecks for such sensor networks stem from a lack of mathematics and algorithms to manage the systems, rather than difficulties associated with building and deploying them. Indeed, traditional sensor coordination strategies do not provide adequate solutions for this problem. Passive data collection methods (e.g., large sensor webs) can scale to large systems, but are generally not suited to highly dynamic environments, such as advanced energy systems, where crucial decisions may need to be reached quickly and locally. Approaches based on local decisions on the other hand cannot guarantee that each agent performing its task (maximize an agent objective) will lead to good network wide solution (maximize a network objective) without invoking cumbersome coordination routines. There is currently a lack of algorithms that will enable self-organization and blend the efficiency of local decision making with the system level guarantees of global decision making, particularly when the systems operate in dynamic and stochastic environments. In this work we addressed this critical gap and provided a comprehensive solution to the problem of sensor coordination to ensure the safe, reliable, and robust operation of advanced energy systems. The differentiating aspect of the proposed work is in shifting the focus towards “what to observe” rather than “how to observe” in large sensor networks, allowing the agents to actively determine both the structure of the network and the relevance of the information they are seeking to collect. In addition to providing an implicit coordination mechanism, this approach allows the system to be reconfigured in response to changing needs (e.g., sudden external events requiring new responses) or changing sensor network characteristics (e.g., sudden changes to plant condition). Outcome Summary: All milestones associated with this project have been completed. In particular, private sensor objective functions were developed which are aligned with the global objective function, sensor effectiveness has been improved by using “sensor teams,” system efficiency has been improved by 30% using difference evaluation functions, we have demonstrated system reconfigurability for 20% changes in system conditions, we have demonstrated extreme scalability of our proposed algorithm, we have demonstrated that sensor networks can overcome disruptions of up to 20% in network conditions, and have demonstrated system reconfigurability to 20% changes in system conditions in hardware-based simulations. This final report summarizes how each of these milestones was achieved, and gives insight into future research possibilities past the work which has been completed. The following publications support these milestones [6, 8, 9, 10, 16, 18, 19].

97 MATHEMATICS AND COMPUTING↗

Fast multipurpose Monte Carlo simulation for proton therapy using multi- and many-core CPU architectures

Purpose: Accuracy in proton therapy treatment planning can be improved using Monte Carlo (MC) simulations. However the long computation time of such methods hinders their use in clinical routine. This work aims to develop a fast multipurpose Monte Carlo simulation tool for proton therapy using massively parallel central processing unit (CPU) architectures. Methods: A new Monte Carlo, called MCsquare (many-core Monte Carlo), has been designed and optimized for the last generation of Intel Xeon processors and Intel Xeon Phi coprocessors. These massively parallel architectures offer the flexibility and the computational power suitable to MC methods. The class-II condensed history algorithm of MCsquare provides a fast and yet accurate method of simulating heavy charged particles such as protons, deuterons, and alphas inside voxelized geometries. Hard ionizations, with energy losses above a user-specified threshold, are simulated individually while soft events are regrouped in a multiple scattering theory. Elastic and inelastic nuclear interactions are sampled from ICRU 63 differential cross sections, thereby allowing for the computation of prompt gamma emission profiles. MCsquare has been benchmarked with the GATE/GEANT4 Monte Carlo application for homogeneous and heterogeneous geometries. Results: Comparisons with GATE/GEANT4 for various geometries show deviations within 2%–1 mm. In spite of the limited memory bandwidth of the coprocessor simulation time is below 25 s for 10{sup 7} primary 200 MeV protons in average soft tissues using all Xeon Phi and CPU resources embedded in a single desktop unit. Conclusions: MCsquare exploits the flexibility of CPU architectures to provide a multipurpose MC simulation tool. Optimized code enables the use of accurate MC calculation within a reasonable computation time, adequate for clinical practice. MCsquare also simulates prompt gamma emission and can thus be used also for in vivo range verification.

60 APPLIED LIFE SCIENCES↗

Different CT slice thickness and contrast‐enhancement phase in radiomics models on the differential performance of lung adenocarcinoma

Abstract Background To investigate the effects of computed tomography (CT) reconstruction slice thickness and contrast‐enhancement phase on the differential diagnosis performance of radiomic signature in lung adenocarcinoma. Methods A total of 187 patients who had been pathologically confirmed with lung adenocarcinoma and nonadenocarcinoma were divided into a training cohort ( n = 149) and validation cohort ( n = 38). All the patients underwent contrast‐enhanced CT and the images were reconstructed with different slice thickness. The radiomic features were extracted from different slice thickness and scan phase. The logistic regression (LR) algorithm was used to build a machine learning model for each group. The area under the curve (AUC) obtained from the receiver operating characteristic (ROC) curve and DeLong test was used to evaluate its discriminating performance. Results Finally, 34 image features and five semantic features were selected to establish a radiomics model. Based on the three contrast‐enhanced CT phases and four reconstruction slice thickness, 12 groups of radiomics models showed good discrimination ability with the AUCs range from 0.9287 to 0.9631, sensitivity range from 0.8349 to 0.9083, specificity range from 0.825 to 0.925 in the training group. Similar results were observed in the validation group. However, there was no statistical significance between the different CT scan phase groups and different slice thickness ( p > 0.05). Conclusions The radiomic analysis of contrast‐enhanced CT can be used for the differential diagnosis of lung adenocarcinoma. Moreover, different slice thickness and contrast‐enhanced scan phase did not affect the discriminating ability in the radiomics models.

Wang, Yang↗

A stochastic model and Monte Carlo algorithm for fluctuation-induced H{sub 2} formation on the surface of interstellar dust grains

A stochastic algorithm for simulation of fluctuation-induced kinetics of H{sub 2} formation on grain surfaces is suggested as a generalization of the technique developed in our recent studies [1] where this method was developed to describe the annihilation of spatially separate electrons and holes in a disordered semiconductor. The stochastic model is based on the spatially inhomogeneous, nonlinear integro-differential Smoluchowski equations with random source term. In this paper we derive the general system of Smoluchowski type equations for the formation of H{sub 2} from two hydrogen atoms on the surface of interstellar dust grains with physisorption and chemisorption sites. We focus in this study on the spatial distribution, and numerically investigate the segregation in the case of a source with a continuous generation in time and randomly distributed in space. The stochastic particle method presented is based on a probabilistic interpretation of the underlying process as a stochastic Markov process of interacting particle system in discrete but randomly progressed time instances. The segregation is analyzed through the correlation analysis of the vector random field of concentrations which appears to be isotropic in space and stationary in time.

79 ASTRONOMY AND ASTROPHYSICS↗

An introduction to partial differential equations constrained optimization

Partial differential equation (PDE) constrained optimization is designed to solve control, design, and inverse problems with underlying physics. A distinguishing challenge of this technique is the handling of large numbers of optimization variables in combination with the complexities of discretized PDEs. Over the last several decades, advances in algorithms, numerical simulation, software design, and computer architectures have allowed for the maturation of PDE constrained optimization (PDECO) technologies with subsequent solutions to complicated control, design, and inverse problems. This special journal edition, entitled “PDE-Constrained Optimization”, features eight papers that demonstrate new formulations, solution strategies, and innovative algorithms for a range of applications. In particular, these contributions demonstrate the impactfulness on our engineering and science communities. This paper offers short remarks to provide some perspective and background for PDECO, in addition to summaries of the eight papers.

97 MATHEMATICS AND COMPUTING↗

A fast Fourier transform-based mesoscale field dislocation mechanics study of grain size effects and reversible plasticity in polycrystals

A numerical implementation of a non-local polycrystal plasticity theory based on a mesoscale version of the field dislocation mechanics theory (MFDM) of Acharya and Roy (2006) is presented using small-strain elasto-viscoplastic fast Fourier transform-based (EVPFFT) algorithm developed by Lebensohn et al. (2012). In addition to considering plastic flow and hardening only due to SSDs (statistically stored dislocations) as in the classic EVPFFT framework, the proposed method accounts for the evolution of GND (geometrically necessary dislocations) densities solving a hyperbolic-type partial differential equation, and GND effects on both plastic flow and hardening. This allows consideration of an enhanced strain-hardening law that includes the effect of the GND density tensor. The numerical implementation of a reduced version of the MFDM is presented in the framework of the FFT-based augmented Lagrangian procedure of Michel et al. (2001). A Finite Differences scheme combined with discrete Fourier transforms is applied to solve both incompatibility and equilibrium equations. The numerical procedure named MFDM-EVPFFT is used to perform full field simulations of polycrystal plasticity considering different grain sizes and their mechanical responses during monotonic tensile and reversible tension-compression tests. Using Voronoi tessellation and periodic boundary conditions, voxelized representative volume elements (RVEs) with different grain sizes are generated. With MFDM-EVPFFT, a Hall-Petch type scaling law is obtained in contrast with the conventional crystal plasticity EVPFFT. In the case of reversible plasticity, a stronger Bauschinger effect is observed with the MFDM-EVPFFT approach in comparison with conventional EVPFFT. Here, the origin of these differences is analyzed in terms of heterogeneity, GND density and stress evolutions during the compression stage.

36 MATERIALS SCIENCE↗

Optimal Control of Differentially Private EV Charging: A Scalable Learning Approach Under Uncertainty

Internet of Things (IoT)-enabled electric vehicles (IoEVs) enable intelligent charging coordination that accounts for grid congestion. However, increased data exchange raises privacy concerns, as charging patterns can reveal sensitive driver behavior to grid operators. Here, we propose a differentially private (DP) EV charging framework that enables coordinated control while protecting driver data with theoretical privacy guarantees. Nevertheless, integrating DP inevitably introduces uncertainty into the control strategy for EVs, which can lead to infeasible solutions. To tackle this challenge, we develop a feasible and scalable control algorithm based on constrained reinforcement learning (CRL) and convex hulls. While our framework is designed to handle the uncertainty introduced by DP, it is general and also applicable to other sources of uncertainty in EV charging, such as the stochastic nature of driver behavior and renewable variability. This ensures feasible and privacy-preserving coordination of EV charging at scale. Our method constructs convex hulls within the action space to guarantee feasibility under stochastic constraints and incorporates constraint reduction techniques to improve scalability. Case studies based on IEEE benchmark systems demonstrate that the proposed approach effectively balances feasibility under uncertainty, scalability, and privacy in large-scale EV charging control.

Engineering - Power transmission and distribution↗

Parallel Implementation of Power System Dynamic Simulation

Dynamic simulation of power system transient stability is important for planning, monitoring, operation, and control of electrical power systems. However, modeling the system dynamics and network involves the computationally intensive time-domain solution of numerous differential and algebraic equations (DAE). This results in a transient stability implementation that may not maintain the real-time constraints of an online security assessment. This paper presents a parallel implementation of the dynamic simulation on a high-performance computing (HPC) platform using parallel simulation algorithms and computation architectures. It enables the simulation to run even faster than real time, enabling the “look-ahead” capability of upcoming stability problems in the power grid.

dynamic simulation↗