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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Constraining chaos: Enforcing dynamical invariants in the training of reservoir computers

Drawing on ergodic theory, we introduce a novel training method for machine learning based forecasting methods for chaotic dynamical systems. The training enforces dynamical invariants—such as the Lyapunov exponent spectrum and the fractal dimension—in the systems of interest, enabling longer and more stable forecasts when operating with limited data. The technique is demonstrated in detail using reservoir computing, a specific kind of recurrent neural network. Finally, results are given for the Lorenz 1996 chaotic dynamical system and a spectral quasi-geostrophic model of the atmosphere, both typical test cases for numerical weather prediction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Numerical integration of stochastic contact Hamiltonian systems via stochastic Herglotz variational principle

Within this work, we establish a stochastic contact variational integrator and its discrete version via stochastic Herglotz variational principle for stochastic contact Hamiltonian systems. A general structure-preserving stochastic contact method is provided to seek the stochastic contact variational integrators. Numerical experiments are performed to verify the validity of this approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Fusion by beam ions in a low collisionality, high mirror ratio magnetic mirror

Abstract The classical problem of neutral beam ions slowing down in a magnetic mirror geometry is revisited to provide predictive capability for the new Wisconsin HTS Axisymmetric Mirror under development at the University of Wisconsin. A Fokker–Planck model named fast beam ion solver (FBIS) is developed to include the spatial non-uniformity of a physical mirror geometry. The mathematical framework allows for efficient orbit averaging of the pitch-angle scattering operator, and permits a determination of the axial profile of the ambipolar potential confining the electrons. The numerical results from FBIS are consistent with earlier work, but further show how mirror-ratio and a near square magnetic well optimizes the fusion gain. The numerical results are also applied to inform the conceptual design of WHAM++, a low capital-cost breakeven-class magnetic mirror device.

Egedal, J. (ORCID:0000000177531529)↗
DOE OSTI2023

Model averaging approaches to data subset selection

Model averaging is a useful and robust method for dealing with model uncertainty in statistical analysis. Often, it is useful to consider data subset selection at the same time, in which model selection criteria are used to compare models across different subsets of the data. Two different criteria have been proposed in the literature for how the data subsets should be weighted. We compare the two criteria closely in a unified treatment based on the Kullback-Leibler divergence and conclude that one of them is subtly flawed and will tend to yield larger uncertainties due to loss of information. Here, analytical and numerical examples are provided.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Numerical Experiments and Identification of Areas for Further Consideration (B639388 Subcontract Quarter II Report)

The second quarter of the project was spent carrying out numerical experiments on a variety of test matrices, using a combination of precisions, with the intent to study the numerical properties (namely, accuracy and convergence behavior) of the Conjugate Gradient (CG) method. We summarize our findings in the remainder of the document. Other activities include attending biweekly xSDK meetings. We are also currently collaborating with Steven Thomas (NREL) on the numerical stability analysis of “low-synch” Gram-Schmidt routines, for potential application within high-performance GMRES variants. This work is in progress. The subsequent quarter will be spent delving into the numerical analysis in order to provide theoretical explanation for the behavior observed in our experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Application of the Continuum Damage Mechanics Wilshire-Cano-Stewart (WCS) Model

