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 1,009 records · Page 56

Approximate Bisimulation-Based Reduction of Power System Dynamic Models

In this paper we propose approximate bisimulation relations and functions for reduction of power system dynamic models in differential- algebraic (descriptor) form. The full-size dynamic model is obtained by linearization of the nonlinear transient stability model. We generalize theoretical results on approximate bisimulation relations and bisimulation functions, originally derived for a class of constrained linear systems, to linear systems in descriptor form. An algorithm for transient stability assessment is proposed and used to determine whether the power system is able to maintain the synchronism after a large disturbance. Two benchmark power systems are used to illustrate the proposed algorithm and to evaluate the applicability of approximate bisimulation relations and bisimulation functions for reduction of the power system dynamic models.

Stankovic, AM↗

Galerkin Neural Networks: A Framework for Approximating Variational Equations with Error Control

Herein, we present a new approach to using neural networks to approximate the solutions of variational equations, based on the adaptive construction of a sequence of finite-dimensional sub-spaces whose basis functions are realizations of a sequence of neural networks. Here, the finite-dimensional subspaces are then used to define a standard Galerkin approximation of the variational equation. This approach enjoys a number of advantages, including: the sequential nature of the algorithm offers a systematic approach to enhancing the accuracy of a given approximation; the sequential enhancements provide a useful indicator for the error that can be used as a criterion for terminating the sequential updates; the basic approach is largely oblivious to the nature of the partial differential equation under consideration; and, some basic theoretical results are presented regarding the convergence (or otherwise) of the method which are used to formulate basic guidelines for applying the method.

97 MATHEMATICS AND COMPUTING↗

A Comparison of Genetic Programming Variants for Hyper-Heuristics

Modern society is faced with ever more complex problems, many of which can be formulated as generate-and-test optimization problems. General-purpose optimization algorithms are not well suited for real-world scenarios where many instances of the same problem class need to be repeatedly and efficiently solved, such as routing vehicles over highways with constantly changing traffic flows, because they are not targeted to a particular scenario. Hyper-heuristics automate the design of algorithms to create a custom algorithm for a particular scenario. Hyper-heuristics typically employ Genetic Programming (GP) and this project has investigated the relationship between the choice of GP and performance in Hyper-heuristics. Results are presented demonstrating the existence of problems for which there is a statistically significant performance differential between the use of different types of GP.

97 MATHEMATICS AND COMPUTING↗

Massively parallel modeling and inversion of electrical resistivity tomography data using PFLOTRAN

Abstract. Electrical resistivity tomography (ERT) is a broadly accepted geophysical method for subsurface investigations. Interpretation of field ERT data usually requires the application of computationally intensive forward modeling and inversion algorithms. For large-scale ERT data, the efficiency of these algorithms depends on the robustness, accuracy, and scalability on high-performance computing resources. In this regard, we present a robust and highly scalable implementation of forward modeling and inversion algorithms for ERT data. The implementation is publicly available and developed within the framework of PFLOTRAN, an open-source, state-of-the-art massively parallel subsurface flow and transport simulation code. The forward modeling is based on a finite-volume discretization of the governing differential equations, and the inversion uses a Gauss–Newton optimization scheme. To evaluate the accuracy of the forward modeling, two examples are first presented by considering layered (1D) and 3D earth conductivity models. The computed numerical results show good agreement with the analytical solutions for the layered earth model and results from a well-established code for the 3D model. Inversion of ERT data, simulated for a 3D model, is then performed to demonstrate the inversion capability by recovering the conductivity of the model. To demonstrate the parallel performance of PFLOTRAN's ERT process model and inversion capabilities, large-scale scalability tests are performed by using up to 131 072 processes on a leadership class supercomputer. These tests are performed for the two most computationally intensive steps of the ERT inversion: forward modeling and Jacobian computation. For the forward modeling, we consider models with up to 122 ×106 degrees of freedom (DOFs) in the resulting system of linear equations and demonstrate that the code exhibits almost linear scalability on up to 10 000 DOFs per process. On the other hand, the code shows superlinear scalability for the Jacobian computation, mainly because all computations are fairly evenly distributed over each process with no parallel communication.

58 GEOSCIENCES↗

An Algorithm for Constructing and Searching Spaces of Alternative Hypotheses

