Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mathematical 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 1,621 records · Page 90
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

Computational Methods for Structural Mechanics and Dynamics, part 1

The structural analysis methods research has several goals. One goal is to develop analysis methods that are general. This goal of generality leads naturally to finite-element methods, but the research will also include other structural analysis methods. Another goal is that the methods be amenable to error analysis; that is, given a physical problem and a mathematical model of that problem, an analyst would like to know the probable error in predicting a given response quantity. The ultimate objective is to specify the error tolerances and to use automated logic to adjust the mathematical model or solution strategy to obtain that accuracy. A third goal is to develop structural analysis methods that can exploit parallel processing computers. The structural analysis methods research will focus initially on three types of problems: local/global nonlinear stress analysis, nonlinear transient dynamics, and tire modeling.

Stroud, W. Jefferson↗
DOE OSTI2024

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↗
DOE OSTI2021

Oak Ridge National Laboratory NCSP Analytical Methods Subtask 3, AMPX Development and Maintenance, and NCSP Nuclear Data Subtask 6, SAMMY Modernization

The modernization of SAMMY continued with consolidation of access to covariance information for adjusted parameters and data in SAMMY. This consolidation allowed for removal of many scratch files. In addition, work was initiated to make the 0K cross section calculation more modular and less dependent on SAMMY global parameters. An initial application programming interface (API) was added to expose cross sections (including resolution broadening) generated by SAMMY to external fitting routines. The processing for thermal moderators in AMPX was updated for selected moderators for which the generated grid was not fine enough. Updated libraries were generated for SCALE. In addition, work continued to fully support new Evaluated Nuclear Data File (ENDF) formats, including the Generalized Nuclear Database Structure (GNDS) in AMPX.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2015

Communication: Global flux surface hopping in Liouville space

Recent years have witnessed substantial progress in the surface hopping (SH) formulation of non-adiabatic molecular dynamics. A generalization of the traditional fewest switches SH (FSSH), global flux SH (GFSH) utilizes the gross population flow between states to derive SH probabilities. The Liouville space formulation of FSSH puts state populations and coherences on equal footing, by shifting the hopping dynamics from Hilbert to Liouville space. Both ideas have shown superior results relative to the standard FSSH in Hilbert space, which has been the most popular approach over the past two and a half decades. By merging the two ideas, we develop GFSH in Liouville space. The new method is nearly as straightforward as the standard FSSH, and carries comparable computational expense. Tested with a representative super-exchange model, it gives the best performance among all existing techniques in the FSSH series. The obtained numerical results match almost perfectly the exact quantum mechanical solutions. Moreover, the results are nearly invariant under the choice of a basis state representation for SH, in contrast to the earlier techniques which exhibit notable basis set dependence. Unique to the developed approach, this property is particularly encouraging, because exact quantum dynamics is representation independent. GFSH in Liouville space significantly improves accuracy and applicability of SH for a broad range of chemical and physical processes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Investigation of Delayed Neutron Sensitivities for Several ICSBEP Benchmarks using MCNP

The effective delayed neutron (β$_{eff}$) is a very important parameter for reactor and criticality applications. This parameter is equal to the difference in reactivity between delayed critical ($k_{eff}$ = 1, which requires both prompt and delayed neutrons to achieve criticality) and prompt critical ($k_p$ = 1, which requires only prompt neutrons to achieve criticality). This is often referred to as the delayed critical "window" (the region of criticality between delayed and prompt critical). β$_{eff}$ is a reactor kinetics parameters and depends on the nuclides in the system that undergo fission as well as the spectral characteristics of the system. Measurements of β$_{eff}$ have been performed for many criticality experiments. The EUCLID (Experiments Underpinned by Computational Learning for Improvements in nuclear Data) project at Los Alamos National Laboratory (LANL) aims to constrain nuclear data by using a suite of measurement types beyond $k_{eff}$. Our team has recently investigated the use of pulsed spheres for nuclear data validation. Several other measurement methods are also of interest, including β$_{eff}$ (investigated here) and reactivity coefficients (investigated in a separate work at this same meeting). One focus of our work is to determine if other methods are complimentary to the critical experiments already utilized for nuclear data validation. This is important because if a method has similar sensitivities then it will not be particularly useful for nuclear data validation as it will provide the same information as the critical experiments already being used. Here "similar" could refer to several characteristics, one being the shape of a sensitivity profile over energy. In the future, these methods will be utilized (with both existing and new experiments) in machine learning algorithms for nuclear validation, similar to what is currently done for criticality experiments. In order to use a measurement type for nuclear validation, it is necessary to obtain cross-section sensitivities for that parameter. This work looks at one approach to estimate β$_{eff}$ sensitivities by utilizing $k_{eff}$ sensitivities within Monte Carlo N-Particle ® Code Version 6.2. This is applied to several criticality benchmarks. Results are compared and the benefits and limitations of this approach are discussed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Using Data-Driven Prediction of Downstream 1D River Flow to Overcome the Challenges of Hydrologic River Modeling