In this study, the applications of the continuum damage mechanics-based Wilshire-Cano-Stewart (WCS) model are explored to predict rupture time, minimum-creep-strain-rate (MCSR), damage, damage evolution, and creep deformation. Increase knowledge in manufacturing methods has pushed the limit of material science and the development of new materials. Conventional testing is required to qualify materials against creep which according to the ASME B&PV III code, 10,000+ hours of experiments are necessary for each heat before materials are put into service. This process is costly and not feasible for new materials. As an alternative, models have been employed to predict creep behaviors and reduce the amount of time necessary for material qualification. Many models have been developed to predict distinct creep behaviors and the question of which model is best remains. Amongst current models, the WCS model has emerge with the ability to predict multiple behaviors using an explicit analytical approach with the ability to predict long-term creep. In this study the novel continuum damage mechanics WCS is employed in multiple applications. The goals of the study are (a) to discuss and determine the framework of the WCS model and validated it mathematically and using parametric simulations, (b) applied the model to accelerated creep data to show the capabilities of the model with non-conventional data, and (c) applied a novel numerical method, the datum temperature method (DTM) to show the model extrapolations and interpolations capabilities with limited and reduce data sets. To accomplish these goals, data is gathered for alloy P91 and Inconel 718 to develop and post-audit validate the model. The benefits of using the WCS model is that it provides an explicit stress and temperature dependency ideal for extrapolations, the coupled equations are suitable for finite element analysis (FEA) implementation, and it follows an explicit calibration approach. The model also proves that it can be applied to accelerated testing data and using the DTM.

Cano, Jaime A↗
DOE OSTI2024

Discrete-Element and Material-Point Method (DEM and MPM) Based Solvers for Sustainable Technologies

We present the use of discrete element method (DEM) and material point method (MPM) in three relevant green technology applications that include biomass feedstock handling, lithium-ion battery manufacturing, and high-pressure reverse osmosis. Our open-source DEM and MPM solvers are developed using performance portable grid and particle management library, AMReX, thus enabling superior performance on NVIDIA and AMD GPUs with > 100 million particles. Our DEM solver resolves the motion of individual particles in a granular system and includes a bonded sphere method for modeling non-spherical particles along with Hertzian and liquid bridge-based contact models. We simulate highly variable biomass feedstock flows in large-scale hoppers for biofuel production and electrode calendering in battery manufacturing using DEM. Our simulations predict flow blockage in large scale biomass hoppers and electrode microstructure variations, thus providing valuable information for biofuel and battery manufacturers, respectively. The second half of the talk will be on MPM and its application towards pore resolved simulations of reverse osmosis membranes under compressive loads. We present a validation study of our MPM simulations with membrane microscopy imaging thus providing useful insights on membrane stability under high pressure conditions. We also present a spectral stability analysis of using linear hat, quadratic and cubic spline basis in MPM indicating regions of numerical stability.

BIOMASS FUELS,MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Effect of artificial viscosity on shocked particle-laden flows for staggered grid Lagrangian methods

Abstract Shocked particle-laden flows are important to many natural and industrial processes. When simulating these systems, artificial viscosity is often required to prevent numerical artifacts, such as ringing, from arising in the pressure and density fields. The linear and quadratic coefficients of the artificial viscosity determine the amount of smoothing that occurs in these fields. For particle-laden flows, however, many of the fluid–particle interaction forces, for example, the pressure gradient force and unsteady forces, depend on gradients in the fluid fields. Furthermore, while the shock passes over a particle, these forces can be more dominant than drag. This means that the artificial viscosity coefficients affect how a particle and fluid interact when simulating shocked particle systems. Here this effect is investigated for isolated particles and for a particle curtain using a staggered grid Lagrangian approach. The artificial viscosity coefficients have a significant impact on the maximum force that a fluid imparts to a particle, which is important for determining whether a particle will break up in response to the shock. Furthermore, it is found that the density ratio between the particle and the fluid is important in determining whether the artificial viscosity coefficients have a significant impact on the particle’s motion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

A new form of the Saint-Venant equations for variable topography

