Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical algorithm computing”

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,675 records · Page 93

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↗

Fully implicit Particle-in-cell algorithms for multiscale plasma simulation

The outline of the paper is as follows: Particle-in-cell (PIC) methods for fully ionized collisionless plasmas, explicit vs. implicit PIC, 1D ES implicit PIC (charge and energy conservation, moment-based acceleration), and generalization to Multi-D EM PIC: Vlasov-Darwin model (review and motivation for Darwin model, conservation properties (energy, charge, and canonical momenta), and numerical benchmarks). The author demonstrates a fully implicit, fully nonlinear, multidimensional PIC formulation that features exact local charge conservation (via a novel particle mover strategy), exact global energy conservation (no particle self-heating or self-cooling), adaptive particle orbit integrator to control errors in momentum conservation, and canonical momenta (EM-PIC only, reduced dimensionality). The approach is free of numerical instabilities: ω pe Δt >> 1, and Δx >> λ D . It requires many fewer dofs (vs. explicit PIC) for comparable accuracy in challenging problems. Significant CPU gains (vs explicit PIC) have been demonstrated. The method has much potential for efficiency gains vs. explicit in long-time-scale applications. Moment-based acceleration is effective in minimizing N FE , leading to an optimal algorithm.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Topanga: A kinetic ion plasma code for large-scale ionospheric simulations on magnetohydrodynamic timescales

Topanga is a kinetic ion code developed for simulating large-scale plasma phenomena in the Earth's ionosphere on magnetohydrodynamic timescales. It is a domain-decomposed parallel code that runs on high-performance computing platforms. Features of Topanga include spherical geometry for simplified boundary conditions and computational efficiency; a hybrid plasma model with inertia-less fluid electrons, kinetic ions, and an electric field specified via an Ohm's law; a Maxwell-FDTD (finite difference time domain) plasma model which retains the displacement current in Maxwell's equations and models electron currents in the ionosphere with a tensor conductivity; sponge-layer boundary conditions for absorption of electromagnetic and plasma waves incident on the domain boundaries; and a novel mixed-implicit algorithm for evolving the EM fields inside the Maxwell-FDTD region that is stable over many orders of magnitude in the electron–ion collision frequency. We verify the numerical methods used in Topanga on a pair of test problems. The first test involves modeling a three-dimensional collisionless shock using the hybrid set of equations. The second test involves modeling a spherical TEM mode in vacuum using the Maxwell-FDTD set of equations. Finally, we demonstrate how using the combined set of hybrid and Maxwell-FDTD equations to model the Starfish Prime high-altitude nuclear test recovers a “missing” EM signal on the ground that is not present when using only the hybrid set of equations. The magnitude of this signal in the simulation containing the Maxwell-FDTD region agrees well with the E3a portion of the magnetohydrodynamic electromagnetic pulse from Starfish Prime.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Seismic Spatial Gradients and Machine Learning-Based Classifiers for Explosion Monitoring (LDRD 218327)

This final report summarizes the work completed under the Laboratory Directed Research and Development (LDRD) project “Seismic Spatial Gradients as a Machine Learning-Based Classifier for Explosion Monitoring.” The overarching goal of the project was to explore the efficacy of using machine learning-based classification algorithms where the input data are the spatial gradient of the seismic wavefield collected at a single point on the Earth’s surface. The methods that I describe here are in direct contrast to conventional methods of seismic discrimination which typically rely on a spatially extended network of instruments and physics-based wavefield attributes such as, for example, the ratio between $\textit{P}$ and $\textit{S}$ waves. Rather, we use the spatial gradient of the seismic wavefield observed at a single point on the Earth’s surface and data processing approaches inspired by the machine learning community. We tested two algorithms, a neural network and a modified version of principal component analysis termed Spectrally Filtered Principal Component Analysis (SFPCA). To test these algorithms, we first conducted a series of numerical tests using synthetic data and then conducted a small-scale controlled field experiment. The tests using synthetic data showed that both algorithms had high success rates on gradiometric data, even when simulated noise was added to the signal. Furthermore, we found that using seismic spatial gradients increased the performance of our discrimination algorithms when compared to using just the traditional translational motion seismic data. The tests with field data also showed a high degree of discriminative success.

58 GEOSCIENCES↗

Probabilistic N - k failure-identification for power systems

