Search NASA⌕ Search

SEARCH · Search NASA

Results for “problem solving complexity”

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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

The simulation of 3D hypervelocity spallation using a hydrocode PAGOSA with FLIP+MPM

n this work, a hydrocode PAGOSA with FLIP+MPM is presented and exercised to investigate the fracture in ductile material. The merit of PAGOSA with FLIP+MPM to solve the advection problem is first illustrated by a solid piston periodically moving in a sealed tube with air. Furthermore, the ability of PAGOSA with FLIP+MPM to capture the fracture in material is shown by a simple stretching fracture in ductile material. In both of two benchmark problems, the PAGOSA results and analytical solutions are also presented for comparison. Then PAGOSA with FLIP+MPM is used to model complex spall in ductile material, which is a challenging problem in engineering applications. The convergences of PAGOSA with FLIP+MPM—based on both the mesh size and the marker density—are investigated by monitoring free surface velocity. To further show the ability of PAGOSA with FLIP+MPM to predict fracture in ductile material, the numerical results are compared with the experimental results and other published numerical results. Moreover, the effect of the spall parameter in PAGOSA with FLIP+MPM on the numerical simulation is also analyzed by investigating the free surface velocity. Finally, the effects of the peak compressive stress, the tensile strain rate, and the loading rate on the spallation are further investigated. The numerical results show that PAGOSA with FLIP+MPM can improve PAGOSA's performance when applied to predicting fracture in ductile materials, and is robust enough to accurately predict spall fracture in ductile materials.

42 ENGINEERING↗
DOE OSTI2023

Architecture for Quantum-in-the Loop Real-Time Simulations for Designing Resilient Smart Grids

With the power grid growing more complex every day with the inclusion of new sensors and regulatory approvals that enable end-users and small local developers to participate in the grid, it is becoming challenging for conventional smart grid simulation, emulation, and testing technologies to keep up. In this work, we propose that quantum-encoded real-time simulations can be helpful under the new paradigm and operational circumstances to solve optimization problems for power grids. By leveraging the principles of quantum mechanics, the proposed quantum-in-loop (QIL) framework will enable better and faster optimization solutions based on real-world, real-time data streams, facilitating the real-time planning and operations of electrical grids that rely on millions of distributed sensors and controllers. Furthermore, QIL will allow researchers and engineers to assist utilities in designing, developing, and de-risking algorithms to optimize power grid operation and resilience by considering inputs from millions of grid-connected devices. QIL framework is being developed to have a self-limiting triage mechanism, which will help engineers and practitioners identify fundamental physical limits on quantum processors, revealing what quantum algorithms can and cannot do in utility-specific use cases and must continue to count on classical high-performance computing infrastructure.

digital real-time simulation↗
DOE OSTI2024

Towards reverse mode automatic differentiation of Kokkos-based codes

Derivative computation is a key component of optimization, sensitivity analysis, uncertainty quantification, and the solving of nonlinear problems. Automatic differentiation (AD) is a powerful technique for evaluating such derivatives, and in recent years, has been integrated into programming environments such as Jax, PyTorch, and TensorFlow to support derivative computations needed for training of machine learning models, facilitating wide-spread use of these technologies. The C++ language has become the de facto standard for scientific computing due to numerous factors, yet language complexity has made the wide-spread adoption of AD technologies for C++ difficult, hampering the incorporation of powerful differentiable programming approaches into C++ scientific simulations. This is exacerbated by the increasing emergence of architectures, such as GPUs, with limited memory capabilities and requiring massive thread-level concurrency. C++ AD tools must effectively use these environments to bring novel scientific simulations to next-generation DOE experimental and observational facilities. In this project, we investigated source transformation-based automatic differentiation using LLVM compiler infrastructure to automatically generate portable and efficient gradient computations of Kokkos-based code. We have demonstrated that our proposed strategy is feasible by investigating the usage of a prototype LLVM-based source transformation tool to generate gradients of simple functions made of sequences of simple Kokkos parallel regions. Speedups of up to 500x compared to Sacado were observed on NVIDIA V100 GPU.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A quasi-static particle-in-cell algorithm based on an azimuthal Fourier decomposition for highly efficient simulations of plasma-based acceleration: QPAD