In this paper we develop techniques for automated hypothesis generation over data sets that maycontain contradictions. To do so, we make use of the equivalence between two formulations: those offirst order predicate logic with prefix modal quantifiers under the finite model hypothesis and those ofMixed Integer Linear Programming (MILP) problems. The equivalence between integer programming and logical satisfiability has been known since Karp'sseminal work in NP-completeness. Other authors have made use of this equivalence to explore efficientmethods of solving the satisfiability problem in the propositional calculus for specific problem types.The work presented here differentiates itself from previous work in that we do not assume that alllogical assertions are true without doubt. Instead we look for alternative hypotheses about the validityof the claims by identifying alternative optimal solutions to a corresponding MILP. We use a collectionof slack variables in the derived linear constraints to indicate the presence of contradictory data orassumptions. The objective is to minimize contradictions between data and assertions represented bythe presence of non-zero slack in the set of linear constraints.

99 GENERAL AND MISCELLANEOUS↗

Improving solve time of aggregation-based adaptive AMG

In this paper, we propose improving the solve time of a bootstrap algebraic multigrid (AMG) designed previously by the authors. This is achieved by incorporating the information, a set of algebraically smooth vectors, generated by the bootstrap algorithm, in a single hierarchy by using sufficiently large aggregates, and these aggregates are compositions of aggregates already built throughout the bootstrap algorithm. The modified AMG method has good convergence properties and shows significant reduction in both memory and solve time. These savings with respect to the original bootstrap AMG are illustrated on some difficult (for standard AMG) linear systems arising from discretization of scalar and vector function elliptic partial differential equations in both 2D and 3D.

97 MATHEMATICS AND COMPUTING↗

RE-INTEGRATE EMT Simulation Software: Graph Convolutional Network for Sparse Matrix Pattern Detection

The increasing complexity of power networks, driven by proliferation of inverters, presents analytical challenges that simplified models often fail to capture, necessitating Electromagnetic Transient (EMT) simulations. EMT models are represented as discretized differential-algebraic equations (DAEs), forming a linear system Ax = b that is computationally intensive to solve. Due to inherent sparsity of adjacency matrix A, distinct patterns emerge that, when accurately identified, enable efficient solver selection to minimize computation time. However, identifying ideal pattern is complicated by numerous reordering algorithms and limited structural insights. To address this, we introduce a Graph Convolutional Network (GCN) model for classifying sparse matrix patterns common in power system analysis. The model, achieving 96% test accuracy, is validated using PV plant models of 125 MW capacities connected to New England 39-bus transmission system (TS), and further scaled to a 4,992-bus network with 384 PV plants, yielding 191, 616 × 191, 616 sized A matrix. For all cases, the GCN model accurately identifies the matrix’s intrinsic sparse pattern, demonstrating its potential to enhance solver performance in EMT analysis.