Methods for downstream river flow prediction can be categorized into physics-based and empirical approaches. Although based on well-studied physical relationships, physics-based models rely on numerous hydrologic variables characteristic of the specific river system that can be costly to acquire. Moreover, simulation is often computationally intensive. Conversely, empirical models require less information about the system being modeled and can capture a system’s interactions based on a smaller set of observed data. This article introduces two empirical methods to predict downstream hydraulic variables based on observed stream data: a linear programming (LP) model, and a convolutional neural network (CNN). We apply both empirical models within the Colorado River system to a site located on the Green River, downstream of the Yampa River confluence and Flaming Gorge Dam, and compare it to the physics-based model Streamflow Synthesis and Reservoir Regulation (SSARR) currently used by federal agencies. Results show that both proposed models significantly outperform the SSARR model. Moreover, the CNN model outperforms the LP model for hourly predictions whereas both perform similarly for daily predictions. Although less accurate than the CNN model at finer temporal resolution, the LP model is ideal for linear water scheduling tools.

13 HYDRO ENERGY↗
DOE OSTI2016

Mixed Arlequin method for multiscale poromechanics problems: Mixed Arlequin method for multiscale poromechanics problems

An Arlequin poromechanics model is introduced to simulate the hydro-mechanical coupling effects of fluid-infiltrated porous media across different spatial scales within a concurrent computational framework. A two-field poromechanics problem is first recast as the twofold saddle point of an incremental energy functional. We then introduce Lagrange multipliers and compatibility energy functionals to enforce the weak compatibility of hydro-mechanical responses in the overlapped domain. Here, to examine the numerical stability of this hydro-mechanical Arlequin model, we derive a necessary condition for stability, the twofold inf–sup condition for multi-field problems, and establish a modified inf–sup test formulated in the product space of the solution field. We verify the implementation of the Arlequin poromechanics model through benchmark problems covering the entire range of drainage conditions. Finally, through these numerical examples, we demonstrate the performance, robustness, and numerical stability of the Arlequin poromechanics model.

42 ENGINEERING↗
DOE OSTI2021

Zika virus dynamics: Effects of inoculum dose, the innate immune response and viral interference

Experimental Zika virus infection in non-human primates results in acute viral load dynamics that can be well-described by mathematical models. The inoculum dose that would be received in a natural infection setting is likely lower than the experimental infections and how this difference affects the viral dynamics and immune response is unclear. Here we study a dataset of experimental infection of non-human primates with a range of doses of Zika virus. We develop new models of infection incorporating both an innate immune response and viral interference with that response. We find that such a model explains the data better than models with no interaction between virus and the immune response. We also find that larger inoculum doses lead to faster dynamics of infection, but approximately the same total amount of viral production.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2018

Numerical solution of linear and nonlinear hyperbolic telegraph type equations with variable coefficients using shifted Jacobi collocation method

The telegraph equation is one of the important equations of mathematical physics. In this work, a spectral collocation scheme is proposed for the numerical solutions of one- and two-dimensional linear telegraph equations and telegraph equations with nonlinear forcing term. The homogeneous initial and boundary conditions are satisfied exactly by expanding the unknown variable using polynomial bases of functions which are built upon the Jacobi polynomials. The suggested scheme is successfully developed for the aforementioned problem with nonhomogeneous data. Extensive numerical experiments are presented to verify the efficiency of the proposed scheme.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1984

Recent advances in methods for numerical solution of O.D.E. initial value problems

In the mathematical modeling of physical systems, it is often necessary to solve an initial value problem (IVP), consisting of a system of ordinary differential equations (ODE). A typical program produces approximate solutions at certain mesh points. Almost all existing codes try to control the local truncation error, while the user is really interested in controlling the true or global error. The present investigation provides a review of recent advances regarding the solution of the IVP, giving particular attention to stiff systems. Stiff phenomena are customarily defined in terms of the eigenvalues of the Jacobian. There are, however, some difficulties connected with this approach. It is pointed out that an estimate of the Lipschitz constant proves to be a very practical way to determine the stiffness of a problem.

Bui, T. D.↗
NASA NTRS1985

Proceedings of the Third Annual Symposium on Mathematical Pattern Recognition and Image Analysis

Topics addressed include: multivariate spline method; normal mixture analysis applied to remote sensing; image data analysis; classifications in spatially correlated environments; probability density functions; graphical nonparametric methods; subpixel registration analysis; hypothesis integration in image understanding systems; rectification of satellite scanner imagery; spatial variation in remotely sensed images; smooth multidimensional interpolation; and optimal frequency domain textural edge detection filters.

