Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical mathematics”

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 595 records · Page 33
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Data-driven variational multiscale reduced order models

We propose a new data-driven reduced order model (ROM) framework that centers around the hierarchical structure of the variational multiscale (VMS) methodology and utilizes data to increase the ROM accuracy at a modest computational cost. The VMS methodology is a natural fit for the hierarchical structure of the ROM basis: In the first step, we use the ROM projection to separate the scales into three categories: (i) resolved large scales, (ii) resolved small scales, and (iii) unresolved scales. In the second step, we explicitly identify the VMS–ROM closure terms, i.e., the terms representing the interactions among the three types of scales. In the third step, we use available data to model the VMS–ROM closure terms. Thus, instead of phenomenological models used in VMS for standard numerical discretizations (e.g., eddy viscosity models), we utilize available data to construct new structural VMS–ROM closure models. Specifically, we build ROM operators (vectors, matrices, and tensors) that are closest to the true ROM closure terms evaluated with the available data. We test the new data-driven VMS–ROM in the numerical simulation of four test cases: (i) the 1D Burgers equation with viscosity coefficient v = 10 -3 ; (ii) a 2D flow past a circular cylinder at Reynolds numbers, Re = 100, Re = 500, and Re= 1000; (iii) the quasi-geostrophic equations at Reynolds number Re = 450 and Rossby number Ro = 0.0036; and (iv) a 2D flow over a backward facing step at Reynolds number Re = 1000. The numerical results show that the data-driven VMS–ROM is significantly more accurate than standard ROMs.

42 ENGINEERING↗
DOE OSTI2022

A thermodynamically consistent finite strain phase field approach to ductile fracture considering multi-axial stress states

Phase field models for ductile fracture have gained significant attention in the last two decades due to their ability in implicitly tracking the nucleation and propagation of cracks. However, most crack phase field formulations for elastoplastic solids focus only on the effects of plastic deformation, and do not consider the different multi-axial stress states that may arise in practical designs. In this work, a thermodynamically consistent phase field approach coupled with finite strain plasticity, considering multi-axial stress states is presented. In order to account for the coupling between plasticity and stress states, the Stress-Weighted Ductile Fracture Model (SWDFM) is utilized. The SWDFM represents a criterion for predicting ductile crack initiation under both monotonic and cyclic loadings based on histories of an internal plastic variable, stress triaxiality, and the Lode angle parameter. The excellent performance of the SWDFM for predicting ductile crack initiation motivates for its incorporation into a phase field approach for predicting both crack initiation and propagation through degradation of the fracture toughness. Moreover, based on the second law of thermodynamics, exact requirements are imposed on the rate at which the fracture toughness can evolve. Here, a novel function for degrading the plastic yield surface during the evolution of damage is introduced. This function, in line with experimental observations, leads to an accumulation of plastic deformation in damaged regions of a solid, and avoids numerical instabilities arising from concentrations of large plastic deformations in severely damaged regions. For validating the proposed model, results of computational simulations are compared to data from selected tests considering different multi-axial stress states. Comparisons of the numerical results with data from laboratory experiments demonstrate the capabilities of the proposed framework.

42 ENGINEERING↗
DOE OSTI2021

When and why PINNs fail to train: A neural tangent kernel perspective

Physics-informed neural networks (PINNs) have lately received great attention thanks to their flexibility in tackling a wide range of forward and inverse problems involving partial differential equations. However, despite their noticeable empirical success, little is known about how such constrained neural networks behave during their training via gradient descent. More importantly, even less is known about why such models sometimes fail to train at all. Here in this work, we aim to investigate these questions through the lens of the Neural Tangent Kernel (NTK); a kernel that captures the behavior of fully-connected neural networks in the infinite width limit during training via gradient descent. Specifically, we derive the NTK of PINNs and prove that, under appropriate conditions, it converges to a deterministic kernel that stays constant during training in the infinite-width limit. This allows us to analyze the training dynamics of PINNs through the lens of their limiting NTK and find a remarkable discrepancy in the convergence rate of the different loss components contributing to the total training error. To address this fundamental pathology, we propose a novel gradient descent algorithm that utilizes the eigenvalues of the NTK to adaptively calibrate the convergence rate of the total training error. Finally, we perform a series of numerical experiments to verify the correctness of our theory and the practical effectiveness of the proposed algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