Hossain, Md Rifat [Florida International Universit↗

SU-E-J-224: Using UTE and T1 Weighted Spin Echo Pulse Sequences for MR-Only Treatment Planning; Phantom Study

Purpose: Investigating a new approach in MRI based treatment planning using the combination of (Ultrashort Echo Time) UTE and T1 weighted spin echo pulse sequences to delineate air, bone and water (soft tissues) in generating pseudo CT images comparable with CT. Methods: A gel phantom containing chicken bones, ping pang balls filled with distilled water and air bubbles, was made. It scanned with MRI using UTE and 2D T1W SE pulse sequences with (in plane resolution= 0.53mm, slice thickness= 2 mm) and CT with (in plane resolution= 0.5 mm and slice thickness= 0.75mm) as a ground truth for geometrical accuracy. The UTE and T1W SE images were registered with CT using mutual information registration algorithm provided by Philips Pinnacle treatment planning system. The phantom boundaries were detected using Canny edge detection algorithm for CT, and MR images. The bone, air bubbles and water in ping pong balls were segmented from CT images using threshold 300HU, - 950HU and 0HU, respectively. These tissue inserts were automatically segmented from combined UTE and T1W SE images using edge detection and relative intensity histograms of the phantom. The obtained segmentations of air, bone and water inserts were evaluated with those obtained from CT. Results: Bone and air can be clearly differentiated in UTE images comparable to CT. Combining UTE and T1W SE images successfully segmented the air, bone and water. The maximum segmentation differences from combine MRI images (UTE and T1W SE) and CT are within 1.3 mm, 1.1mm for bone, air, respectively. The geometric distortion of UTE sequence is small less than 1 pixel (0.53 mm) of MR image resolution. Conclusion: Our approach indicates that MRI can be used solely for treatment planning and its quality is comparable with CT.

60 APPLIED LIFE SCIENCES↗

THE PHASES DIFFERENTIAL ASTROMETRY DATA ARCHIVE. III. LIMITS TO TERTIARY COMPANIONS

The Palomar High-precision Astrometric Search for Exoplanet Systems (PHASES) monitored 51 subarcsecond binary systems to evaluate whether tertiary companions as small as Jovian planets orbited either the primary or secondary stars, perturbing their otherwise smooth Keplerian motions. Twenty-one of those systems were observed 10 or more times and show no evidence of additional companions. A new algorithm is presented for identifying astrometric companions and establishing the (companion mass)-(orbital period) combinations that can be excluded from existence with high confidence based on the PHASES observations, and the regions of mass-period phase space being excluded are presented for 21 PHASES binaries.

79 ASTRONOMY AND ASTROPHYSICS↗

Variational symplectic algorithm for guiding center dynamics in the inner magnetosphere

Charged particle dynamics in magnetosphere has temporal and spatial multiscale; therefore, numerical accuracy over a long integration time is required. A variational symplectic integrator (VSI) [H. Qin and X. Guan, Phys. Rev. Lett. 100, 035006 (2008) and H. Qin, X. Guan, and W. M. Tang, Phys. Plasmas 16, 042510 (2009)] for the guiding-center motion of charged particles in general magnetic field is applied to study the dynamics of charged particles in magnetosphere. Instead of discretizing the differential equations of the guiding-center motion, the action of the guiding-center motion is discretized and minimized to obtain the iteration rules for advancing the dynamics. The VSI conserves exactly a discrete Lagrangian symplectic structure and has better numerical properties over a long integration time, compared with standard integrators, such as the standard and adaptive fourth order Runge-Kutta (RK4) methods. Applying the VSI method to guiding-center dynamics in the inner magnetosphere, we can accurately calculate the particles'orbits for an arbitrary long simulating time with good conservation property. When a time-independent convection and corotation electric field is considered, the VSI method can give the accurate single particle orbit, while the RK4 method gives an incorrect orbit due to its intrinsic error accumulation over a long integrating time.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Computational physics and applied mathematics capability review June 8-10, 2010 (Advance materials to committee members)

Los Alamos National Laboratory will review its Computational Physics and Applied Mathematics (CPAM) capabilities in 2010. The goals of capability reviews are to assess the quality of science, technology, and engineering (STE) performed by the capability, evaluate the integration of this capability across the Laboratory and within the scientific community, examine the relevance of this capability to the Laboratory's programs, and provide advice on the current and future directions of this capability. This is the first such review for CPAM, which has a long and unique history at the laboratory, starting from the inception of the Laboratory in 1943. The CPAM capability covers an extremely broad technical area at Los Alamos, encompassing a wide array of disciplines, research topics, and organizations. A vast array of technical disciplines and activities are included in this capability, from general numerical modeling, to coupled mUlti-physics simulations, to detailed domain science activities in mathematics, methods, and algorithms. The CPAM capability involves over 12 different technical divisions and a majority of our programmatic and scientific activities. To make this large scope tractable, the CPAM capability is broken into the following six technical 'themes.' These themes represent technical slices through the CP AM capability and collect critical core competencies of the Laboratory, each of which contributes to the capability (and each of which is divided into multiple additional elements in the detailed descriptions of the themes in subsequent sections): (1) Computational Fluid Dynamics - This theme speaks to the vast array of scientific capabilities for the simulation of fluids under shocks, low-speed flow, and turbulent conditions - which are key, historical, and fundamental strengths of the laboratory; (2) Partial Differential Equations - The technical scope of this theme is the applied mathematics and numerical solution of partial differential equations (broadly defined) in a variety of settings, including particle transport, solvers, and plasma physics; (3) Monte Carlo - Monte Carlo was invented at Los Alamos, and this theme discusses these vitally important methods and their application in everything from particle transport, to condensed matter theory, to biology; (4) Molecular Dynamics - This theme describes the widespread use of molecular dynamics for a variety of important applications, including nuclear energy, materials science, and biological modeling; (5) Discrete Event Simulation - The technical scope of this theme represents a class of complex system evolutions governed by the action of discrete events. Examples include network, communication, vehicle traffic, and epidemiology modeling; and (6) Integrated Codes - This theme discusses integrated applications (comprised of all of the supporting science represented in Themes 1-5) that are of strategic importance to the Laboratory and the nation. The laboratory has in approximately 10 million source lines of code in over 100 different such strategically important applications. Of these themes, four of them will be reviewed during the 2010 review cycle: Themes 1, 2, 3, and 6. Because these capability reviews occur every three years, Themes 4 and 5 will be reviewed in 2013, along with Theme 6 (which will be reviewed during each review, owing to this theme's role as an integrator of the supporting science represented by the other 5 themes). Yearly written status reports will be provided to the Capability Review Committee Chair during off-cycle years.