Guseman, L. F., Jr.↗
DOE OSTI2023

Robust scalable initialization for Bayesian variational inference with multi-modal Laplace approximations

Predictive modeling typically relies on Bayesian model calibration to provide uncertainty quantification. Variational inference utilizing fully independent (“mean-field”) Gaussian distributions are often used as approximate probability density functions. This simplification is attractive since the number of variational parameters grows only linearly with the number of unknown model parameters. However, the resulting diagonal covariance structure and unimodal behavior can be too restrictive to provide useful approximations of intractable Bayesian posteriors that exhibit highly non-Gaussian behavior, including multimodality. High-fidelity surrogate posteriors for these problems can be obtained by considering the family of Gaussian mixtures. Gaussian mixtures are capable of capturing multiple modes and approximating any distribution to an arbitrary degree of accuracy, while maintaining some analytical tractability. Unfortunately, variational inference using Gaussian mixtures with full-covariance structures suffers from a quadratic growth in variational parameters with the number of model parameters. The existence of multiple local minima due to strong nonconvex trends in the loss functions often associated with variational inference present additional complications, These challenges motivate the need for robust initialization procedures to improve the performance and computational scalability of variational inference with mixture models. In this work, we propose a method for constructing an initial Gaussian mixture model approximation that can be used to warm-start the iterative solvers for variational inference. The procedure begins with a global optimization stage in model parameter space. In this step, local gradient-based optimization, globalized through multistart, is used to determine a set of local maxima, which we take to approximate the mixture component centers. Around each mode, a local Gaussian approximation is constructed via the Laplace approximation. Finally, the mixture weights are determined through constrained least squares regression. The robustness and scalability of the proposed methodology is demonstrated through application to an ensemble of synthetic tests using high-dimensional, multimodal probability density functions. Here, the practical aspects of the approach are demonstrated with inversion problems in structural dynamics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Improved Sampling Algorithms in the Risk-Informed Safety Margin Characterization Toolkit

The RISMC approach is developing advanced set of methodologies and algorithms in order to perform Probabilistic Risk Analyses (PRAs). In contrast to classical PRA methods, which are based on Event-Tree and Fault-Tree methods, the RISMC approach largely employs system simulator codes applied to stochastic analysis tools. The basic idea is to randomly perturb (by employing sampling algorithms) timing and sequencing of events and internal parameters of the system codes (i.e., uncertain parameters) in order to estimate stochastic parameters such as core damage probability. This approach applied to complex systems such as nuclear power plants requires to perform a series of computationally expensive simulation runs given a large set of uncertain parameters. These types of analysis are affected by two issues. Firstly, the space of the possible solutions (a.k.a., the issue space or the response surface) can be sampled only very sparsely, and this precludes the ability to fully analyze the impact of uncertainties on the system dynamics. Secondly, large amounts of data are generated and tools to generate knowledge from such data sets are not yet available. This report focuses on the first issue and in particular employs novel methods that optimize the information generated by the sampling process by sampling unexplored and risk-significant regions of the issue space: adaptive (smart) sampling algorithms. They infer system response from surrogate models constructed from existing samples and predict the most relevant location of the next sample. It is therefore possible to understand features of the issue space with a small number of carefully selected samples. In this report, we will present how it is possible to perform adaptive sampling using the RISMC toolkit and highlight the advantages compared to more classical sampling approaches such Monte-Carlo. We will employ RAVEN to perform such statistical analyses using both analytical cases but also another RISMC code: RELAP-7.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2015

Dynamic Event Tree advancements and control logic improvements