The three-dimensional (3D) quasi-static particle-in-cell (PIC) algorithm is a very efficient method for modeling short-pulse laser or relativistic charged particle beam–plasma interactions. In this algorithm, the plasma response, i.e., plasma wave wake, to a non-evolving laser or particle beam is calculated using a set of Maxwell’s equations based on the quasi-static approximate equations that exclude radiation. The plasma fields are then used to advance the laser or beam forward using a large time step. The algorithm is many orders of magnitude faster than a 3D fully explicit relativistic electromagnetic PIC algorithm. It has been shown to be capable to accurately model the evolution of lasers and particle beams in a variety of scenarios. Additionally, at the same time, an algorithm in which the fields, currents and Maxwell equations are decomposed into azimuthal harmonics has been shown to reduce the algorithmic complexity of a 3D explicit PIC algorithm to that of a 2D algorithm when the expansion is truncated while maintaining accuracy for problems with near azimuthal symmetry. This hybrid algorithm uses a PIC description in r–z and a gridless description in . We describe a novel method that combines the quasi-static and hybrid PIC methods. This algorithm expands the fields, charge and current density into azimuthal harmonics. A set of the quasi-static field equations is derived for each harmonic. The complex amplitudes of the fields are then solved using the finite difference method. The beam and plasma particles are advanced in Cartesian coordinates using the total fields. Details on how this algorithm was implemented using a similar workflow to an existing quasi-static code, QuickPIC, are presented. The new code is called QPAD for QuickPIC with Azimuthal Decomposition. Benchmarks and comparisons between a fully 3D explicit PIC code (OSIRIS), a full 3D quasi-static code (QuickPIC), and the new quasi-static PIC code with azimuthal decomposition (QPAD) are also presented.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

Fast solvers for tokamak fluid models with PETSc