The solution stability of river models using the one-dimensional (1D) Saint-Venant equations can be easily undermined when source terms in the discrete equations do not satisfy the Lipschitz smoothness condition for partial differential equations. Although instability issues have been previously noted, they are typically treated as model implementation issues rather than as underlying problems associated with the form of the governing equations. This study proposes a new reference slope form of the Saint-Venant equations to ensure smooth slope source terms and eliminate one source of potential numerical oscillations. It is shown that a simple algebraic transformation of channel geometry provides a smooth reference slope while preserving the correct cross-section flow area and the total Piezometric pressure gradient that drives the flow. The reference slope method ensures the slope source term in the governing equations is Lipschitz continuous while maintaining all the underlying complexity of the real-world geometry. The validity of the mathematical concept is demonstrated with the open-source Simulation Program for River Networks (SPRNT) model in a series of artificial test cases and a simulation of a small urban creek. Validation comparisons are made with analytical solutions and the Hydrologic Engineering Center's River Analysis System (HEC-RAS) model. The new method reduces numerical oscillations and instabilities without requiring ad hoc smoothing algorithms.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

A hybrid calibration approach to Hertz-type contact parameters for discrete element models

This study aims at providing a hybrid calibration framework to estimate Hertz-type contact parameters (particle-scale shear modulus and Poisson ratio) for both two-dimensional and three-dimensional discrete element modelling (DEM). On the basis of statistically isotropic granular packings, a set of analytical formulae between macroscopic material parameters (Young modulus and Poisson ratio) and particle-scale Hertz-type contact parameters for granular systems are derived under small-strain isotropic stress conditions. However, the derived analytical solutions are only estimated values for general models. By viewing each DEM modelling as an implicit mathematical function taking the particle-level parameters as independent variables and employing the derived analytical solutions as the initial input parameters, an automatic iterative scheme is proposed to obtain the calibrated parameters with higher accuracies. Considering highly nonlinear features and discontinuities of the macro-micro relationship in Hertz-based discrete element models, the adaptive moment estimation algorithm is adopted in this study because of its capacity of dealing with noise gradients of cost functions. Here, the proposed method is validated with several numerical cases including randomly distributed monodisperse and polydisperse packings. Noticeable improvements in terms of calibration efficiency and accuracy have been made.

Constitutive law↗
DOE OSTI2022

Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints

Here, we propose an algorithm for solving bound-constrained mathematical programs with complementarity constraints on the variables. Each iteration of the algorithm involves solving a linear program with complementarity constraints in order to obtain an estimate of the active set. The algorithm enforces descent on the objective function to promote global convergence to B-stationary points. We provide a convergence analysis and preliminary numerical results on a range of test problems. We also study the effect of fixing the active constraints in a bound-constrained quadratic program that can be solved on each iteration in order to obtain fast convergence.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Equivalence of quantum barren plateaus to cost concentration and narrow gorges

Optimizing parameterized quantum circuits (PQCs) is the leading approach to make use of near-term quantum computers. However, very little is known about the cost function landscape for PQCs, which hinders progress towards quantum-aware optimizers. In this work, we investigate the connection between three different landscape features that have been observed for PQCs: (1) exponentially vanishing gradients (called barren plateaus (BPs)), (2) exponential cost concentration about the mean, and (3) the exponential narrowness of minima (called narrow gorges). Here we analytically prove that these three phenomena occur together, i.e., when one occurs then so do the other two. A key implication of this result is that one can numerically diagnose BPs via cost differences rather than via the computationally more expensive gradients. More broadly, our work shows that quantum mechanics rules out certain cost landscapes (which otherwise would be mathematically possible), and hence our results could be interesting from a quantum foundations perspective.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Pauli potential formalism at finite temperature

At zero temperature, the Pauli potential—the functional derivative of the Pauli kinetic energy density functional—is the key to the accuracy of the orbital-free density functional theory (OFDFT) as it is supposed to capture all the effects associated with the Pauli exclusion principle. Here, we extend this concept to finite temperature by defining Pauli free energy and the modified Pauli free energy, both representing the natural generalizations of the Pauli term from zero- T to finite- T . We discuss their physical interpretation, the mathematical nuances, and the applicability, arguing that the modified Pauli potential should be used as an extension of the zero- T counterpart within the OF-DFT framework. Through analytical and numerical methods, we then analyze some of the exact properties concerning the modified Pauli free- and kinetic-energy terms and examine the temperature dependence of the modified Pauli potential.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Deterministic Linear Time for Maximal Poisson‐Disk Sampling using Chocks without Rejection or Approximation