An asymptotic-preserving 2D-2P relativistic Drift-Kinetic-Equation solver for runaway electron simulations in axisymmetric tokamaks

We propose an asymptotic-preserving (AP), uniformly convergent numerical scheme for the relativistic collisional Drift-Kinetic Equation (rDKE) to simulate runaway electrons in axisymmetric toroidal magnetic field geometries typical of tokamak devices. The approach is derived from an exact Green's function solution with numerical approximations of quantifiable impact, and results in a simple, two-step operator-split algorithm, consisting of a collisional Eulerian step, and a Lagrangian orbit-integration step with analytically prescribed kernels. The AP character of the approach is demonstrated by analysis of the dominant numerical errors, as well as by numerical experiments. We demonstrate the ability of the algorithm to provide accurate answers regardless of plasma collisionality on a circular axisymmetric tokamak geometry.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Local conservation of energy in fully implicit PIC algorithms

We consider the issue of strict, fully discrete local energy conservation for a whole class of fully implicit local-charge- and global-energy-conserving particle-in-cell (PIC) algorithms. Earlier studies demonstrated these algorithms feature strict global energy conservation. However, whether a local energy conservation theorem exists (in which the local energy update is governed by a flux balance equation at every mesh cell) for these schemes is unclear. In this study, we show that a local energy conservation theorem indeed exists. We begin our analysis with the 1D electrostatic PIC model without orbit-averaging, and then generalize our conclusions to account for orbit averaging, multiple dimensions, and electromagnetic models (Darwin). In all cases, a temporally, spatially, and particle-discrete local energy conservation theorem is shown to exist, proving that these formulations (as originally proposed in the literature), in addition to being locally charge conserving and globally energy conserving, are strictly locally energy conserving as well. In contrast to earlier proofs of local conservation in the literature, which only considered continuum time, our result is valid for the fully implicit time-discrete version of all models considered, including important features such as orbit averaging. We demonstrate the local-energy-conservation property numerically with a paradigmatic numerical example.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Detecting False Data Injection Attacks in Smart Grids: A Semi-Supervised Deep Learning Approach

The dependence on advanced information and communication technology increases the vulnerability in smart grids under cyber-attacks. Recent research on unobservable false data injection attacks (FDIAs) reveals the high risk of secure system operation, since these attacks can bypass current bad data detection mechanisms. To mitigate this risk, this paper proposes a data-driven learning-based algorithm for detecting unobservable FDIAs in distribution systems. We use autoencoders for efficient dimension reduction and feature extraction of measurement datasets. Further, we integrate the autoencoders into an advanced generative adversarial network (GAN) framework, which successfully detects anomalies under FDIAs by capturing the unconformity between abnormal and secure measurements. Also, considering that the datasets collected from practical power systems are partially labeled due to expensive labeling costs and missing labels, the proposed method only requires a few labeled measurement data in addition to unlabeled data for training. Numerical simulations in three-phase unbalanced IEEE 13-bus and 123-bus distribution systems validate the detection accuracy and efficiency of this method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A new upper bound for the growth factor in Gaussian elimination with complete pivoting

Abstract The growth factor in Gaussian elimination measures how large the entries of an LU factorization can be relative to the entries of the original matrix. It is a key parameter in error estimates, and one of the most fundamental topics in numerical analysis. We produce an upper bound of for the growth factor in Gaussian elimination with complete pivoting — the first improvement upon Wilkinson's original 1961 bound of .