This work considers a probabilistic generalization of the N - k failure-identification problem in power transmission networks, where the probability of failure of each component in the network is known a priori and the goal of the problem is to find a set of k components that maximizes disruption to the system loads weighted by the probability of simultaneous failure of the k components. The resulting problem is formulated as a bilevel mixed-integer nonlinear program. Convex relaxations, linear approximations, and heuristics are developed to obtain feasible solutions that are close to the optimum. A general cutting-plane algorithm is proposed to solve the convex relaxation and linear approximations of the N - k problem. Extensive numerical results corroborate the effectiveness of the proposed algorithms on small-, medium-, and large-scale test instances; the test instances include the IEEE 14-bus system, the IEEE single-area and three-area RTS96 systems, the IEEE 118-bus system, the WECC 240-bus test system, the 1354-bus PEGASE system, and the 2383-bus Polish winter-peak test system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

On the Derivation of Quasi-Newton Formulas for Optimization in Function Spaces

Newton’s method is usually preferred when solving optimization problems due to its superior convergence properties compared to gradient-based or derivative-free optimization algorithms. However, deriving and computing second-order derivatives needed by Newton’s method often is not trivial and, in some cases, not possible. In such cases quasi-Newton algorithms are a great alternative. In this paper, we provide a new derivation of well-known quasi-Newton formulas in an infinite-dimensional Hilbert space setting. Furthermore, it is known that quasi-Newton update formulas are solutions to certain variational problems over the space of symmetric matrices. In this paper, we formulate similar variational problems over the space of bounded symmetric operators in Hilbert spaces. By changing the constraints of the variational problem we obtain updates (for the Hessian and Hessian inverse) not only for the Broyden-Fletcher-Goldfarb-Shanno (BFGS) quasi-Newton method but also for Davidon–Fletcher–Powell (DFP), Symmetric Rank One (SR1), and Powell-Symmetric-Broyden (PSB). In addition, for an inverse problem governed by a partial differential equation (PDE), we derive DFP and BFGS “structured” secant formulas that explicitly use the derivative of the regularization and only approximates the second derivative of the misfit term. We show numerical results that demonstrate the desired mesh-independence property and superior performance of the resulting quasi-Newton methods.

97 MATHEMATICS AND COMPUTING↗

Sparse-grid, reduced-basis Bayesian inversion: Nonaffine-parametric nonlinear equations

We extend the reduced basis (RB) accelerated Bayesian inversion methods for affine-parametric, linear operator equations which are considered in [16,17] to non-affine, nonlinear parametric operator equations. We generalize the analysis of sparsity of parametric forward solution maps in [20] and of Bayesian inversion in [48,49] to the fully discrete setting, including Petrov–Galerkin high-fidelity (“HiFi”) discretization of the forward maps. We develop adaptive, stochastic collocation based reduction methods for the efficient computation of reduced bases on the parametric solution manifold. The nonaffinity and nonlinearity with respect to (w.r.t.) the distributed, uncertain parameters and the unknown solution is collocated; specifically, by the so-called Empirical Interpolation Method (EIM). For the corresponding Bayesian inversion problems, computational efficiency is enhanced in two ways: first, expectations w.r.t. the posterior are computed by adaptive quadratures with dimension-independent convergence rates proposed in [49]; the present work generalizes [49] to account for the impact of the PG discretization in the forward maps on the convergence rates of the Quantities of Interest (QoI for short). Second, we propose to perform the Bayesian estimation only w.r.t. a parsimonious, RB approximation of the posterior density. Based on the approximation results in [49], the infinite-dimensional parametric, deterministic forward map and operator admit N-term RB and EIM approximations which converge at rates which depend only on the sparsity of the parametric forward map. In several numerical experiments, the proposed algorithms exhibit dimension-independent convergence rates which equal, at least, the currently known rate estimates for N-term approximation. We propose to accelerate Bayesian estimation by first offline construction of reduced basis surrogates of the Bayesian posterior density. The parsimonious surrogates can then be employed for online data assimilation and for Bayesian estimation. They also open a perspective for optimal experimental design.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sampling two-dimensional isometric tensor network states

Sampling a quantum system’s underlying probability distributions is an important computational task, e.g., for quantum advantage experiments and quantum Monte Carlo algorithms. Tensor networks are an invaluable tool for efficiently representing states of large quantum systems with limited entanglement. Algorithms for sampling one-dimensional (1D) tensor networks are well-established and utilized in several 1D tensor network methods. In this paper we introduce two novel sampling algorithms for two-dimensional (2D) isometric tensor network states (isoTNS) that generalize existing 1D tensor network sampling algorithms. Our first proposed algorithm performs independent sampling and yields a single configuration together with its associated probability. The second algorithm employs a greedy search strategy to identify high-probability configurations and their corresponding probabilities. Numerical results demonstrate the effectiveness of these algorithms across quantum states with varying entanglement and system size.

