Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational Mathematics and Numerical Analysis”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Performing Numerical Analysis of Cybersecurity Options Using Dynamic Risk Analysis Tool EMRALD

Cyberattacks can have many different attack paths, durations, and goals. There are also many different mitigation options involving hardware, software, and/or humans. Considering a cyber threat should involve defense-in-depth methods and a quantitative or numerical evaluation of overall effectiveness against dynamic, time-dependent attacks to make cost and risk-informed decisions. Typical cyberattack modeling methods only provide a qualitative evaluation. The main areas of cybersecurity are confidentiality, integrity, and availability. For companies with cyber-physical systems such as advanced nuclear reactors, cyber-related safety is a requirement set by North American Electric Reliability and the U.S. Nuclear Regulatory Commission. They are also concerned about availability or reliability as a business case. As cyber threats are evolving to a business-for-hire structure, more attacks may focus on disrupting business success and reliability, causing financial and economic stability risk. Companies want to know business reliability and recovery from those threats, and that requires modeling physical behavior of the targets. Dynamic-state-based and Markov-based modeling provides a method for better cyber scenario modeling with different tools having issues such as state-base explosion. Dynamic modeling enables time and conditional features not found in other numerical evaluation methods. EMRALD (Event Modeling Risk Assessment using Lined Diagrams) is a dynamic risk analysis modeling and simulation tool and has features that reduce modeling issues. It has been used to model different time-dependent events including plant behavior and operator procedures. As a general modeling tool, EMRALD can also be used to model cyberattack scenarios with varying mitigation options and quantify effectiveness, producing numerical data for risk-informed decisions. This paper uses EMRALD to demonstrate that dynamic numerical risk analysis can be used for cyber threat modeling to provide insights for design decision-making and optimize defense strategies. Keywords: cyber modeling; cyber-physical systems; numerical cyber modeling

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Model Development for the ACME Lab Modular Wall and A-Frame Assemblies

The structural frame used for conducting large structural tests was replaced by the ACME (Applied Combined Mechanical Environments) Lab in Building 860 of Sandia National Laboratories in Albuquerque, NM. This new design required simulation and analysis to verify maximum loads and corresponding factors of safety. Two major assemblies which are part of the ACME Lab, the Modular Wall and A-Frame, were designed to operate with a multitude of components in various configurations and with varying loads. Simulations of the Modular Wall and A-Frame structures were performed through explicit analysis to determine safety factors for numerous loading scenarios. The Modular Wall had safety factors of 1.1 for the lateral, diagonal, and gusset loading conditions. The A-Frame had safety factors of 2 for all loading conditions simulated.

42 ENGINEERING↗
DOE OSTI2025

PSA 2025 DPRA for Cyber Optimization

Cyberattacks can have many different attack paths, durations, and goals. There are also many different mitigation options involving hardware, software, and/or humans. Evaluating defense options should include quantitative evaluation of overall effectiveness to make cost and risk-informed decisions. Typical cyberattack modeling methods only provide a qualitative evaluation and have difficulty with time dependent scenarios. The main areas of cybersecurity are confidentiality, integrity, and availability. For companies with cyber-physical systems such as advanced nuclear reactors, cyber-related integrity is a requirement set by the U.S. Nuclear Regulatory Commission. But companies are also concerned about availability or reliability as a business case. As cyber threats are evolving to a business-for-hire structure, more attacks focus on disrupting business success and reliability, causing financial and economic stability risk. Companies want reliability analysis while optimizing cost, which requires more than safety modeling methods. Dynamic-state-based and Markov-based modeling provides a method for better cyber scenario modeling with timing and conditional features not found in other numerical evaluation methods. EMRALD (Event Modeling Risk Assessment using Lined Diagrams) is a dynamic risk analysis modeling and simulation tool and has features that reduce modeling issues such as state-base explosion found in Markov-based tools. It has been used to model different time-dependent events including plant behavior and operator procedures. As a general modeling tool, EMRALD can also be used to model cyberattack scenarios with varying mitigation options and quantify effectiveness, producing numerical data for risk-informed decisions. This paper uses EMRALD to demonstrate that dynamic risk analysis can be used for cyber threat modeling to provide insights for design decision-making and optimize defense strategies.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Non-intrusive reduced-order modeling for dynamical systems with spatially localized features

