Search NASA⌕ Search

SEARCH · Search NASA

Results for “Data-Driven Numerical Methods”

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 55 records · Page 3

Quarterly Research Performance Progress Report (Q8)

As part of Task 1, we have started by testing our modeling capabilities by reproducing isothermal DFIT simulations presented in the literature. Once satisfied with the results we have started by targeting the modeling of the DFITs at conducted at well 58-32. We have a identified a specific test (cycle 4 in zone 2) as the most interesting to be model with GEOS hydraulic fracturing module. Thus, we have first produced results with an isothermal model and adjusted model parameters to get a satisfying match with field pressure data. The, we have added thermal effects and compared the modeling results with and without thermal effects to estimate how thermal effects may influence test interpretation. Models seem to suggest that, for small volumes of fluid, thermal effects are moderate. In Task 2, we have adapted GEOS phase-field formulation to be able to simulate near-wellbore hydraulic fracture nucleation and propagation. We have devised a novel formulation that, compared to other existing ones, incorporates rock strengths. We have submitted a journal publication about our work. We are currently employing this phase-field formulation to model the experiments taking place at U Pitt and help us understand the effect of various parameters. In Task 3, we have built a model of the region surround well 16A and have started modeling stage 3 stimulation because of its simpler planar geometry. After calibrating simulation parameters using known analytical solutions, we have simulated the stage 3 stimulation using our isothermal hydraulic fracturing module, varying the permeability field, the stress conditions including different physics to get a better understanding of the numerical challenges and of the effects of varying these parameters on the simulation results. In Task 4 laboratory experimentation, a set of specialized drilling and injection tools has been customized and constructed to accommodate an inclined well with an orientation of up to 30 degrees relative to material anisotropy or principal stress axes. These inclined samples have also undergone thermal stress and hydraulic fracturing at a temperature of 190 degrees Celsius. Furthermore, both vertical and deviated sampling testing setups enable an extended analysis of post-peak pressure behaviors, facilitating post-test pressure analyses such as the G-function, step rate, and fracture reopening measurements. Thus, the key components of in-situ stress estimation can be extracted and validated through our experiment, providing a solid foundation for validating existing in-situ stress estimation theories or proposing new ones. Simultaneously, we are integrating computer vision techniques with traditional experimental fracture observation methods such as multi-overcore/slicing and water-penetration fracture observation. This combination will prove beneficial in populating the hydraulic fracture patterns database, generated under challenging EGS conditions. This approach aims to deepen our understanding of the complexities in EGS reservoirs and pave the way for future data-driven investigations. Additionally, PITT has also equipped the ELE International compression machine, which is now prepared for conducting indirect tensile and fracture toughness tests. These tests will aid in characterizing how rock fabrics influence the resulting fracture patterns. Additionally, we have completed the required personnel training and gained access to Scanning Electron Microscopy (SEM) and Energy Dispersive Spectroscopy (EDS) for conducting more detailed characterization and analysis of rock fabrics, as well as the examination of thermal and hydraulically induced fracture patterns. Thus, the PITT team has effectively demonstrated the capabilities of our experimental apparatuses in exploring the thermal effects, well deviation angles, material anisotropy, and operational choices (such as circulation rate, injection fluid viscosity, and injection rate) and their impact on pressure responses and fracture trajectories under the Utah FORGE conditions.

15 GEOTHERMAL ENERGY↗

Numerical Investigation of Fluid Flow and Space Charge in Liquid Argon Time Projection Chamber (LArTPC) Detectors