Abstract We show how to sample uniformly within the three‐sided region bounded by a circle, a radial ray, and a tangent, called a “chock.” By dividing a 2D planar rectangle into a background grid, and subtracting Poisson disks from grid squares, we are able to represent the available region for samples exactly using triangles and chocks. Uniform random samples are generated from chock areas precisely without rejection sampling. This provides the first implemented algorithm for precise maximal Poisson‐disk sampling in deterministic linear time. We prove O(n · M(b) log b), where n is the number of samples, b is the bits of numerical precision and M is the cost of multiplication. Prior methods have higher time complexity, take expected time, are non‐maximal, and/or are not Poisson‐disk distributions in the most precise mathematical sense. We fill this theoretical lacuna.

Mitchell, Scott A.↗
DOE OSTI2022

Towards scaling community detection on distributed-memory heterogeneous systems

Distributed multi-GPU systems pose significant challenges and opportunities for efficient execution of parallel applications. Graph algorithms are generally characterized by irregular memory accesses, low computation to communication ratios, and load balancing problems that are especially hard to address on multi-GPU systems. Graph community detection is an important problem in the emerging domain of graph analytics with numerous applications. In this paper, we present our ongoing work on distributed-memory multi-GPU implementation for graph community detection. Our work parallelizes the widely used (albeit serial) Louvain method on distributed multi-GPU platforms. Supported by an extensive set of experiments on a multi-GPU enabled supercomputer (OLCF Summit) and a single compute node (Nvidia DGX-2®), we demonstrate competitive performance to existing distributed-memory CPU-based implementation, and up to 6.5 better results than Nvidia RAPIDS® CUGRAPH. To the best of our knowledge, this work represents the first effort for community detection on distributed multi-GPU systems. Our approach and related findings can be extended to numerous other iterative graph algorithms on multi-GPU systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Bayesian Deep Learning Approach to Near-Term Climate Prediction

Since model bias and associated initialization shock are serious shortcomings that reduce prediction skills in state-of-the-art decadal climate prediction efforts, we pursue a complementary machine-learning-based approach to climate prediction. The example problem setting we consider consists of predicting natural variability of the North Atlantic sea surface temperature on the interannual timescale in the pre-industrial control simulation of the Community Earth System Model. While previous works have considered the use of recurrent networks such as convolutional LSTMs and reservoir computing networks in this and other similar problem settings, we currently focus on the use of feedforward convolutional networks. In particular, we find that a feedforward convolutional network with a Densenet architecture is able to outperform a convolutional LSTM in terms of predictive skill. Next, we go on to consider a probabilistic formulation of the same network based on Stein variational gradient descent and find that in addition to providing useful measures of predictive uncertainty, the probabilistic (Bayesian) version improves on its deterministic counterpart in terms of predictive skill. Finally, we characterize the reliability of the ensemble of machine learning models obtained in the probabilistic setting by using analysis tools developed in the context of ensemble numerical weather prediction.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

An investigation of Newton-Sketch and subsampled Newton methods

Sketching, a dimensionality reduction technique, has received much attention in the statistics community. In this paper, we study sketching in the context of Newton's method for solving finite-sum optimization problems in which the number of variables and data points are both large. In this work, we study two forms of sketching that perform dimensionality reduction in data space: Hessian subsampling and randomized Hadamard transformations. Each has its own advantages, and their relative tradeoffs have not been investigated in the optimization literature. Additionally, our study focuses on practical versions of the two methods in which the resulting linear systems of equations are solved approximately, at every iteration, using an iterative solver. The advantages of using the conjugate gradient method vs. a stochastic gradient iteration are revealed through a set of numerical experiments, and a complexity analysis of the Hessian subsampling method is presented.

97 MATHEMATICS AND COMPUTING↗