Dumitrescu, Eugene [ORNL] (ORCID:0000000158519567)↗

Three-dimensional anisotropic adaptive filtering of projection data for noise reduction in cone beam CT

Purpose: The combination of quickly rotating C-arm gantry with digital flat panel has enabled the acquisition of three-dimensional data (3D) in the interventional suite. However, image quality is still somewhat limited since the hardware has not been optimized for CT imaging. Adaptive anisotropic filtering has the ability to improve image quality by reducing the noise level and therewith the radiation dose without introducing noticeable blurring. By applying the filtering prior to 3D reconstruction, noise-induced streak artifacts are reduced as compared to processing in the image domain. Methods: 3D anisotropic adaptive filtering was used to process an ensemble of 2D x-ray views acquired along a circular trajectory around an object. After arranging the input data into a 3D space (2D projections + angle), the orientation of structures was estimated using a set of differently oriented filters. The resulting tensor representation of local orientation was utilized to control the anisotropic filtering. Low-pass filtering is applied only along structures to maintain high spatial frequency components perpendicular to these. The evaluation of the proposed algorithm includes numerical simulations, phantom experiments, and in-vivo data which were acquired using an AXIOM Artis dTA C-arm system (Siemens AG, Healthcare Sector, Forchheim, Germany). Spatial resolution and noise levels were compared with and without adaptive filtering. A human observer study was carried out to evaluate low-contrast detectability. Results: The adaptive anisotropic filtering algorithm was found to significantly improve low-contrast detectability by reducing the noise level by half (reduction of the standard deviation in certain areas from 74 to 30 HU). Virtually no degradation of high contrast spatial resolution was observed in the modulation transfer function (MTF) analysis. Although the algorithm is computationally intensive, hardware acceleration using Nvidia's CUDA Interface provided an 8.9-fold speed-up of the processing (from 1336 to 150 s). Conclusions: Adaptive anisotropic filtering has the potential to substantially improve image quality and/or reduce the radiation dose required for obtaining 3D image data using cone beam CT.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Entity—Hardware-agnostic Particle-in-cell Code for Plasma Astrophysics. I. Curvilinear Special Relativistic Module

Entity is a new-generation, fully open-source particle-in-cell (PIC) code developed to overcome key limitations in astrophysical plasma modeling, particularly the extreme separation of scales and the performance challenges associated with evolving, GPU-centric computing infrastructures. It achieves hardware-agnostic performance portability across various GPU and CPU architectures using the Kokkos library. Crucially, Entity maintains a high standard for usability, clarity, and customizability, offering a robust and easy-to-use framework for developing new algorithms and grid geometries, which allows extensive control without requiring edits to the core source code. This paper details the core general-coordinate special relativistic module. Entity is the first PIC code designed to solve the Vlasov–Maxwell system in general coordinates, enabling a coordinate-agnostic framework that provides the foundational structure for straightforward extension to arbitrary coordinate geometries. The core methodology achieves numerical stability by solving particle equations of motion in the global orthonormal Cartesian basis, despite using generalized coordinates like Cartesian, axisymmetric spherical, and quasi-spherical grids. Charge conservation is ensured via a specialized current deposition technique using conformal currents. The code exhibits robust scalability and performance portability on major GPU platforms (AMD MI250X, NVIDIA A100, and Intel Max Series), with the 3D particle pusher and the current deposition operating efficiently at about 2 ns per particle per time step. Functionality is validated through a comprehensive suite of standard Cartesian plasma tests and the accurate modeling of relativistic magnetospheres in curvilinear axisymmetric geometries.