Overview This project focused on developing a high-fidelity numerical framework to simulate the multiphysics environment within Liquid Argon Time Projection Chamber (LArTPC) detectors. The primary objective was to characterize the complex interplay between ion transport, background fluid dynamics, and electric field distortions—a critical factor for the calibration and sensitivity of next-generation High Energy Physics experiments, such as DUNE. Technical Achievements The research successfully yielded a hybrid numerical space-charge solver utilizing a Cell-Centered Finite Volume Method (FVM) for ion transport coupled with a Finite Element Method (FEM) for electric potential. Key accomplishments include: • Verification & Validation: The 3-D solver was rigorously verified against 1-D analytical solutions, demonstrating high numerical accuracy in predicting space-charge-induced field deviations. • Field Distortion Analysis: 3D simulations revealed that space charge effects introduce significant non-uniformities in the electric field. Critically, the research identified that background LAr flow velocities, when comparable to ion drift velocities, markedly exacerbate these distortions. • Technology Transfer: The resulting source code and comprehensive user manuals were successfully transferred to collaborators at Fermilab, providing a portable computational tool for the broader scientific community. Challenges and Future Directions While the space-charge solver achieved all performance metrics, the integrated fluid dynamics modeling encountered convergence challenges stemming from the extreme 200-fold disparity in length scales between the detector's 37 mm inlet pipes and the 8-meter global domain. To address this, the project has identified a clear technical pivot toward Hierarchical Geometric Adaptive Mesh Refinement (HG-AMR). By implementing an h-type refinement strategy with hanging nodes, future iterations of this solver will be capable of resolving localized high-gradient inlet flows without the prohibitive computational costs of regular grids. This advancement, combined with data-driven uncertainty quantification based on MicroBooNE-style calibration, will enable the precise modeling of detector responses in large-scale cryogenic environments where direct measurement remains difficult. Impact The computational tools developed under this award provide a foundation for enhancing the energy resolution and spatial reconstruction of noble liquid detectors. By bridging the gap between theoretical fluid dynamics and experimental field calibration, this work supports the DOE’s mission to advance the frontiers of neutrino physics and dark matter detection.

42 ENGINEERING↗

A comparison of surrogate constitutive models for viscoplastic creep simulation of HT-9 steel

Mechanistic microstructure-informed constitutive models for the mechanical response of polycrystals are a cornerstone of computational materials science. However, as these models become increasingly more complex – often involving coupled differential equations describing the effect of specific deformation modes – their associated computational costs can become prohibitive, particularly in optimization or uncertainty quantification tasks that require numerous model evaluations. To address this challenge, surrogate constitutive models that balance accuracy and computational efficiency are highly desirable. Data-driven surrogate models, that learn the constitutive relation directly from data, have emerged as a promising solution. In this work, we develop two local surrogate models for the viscoplastic response of a steel: a piecewise response surface method and a mixture of experts model. These surrogates are designed to adapt to complex material behavior, which may vary with material parameters or operating conditions. The surrogate constitutive models are applied to creep simulations of HT-9 steel, an alloy of considerable interest to the nuclear energy sector due to its high tolerance to radiation damage, using training data generated from viscoplastic self-consistent (VPSC) simulations. In conclusion, we define a set of test metrics to numerically assess the accuracy of our surrogate models for predicting viscoplastic material behavior, and show that the mixture of experts model outperforms the piecewise response surface method in terms of accuracy.

36 MATERIALS SCIENCE↗

LDRD Abbreviated report: High-Order General-Discrete-Ordinates Method Enabling Efficient Deterministic Transport in Hydrodynamic Simulations

Deterministic transport simulations for national-security and energy applications often operate in high-dimensional phase-space, where accuracy and cost both become major challenges. A common numerical artifact in such problems is the “ray-effect,” which appears as unphysical streaks. Beyond misinterpretation, these artifacts can contaminate tightly coupled physics, such as fluid dynamics, radiation-hydrodynamics, and laser-plasma interactions, eroding the predictive capability of entire multiphysics workflows. Our objective was to make high-dimension studies practical on modern hardware while mitigating the ray-effect without relying on prohibitively expensive sampling approaches such as Monte Carlo methods. We developed the Generic Discretization Library (GenDiL), a Graphics Processing Unit (GPU)-first framework that uses high-order Discontinuous Galerkin (DG) methods and matrix-free algorithms to reduce memory usage and improve computational efficiency, critical for phase-space simulations. GenDiL supports phase-space adaptivity in both mesh size and polynomial order (hp-adaptivity) to place resolution only where it is needed. A central capability is Local Dimensional Refinement (LDR), which couples lower-dimension continuum models to higher-dimension kinetic models through stable and conservative interfaces, so that high-fidelity physics is applied only in regions where it is essential. Building on the GenDiL framework, we developed the General SN (GSN) family of algorithms as a true generalization of the polar SN approach (discrete ordinates, often denoted SN). Rather than tying discrete ordinates to a specific polar change of coordinates, GSN formulates transport on an arbitrary change of coordinates chosen to reduce ray-effect. We studied two complementary variants: an analytic variant, where the coordinate map is prescribed in advance by a closed-form function; and a data-driven variant, where a quantity of interest, such as the net flux, guides the coordinate system. GenDiL provides the library infrastructure for efficient GPU execution, but the GSN concept is algorithmic and independent of any one library. Across representative high-dimension tests, including non-symmetric solutions, both variants delivered strong ray-effect mitigation at practical cost, moving four- to six-dimensional analysis toward repeatable, routine studies.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Constrained or unconstrained? Neural-network-based equation discovery from data