Bisain, Ankit [Department of Mathematics Massachus↗
DOE OSTI2024

Kernel polynomial method for linear spin wave theory

Calculating dynamical spin correlations is essential for matching model magnetic exchange Hamiltonians to momentum-resolved spectroscopic measurements. A major numerical bottleneck is the diagonalization of the dynamical matrix, especially in systems with large magnetic unit cells, such as those with incommensurate magnetic structures or quenched disorder. In this paper, we demonstrate an efficient scheme based on the kernel polynomial method for calculating dynamical correlations of relevance to inelastic neutron scattering experiments. This method reduces the scaling of numerical cost from cubic to linear in the magnetic unit cell size.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A Contextually-Aware Sensitivity Analysis to Guide the Design of Randomized Least Squares Solvers in Applications

Our work on the DOE-sponsored project “A Contextually-Aware Sensitivity Analysis to Guide the Design of Randomized Least Squares Solvers in Applications,” was an effort to address critical challenges in nu merical computing and its applications to optimization. The increasing demand for robust and scalable solutions to large-scale linear algebra problems has highlighted the limitations of traditional approaches, particularly in heterogeneous and extreme-scale computing environments. Randomized Numerical Linear Algebra (RandNLA) offers a promising framework to address these challenges, and this proposal builds on this foundation by introducing innovations in sensitivity analysis and computational adaptability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Euler equations and the Sod shock tube problem

The Euler equations are a subset of the magnetohydrodynamic (MHD) equations in the infinitely collisional, unmagnetized limit. MHD modeling is central to many areas of plasma physics, ranging from low-temperature glow discharges to inertial confinement fusion. An important aspect of the Euler equations is their ability to describe states with discontinuities, such as shock waves. A standard benchmark test for numerical implementation of the Euler equations is the Sod shock tube. In this test, the system is initialized at rest with a pressure and density discontinuity, which results in a shock wave traveling into the low-pressure region and a rarefaction wave traveling into the high-pressure region. Starting with the presentation of the Euler equations, a numerical algorithm is presented here to solve these equations in one dimension. This is followed by an overview of the Sod shock tube problem that includes the precise initial setup and the analytic solution. Finally, the analytic solution is compared with results from numerical simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

High-Reliability Systems and the Control of National Security Data and Information

High-reliability systems are characterized by catastrophic implications in the event of failure. These implications can include substantive damage to the environment, social order, and loss of life. Examples of high-reliability systems include nuclear submarines, nuclear reactors, the electric grid, and nuclear weapons. Due to the catastrophic implications of failure, there are heightened awareness and control mechanisms surrounding related data and information. However, defining the difference between data and information is often ambiguous across scholarly disciplines and in United States policy and legislation. For high-reliability systems, the implications of ambiguity between data and information may affect the security of United States interests and even cost lives. For security, data are raw facts or figures without context, while information is the compilation or articulation of data that forms context. Security depends on clarity in the differences between data and information and how to control them. Control is necessary to ensure that data and information are not unintentionally released to foreign governments, the public, or those without need-to-know. A primary concern in the practice of security is the control of data to avoid the unintended conversion to information. Intra-institutionally, this control is highly complex given the amalgam of legacy data systems and the numerous and constantly evolving nature of modern data systems that were not necessarily designed to be integrated. The complexity of this concern is augmented when institutions are part of interinstitutional collaborations or networks of public-private partnerships that share data and information. Additionally, institutions that share data as a function of policy and legislative action— particularly formally integrated data and information system infrastructures—may be at higher security risk. This paper will present an intra-institutional paradigm that utilizes and integrates concepts from numerous disciplines to frame a critical and underspecified practical issue in security—controlling for the unintended conversion of data to information.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗
DOE OSTI2023

Neural Network-Enhanced Reproducing Kernel Particle Method for Image-Based Multiphysics Damage Modeling of Energy Storage Materials

Energy storage materials undergo significant stresses during charge/discharge cycling, which makes understanding their reliability and durability fundamental in predicting performance and service life. Strong electrochemical-mechanical coupling and highly anisotropic material properties contribute to the formation and propagation of micro-cracking, largely along material interfaces and grain boundaries. With microstructural images supplied by the National Renewable Energy Laboratory (NREL), image-based modeling techniques are used to represent the complex material microstructures that dictate the coupled physics of these systems. Traditional electrochemical-mechanical models rely on mesh-based finite element methods, which can lead to difficulties in capturing crack propagation due to mesh dependency. Additionally, commonly used damage models, such as the continuous damage model and the cohesive zone model, often have steep tradeoffs between discontinuous field accuracy and computational expense. In this work, a neural network-enhanced reproducing kernel particle method (NN-RKPM) [1] is leveraged to accurately capture damage and crack propagation throughout the material by learning the location, orientation, and sharpness of discontinuity while allowing for a coarser nodal distribution than that necessary for capturing sharp solution transitions using traditional mesh-based methods. NN-RKPM is used to inform how crack opening and closure in turn affect the coupled chemical equations and material microstructure. Reference: [1] Baek, J., Chen, J. S., Susuki, K., "Neural Network enhanced Reproducing Kernel Particle Method for Modeling Localizations," International Journal for Numerical Methods in Engineering, Vol. 123, pp 4422-4454, https://doi.org/10.1002/nme.7040, 2022.

damage modeling↗
DOE OSTI2025

Towards Seamless Interoperability of MPI-OpenMP Applications

A chasm exists between mathematical software libraries written for MPI-based applications and those written for OpenMP applications. Recently, however, PETSc enables the simple use of its MPI-based linear solvers from OpenMP applications. Separately, the MPICH MPI development team has started a new project to allow almost seamless MPI use in OpenMP applications. Both proposed approaches would result in a similar user experience. Here, we discuss the reasons for these projects and their potential for providing more numerical library choices for OpenMP applications, including the unlimited assortment of linear solvers available in PETSc. In addition, we present the performance of an application using the first approach, demonstrating its efficacy.

MPI↗
DOE OSTI2020

Nonoverlapping Localized Exponential Time Differencing Methods for Diffusion Problems

In this paper, we propose nonoverlapping localized exponential time differencing (ETD) methods for diffusion problems. The model time-dependent diffusion equation is first reformulated on subdomains based on the nonoverlapping domain decomposition, in which Neumann boundary conditions are imposed on the interfaces for the subdomain problems and Dirichlet type conditions are enforced to form a space-time interface problem. After spatial discretization by standard central finite differences and temporal integration with the first or second order ETD methods, the fully discrete interface problem is obtained. Such an interface problem is then solved iteratively either at each time step or over the whole time interval: the former involves the solution of stationary problems in each subdomain at each iteration while the latter involves the solution of time-dependent subdomain problems at each iteration. For both approaches, we prove that localized ETD solutions conserve mass exactly and converge in time to the exact space semidiscrete solution. Numerical experiments in two dimensions are also presented to illustrate the performance of the proposed methods.

Mass conservation↗
DOE OSTI2021

Thermodynamically consistent algorithms for models of incompressible multiphase polymer solutions with a variable mobility

Here we present a general strategy for developing structure and property preserving numerical algorithms for thermodynamically consistent models of incompressible multiphase polymer solutions with a variable mobility. We first present a formalism to derive thermodynamically consistent, incompressible, multiphase polymer models. Then, we develop the general strategy, known as the supplementary variable method, to devise thermodynamically consistent numerical approximations to the models. We illustrate the numerical strategy using newly developed models of incompressible diblock copolymer solutions coupled with an electric and a magnetic field, respectively. Mesh refinement is conducted to verify convergence rates of the developed schemes. Some numerical examples are given to exhibit underlying dynamics absent from and driven by the external fields, respectively, highlighting differences between models with the variable and constant mobilities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Learning subgrid-scale models with neural ordinary differential equations

We propose a new approach to learning the subgrid-scale model when simulating partial differential equations (PDEs) solved by the method of lines and their representation in chaotic ordinary differential equations, based on neural ordinary differential equations (NODEs). Solving systems with fine temporal and spatial grid scales is an ongoing computational challenge, and closure models are generally difficult to tune. Machine learning approaches have increased the accuracy and efficiency of computational fluid dynamics solvers. In this approach neural networks are used to learn the coarse- to fine-grid map, which can be viewed as subgrid-scale parameterization. We propose a strategy that uses the NODE and partial knowledge to learn the source dynamics at a continuous level. Our method inherits the advantages of NODEs and can be used to parameterize subgrid scales, approximate coupling operators, and improve the efficiency of low-order solvers. Numerical results with the two-scale Lorenz 96 ODE, the convection-diffusion PDE, and the viscous Burgers' PDE are used to illustrate this approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A comparative study of machine learning models for predicting the state of reactive mixing

Mixing phenomena are important mechanisms controlling flow, species transport, and reaction processes in fluids and porous media. Accurate predictions of reactive mixing are critical for many Earth and environmental science problems such as contaminant fate and remediation, macroalgae growth, and plankton biomass evolution. Here, to investigate the evolution of mixing dynamics under different scenarios (e.g., anisotropy, fluctuating velocity fields), a finite-element-based numerical model was built to solve the fast, irreversible bimolecular reaction-diffusion equations to simulate a range of reactive-mixing scenarios. A total of 2,315 simulations were performed using different sets of model input parameters comprising various spatial scales of vortex structures in the velocity field, time-scales associated with velocity oscillations, the perturbation parameter for the vortex-based velocity, anisotropic dispersion contrast (i.e., ratio of longitudinal-to-transverse dispersion), and molecular diffusion. The outputs comprised concentration profiles of reactants and products. The inputs to and outputs from these simulations were concatenated into feature and label matrices, respectively, to train 20 different machine learning (ML) models intended to emulate system behavior. These 20 ML emulators, based on linear methods, Bayesian methods, ensemble learning methods, and multilayer perceptrons (MLPs), were trained to classify the state of mixing and predict three quantities of interest (QoIs) characterizing species production, decay (i.e., average concentration, square of average concentration), and degree of mixing (i.e., variances of species concentration). Unsurprisingly, linear classifiers and regressors failed to reproduce the QoIs; however, ensemble methods (classifiers and regressors) and the MLP model accurately classified the state of reactive mixing and the QoIs. Among ensemble methods, random forest and decision-tree-based AdaBoost faithfully predicted the QoIs. At run time, trained ML emulators produced results times faster than the finite-element simulations. Due to their low computational expense and high accuracy, ensemble and MLP models are excellent emulators for these numerical simulations and great utilities in uncertainty quantification exercises, which can require 1,000s of forward model runs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Alternative approach to quantum imaginary time evolution

There is increasing interest in quantum algorithms (QAs) that are based on the imaginary time evolution (ITE), a successful classical numerical approach to obtain ground states. However, most of the proposals so far require heavy postprocessing computational steps on a classical computer, such as solving linear equations. Here we provide an alternative approach to implement ITE. A key feature in our approach is the use of an orthogonal basis set: the propagated state is efficiently expressed in terms of orthogonal basis states at every step of the evolution. We argue that the number of basis states needed at those steps to achieve an accurate solution can be kept on the order of n , the number of qubits, by controlling the precision (number of significant digits) and the imaginary time increment. The number of quantum gates per imaginary time step is estimated to be polynomial in n . Additionally, while in many QAs the locality of the Hamiltonian is a key assumption, in our algorithm this restriction is not required. This characteristic of our algorithm renders it useful for studying highly nonlocal systems, such as the occupation-representation nuclear shell model. Here, we illustrate our algorithm through numerical implementation on an IBM quantum simulator.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