Hakobyan, Hayk [Flatiron Institute, New York, NY (↗

A GENERALIZED STOCHASTIC COLLOCATION APPROACH TO CONSTRAINED OPTIMIZATION FOR RANDOM DATA IDENTIFICATION PROBLEMS

We present a scalable, parallel mechanism for stochastic identification/control for problems constrained by partial differential equations with random input data. Several identification objectives will be discussed that either minimize the expectation of a tracking cost functional or minimize the difference of desired statistical quantities in the appropriate $L^p$ norm, and the distributed parameters/control can both deterministic or stochastic. Given an objective we prove the existence of an optimal solution, establish the validity of the Lagrange multiplier rule and obtain a stochastic optimality system of equations. The modeling process may describe the solution in terms of high dimensional spaces, particularly in the case when the input data (coefficients, forcing terms, boundary conditions, geometry, etc) are affected by a large amount of uncertainty. For higher accuracy, the computer simulation must increase the number of random variables (dimensions), and expend more effort approximating the quantity of interest in each individual dimension. Hence, we introduce a novel stochastic parameter identification algorithm that integrates an adjoint-based deterministic algorithm with the sparse grid stochastic collocation FEM approach. This allows for decoupled, moderately high dimensional, parameterized computations of the stochastic optimality system, where at each collocation point, deterministic analysis and techniques can be utilized. The advantage of our approach is that it allows for the optimal identification of statistical moments (mean value, variance, covariance, etc.) or even the whole probability distribution of the input random fields, given the probability distribution of some responses of the system (quantities of physical interest). Our rigorously derived error estimates, for the fully discrete problems, will be described and used to compare the efficiency of the method with several other techniques. Numerical examples illustrate the theoretical results and demonstrate the distinctions between the various stochastic identification objectives.

Webster, Clayton G↗

Application of the GBFP Method to Electron Partial-Wave Expansion Elastic Scattering Differential Cross Sections Within the Geant4 Toolkit - Paper 69

Analog Monte Carlo simulation of electrons in complex material geometries is generally impractical because the long range Coulomb interactions result in highly peaked differential cross sections (DCS) for scattering and energy-loss and extremely small collision mean free paths (mfp). The condensed history (CH) Monte Carlo method attempts to alleviate this limitation by advancing electrons in fixed steps and sampling angular deflections and energy losses from precomputed distributions obtained from approximate solutions to the underlying transport equation that are valid only for thin layers. Though CH is efficient and is widely employed in production codes (ITS, MCNP, EGS, Geant), step size restrictions and inconsistent handling of material and free surface boundaries limit the ultimate accuracy possible with this approach, especially in applications to highly heterogeneous media. Recently proposed alternatives to the CH method, such as the Generalized Boltzmann Fokker-Planck (GBFP) method, restore the correct transport mechanics by simulating single events based on a Boltzmann transport equation but with efficiency and accuracy achieved through the use of reduced-physics interaction models. Motivated by Lewis theory, various moment-preserving strategies are employed in the GBFP approach to construct DCSs that are less singular, and with mfps shorter than analog. Specifically, the approximate cross sections are constructed to rigorously preserve a finite number of angular and energy-loss moments of the analog DCSs while all higher moments are approximated in terms of the exact lower moments. By systematically increasing the number of moments retained, any desired accuracy can be obtained for integrated quantities, such as dose, reflection and transmission yields, as well as distributed quantities such as energy and angular distributions. For relativistic Rutherford cross section models, the GBFP method has been demonstrated in Monte Carlo simulation to yield accuracy comparable to analog but at a fraction of the cost. One advantage of the GBFP approach is that angular deflection and energy-loss interactions depend only on Legendre moments and energy-loss moments and not the detailed form of the analog DCSs. This feature allows moment-preservation to be enforced through DCSs expressed as a superposition of discrete (i.e., using delta-functions) angular deflections and discrete energy losses. This promotes extremely efficient computation when compared to analog and completely continuous or hybrid discrete-continuous moment-based DCS reconstructions, while yielding highly accurate results for integrated and distributed quantities. In this paper, we demonstrate that the moment-preserving algorithms central to our fully discrete GBFP method can be readily extended to apply to tabulated DCS data, specifically to the partial-wave expansion (PWE) elastic scattering DCSs. Since data libraries for the PWE DCSs for energy and material combinations of interest can be prohibitively large, the GBFP method provides a means to reduce data storage requirements. We implemented our algorithm in the Geant4 Monte Carlo code and all numerical results are obtained using this implementation. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

Scalable branching on dual decomposition of stochastic mixed-integer programming problems

In this work, we present a scalable branching method for the dual decomposition of stochastic mixed-integer programming. Our new branching method is based on the branching method proposed by Caroe and Schultz that creates branching disjunctions on first-stage variables only. We propose improvements to the process for creating branching disjunctions, including (1) branching on the optimal solutions of the Dantzig-Wolfe reformulation of the restricted master problem and (2) using a more comprehensive (yet simple) measure for the dispersions associated with subproblem solution infeasibility. We prove that the proposed branching process leads to an algorithm that terminates finitely, and we provide conditions under which globally optimal solutions can be identified after termination. We have implemented our new branching method, as well as the Caroe-Schultz method and a branch-and-price method, in the open-source software package DSP. Using SIPLIB test instances, we present extensive numerical results to demonstrate that the proposed branching method significantly reduces the number of node subproblems and solution times.

97 MATHEMATICS AND COMPUTING↗

Overlapping localized exponential time differencing methods for diffusion problems

The localized exponential time differencing (ETD) based on overlapping domain decomposition has been recently introduced for extreme-scale phase field simulations of coarsening dynamics, which displays excellent parallel scalability in supercomputers. This paper serves as the first step toward building a solid mathematical foundation for this approach. We study the overlapping localized ETD schemes for a model time-dependent diffusion equation discretized in space by the standard central difference. Two methods are proposed and analyzed for solving the fully discrete localized ETD systems: the first one is based on Schwarz iteration applied at each time step and involves solving stationary problems in the subdomains at each iteration, while the second one is based on the Schwarz waveform relaxation algorithm in which time-dependent subdomain problems are solved at each iteration. The convergences of the associated iterative solutions to the corresponding fully discrete localized ETD solution and to the exact semidiscrete solution are rigorously proved. Finally, numerical experiments are also carried out to confirm theoretical results and to compare the performance of the two methods.

58 GEOSCIENCES↗

RESOLVING THE ELECTROCHEMICAL EQUATIONS OF A SOLID OXIDE FUEL CELL FOR USE IN TRANSIENT SIMULATION AND INTEGRATION INTO CYBER-PHYSICAL SYSTEMS

A major challenge with complex cyber-physical systems stems from long model computational time that creates a mismatch between the model system and the physical system. The numerical modeling of solid oxide fuel cells (SOFCs) presents particular challenges due to the highly coupled nature of the underlying equations and the multiphysics needed to fully resolve their behavior during a transient event. To this end current approaches revolve around splitting the computational efforts into resolving temperature effects and resolving electrochemical effects. Current methods employed for the transient simulation of an SOFC for implementation in the Hybrid Performance (HyPer) facility cyberphysical plant at the National Energy Technology Laboratory reveal a distinct need for accelerated results with a high degree of stability. To this aim, an investigation into the computational time for the code reveals that the underlying electrochemical algorithm takes an order of magnitude more time than its thermal counterpart and has a tendency to vary in terms of iteration time and as such a rework of the underlying system is proposed. The primary method for accelerated electrochemical algorithm solutions is to employ higher order root finding recipes for the resolution of the highly coupled electrochemical equations. This is done with the intention to reduce the overall number of subiterations necessary for resolving voltage, current density, and species concentration, properties of the fuel cell that are all directly coupled and require nested iterative approaches. The overall objective of this approach is an order of magnitude reduction in calculation time without sacrificing stability and increasing accuracy. Specific approaches involve using both bounded and unbounded techniques, such as the False Position method and the Secant method (or if applicable Newton-Raphson) respectively, the drawbacks being slower convergence for False Position and instability for the Secant or Newton-Raphson methods. Current preliminary results on simplified versions of the parent functions involved for electrochemical calculations indicate a reduction in computational steps by a factor of two for the secant method and a factor of three for Newton-Raphson. When implemented into new modified electrochemical algorithms, the results indicate a possible order of magnitude reduction in calculation time.

Arias, Jesus↗

Exploration of efficient reduced-order modeling and a posteriori error estimation

Efficient algorithms are considered for the computation of a reduced-order model based on the proper orthogonal decomposition methodology for the solution of parameterized elliptic partial differential equations. The method relies on partitioning the parameter space into subdomains based on the properties of the solution space and then forming a reduced basis for each of the subdomains. This yields more efficient offline and online stages for the proper orthogonal decomposition method. We extend these ideas for inexpensive adjoint based a posteriori error estimation of both the expensive finite element method solutions and the reduced-order model solutions, for a single and multiple quantities of interest. Finally, various numerical results indicate the efficacy of the approach.

42 ENGINEERING↗

Definition and solution of a stochastic inverse problem for the Manning’s n parameter field in hydrodynamic models

The uncertainty in spatially heterogeneous Manning’s n fields is quantified using a novel formulation and numerical solution of stochastic inverse problems for physics-based models. The uncertainty is quantified in terms of a probability measure and the physics-based model considered here is the state-of-the-art ADCIRC model although the presented methodology applies to other hydrodynamic models. An accessible overview of the formulation and solution of the stochastic inverse problem in a mathematically rigorous framework based on measure theory is presented in this paper. Technical details that arise in practice by applying the framework to determine the Manning’s n parameter field in a shallow water equation model used for coastal hydrodynamics are presented and an efficient computational algorithm and open source software package are developed. A new notion of “condition” for the stochastic inverse problem is defined and analyzed as it relates to the computation of probabilities. Finally, this notion of condition is investigated to determine effective output quantities of interest of maximum water elevations to use for the inverse problem for the Manning’s n parameter and the effect on model predictions is analyzed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