The RAVEN code has been under development at the Idaho National Laboratory since 2012. Its main goal is to create a multi-purpose platform for the deploying of all the capabilities needed for Probabilistic Risk Assessment, uncertainty quantification, data mining analysis and optimization studies. RAVEN is currently equipped with three different sampling categories: Forward samplers (Monte Carlo, Latin Hyper Cube, Stratified, Grid Sampler, Factorials, etc.), Adaptive Samplers (Limit Surface search, Adaptive Polynomial Chaos, etc.) and Dynamic Event Tree (DET) samplers (Deterministic and Adaptive Dynamic Event Trees). The main subject of this document is to report the activities that have been done in order to: start the migration of the RAVEN/RELAP-7 control logic system into MOOSE, and develop advanced dynamic sampling capabilities based on the Dynamic Event Tree approach. In order to provide to all MOOSE-based applications a control logic capability, in this Fiscal Year an initial migration activity has been initiated, moving the control logic system, designed for RELAP-7 by the RAVEN team, into the MOOSE framework. In this document, a brief explanation of what has been done is going to be reported. The second and most important subject of this report is about the development of a Dynamic Event Tree (DET) sampler named “Hybrid Dynamic Event Tree” (HDET) and its Adaptive variant “Adaptive Hybrid Dynamic Event Tree” (AHDET). As other authors have already reported, among the different types of uncertainties, it is possible to discern two principle types: aleatory and epistemic uncertainties. The classical Dynamic Event Tree is in charge of treating the first class (aleatory) uncertainties; the dependence of the probabilistic risk assessment and analysis on the epistemic uncertainties are treated by an initial Monte Carlo sampling (MCDET). From each Monte Carlo sample, a DET analysis is run (in total, N trees). The Monte Carlo employs a pre-sampling of the input space characterized by epistemic uncertainties. The consequent Dynamic Event Tree performs the exploration of the aleatory space. In the RAVEN code, a more general approach has been developed, not limiting the exploration of the epistemic space through a Monte Carlo method but using all the forward sampling strategies RAVEN currently employs. The user can combine a Latin Hyper Cube, Grid, Stratified and Monte Carlo sampling in order to explore the epistemic space, without any limitation. From this pre-sampling, the Dynamic Event Tree sampler starts its aleatory space exploration. As reported by the authors, the Dynamic Event Tree is a good fit to develop a goal-oriented sampling strategy. The DET is used to drive a Limit Surface search. The methodology that has been developed by the authors last year, performs a Limit Surface search in the aleatory space only. This report documents how this approach has been extended in order to consider the epistemic space interacting with the Hybrid Dynamic Event Tree methodology.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Computational Methods for Modeling Electrospray Microdroplet Chemistry for Improved Quantitative Mass Spectrometry

This project aimed at enhancing the quantitative analysis capabilities of electrospray ionization mass spectrometry (ESI-MS) by developing advanced computational methods. The primary focus was to integrate continuum and molecular dynamics simulations to study the behavior of microdroplets in the ESI process, from formation to evaporation. Through this research, we sought to bridge significant length and time scales to provide a comprehensive understanding of how analyte concentrations evolve from bulk solutions into gas-phase ions. This understanding is crucial for addressing challenges such as ionization efficiency, solvent effects, and ion suppression, which currently limit the accuracy of quantitative ESI-MS.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Image-Based Digital Twin for Assessing the Coupled Electro-Chemo-Mechanical Behavior of Li-Ion Batteries

In energy storage materials, strong electrochemical-mechanical coupling and highly anisotropic material properties contribute to the formation and propagation of micro-cracking during charge/discharge cycling, resulting in reduced performance and service life. In this work, a digital twin is created to investigate the performance of a Li-ion battery cathode and simulate degradation accumulation. Pixel-based model construction is used to represent the complex material geometries from microstructural images supplied by the National Renewable Energy Laboratory (NREL). Because of the expected large deformation and crack opening, the reproducing kernel particle method (RKPM), a meshfree method with discretization at the image pixels, is used to approximate the field variables: electrostatic potential, concentration, and displacement. An interface modified reproducing kernel (IM-RK) is constructed by scaling a smooth kernel function with an interface-distance function to achieve strategic discontinuity types (i.e. weak discontinuities for strain discontinuities and strong discontinuities for cracks) and alleviate Gibbs oscillations near these transition zones. The discrete nature of the images' pixel points is employed throughout the model and approximation construction. The mechanical model is verified using an image-based microstructure under tensile loading. A transient electro-chemo-mechanical coupled simulation is performed to evaluate the potential micro-cracking induced degradation of the battery cathode material subjected to charge/discharge cycling.

battery degradation↗
DOE OSTI2016

A multiscale flux basis for mortar mixed discretizations of Stokes–Darcy flows

A multiscale flux basis algorithm is developed for the Stokes–Darcy flow problem. The method is based on a non-overlapping domain decomposition algorithm, where the global problem is reduced to a coarse scale mortar interface problem that is solved by an iterative solver. Subdomain solves are required at each interface iteration, so the cost for the method without a multiscale basis can be high when the number of subdomains or the condition number of the interface problem is large. Here the proposed algorithm involves precomputing a multiscale flux basis, which consists of the flux (or velocity trace) response from each mortar degree of freedom. It is computed by each subdomain independently before the interface iteration begins. The subdomain solves required at each iteration are substituted by a linear combination of the multiscale basis. This may lead to a significant reduction in computational cost since the number of subdomain solves is fixed, depending only on the number of mortar degrees of freedom associated with a subdomain. Several numerical examples are carried out to demonstrate the efficiency of the multiscale flux basis implementation for large-scale Stokes–Darcy problems.

97 MATHEMATICS AND COMPUTING↗