Throughout many fields, practitioners often rely on differential equations to model systems. Yet, for many applications, the theoretical derivation of such equations and/or the accurate resolution of their solutions may be intractable. Instead, recently developed methods, including those based on parameter estimation, operator subset selection, and neural networks, allow for the data-driven discovery of both ordinary and partial differential equations (PDEs), on a spectrum of interpretability. The success of these strategies is often contingent upon the correct identification of representative equations from noisy observations of state variables and, as importantly and intertwined with that, the mathematical strategies utilized to enforce those equations. Specifically, the latter has been commonly addressed via unconstrained optimization strategies. Representing the PDE as a neural network, we propose to discover the PDE (or the associated operator) by solving a constrained optimization problem and using an intermediate state representation similar to a physics-informed neural network (PINN). The objective function of this constrained optimization problem promotes matching the data, while the constraints require that the discovered PDE is satisfied at a number of spatial collocation points. We present a penalty method and a widely used trust-region barrier method to solve this constrained optimization problem, and we compare these methods on numerical examples. Our results on several example problems demonstrate that the latter constrained method outperforms the penalty method, particularly for higher noise levels or fewer collocation points. This work motivates further exploration into using sophisticated constrained optimization methods in scientific machine learning, as opposed to their commonly used, penalty-method or unconstrained counterparts. For both of these methods, we solve these discovered neural network PDEs with classical methods, such as finite difference methods, as opposed to PINNs-type methods relying on automatic differentiation. Here, we briefly highlight how simultaneously fitting the data while discovering the PDE improves the robustness to noise and other small, yet crucial, implementation details.

Data-driven discovery↗

Platform for Remote Deployment and Training for Enhanced Building Operation Practices (Building Re-Tuning and On-going Commissioning)

While a building’s energy usage is driven largely by its design and use, building operator behavior has a strong influence on its energy consumption. This project developed and piloted a specific, data-driven coaching methodology to help operators understand how they can adjust operations and/or affect no/low-cost repairs or upgrades to their specific building HVAC systems to reduce energy consumption. Named BuildingCoach, the operational optimization method used is based on the Building Re-tuning approach developed by the Pacific Northwest National Laboratory. A building operations analytics market has matured over the past decade, though its potential to affect energy-saving changes has not been fully realized. Training operators to understand the methods for operational optimization with the explicit approach of using building-system performance data is hypothesized to create a more effective, longer lasting result in building energy efficiency, and this strategy is the fundamental premise of this project. With the support of an Industry Advisory Board, the project succeeded in developing materials and recruiting for and delivering three pilot cohorts. Deliverables included twenty-two self-paced training modules (accessed via a Learning Management System) and a web-based platform that includes access to real-time building system data and a repository for building system documentation. The project set out to have 100 participants from 50 buildings in three pilot cohorts. In the end, there were 28 participants from 17 buildings, i.e., a significant shortfall. The first two pilot cohorts had only two buildings in each, and this was partially due to difficulties in deploying the Building Operator Coaching Solution (“the BOCS”), which is technology that extracts the data from the controls network and presents it as prescribed for coaching. In the third cohort, the project team deployed the BOCS successfully to 13 buildings, the methodology was piloted as intended, and numerous opportunities for optimization were identified. The BuildingCoach business plan charts a path to an economically sustainable effort. However, even with a licensing model captured in the final version of the business plan, the scalability is still limited to keeping less than 1,000 buildings affected by 2033. Even so, there are unexplored paths to greater scalability that are being considered. CUNY BPL is working to perpetuate and grow the use of BuildingCoach. As of this writing, about twenty buildings have either been connected or will be connected with operators coached / to be coached in the NYC municipal portfolio, twelve buildings across four campuses in NY State will use BuildingCoach, a NY upstate county wishes for six or seven buildings to participate with the support of funding from NYSERDA, and others have also expressed interest. In the decades to come, there will be an increasing percentage of large and mid-sized buildings that incorporate automated system optimization (ASO), and the building operators’ role will shift to spend more time on maintenance and monitoring. Meanwhile, programs such as BuildingCoach will play a critical role in optimizing operations. And, regardless of the emergence of ASO, operators will still need to understand how their systems operate so that they can monitor them properly. Within that context, BuildingCoach is an important step towards operators’ understanding of efficient building system operations.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Data-scarce surrogate modeling of shock-induced pore collapse process