This work presents a non-intrusive reduced-order modeling framework for dynamical systems with spatially localized features characterized by slow singular value decay. The proposed approach builds upon two existing methodologies for reduced and full-order non-intrusive modeling, namely Operator Inference (OpInf) and sparse Full-Order Model (sFOM) inference. We decompose the domain into two complementary subdomains that exhibit fast and slow singular value decay. The dynamics of the subdomain exhibiting slow singular value decay are learned with sFOM while the dynamics with intrinsically low dimensionality on the complementary subdomain are learned with OpInf. The resulting, coupled OpInf-sFOM formulation leverages the computational efficiency of OpInf and the high resolution of sFOM, and thus enables fast non-intrusive predictions for conditions beyond those sampled in the training data set. A novel regularization technique with a closed-form solution based on the Gershgorin disk theorem is introduced to promote stable sFOM and OpInf models. We also provide a data-driven indicator for subdomain selection and ensure solution smoothness over the interface via a post-processing interpolation step. We evaluate the efficiency of the approach in terms of offline and online speedup through a quantitative, parametric computational cost analysis. We demonstrate the coupled OpInf-sFOM formulation for two test cases: a one-dimensional Burgers’ model for which accurate predictions beyond the span of the training snapshots are presented, and a two-dimensional parametric model for the Pine Island Glacier ice thickness dynamics, for which the OpInf-sFOM model achieves an average prediction error on the order of 1% with an online speedup factor of approximately 8$\times$ compared to the numerical simulation.

42 ENGINEERING↗
DOE OSTI2024

Optimization of the artificial viscosity in Lagrangian staggered discretization codes. Modeling 1D stand-alone shock - case study

We have developed new measures of errors for numerical shock. The new approach is based on analysis of the structure function, and separation of the errors related to oscillations and shock width, which also include error in the position of the ”center” of the numerical shock. We have demonstrated that those measures correctly characterize the numerical solution. We introduced an objective function in, which both types of errors are weighted, and presented optimal values of the coefficients of the linear and quadratic viscosity for different weights and different Mach numbers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

SAM: A Modern System Code for Advanced Non-LWR Safety Analysis

The System Analysis Module (SAM), developed at Argonne National Laboratory and by collaborators at other organizations, is for advanced non–light water reactor safety analysis. SAM aims to provide fast-running, modest-fidelity, whole-plant transient analysis capabilities that are essential for fast-turnaround design scoping and engineering analyses of advanced reactor concepts. To facilitate code development, SAM utilizes the MOOSE object-oriented application framework, its underlying finite element library, and linear and nonlinear solvers to leverage modern advanced software environments and numerical methods. SAM aims to solve tightly coupled physical phenomena, including fission reaction, heat transfer, fluid dynamics, and thermal-mechanical responses in advanced reactor structures, systems, and components with high accuracy and efficiency. Finally, this paper gives an overview of the SAM code development, including goals and functional requirements, physical models, current capabilities, verification and validation, software quality assurance, and examples of simulations for advanced nuclear reactor applications.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

TRUST Contact Thermal Conductance (TRUST-CTC) Report: FY24