99 GENERAL AND MISCELLANEOUS↗

A new approach to color-coherent parton evolution

We present a simple parton-shower model that replaces the explicit angular ordering of the coherent branching formalism with a differentially accurate simulation of soft-gluon radiation by means of a non-trivial dependence of the splitting functions on azimuthal angles. We introduce a global kinematics mapping and provide an analytic proof that it satisfies the criteria for next-to leading logarithmic accuracy. In the new algorithm, initial and final state evolution are treated on the same footing. We provide an implementation for final-state evolution in the numerical code ALARIC and present a first comparison to experimental data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Sylvester-preconditioned adaptive-rank implicit time integrators for advection-diffusion equations with variable coefficients

Here, we consider the adaptive-rank integration of multi-dimensional time-dependent advection-diffusion partial differential equations (PDEs) with variable coefficients. We employ a standard finite-difference method for spatial discretization coupled with high-order diagonally implicit Runge-Kutta temporal schemes. The discrete equation is a generalized Sylvester equation (GSE), which we solve with a projection-based adaptive-rank algorithm structured around two key strategies: (i) constructing dimension-wise subspaces using a novel atypical extended Krylov strategy, and (ii) efficiently solving the basis coefficient matrix with a preconditioned GMRES solver. The low-rank decomposition is performed in 2D using SVD and with high-order SVD (HOSVD) in 3D to represent the tensor in a compressed Tucker format. For d-dimensional problems (here, d = 2 or 3), the computational complexity and memory storage of the approach are found numerically to scale as and $\mathscr{O}(Nr^2) + \mathscr{O} (r^{d+1})$ and $\mathscr{O}(Nr) + \mathscr{O} (r^{d})$, respectively, with the one-dimensional resolution and the maximal rank during the Krylov iteration (which we find to be largely independent of on our numerical examples). We present numerical examples that illustrate the advertised properties of the algorithm.

97 MATHEMATICS AND COMPUTING↗

Digital Twin Framework for PIP-II Linac: AI-Driven Multi-Scale Modeling from Ion Source to 800 MeV

The PIP-II linac will enable >1.2 MW beam power for DUNE, requiring unprecedented operational reliability across its warm front-end (RFQ, MEBT) and five distinct SRF sections operating at 162.5/325/650 MHz. We present a comprehensive digital twin framework uniquely combining a fully differentiable fast beam transport code with neural network surrogates trained on high-fidelity PIC simulations, capturing space charge and nonlinear dynamics beyond traditional envelope codes while achieving 10⁴ speedup at <1% accuracy. End-to-end differentiability enables gradient-based optimization across 500+ parameters simultaneously previously impossible with conventional tools while the model incorporates static/dynamic errors and serves as a virtual commissioning platform for diverse hardware integration. The framework facilitates reinforcement learning for pulsed/CW mode transitions, predictive maintenance through anomaly detection, and autonomous tuning algorithm development with real-time execution capability. Validation against physics simulations shows excellent agreement for the front-end, with initial results demonstrating potential for 30% commissioning time reduction and proactive fault mitigation, providing a scalable blueprint for operating next-generation high-intensity accelerators.