Multigrid (MG) is widely recognized as a highly effective solver for the model problem, the Laplacian, but textbook MG fails on most problems of interest. MG methods have been applied to complex, real-world applications with careful consideration of the physical model and discretization. In this work we develop the first step in applying MG methods to science and engineering relevant magnetohydrodynamics (MHD) tokamak models in the M3D-C1 (https://m3dc1.pppl.gov) fusion energy science code. The semi-implicit time integrator in M3D-C1 is composed of many linear solves. The implicit advance of the momentum equation is the most challenging and is the focus of this work. The current production solver in M3D-C1 is a block Jacobi (BJ) preconditioner within a Krylov solver, where blocks group degrees of freedom on planes of constant toroidal coordinate. BJ convergence degrades as the number of planes increases due to the spectral properties of the matrix preconditioned with BJ. The partially magnetic field-aligned, regular toroidal grid structure in M3D-C1 is amenable to semi-coarsening geometric MG in the toroidal direction. This paper develops such a solver and demonstrates competitive performance on a runaway electron model of a SPARC (https://cfs.energy/technology/sparc) disruption, and superior robustness on a stellarator model on which the BJ solver fails to converge.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Identifying recharge sources and their impacts on a North Central New Mexico shallow aquifer using unsupervised machine learning

In this article, shallow aquifers are important but highly variable resources in arid to semi-arid regions. Limited shallow aquifer volume results in high sensitivity to recharge fluctuations, which can impact the local fauna and flora, and transport of contaminants in the aquifer or vadose zone. Aquifer response to external forcing (e.g., precipitation) is usually solved by estimating aquifer parameters and running physics-based models to match known fluctuations of hydraulic head. However, this technique is time and computationally expensive. Furthermore, high aquifer complexity decreases precision in physics-based models. Alternatively supervised machine learning is used to predict aquifer dynamics. However, these techniques rely on input data and struggle to interpret aquifer response for missing sources (i.e., snowpack data). To counter these problems, we propose an unsupervised machine learning technique (NMFk) to estimate the impact of different sources on aquifer recharge. NMFk is used to understand the influence of external forcing on shallow aquifer recharge in the Pajarito Plateau (Los Alamos, NM, USA). The results show how NMFk can be used to reduce the data dimension in a complex field dataset to three recharge signals that cause fluctuations within the field data. Here, the source signals are interpreted as rainfall, snowmelt, and a delayed aquifer response to the previous two signals. These results evidence how heterogeneous aquifers delimited by canyons incised into the Pajarito Plateau respond in similar ways to the source signals identified by NMFk. Furthermore, results show the importance of the local geology where faults act as sinks, and anthropogenic disturbances can facilitate infiltration amplifying the interpreted signal.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Inferring topological transitions in pattern-forming processes with self-supervised learning

Abstract The identification of transitions in pattern-forming processes are critical to understand and fabricate microstructurally precise materials in many application domains. While supervised methods can be useful to identify transition regimes, they need labels, which require prior knowledge of order parameters or relevant microstructures describing these transitions. Instead, we develop a self-supervised, neural-network-based approach that does not require predefined labels about microstructure classes to predict process parameters from observed microstructures. We show that assessing the difficulty of solving this inverse problem can be used to uncover microstructural transitions. We demonstrate our approach by automatically discovering microstructural transitions in two distinct pattern-forming processes: the spinodal decomposition of a two-phase mixture and the formation of binary-alloy microstructures during physical vapor deposition of thin films. This approach opens a path forward for discovering unseen or hard-to-discern transitions and ultimately controlling complex pattern-forming processes.

Abram, Marcin↗
DOE OSTI2020

A Hybrid Stochastic-Interval Operation Strategy for Multi-Energy Microgrids

Increasing deployment of distributed energy resources intensifies interactions among electric, gas, heating, and cooling systems. Inherent uncertainties ranging from internal parameters to external inputs also impose significant challenges on system operation. A coordinated scheduling method is, therefore, desired for facilitating efficient operation of multi-energy microgrids under multiple uncertainties. In this paper, a deterministic coordinated scheduling model is developed first with detailed modeling of system dynamics and device parameters to fully characterize complex interactions among multi-energy carriers. Then, a hybrid stochastic-interval method is proposed to account for heterogeneous uncertainties in decisions of operational strategies. Specifically, performance and efficiency uncertainties of distributed energy resources, and injection uncertainty of renewable sources and multienergy demands are characterized by interval-based uncertain operation regions and probability distributions, respectively. A scenario-based two-stage algorithm is developed to solve the problem so that multiple uncertainties are preserved in the entire decision-making process. Moreover, adjustable operational strategies are determined to hedge uncertainty by considering operators’ risk preferences. The validity of the proposed method is verified by comprehensive case studies on a test system.

hybrid stochastic-interval approach↗
DOE OSTI2023

Development of Building Design Optimization Methodology: Residential Building Applications

Building design optimization is a highly complex problem, requiring long computational running processes because of the many options that exist when a building is being designed. This paper introduces an integrated approach through which to perform this optimization within an acceptable time frame. The approach includes the methods of variable selection, model simplification, and a sequential optimization process. Using singular value decomposition, a large number of design variables is reduced to a smaller subset that can be solved more quickly through the optimization algorithm. To expedite the variable selection process, a modeling approach that quickly simulates annual energy consumption was developed to replace full annual energy simulations. The developed methodology was applied to two residential buildings in the US, and the results are discussed herein. To assess the accuracy of the integrated optimization methodology, the optimized life cycle costs are compaa variables demonstrating the strongest contributions in the optimization study were identified. The proposed methodology significantly shortened the time requirements for the optimization processes of the two case studies by 74% and 84%; the optimized life cycle costs were within 0.05% and 0.06%, respectively, of the optimum point.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2022

Integrability technique for fluid flow induced deformation of a boundary hair

The deformation of a dense carpet of hair due to Stokes flow in a channel can be described by a nonlinear integrodifferential equation for the shape of a single hair, which possesses several solutions for a given choice of parameters. Although it was posed in a previous study and it bears a resemblance to the pendulum problem from mechanics, this equation has not been analytically solved until now. Despite the presence on an integral with a nonlinear functional dependence on the dependent variable, the system is integrable. We compare the analytically obtained solution to a finite-difference numerical approach, identify the physically realizable solution branch, and briefly study the solution structure through a conserved energylike quantity. Time-dependent fluid-structure interactions are a rich and complex subject to investigate, and we argue that the solution discussed herein can be used as a basis for understanding these systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

tomoCAM : fast model-based iterative reconstruction via GPU acceleration and non-uniform fast Fourier transforms

X-ray-based computed tomography is a well established technique for determining the three-dimensional structure of an object from its two-dimensional projections. In the past few decades, there have been significant advancements in the brightness and detector technology of tomography instruments at synchrotron sources. These advancements have led to the emergence of new observations and discoveries, with improved capabilities such as faster frame rates, larger fields of view, higher resolution and higher dimensionality. These advancements have enabled the material science community to expand the scope of tomographic measurements towards increasingly in situ and in operando measurements. In these new experiments, samples can be rapidly evolving, have complex geometries and restrictions on the field of view, limiting the number of projections that can be collected. In such cases, standard filtered back-projection often results in poor quality reconstructions. Iterative reconstruction algorithms, such as model-based iterative reconstructions (MBIR), have demonstrated considerable success in producing high-quality reconstructions under such restrictions, but typically require high-performance computing resources with hundreds of compute nodes to solve the problem in a reasonable time. Here, tomoCAM , is introduced, a new GPU-accelerated implementation of model-based iterative reconstruction that leverages non-uniform fast Fourier transforms to efficiently compute Radon and back-projection operators and asynchronous memory transfers to maximize the throughput to the GPU memory. The resulting code is significantly faster than traditional MBIR codes and delivers the reconstructive improvement offered by MBIR with affordable computing time and resources. tomoCAM has a Python front-end, allowing access from Jupyter -based frameworks, providing straightforward integration into existing workflows at synchrotron facilities.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Top-down design of protein architectures with reinforcement learning

As a result of evolutionary selection, the subunits of naturally occurring protein assemblies often fit together with substantial shape complementarity to generate architectures optimal for function in a manner not achievable by current design approaches. We describe a “top-down” reinforcement learning–based design approach that solves this problem using Monte Carlo tree search to sample protein conformers in the context of an overall architecture and specified functional constraints. Cryo–electron microscopy structures of the designed disk-shaped nanopores and ultracompact icosahedra are very close to the computational models. The icosohedra enable very-high-density display of immunogens and signaling molecules, which potentiates vaccine response and angiogenesis induction. Our approach enables the top-down design of complex protein nanomaterials with desired system properties and demonstrates the power of reinforcement learning in protein design.

Science & Technology - Other Topics↗
DOE OSTI2026

Optimization of the FRIB beam dump: a hybrid genetic algorithm and reinforcement learning approach

The operational envelope of high-power-density systems, such as particle accelerators and advanced nuclear energy systems, is critically constrained by the need to manage extreme thermal loads. To address this, we present a novel hybrid optimization framework combining a genetic algorithm (GA) with a soft actor-critic (SAC) deep reinforcement learning agent. This framework was applied to a practical high-heat-flux problem: redesigning the beam dump at the Facility for Rare Isotope Beams (FRIB) for a power upgrade from 20 kW to 50 kW. The resulting design, validated by three-dimensional conjugate heat transfer simulations, suppresses hazardous hot spots and yields a markedly more uniform temperature distribution. This provides a robust operating margin, increasing the average power-handling capability by 72% relative to the current design, demonstrating the framework’s potential to solve complex thermal management challenges in both accelerator technology and advanced nuclear systems.

Accelerator↗
DOE OSTI2025

Time-dependent phenomena in correlated materials

Understanding time-dependent processes and light-matter interaction in strongly correlated materials, and the interplay between electronic, orbital, vibrational, and spin degrees of freedom, is a cornerstone of condensed matter. These mechanisms can be proven by measuring the response of the systems to time-dependent perturbations. The corresponding time scales are dictated by the way light couples to the different excitations, and how these excitations exchange energy and momentum. Our research advances our understanding of these processes, and the interpretation of different equilibrium and time-resolved spectroscopies. Our project encompasses two main themes: (i) developing and refining computational techniques to study non-equilibrium spectroscopies including non-perturbative effects and (ii) applications to non-equilibrium phenomena. We have developed a new computational approach that works directly in the time domain: by including all the degrees of freedom involved in the scattering process (e.g. electrons, photons, neutrons), we solve the time dependent problem: a faithful numerical simulation of the experiment. By measuring the energy and momentum of the outgoing particles, we can extract information about the energy and momentum absorbed by the system. Prior to our work, people attempting to model and calculate non-equilibrium spectral functions relied on a description of the scattering cross section based on a formulation in the frequency domain, a treatment that is extremely cumbersome and complex. Our technique works in and out of equilibrium and can reproduce spectra by several spectroscopic techniques, such as time-resolved photoemission, neutron scattering, Raman, X-ray spectroscopies (RIXS, Auger, XAS, XMCD), and, by not relying on analytical approximations, yields results that reveal novel overlooked transient mechanisms. These tools provide sorely needed intuition for understanding the phenomenology of strongly correlated materials and will help experimentalists in identifying signatures of relevant excitations in pump-probe experiments, such as those conducted in DOE supported facilities.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Parallel Memory-Independent Communication Bounds for SYRK

In this paper, we focus on the parallel communication cost of multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK). SYRK requires half the computation of general matrix multiplication because of the symmetry of the output matrix. Recent work (Beaumont et al., SPAA '22) has demonstrated that the sequential I/O complexity of SYRK is also a constant factor smaller than that of general matrix multiplication. Inspired by this progress, we establish memory-independent parallel communication lower bounds for SYRK with smaller constants than general matrix multiplication, and we show that these constants are tight by presenting communication-optimal algorithms. The crux of the lower bound proof relies on extending a key geometric inequality to symmetric computations and analytically solving a constrained nonlinear optimization problem. Here, the optimal algorithms use a triangular blocking scheme for parallel distribution of the symmetric output matrix and corresponding computation.

Communication costs↗
DOE OSTI2021

Multirate linearly-implicit GARK schemes

Many complex applications require the solution of initial-value problems where some components change fast, while others vary slowly. Multirate schemes apply different step sizes to resolve different components of the system, according to their dynamics, in order to achieve increased computational efficiency. The stiff components of the system, fast or slow, are best discretized with implicit base methods in order to ensure numerical stability. To this end, linearly implicit methods are particularly attractive as they solve only linear systems of equations at each step. This paper develops the Multirate GARK-ROS/ROW (MR-GARK-ROS/ROW) framework for linearly-implicit multirate time integration. The order conditions theory considers both exact and approximative Jacobians. The effectiveness of implicit multirate methods depends on the coupling between the slow and fast computations; an array of efficient coupling strategies and the resulting numerical schemes are analyzed. Multirate infinitesimal step linearly-implicit methods, that allow arbitrarily small micro-steps and offer extreme computational flexibility, are constructed. The new unifying framework includes existing multirate Rosenbrock(-W) methods as particular cases, and opens the possibility to develop new classes of highly effective linearly implicit multirate integrators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Convergence Criteria for Multiphysics Simulations

The behavior of engineered systems is often influenced by multiple physical phenomena, such as mechanical deformation, heat transfer, and chemical species transport and reactions. There are often strong interactions between these phenomena, and there is increasing interest in applying coupled-physics models to improve understanding of physical behavior under complex environmental conditions. Multiple simulation frameworks that facilitate coupled-physics simulations are in widespread use, and these employ a variety of techniques to account for interactions between those physics. Many frameworks solve the physics models independently and transfer results between them. Alternatively, a single monolithic system of equations for every physics model can be formed and solved. Each of these approaches has its benefits and drawbacks, and the optimal approach varies depending on the nature of the problem. The open-source MOOSE framework was developed targeting solution of large-scale multiphysics problems. Although it provides options for all these coupling approaches, its standard approach for multiphysics solutions is to form and solve a single monolithic system of equations containing the unknowns for all physics models. MOOSE provides a streamlined approach for users to define the solution variables, the terms in the partial differential equations pertaining to each variable, and interactions between solution variables. One aspect of the monolithic solution approach that can be problematic, however, is defining appropriate convergence criteria for the nonlinear system. A standard approach is to determine convergence is to simply take a norm of the residual vector corresponding to the full vector of unknowns. However, if the residual vector contains variables for multiple physics models, the magnitudes of those variables can differ significantly, and the variables can converge at significantly different rates from each other. It is important to ensure that the variables for each of the physics are converged, and also ensure that the convergence criteria are not excessively stringent in cases when there is little change in the solution. This talk presents representative multiphysics problems to highlight these issues, and shows strategies for convergence criteria in MOOSE that are robust for multiphysics models under a variety of conditions.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2020

High-order matrix-free incompressible flow solvers with GPU acceleration and low-order refined preconditioners

In this work, we present a matrix-free flow solver for high-order finite element discretizations of the incompressible Navier-Stokes and Stokes equations with GPU acceleration. For high polynomial degrees, assembling the matrix for the linear systems resulting from the finite element discretization can be prohibitively expensive, both in terms of computational complexity and memory. For this reason, it is necessary to develop matrix-free operators and preconditioners, which can be used to efficiently solve these linear systems without access to the matrix entries themselves. The matrix-free operator evaluations utilize GPU-accelerated sum-factorization techniques to minimize memory movement and maximize throughput. The preconditioners developed in this work are based on a low-order refined methodology with parallel subspace corrections, as described for diffusion problems in [1]. The saddle-point Stokes system is solved using block-preconditioning techniques, which are robust in mesh size, polynomial degree, time step, and viscosity. For the incompressible Navier-Stokes equations, we make use of projection (fractional step) methods, which require Helmholtz and Poisson solves at each time step. The performance of our flow solvers is assessed on several benchmark problems in two and three spatial dimensions.

97 MATHEMATICS AND COMPUTING↗