Understanding the mechanisms of shock-induced pore collapse is of great interest in various disciplines in sciences and engineering, including materials science, biological sciences, and geophysics. However, numerical modeling of the complex pore collapse processes can be costly. To this end, a strong need exists to develop surrogate models for generating economic predictions of pore collapse processes. Here, in this work, we study the use of a data-driven reduced-order model, namely dynamic mode decomposition, and a deep generative model, namely conditional generative adversarial networks, to resemble the numerical simulations of the pore collapse process at representative training shock pressures. Since the simulations are expensive, the training data are scarce, which makes training an accurate surrogate model challenging. To overcome the difficulties posed by the complex physics phenomena, we make several crucial treatments to the plain original form of the methods to increase the capability of approximating and predicting the dynamics. In particular, physics information is used as indicators or conditional inputs to guide the prediction. In realizing these methods, the training of each dynamic mode composition model takes only around 30 s on CPU. In contrast, training a generative adversarial network model takes 8 h on GPU. Moreover, using dynamic mode decomposition, the final-time relative error is around 0.3% in the reproductive cases. We also demonstrate the predictive power of the methods at unseen testing shock pressures, where the error ranges from 1.3 to 5% in the interpolatory cases and 8 to 9% in extrapolatory cases.

97 MATHEMATICS AND COMPUTING↗

Identifying Differential Equations in Fourier Domain (FourierIdent)

We investigate identifying differential equations in the frequency domain. Fourier analysis is an important tool in theoretical analysis and numerical solvers of differential equations, yet there is limited work in exploring this connection in the identification of differential equations. This paper aims to identify the underlying differential equation in the frequency domain, from a given single realization of the differential equation perturbed by noise. Such setting imposes difficulties which are different from other identification methods where computation is carried out in the physical domain. We propose several ways to mitigate the challenges arising from noise in data and large differences in the magnitudes of frequency responses. The main takeaways are that identifying differential equations solely in the frequency domain is challenging, the method we propose is based on a form of domain partitions in the frequency domain, and this method shows benefits for complex data even with high level of noise. We introduce a Fourier feature denoising, and define the meaningful data region and the core regions of features to reduce the effect of noise in the frequency domain and to enhance the accuracy in coefficient identification. The proposed method is tested on various differential equations with linear, nonlinear, and high-order derivative feature terms, and shows advantages on complex data with many frequency modes, even under high level of noise.

97 MATHEMATICS AND COMPUTING↗

Efficient data-driven models for prediction and optimization of geothermal power plant operations

Increasing the capacity of geothermal energy as a renewable resource calls for development and deployment of efficient control and optimization technologies for geothermal power plants. A data-driven prediction and optimization model is presented as a cost-effective and efficient alternative to physics-based approach. The model predicts power output and operational cost by propagating the influence of control and disturbance variables within an artificial neural network (ANN). Numerical experiments with simulated and field data from a real geothermal power plant are first used to demonstrate the prediction performance of the ANN model. The model is then adopted to maximize the net predicted power production by automatically adjusting the working fluid circulation rate. The optimization performance of the model in evaluated using a thermodynamic flowsheet simulation model. The workflow is applied to model and control the effect of ambient temperature on an air-cooled binary cycle power plant, which is complex and costly to perform using a physics-based predictive model. As a result, the performance of the method is demonstrated by applying it to both simulated and field datasets from a binary cycle geothermal power plant.