The objective of the Delivery Environments (DE) Testbeds to Reduce Uncertainties in Simulations and Tests (TRUST) project is to quantify and help increase confidence in specific areas of computational and experimental capabilities that are applicable to current and future delivery environments. More complete quantification of confidence in experimental and computational capabilities and the sufficient increase of confidence in those capabilities is critical to improving weapons engineering design, qualification, and assessment efforts that are critical to the current and future stockpile. Staff development will include cross-discipline collaboration to provide engineers with experience in both numerical simulations and experimental methods. This work uses and provides feedback on analysis tools and experimental results databases for efficient and responsive engineering which are currently under development. TRUST currently includes five testbeds and their associated engineering analysis baseline models (EABMs): 1. contact thermal conductivity, (CTC) 2. nonlinear dynamics, (ND) 3. sensors in environments for accelerometers, (SEA) 4. sensors in environments for fiber optic displacement gages, and (SEFOD) 5. sensors in environments for thermocouples (SETC). The TRUST project uses single-feature testbeds to quantify uncertainties in specific models and experiments and to identify capability development needs that can help to reduce these uncertainties. Each testbed is designed, configured, and tested in collaboration with groups with design and experimental capability: E-14 and MPA-CINT. The complementary simulations are conducted using W-13 analysis tools and stored in model repositories with plans for incremental progress toward EABM requirements. W-13 extends and exercises the testbed simulations in collaboration with experimentalists for uncertainty quantification of current and future materials, geometries, and environments. Additionally, TRUST is intended to provide engineers in W-13 and E-14 with experience in both numerical simulations and experimental methods through cross-discipline collaborations. Following the introduction to the TRUST project, the remainder of this report focuses on experimental and analytical efforts conducted in Fiscal Year (FY) 2024 relevant to the TRUST Contact Thermal Conductance (CTC) testbed.

42 ENGINEERING↗
DOE OSTI2025

Central Compact Finite‐Difference Scheme With High Spectral Resolution for KdV Equation

This work presents a combination of cell‐node and cell‐centered compact finite difference scheme for the approximation of third derivatives involved in Korteweg–de Vries (KdV) equations. This approach employs a half‐shifted derivative construction at cell centers, avoiding the need for compact interpolation, thereby removing transfer errors; hence, it improves spectral resolution and maintains high‐order accuracy. Fourier analysis is performed to show the spectral properties of the proposed formulation, which provides higher spectral resolutions as compared to node‐based compact schemes. A filtering strategy is incorporated to suppress high‐frequency oscillations without compromising the accuracy of the numerical scheme, and the total variation diminishing Runge Kutta (TVDRK3) method is applied for time integration. Numerical experiments on linear, nonlinear, and coupled KdV systems are conducted, and a comparative analysis with cell‐node compact schemes confirms that the proposed scheme consistently reduces errors by up to an order of magnitude and achieves high spectral resolution properties.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Grain2Mesh: Mesh Generation for Grain-Scale Nonlinear Elasticity Modeling

The nonlinear hysteretic behavior of rocks under cyclic loading is a crucial area of study in geomechanics. The macroscopic response of a variety of materials has been found to be contingent upon the behavior of the micro-scale structure. This project aims to develop a functional and maintainable software package for generating a multi-phase numerical mesh and accompanying simulation files for finite element modeling used in computational mechanics solvers. Meshes generated from images often lack key preprocessing that reduces noise and prevents mesh element distortion that can increase computational cost. By incorporating user feedback throughout, grain2mesh ensures a high-fidelity mesh that can be used to model grain-scale interactions such as shearing, crack propagation, and interfacial material contrast. Scientific applications of this software include material fracturing, stress-strain analysis for natural and engineered materials, and nonlinear meso-scale analysis.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Yet Another Discriminant Analysis (YADA): A Probabilistic Model for Machine Learning Applications

This paper presents a probabilistic model for various machine learning (ML) applications. While deep learning (DL) has produced state-of-the-art results in many domains, DL models are complex and over-parameterized, which leads to high uncertainty about what the model has learned, as well as its decision process. Further, DL models are not probabilistic, making reasoning about their output challenging. In contrast, the proposed model, referred to as Yet Another Discriminate Analysis(YADA), is less complex than other methods, is based on a mathematically rigorous foundation, and can be utilized for a wide variety of ML tasks including classification, explainability, and uncertainty quantification. YADA is thus competitive in most cases with many state-of-the-art DL models. Ideally, a probabilistic model would represent the full joint probability distribution of its features, but doing so is often computationally expensive and intractable. Hence, many probabilistic models assume that the features are either normally distributed, mutually independent, or both, which can severely limit their performance. YADA is an intermediate model that (1) captures the marginal distributions of each variable and the pairwise correlations between variables and (2) explicitly maps features to the space of multivariate Gaussian variables. Numerous mathematical properties of the YADA model can be derived, thereby improving the theoretic underpinnings of ML. Validation of the model can be statistically verified on new or held-out data using native properties of YADA. However, there are some engineering and practical challenges that we enumerate to make YADA more useful.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Dominant balance-based adaptive mesh refinement for incompressible fluid flows

