SEARCH · Search NASA

Results for “EM simulation”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

59 records · Page 4

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Q1 Report for FY25 Theory and Simulation Performance Target: Development of an integrated modeling framework for fusion reactor design and assessment

This report describes the work and activities carried out towards the completion of each of the following milestones in FY25 Q1: 1. Demonstrate workflow for generating self-consistent CESOL plasma profiles + first wall and divertor loading prediction and generate the CAT plasma and neutron loading needed for further engineering analysis: $/circ$ Initially run CESOL with SOLPS and map heat flux using simple HEAT method: ▪ Generate SOLPS grid for CAT reference case, ▪ Implement and apply ‘lower’ fidelity method of using HEAT-like analytic method to map SOLPS heat flux from charged particles to first wall, and ▪ Provide initial heat flux + neutron loading for further engineering analysis. 2. Demonstrate multiphysics magnet analysis: $/circ$ Demonstrate validation of the Elmer workflow by comparing induced stresses due to EM forces generated by TF coils using multiple codes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2025

SympGNNs: Symplectic Graph Neural Networks for identifying high-dimensional Hamiltonian systems and node classification

Existing neural network models to learn Hamiltonian systems, such as SympNets, although accurate in low-dimensions, struggle to learn the correct dynamics for high-dimensional many-body systems. Herein, we introduce Symplectic Graph Neural Networks (SympGNNs) that can effectively handle system identification in high-dimensional Hamiltonian systems, as well as node classification. SympGNNs combine symplectic maps with permutation equivariance, a property of graph neural networks. Specifically, we propose two variants of SympGNNs: (i) G-SympGNN and (ii) LA-SympGNN, arising from different parameterizations of the kinetic and potential energy. We demonstrate the capabilities of SympGNN on two physical examples: a 40-particle coupled Harmonic oscillator, and a 2000-particle molecular dynamics simulation in a two-dimensional Lennard-Jones potential. Furthermore, we demonstrate the performance of SympGNN in the node classification task, achieving accuracy comparable to the state-of-the-art. Finally, we also empirically show that SympGNN can overcome the oversmoothing and heterophily problems, two key challenges in the field of graph neural networks.

Deep learning↗

DOE OSTI2026

Computationally efficient Bayesian estimation of graphical networks for omics data

Graphical networks are useful, widely-used modeling approaches to represent complex biological processes with biological measurements generated by platforms such as mass spectrometry. Bayesian analyses of graphical networks for omics data have several advantages over their frequentist counterparts, such as the inclusion of prior knowledge in the estimation of models. However, Bayesian approaches to date have only been feasible for data with a couple hundred biomolecules due to prohibitive computational time, but omics data often contains tens of thousands of biomolecules. Here, we present and illustrate a more computationally efficient approach named BPlane (Bayesian PseudoLikelihood-based Algorithm for Network Estimation) to extend Bayesian modeling capabilities for larger-sized datasets, such as most untargeted proteomics data. Via simulation, we demonstrate that BPlane produces substantial computational savings over a current state-of-the-art Bayesian algorithm while maintaining competitive edge detection accuracy. On a SARS-CoV2 proteomics data with 7000 proteins, the competing algorithm takes three times as long to complete the first iteration as BPlane takes to converge after over 100 iterations.

EM algorithm↗

DOE OSTI2025

Transient fuel performance analysis for the preliminary fuel concept of general atomics fast modular reactor

This study investigates the transient fuel performance of General Atomics Fast Modular Reactor (GA-FMR) during accident scenarios, focusing on the behavior of its innovative fuel system that combines high-assay low enriched uranium dioxide (HALEUO2) fuel with SiGA® ceramic matrix composite silicon carbide cladding. The preliminary fuel design’s response was analyzed during reactivity-initiated accidents (RIA) and loss of coolant accidents (LOCA) using BISON fuel performance analysis code, which included both the diffusion enhanced and BISON-FASTGRASS coupled UO 2 models. The RIA analysis demonstrated that effective reactivity control reduced fuel temperature, though with transient fission gas release resulting in additional tensile stress state on the cladding. LOCA simulations revealed differing predictions between the two models: the BISON UO 2 model showed more transient fission gas release but minimal pellet expansion, while the BISON-FASTGRASS UO 2 model predicted less pronounced fission gas release but more fuel swelling and thermal expansion, potentially leading to pellet-cladding mechanical interaction. Here, these findings highlight critical areas for fuel design optimization and identify knowledge gaps requiring further experimental and computational investigation to advance GA-FMR fuel development.

Lee, Soon K. [Argonne National Laboratory (ANL), A↗

DOE OSTI2024

Learning nonlinear operators in latent spaces for real-time predictions of complex dynamics in physical systems

Abstract Predicting complex dynamics in physical applications governed by partial differential equations in real-time is nearly impossible with traditional numerical simulations due to high computational cost. Neural operators offer a solution by approximating mappings between infinite-dimensional Banach spaces, yet their performance degrades with system size and complexity. We propose an approach for learning neural operators in latent spaces, facilitating real-time predictions for highly nonlinear and multiscale systems on high-dimensional domains. Our method utilizes the deep operator network architecture on a low-dimensional latent space to efficiently approximate underlying operators. Demonstrations on material fracture, fluid flow prediction, and climate modeling highlight superior prediction accuracy and computational efficiency compared to existing methods. Notably, our approach enables approximating large-scale atmospheric flows with millions of degrees, enhancing weather and climate forecasts. Here we show that the proposed approach enables real-time predictions that can facilitate decision-making for a wide range of applications in science and engineering.

97 MATHEMATICS AND COMPUTING↗