15 GEOTHERMAL ENERGY↗

Neural chaos: A spectral stochastic neural operator

Building surrogate models for operators with uncertainty quantification capabilities is essential for many engineering applications where randomness–such as variability in material properties, boundary conditions, and initial conditions–is unavoidable. Polynomial Chaos Expansion (PCE) is widely recognized as a go-to method for constructing stochastic surrogates in both intrusive and non-intrusive ways, and it has recently been used in the context of operator learning. However, its application becomes challenging for complex or high-dimensional processes, as achieving accuracy requires higher-order polynomials, which can increase computational demand and/or the risk of overfitting. Furthermore, PCE requires specialized treatments to manage random variables that are not independent, and these treatments may be problem-dependent or may fail with increasing complexity. Here, in this work, we adopt the same formalism as the spectral expansion used in PCE; however, we replace the classical polynomial basis functions with neural network (NN) basis functions to leverage their expressivity. To achieve this, we propose an algorithm that identifies NN-parameterized basis functions in a purely data-driven manner, without any prior assumptions about the joint distribution of the random variables involved, whether independent or dependent, or about their marginal distributions. The proposed algorithm identifies each NN-parameterized basis function sequentially, ensuring they are orthogonal with respect to the data distribution. The basis functions are constructed directly on the joint stochastic variables without requiring a tensor product structure or assuming independence of the random variables. This approach may offer greater flexibility for complex stochastic models, while simplifying implementation compared to the tensor product structures typically used in PCE to handle random vectors. This is particularly advantageous given the current state of open-source packages, where building and training neural networks can be done with just a few lines of code and extensive community support. We demonstrate the effectiveness of the proposed scheme through several numerical examples of varying complexity and provide comparisons with classical PCE.

Polynomial chaos expansion↗

Learning dynamical systems from data: An introduction to physics-guided deep learning

Modeling complex physical dynamics is a fundamental task in science and engineering. Traditional physics-based models are first-principled, explainable, and sample-efficient. However, they often rely on strong modeling assumptions and expensive numerical integration, requiring significant computational resources and domain expertise. While deep learning (DL) provides efficient alternatives for modeling complex dynamics, they require a large amount of labeled training data. Furthermore, its predictions may disobey the governing physical laws and are difficult to interpret. Physics-guided DL aims to integrate first-principled physical knowledge into data-driven methods. It has the best of both worlds and is well equipped to better solve scientific problems. Recently, this field has gained great progress and has drawn considerable interest across discipline Here, we introduce the framework of physics-guided DL with a special emphasis on learning dynamical systems. We describe the learning pipeline and categorize state-of-the-art methods under this framework. We also offer our perspectives on the open challenges and emerging opportunities.

97 MATHEMATICS AND COMPUTING↗

A Practical Comparison of Data-Driven Prognostics Methods for Energy Systems

This study explores data-driven prognostics for nuclear power plant (NPP) condensers, focusing on tube fouling. We utilized the Asherah nuclear power plant simulator (ANS) to compare four methods: Random Forest (RF), Support Vector Regressor (SVR), Fully Connected Neural Network (FCNN), and Long Short-Term Memory Neural Network (LSTM). By simulating various fouling scenarios in the ANS, we generated data with different degradation rates under transient operations. The models were trained and tested on these data, with performance evaluated visually and numerically including uncertainty assessment. The LSTM model excelled, exhibiting minimal prediction noise and the most accurate remaining useful life estimates across all degradation levels. Its ability to capture long-term dependencies and produce cleaner outputs makes it a strong candidate, although accurate training data across the entire component lifespan are crucial. The RF model emerged as a robust alternative, providing reliable predictions with high confidence. The FCNN and SVR models, while less effective overall, showed potential under specific conditions. FCNN offers a less complex alternative to LSTM and might benefit from larger datasets. SVR excels in precision when the quality of the training data is high. Furthermore, this study highlights the operational benefits of advanced prognostics in the energy sector and emphasizes the need for further research in NPP condenser health management through real-life experiments.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Latent Twins