This work introduces a novel adaptive mesh refinement (AMR) method that utilizes dominant balance analysis (DBA) for efficient and accurate grid adaptation in computational fluid dynamics (CFD) simulations. The proposed method leverages a Gaussian mixture model (GMM) to classify grid cells into active and passive regions based on the dominant physical interactions within the equation space. By modeling truncation error probabilistically from discretized terms, the method identifies regions of high interaction where numerical accuracy is most sensitive to resolution. Unlike traditional AMR strategies, this approach does not rely on heuristic-based sensors or user-defined thresholds, providing a fully automated and problem-independent framework for AMR. Applied to the incompressible Navier-Stokes equations for steady and unsteady flow past a cylinder, the DBA-based AMR method achieves comparable accuracy to high-resolution grids while reducing computational costs by up to 70 %. The validation highlights the method’s effectiveness in capturing complex flow features while minimizing grid cells, directing computational resources toward regions with the most critical dynamics. This modular and scalable strategy is adaptable to a wide range of applications, presenting a promising tool for efficient high-fidelity simulations in CFD and other multiphysics domains.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

A Structure-Preserving Decorated Particle Method for the Vlasov-Poisson System

We revisit the Scovel-Weinstein framework (Scovel & Weinstein, CPAM 1994) for reducing the Vlasov-Poisson system while preserving its Hamiltonian structure. Standard particle-in-cell (PIC) algorithms approximate the distribution function by macro-particles with position and velocity. In contrast, Scovel-Weinstein decorated particles involve additional shape degrees of freedom, while maintaining a finite-dimensional reduction with Hamiltonian structure inherited from the continuum model. Although the original work established this structure three decades ago, its computational potential has remained largely unexplored. We present a practical implementation of the Scovel-Weinstein model and compare it with a standard PIC algorithm. Numerical experiments demonstrate that macro-particles in standard PIC can be replaced by far fewer decorated particles while retaining comparable accuracy. This decorated particle approach offers a new structure-preserving paradigm for kinetic plasma simulation.

65M75, 70H05, 70G65↗
DOE OSTI2025

Coefficient-to-Basis Network: a fine-tunable operator learning framework for inverse problems with adaptive discretizations and theoretical guarantees

We propose a Coefficient-to-Basis Network (C2BNet), a novel framework for solving inverse problems within the operator learning paradigm. C2BNet efficiently adapts to different discretizations through fine-tuning, using a pre-trained model to significantly reduce computational cost while maintaining high accuracy. Unlike traditional approaches that require retraining from scratch for new discretizations, our method enables seamless adaptation without sacrificing predictive performance. Furthermore, we establish theoretical approximation and generalization error bounds for C2BNet by exploiting low-dimensional structures in the underlying datasets. Our analysis demonstrates that C2BNet adapts to low-dimensional structures without relying on explicit encoding mechanisms, highlighting its robustness and efficiency. To validate our theoretical findings, we conducted extensive numerical experiments that showcase the superior performance of C2BNet on several inverse problems. The results confirm that C2BNet effectively balances computational efficiency and accuracy, making it a promising tool to solve inverse problems in scientific computing and engineering applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A Performance Portable, Fully Implicit Landau Collision Operator with Batched Linear Solvers

Modern accelerators use hierarchical parallel programming models that enable massive multithreading within a processing element (PE), with multiple PEs per device driven by traditional processes. Batching is a technique for exposing PE-level parallelism in algorithms that have traditionally run on MPI processes or multiple threads within a single process. Opportunities for batching arise in, for example, kinetic discretizations of magnetized plasmas where collisions are advanced in velocity space at each spatial point independently. This paper builds on previous work on a high-performance, fully nonlinear, Landau collision operator by batching the linear solver, as well as batching the spatial point problems and adding new support for multiple grids for multiscale, multispecies problems. An anisotropic relaxation verification test that agrees well with previously published results and analytical models is presented. The performance results from NVIDIA A100 and AMD MI250X nodes are presented with hardware utilization analysis for each architecture. Finally, the entire implicit Landau operator time advance is implemented in Kokkos for performance portability, running entirely on the device and is available in the PETSc numerical library.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Variational Quantum Algorithms for Semidefinite Programming

A semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond. In this work, we propose variational quantum algorithms for approximately solving SDPs. For one class of SDPs, we provide a rigorous analysis of their convergence to approximate locally optimal solutions, under the assumption that they are weakly constrained (i.e., N$\gg$M, where N is the dimension of the input matrices and M is the number of constraints). We also provide algorithms for a more general class of SDPs that requires fewer assumptions. Finally, we numerically simulate our quantum algorithms for applications such as MaxCut, and the results of these simulations provide evidence that convergence still occurs in noisy settings.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Adaptive immersed isogeometric level-set topology optimization

Here, this paper presents for the first time an adaptive immersed approach for level-set topology optimization using higher-order truncated hierarchical B-spline discretizations for design and state variable fields. Boundaries and interfaces are represented implicitly by the iso-contour of one or multiple level-set functions. An immersed finite element method, the eXtended IsoGeometric Analysis, is used to predict the physical response. The proposed optimization framework affords different adaptively refined higher-order B-spline discretizations for individual design and state variable fields. The increased continuity of higher-order B-spline discretizations together with local refinement enables direct control over the accuracy of the representation of each field while simultaneously reducing computational cost compared to uniformly refined discretizations. A flexible mesh adaptation strategy enables local refinement based on geometric measures or physics-based error indicators. These adaptive discretization and analysis approaches are integrated into gradient-based optimization schemes, evaluating the design sensitivities using the adjoint method. Numerical studies illustrate the features of the proposed framework with static, linear elastic, multi-material, two- and three-dimensional problems. The examples provide insight into the effect of refining the design variable field on the optimization result and the convergence rate of the optimization process. Using coarse higher-order B-spline discretizations for level-set fields promotes the development of smooth designs and suppresses the emergence of small features. Moreover, adaptive mesh refinement for state variable fields results in a reduction of overall computational cost. Higher-order B-spline discretizations are especially interesting when evaluating gradients of state variable fields due to their higher inter-element continuity.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Investigation of Numerical Methods for Performance Improvement of MOOSE-based System Analysis Codes

The main objective of this study is to investigate the feasibility of implementation of staggered-grid finite volume method (SG-FVM) using the MOOSE framework to support the development of the advanced system analysis code SAM. This study successfully demonstrated the integration of staggered-grid finite volume method in the application level using the MOOSE framework, although not in the framework level which should be investigated in the future. Several important properties of the implemented SG-FVM, e.g., high-order spatial accuracy and monotonicity preserving, have been demonstrated with selected numerical test cases. The superior performance in execution time was also evident based on a selected one- dimensional flow problem in a loop configuration.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Analysis of the weighted shifted boundary method for the Poisson and Stokes problems

The Shifted Boundary Method (SBM) belongs to the class of unfitted (or immersed, or embedded) finite element methods, and relies on reformulating the original boundary value problem over a surrogate (approximate) computational domain. Accuracy is maintained by properly shifting the location and values of the boundary conditions. This avoids integration over cut cells and the associated implementation issues. Recently, the Weighted SBM (WSBM) was proposed for the Navier-Stokes equations with free surfaces and the Stokes flow with moving boundaries. The attribute “weighted” in the name WSBM stems from the fact that its variational form is weighted with the elemental volume fraction of active fluid. The motivation for the development of the WSBM was the preservation of the volume of active fluid to a higher degree of accuracy, which in turn resulted in improved stability and robustness characteristics in moving-boundary, time-dependent simulations. In this article, we present the numerical analysis of the WSBM formulations for the Poisson and Stokes problems. We give mathematical conditions under which the bilinear forms defining the discrete variational formulations are uniformly coercive (Poisson problem) or inf-sup stable (Stokes problem). By these results, stability and optimal convergence is proven in the natural norm; L2-error estimates can also be derived.

Approximate domain boundaries↗