Pathak, Abhishek [Fermilab] (ORCID:000000021704208↗

Digital Twin Framework for PIP-II Linac: AI-Driven Multi-Scale Modeling from Ion Source to 800 MeV

The PIP-II linac will enable >1.2 MW beam power for DUNE, requiring unprecedented operational reliability across its warm front-end (RFQ, MEBT) and five distinct SRF sections operating at 162.5/325/650 MHz. We present a comprehensive digital twin framework uniquely combining a fully differentiable fast beam transport code with neural network surrogates trained on high-fidelity PIC simulations, capturing space charge and nonlinear dynamics beyond traditional envelope codes while achieving 10⁴× speedup at <1% accuracy. End-to-end differentiability enables gradient-based optimization across 500+ parameters simultaneously—previously impossible with conventional tools—while the model incorporates static/dynamic errors and serves as a virtual commissioning platform for diverse hardware integration. The framework facilitates reinforcement learning for pulsed/CW mode transitions, predictive maintenance through anomaly detection, and autonomous tuning algorithm development with real-time execution capability. Validation against physics simulations shows excellent agreement for the front-end, with initial results demonstrating potential for 30% commissioning time reduction and proactive fault mitigation, providing a scalable blueprint for operating next-generation high-intensity accelerators.

Pathak, Abhishek [Fermilab] (ORCID:000000021704208↗

Methods for Dynamic Analysis of Distribution Feeders with High Penetration of PV Generators

An increase in the number of inverter-interfaced photovoltaic (PV) generators on existing distribution feeders affects the design, operation, and control of the distribution systems. Existing distribution system analysis tools are capable of supporting only snapshot and quasi-static analyses. Capturing the dynamic effects of PV generators during the variation in distribution system states is necessary when studying the effects of controller bandwidths, multiple voltage correction devices, and anti-islanding. This work explores the use of dynamic phasors and differential algebraic equations (DAE) for impact analysis of PV generators on the existing distribution feeders.

14 SOLAR ENERGY↗

Variational multiscale element-free Galerkin method combined with the moving Kriging interpolation for solving some partial differential equations with discontinuous solutions

Solving partial differential equations with discontinuous solutions is an important challenging problem in numerical analysis. To this end, there are some methods such as finite volume method, discontinuous Galerkin approach and particle technique that are able to solve these problems. In the current paper, the moving Kriging element-free Galerkin method has been combined with the variational multiscale algorithm to obtain acceptable and high-resolution solutions. For testing this technique, we select some PDEs with discontinuous solution such as Burgers’, Sod’s shock tube, advection–reaction–diffusion, Kuramoto–Sivashinsky, Boussinesq and shallow water equations. First, we obtain a time-discrete scheme by approximating time derivative via finite difference technique. Then we introduce the moving Kriging interpolation and also obtain their shape functions. We use the element-free Galerkin method for approximating the spatial derivatives. This method uses a weak form of the considered equation that is similar to the finite element method with the difference that in the classical element-free Galerkin method test and trial functions are moving least squares approximation (MLS) shape functions. Since the shape functions of moving least squares (MLS) approximation do not have Kronecker delta property, we cannot implement the essential boundary condition, directly. Thus, we employ the shape functions of moving Kriging interpolation and radial point interpolation technique which have the mentioned property. Also, in the element-free Galekin method, we do not use any triangular, quadrangular or other type of meshes. The element-free Galerkin method is a global method while finite element method is a local one. This technique employs a background mesh for integration which makes it different from the truly mesh procedures. Several test problems are solved and numerical simulations are reported which confirm the efficiency of the proposed schemes.

97 MATHEMATICS AND COMPUTING↗

EM reconstruction of dual isotope PET using staggered injections and prompt gamma positron emitters

Purpose: The aim of dual isotope positron emission tomography (DIPET) is to create two separate images of two coinjected PET radiotracers. DIPET shortens the duration of the study, reduces patient discomfort, and produces perfectly coregistered images compared to the case when two radiotracers would be imaged independently (sequential PET studies). Reconstruction of data from such simultaneous acquisition of two PET radiotracers is difficult because positron decay of any isotope creates only 511 keV photons; therefore, the isotopes cannot be differentiated based on the detected energy. Methods: Recently, the authors have proposed a DIPET technique that uses a combination of radiotracer A which is a pure positron emitter (such as{sup 18}F or {sup 11}C) and radiotracer B in which positron decay is accompanied by the emission of a high-energy (HE) prompt gamma (such as {sup 38}K or {sup 60}Cu). Events that are detected as triple coincidences of HE gammas with the corresponding two 511 keV photons allow the authors to identify the lines-of-response (LORs) of isotope B. These LORs are used to separate the two intertwined distributions, using a dedicated image reconstruction algorithm. In this work the authors propose a new version of the DIPET EM-based reconstruction algorithm that allows the authors to include an additional, independent estimate of radiotracer A distribution which may be obtained if radioisotopes are administered using a staggered injections method. In this work the method is tested on simple simulations of static PET acquisitions. Results: The authors’ experiments performed using Monte-Carlo simulations with static acquisitions demonstrate that the combined method provides better results (crosstalk errors decrease by up to 50%) than the positron-gamma DIPET method or staggered injections alone. Conclusions: The authors demonstrate that the authors’ new EM algorithm which combines information from triple coincidences with prompt gammas and staggered injections improves the accuracy of DIPET reconstructions for static acquisitions so they reach almost the benchmark level calculated for perfectly separated tracers.

62 RADIOLOGY AND NUCLEAR MEDICINE↗