Over the past decade, scientific machine learning has transformed the development of mathematical and computational frameworks for analyzing, modeling, and predicting complex systems. From inverse problems to numerical partial differential equations (PDEs), dynamical systems, and model reduction, these advances have pushed the boundaries of what can be simulated. Yet they have often progressed in parallel, with representation learning and algorithmic solution methods evolving largely as separate pipelines. With Latent Twins, we propose a unifying mathematical framework that creates a hidden surrogate in latent space for the underlying equations. Whereas digital twins mirror physical systems in the digital world, Latent Twins mirror mathematical systems in a learned latent space governed by operators. Through this lens, classical modeling, inversion, model reduction, and operator approximation all emerge as special cases of a single principle. We establish the fundamental approximation properties of Latent Twins for both ordinary differential equations (ODEs) and PDEs and demonstrate the framework across three representative settings: (i) canonical ODEs, capturing diverse dynamical regimes; (ii) a PDE benchmark using the shallow-water equations, contrasting Latent Twin simulations with deep operator network and forecasts with a four-dimensional variational method baseline; and (iii) a challenging real-data geopotential reanalysis dataset, reconstructing and forecasting from sparse, noisy observations. Latent Twins provide a compact, interpretable surrogate for solution operators that evaluate across arbitrary time gaps in a single-shot, while remaining compatible with scientific pipelines such as assimilation, control, and uncertainty quantification. Looking forward, this framework offers scalable, theory-grounded surrogates that bridge data-driven representation learning and classical scientific modeling across disciplines.

Latent Twins↗

Improving I/O-aware Workflow Scheduling via Data Flow Characterization and trade-off Analysis

The scientific computing paradigm has transitioned from compute-intensive to I/O-intensive and memory-intensive in the past decade, especially when data-driven science has become common practice. Numerous empirical I/O-aware scheduling optimizations have been developed by incorporating I/O capacity and bandwidth as constraints into scheduling. Unfortunately, there is a lack of data flow (I/O) characterization tool and an understanding of trade-offs between concurrency, locality, and I/O bandwidth. To bridge the gap, this work 1) presents a set of descriptors to characterize, organize, and visualize I/O profiles, including flow size, I/O bandwidth, and operation count, which group data flows by I/O types, tasks, and files; 2) proposes an I/O Roofline model-based trade-off analysis to find the optimal trade-off between flow operational intensity, concurrency, and flow performance. The I/O descriptors generate useful insights into complicated I/O behaviors, suggesting distinct concurrency, storage, and scheduling to be used by types, tasks, and files. The proposed trade-off analysis guides scheduling decisions that generate resource assignment with the best flow parallelism. We evaluate our I/O-aware scheduling methodology on a highly I/O-intensive workflow–1000 Genomes. The experimental results demonstrate speedups of up to 2.4× compared to the state-of-the- art methods.

Guo, Luanzheng [BATTELLE (PACIFIC NW LAB)]↗

TNet: A Model-Constrained Tikhonov Network Approach for Inverse Problems

Deep learning (DL), in particular deep neural networks, by default is purely data-driven and in general does not require physics. This is the strength of DL but also one of its key limitations when applied to science and engineering problems in which underlying physical properties—such as stability, conservation, and positivity—and accuracy are required. DL methods in their original forms are often not capable of respecting the underlying mathematical models or achieving desired accuracy even in big-data regimes. On the other hand, many data-driven science and engineering problems, such as inverse problems, typically have limited experimental or observational data, and DL would overfit the data in this case. Leveraging information encoded in the underlying mathematical models, we argue, not only compensates for missing information in low data regimes but also provides opportunities to equip DL methods with the underlying physics, hence promoting better generalization. This paper develops a model-constrained DL approach and its variant TNet—a Tikhonov neural network—which are capable of learning not only information hidden in the training data but also in the underlying mathematical models to solve inverse problems governed by partial differential equations in low data regimes. We provide the constructions and some theoretical results for the proposed approaches for both linear and nonlinear inverse problems. Since TNet is designed to learn inverse solutions with Tikhonov regularization, it is interpretable: in fact it recovers Tikhonov solutions for linear cases while potentially approximating Tikhonov solutions for nonlinear inverse problems. We also prove that data randomization can enhance not only the smoothness of the networks but also their generalizations. Comprehensive numerical results confirm the theoretical findings and show that with even as little as 1 training data sample for one-dimensional (1D) deconvolution, 5 for an inverse 2D heat conductivity problem, 100 for inverse initial conditions for a time-dependent 2D Burgers’s equation, and 50 for inverse initial conditions for 2D Navier–Stokes equations, TNet solutions can be as accurate as Tikhonov solutions while being several orders of magnitude faster. Furthermore, this is possible owing to the model-constrained term, replications, and randomization.

97 MATHEMATICS AND COMPUTING↗

Evaluation of data driven low-rank matrix factorization for accelerated solutions of the Vlasov equation

Low-rank methods have shown success in accelerating simulations of a collisionless plasma described by the Vlasov equation, but still rely on computationally costly linear algebra every time step. We propose a data-driven factorization method using artificial neural networks, specifically with convolutional layer architecture, that trains on existing simulation data. At inference time, the model outputs a low-rank decomposition of the distribution field of the charged particles, and we demonstrate that this step is faster than the standard linear algebra technique. Numerical experiments show that the method achieves comparable reconstruction accuracy for interpolation tasks, generalizing to unseen test data in a manner beyond just memorizing training data; patterns in factorization also inherently followed the same numerical trend as those within algebraic methods (e.g., truncated singular-value decomposition). However, when training on the first 70% of a time-series data and testing on the remaining 30%, the method fails to meaningfully extrapolate. Despite this limiting result, the technique may have benefits for simulations in a statistical steady-state or otherwise showing temporal stability. These results suggest that while the model offers a computationally efficient alternative for datasets with temporal stability, its current formulation is best suited for interpolation rather than for predicting future states in time-evolving systems. This study thus lays the groundwork for further refinement of neural network-based approaches to low-rank matrix factorization in high-dimensional plasma simulations.

97 MATHEMATICS AND COMPUTING↗

An Open Benchmark of One Million High-Fidelity Cislunar Trajectories

Cislunar space spans from geosynchronous altitudes to beyond the Moon and will underpin future exploration, science, and security operations. We describe and release an open dataset of one million numerically propagated cislunar trajectories generated with the open-source Space Situational Awareness Python package (SSAPy). The model includes high-degree Earth/Moon gravity, solar gravity, and Earth/Sun radiation pressure; other planetary gravities are omitted by design for computational efficiency. Initial conditions uniformly sample commonly used osculating-element ranges, and each trajectory is propagated for up to six years under a single, fixed start epoch. The dataset is intended as a reusable benchmark for method development (e.g., space domain awareness, navigation, and machine-learning pipelines), a reference library for statistical studies of orbit families, and a starting point for community-driven extensions (e.g., alternative epochs). We report empirically observed stability trends (e.g., a band near ~5 GEO and persistence of some co-orbital classes including L4/L5 librators) as dataset descriptors rather than new dynamical results. The chief contribution is the scale, fidelity, organization (CSV/HDF5 with full state time series and metadata), and open availability, which together lower the barrier to comparative and data-driven studies in the cislunar regime.

79 ASTRONOMY AND ASTROPHYSICS↗

Position Papers for Inverse Methods for Complex Systems under Uncertainty Workshop

The ability to solve inverse problems – inferring unknown parameters, structures, or states of a system from observed data – is essential for advancing scientific discovery and innovation capabilities for the DOE mission. Basic research needs and challenges are particularly acute in emerging areas such as the interactive, data-driven, modeling and simulation of digital twins; decision support for experiments at DOE scientific user facilities; and for other complex systems and workflows. Inverse problems are at the heart of understanding and controlling complex systems due to factors such as observational data with varying modalities and fidelities, inherent uncertainties in physical measurements and numerical models, and the computational demands of rapid and high-fidelity simulations. The convergence of recent scientific computing trends – scientific machine learning, artificial intelligence, and computing advances such as exascale computing – is creating unprecedented opportunities. These advancements offer the potential to revolutionize how we approach inverse problems to extract actionable insights with the required level of accuracy and computational efficiency. This workshop and the Call for Position Papers are vital steps in bringing together experts to collectively explore and identify the new computational and mathematical directions needed in inverse methods for complex systems under uncertainty.

97 MATHEMATICS AND COMPUTING↗