Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Convergence 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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Well-Posedness of the Iterative Boltzmann Inversion

The iterative Boltzmann inversion is a fixed point iteration to determine an effective pair potential for an ensemble of identical particles in thermal equilibrium from the corresponding radial distribution function. Although the method is reported to work reasonably well in practice, it still lacks a rigorous convergence analysis. In this paper we provide some first steps towards such an analysis, and we show under quite general assumptions that the associated fixed point operator is Lipschitz continuous (in fact, differentiable) in a suitable neighborhood of the true pair potential, assuming that such a potential exists. In other words, the iterative Boltzmann inversion is well-defined in the sense that if the kth iterate of the scheme is sufficiently close to the true pair potential then the k+1st iterate is an admissible pair potential, which again belongs to the domain of the fixed point operator. On our way we establish important properties of the cavity distribution function and provide a proof of a statement formulated by Groeneveld concerning the rate of decay at infinity of the Ursell function associated with a Lennard-Jones type potential.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Monte Carlo Techniques for Nuclear Systems - Theory Lectures

These are lecture notes for a Monte Carlo class given at the University of New Mexico. The following topics are covered: course information; nuclear eng. review & MC; random numbers and sampling; computational geometry; collision physics; tallies and statistics; eigenvalue calculations I; eigenvalue calculations II; eigenvalue calculations III; variance reduction; parallel Monte Carlo; parameter studies; fission matrix and higher eigenmodes; doppler broadening; Monte Carlo depletion; HTGR modeling; coupled MC and T/H calculations; fission energy deposition. Solving particle transport problems with the Monte Carlo method is simple - just simulate the particle behavior. The devil is in the details, however. These lectures provide a balanced approach to the theory and practice of Monte Carlo simulation codes. The first lectures provide an overview of Monte Carlo simulation methods, covering the transport equation, random sampling, computational geometry, collision physics, and statistics. The next lectures focus on the state-of-the-art in Monte Carlo criticality simulations, covering the theory of eigenvalue calculations, convergence analysis, dominance ratio calculations, bias in Keff and tallies, bias in uncertainties, a case study of a realistic calculation, and Wielandt acceleration techniques. The remaining lectures cover advanced topics, including HTGR modeling and stochastic geometry, temperature dependence, fission energy deposition, depletion calculations, parallel calculations, and parameter studies. This portion of the class focuses on using MCNP to perform criticality calculations for reactor physics and criticality safety applications. It is an intermediate level class, intended for those with at least some familiarity with MCNP. Class examples provide hands-on experience at running the code, plotting both geometry and results, and understanding the code output. The class includes lectures & hands-on computer use for a variety of Monte Carlo calculations. Beginning MCNP users are encouraged to review LA-UR-09-00380, "Criticality Calculations with MCNP: A Primer (3nd Edition)" (available at http:// mcnp.lanl.gov under "Reference Collection") prior to the class. No Monte Carlo class can be complete without having students write their own simple Monte Carlo routines for basic random sampling, use of the random number generator, and simplified particle transport simulation.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

Rapid eco‐phenotypic feedback and the temperature response of biomass dynamics

Biomass dynamics capture information on population dynamics and ecosystem-level processes (e.g., changes in production over time). Understanding how rising temperatures associated with global climate change influence biomass dynamics is thus a pressing issue in ecology. The total biomass of a species depends on its density and its average mass. Consequently, disentangling how biomass dynamics responds to increasingly warm and variable temperatures ultimately depends on understanding how temperature influences both density and mass dynamics. Here, we address this issue by keeping track of experimental microbial populations growing to carrying capacity for 15 days at two different temperatures, and in the presence and absence of temperature variability. We develop a simple mathematical expression to partition the contribution of changes in density and mass to changes in biomass and assess how temperature responses in either one influence biomass shifts. Moreover, we use time-series analysis (Convergent Cross Mapping) to address how temperature and temperature variability influence reciprocal effects of density on mass and vice versa. We show that temperature influences biomass through its effects on density and mass dynamics, which have opposite effects on biomass and can offset each other. We also show that temperature variability influences biomass, but that effect is independent of any effects on density or mass dynamics. Last, we show that reciprocal effects of density and mass shift significantly across temperature regimes, suggesting that rapid and environment-dependent eco-phenotypic dynamics underlie biomass responses. Overall, our results connect temperature effects on population and phenotypic dynamics to explain how biomass responds to temperature regimes, thus shedding light on processes at play in cosmopolitan and abundant microbes as the world experiences increasingly warm and variable temperatures.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2016

How Informative Are Drug‐Drug Interactions of Gene‐Drug Interactions?

Abstract FDA recommendations to manage polymorphic CYP‐mediated drug‐drug interactions (DDIs) and gene‐drug interactions (GDIs) are typically similar. However, DDIs may not always reliably predict GDIs because the victim drug may have multiple metabolic pathways and the perpetrator drug may affect multiple enzymes or transporters. Consequently, it is of great interest to both the pharmaceutical industry and regulatory agencies to determine if DDI studies can be leveraged to inform GDIs or vice versa for dose adjustment and labeling. The objective of this study was to investigate under what circumstances DDIs can be used to predict GDIs for prototypical CYP2C9, CYP2C19, and CYP2D6 substrates. We investigated model substrates for CYP2D6 (metoprolol, dextromethorphan, atomoxetine, and vortioxetine), CYP2C9 (warfarin, flurbiprofen, and celecoxib), and CYP2C19 (omeprazole and clopidogrel). Data on drug exposure for poor metabolizers (GDI) and for DDIs mediated by strong/moderate inhibitors in extensive metabolizers were collected. The impact of DDIs and GDIs on drug exposure was compared using: (1) a descriptive and (2) a physiologically based pharmacokinetic convergence analysis. Results from both approaches indicate that information on DDIs can be used to reliably predict GDIs for CYP2D6 substrates. The situation is more complex for CYP2C9 and CYP2C19 substrates because dose of the inhibitor (CYP2C9) and potency of the inhibitor (CYP2C19) impact the extent to which perpetrator drugs phenotypically convert extensive metabolizers to poor(er) metabolizers.

Lagishetty, Chakradhar V.↗
DOE OSTI2024

An Empirical Quantile Estimation Approach for Chance-Constrained Nonlinear Optimization Problems

We investigate an empirical quantile estimation approach to solve chance-constrained nonlinear optimization problems. Our approach is based on the reformulation of the chance constraint as an equivalent quantile constraint to provide stronger signals on the gradient. In this approach, the value of the quantile function is estimated empirically from samples drawn from the random parameters, and the gradient of the quantile function is estimated via a finite-difference approximation on top of the quantile-function-value estimation. We establish a convergence theory of this approach within the framework of an augmented Lagrangian method for solving general nonlinear constrained optimization problems. The foundation of the convergence analysis is a concentration property of the empirical quantile process, and the analysis is divided based on whether or not the quantile function is differentiable. In contrast to the sampling-and-smoothing approach used in the literature, the method developed in this paper does not involve any smoothing function and hence the quantile-function gradient approximation is easier to implement and there are less accuracy-control parameters to tune. Furthermore, we demonstrate the effectiveness of this approach and compare it with a smoothing method for the quantile-gradient estimation. Numerical investigation shows that the two approaches are competitive for certain problem instances.

Applied Probability↗
DOE OSTI2023

Structure-aware methods for expensive derivative-free nonsmooth composite optimization

We present new methods for solving a broad class of bound-constrained nonsmooth composite minimization problems. These methods are specially designed for objectives that are some known mapping of outputs from a computationally expensive function. We provide accompanying implementations of these methods: in particular, a novel manifold sampling algorithm (MS-P) with subproblems that are in a sense primal versions of the dual problems solved by previous manifold sampling methods and a method (GOOMBAH) that employs more difficult optimization subproblems. For these two methods, we provide rigorous convergence analysis and guarantees. We demonstrate extensive testing of these methods. Open-source implementations of the methods developed in this manuscript can be found at https://github.com/POptUS/ IBCDFO/.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Minimum entropy filtering for a single output non-Gaussian stochastic system using state transformation

This paper presents a novel filter design for the single-output stochastic non-linear systems subjected to non-Gaussian noises and the proposed assumptions. Based on a state transformation, the unmeasurable states of the systems can be estimated where non-linear terms in the systems have been eliminated. It has been shown that the estimation error is linearly dynamical regarding to the presented vector-valued filter gain which can be optimised by minimising the entropy-based performance criterion. In addition, the convergence of the presented algorithm is analysed in mean-square sense and a numerical example is given to verify the effectiveness of the presented filtering algorithm. Meanwhile, the extended Kalman filter, unscented particle filter and minimum entropy filter are given for the comparisons of the filtering performance. Following the presented framework, some extensions of the presented filtering algorithm are discussed to indicate the flexibility of the filter design. The contribution of this paper can be summarised as establishing a novel minimum entropy filtering framework which consists of model transformation, entropy optimisation and convergence analysis.

42 ENGINEERING↗
DOE OSTI2022

Forward and inverse modeling of fault transmissibility in subsurface flows

Characterizing physical properties of faults, such as their transmissibility, is crucial for performing predictive numerical simulation of subsurface flows, such as those encountered in petroleum engineering and remediation of subsurface contamination. Here, this paper provides a complete investigation of the inverse problem for fault transmissibility in subsurface flow models, under appropriate assumptions on fault structure. In particular, the following aspects are considered: 1) fault modeling and well-posedness of the forward problem; 2) finite element (FEM) discretizations of the forward problem and their rigorous a priori convergence analysis; 3) Well-posedness of the Bayesian inverse problem, FEM discretization of the infinite dimensional Bayesian inverse formulation, and its rigorous a priori analysis. Moreover, computation of the maximum a posteriori (MAP) point via fast inexact Newton-conjugate gradient optimization and a Laplace approximation of the Bayesian posterior are also presented. Numerical results illustrate the use of the proposed fault model in forward and inverse problems for subsurface flows in two dimensional domains with multiple faults.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A scalable exponential-DG approach for nonlinear conservation laws: With application to Burger and Euler equations

In this work, we propose an Exponential DG framework for partial differential equations. We decompose 7 governing equations into linear and nonlinear parts to which we apply the discontinuous Galerkin 8 (DG) spatial discretization. In particular, we construct the linear part using Jacobian that effectively 9 capture stiff characteristics in the system. The former is integrated analytically, whereas the latter 10 is approximated. This approach i) is stable with a large Courant number (Cr > 1); ii) supports 11 high-order solutions both in time and space; iii) is computationally favorable compared to IMEX 12 DG methods with no preconditioner; iv) becomes comparable to explicit RKDG methods on uniform 13 mesh and beneficial on non-uniform grid for Euler equations; v) is scalable in a modern massively 14 parallel computing architecture due to its explicit nature of exponential time integrators and com15 pact communication stencil of DG method. Numerical results demonstrate the performance of our 16 proposed methods through various examples. We also discuss the stability and convergence analysis 17 for our exponential DG scheme in the context of Burgers equation.

42 ENGINEERING↗
DOE OSTI2019

A bi-fidelity method for the multiscale Boltzmann equation with random parameters

In this paper, we study the multiscale Boltzmann equation with multi-dimensional random parameters by a bi-fidelity stochastic collocation (SC) method developed in [52], [70], [71]. By choosing the compressible Euler system as the low-fidelity model, we adapt the bi-fidelity SC method to combine computational efficiency of the low-fidelity model with high accuracy of the high-fidelity (Boltzmann) model. With only a small number of high-fidelity asymptotic-preserving solver runs for the Boltzmann equation, the bi-fidelity approximation can capture well the macroscopic quantities of the solution to the Boltzmann equation in the random space. Additionally, a priori estimate on the accuracy between the high- and bi-fidelity solutions together with a convergence analysis is established. Finally, we present extensive numerical experiments to verify the efficiency and accuracy of our proposed method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Generating Converged Accurate Free Energy Surfaces for Chemical Reactions with a Force-Matched Semiempirical Model

Here, we demonstrate the capability of creating robust density functional tight binding (DFTB) models for chemical reactivity in prebiotic mixtures through force matching to short time scale quantum free energy estimates. Molecular dynamics using density functional theory (DFT) is a highly accurate approach to generate free energy surfaces for chemical reactions, but the extreme computational cost often limits the time scales and range of thermodynamic states that can feasibly be studied. In contrast, DFTB is a semiempirical quantum method that affords up to a thousandfold reduction in cost and can recover DFT-level accuracy. Here, we show that a force-matched DFTB model for aqueous glycine condensation reactions yields free energy surfaces that are consistent with experimental observations of reaction energetics. Convergence analysis reveals that multiple nanoseconds of combined trajectory are needed to reach a steady-fluctuating free energy estimate for glycine condensation. Predictive accuracy of force-matched DFTB is demonstrated by direct comparison to DFT, with the two approaches yielding surfaces with large regions that differ by only a few kcal mol –1 .

36 MATERIALS SCIENCE↗
DOE OSTI2016

The arbitrary order mixed mimetic finite difference method for the diffusion equation

Here, we propose an arbitrary-order accurate mimetic finite difference (MFD) method for the approximation of diffusion problems in mixed form on unstructured polygonal and polyhedral meshes. As usual in the mimetic numerical technology, the method satisfies local consistency and stability conditions, which determines the accuracy and the well-posedness of the resulting approximation. The method also requires the definition of a high-order discrete divergence operator that is the discrete analog of the divergence operator and is acting on the degrees of freedom. The new family of mimetic methods is proved theoretically to be convergent and optimal error estimates for flux and scalar variable are derived from the convergence analysis. A numerical experiment confirms the high-order accuracy of the method in solving diffusion problems with variable diffusion tensor. It is worth mentioning that the approximation of the scalar variable presents a superconvergence effect.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Accuracy of power spectra in dissipationless cosmological simulations

Abstract We exploit a suite of large N-body simulations (up to N = 40963) performed with abacus, of scale-free models with a range of spectral indices n, to better understand and quantify convergence of the matter power spectrum. Using self-similarity to identify converged regions, we show that the maximal wavenumber resolved at a given level of accuracy increases monotonically as a function of time. At 1 per cent level it starts at early times from a fraction of $k_\Lambda$, the Nyquist wavenumber of the initial grid, and reaches at most, if the force softening is sufficiently small, ${\sim}2{-}3 k_\Lambda$ at the very latest times we evolve to. At the $5{{\ \rm per\ cent}}$ level, accuracy extends up to wavenumbers of order $5k_\Lambda$ at late times. Expressed as a suitable function of the scale-factor, accuracy shows a very simple n-dependence, allowing a extrapolation to place conservative bounds on the accuracy of N-body simulations of non-scale-free models like LCDM. We note that deviations due to discretization in the converged range are not well modelled by shot noise, and subtracting it in fact degrades accuracy. Quantitatively our findings are broadly in line with the conservative assumptions about resolution adopted by recent studies using large cosmological simulations (e.g. Euclid Flagship) aiming to constrain the mildly non-linear regime. On the other hand, we remark that conclusions about small-scale clustering (e.g. concerning the validity of stable clustering) obtained using PS data at wavenumbers larger than a few $k_\Lambda$ may need revision in light of our convergence analysis.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Electrical Load Forecasting Over Multihop Smart Metering Networks With Federated Learning

Electric load forecasting is essential for power management and stability in smart grids. This is mainly achieved via advanced metering infrastructure, where smart meters (SMs) record household energy data. Traditional machine learning (ML) methods are often employed for load forecasting, but require data sharing, which raises data privacy concerns. Federated learning (FL) can address this issue by running distributed ML models at local SMs without data exchange. However, current FL-based approaches struggle to achieve efficient load forecasting due to imbalanced data distribution across heterogeneous SMs. Here, this article presents a novel personalized FL (PFL) method for high-quality load forecasting in metering networks. A meta-learning-based strategy is developed to address data heterogeneity at local SMs in the collaborative training of local load forecasting models. Moreover, to minimize the load forecasting delays in our PFL model, we study a new latency optimization problem based on optimal resource allocation at SMs. A theoretical convergence analysis is also conducted to provide insights into FL design for federated load forecasting. Extensive simulations from real-world datasets show that our method outperforms existing approaches regarding better load forecasting and reduced operational latency costs.

Rahman, Ratun [Univ. of Alabama, Huntsville, AL (U↗
DOE OSTI2022

On the Convergence of Overlapping Schwarz Decomposition for Nonlinear Optimal Control

Here, we study the convergence properties of an overlapping Schwarz decomposition algorithm for solving nonlinear optimal control problems (OCPs). The algorithm decomposes the time domain into a set of overlapping subdomains, and solves all subproblems defined over subdomains in parallel. The convergence is attained by updating primal-dual information at the boundaries of overlapping subdomains. We show that the algorithm exhibits local linear convergence, and that the convergence rate improves exponentially with the overlap size. We also establish global convergence results for a general quadratic programming, which enables the application of the Schwarz scheme inside second-order optimization algorithms (e.g., sequential quadratic programming). The theoretical foundation of our convergence analysis is a sensitivity result of nonlinear OCPs, which we call "exponential decay of sensitivity" (EDS). Intuitively, EDS states that the impact of perturbations at domain boundaries (i.e., initial and terminal time) on the solution decays exponentially as one moves into the domain. Here, we expand a previous analysis available in the literature by showing that EDS holds for both primal and dual solutions of nonlinear OCPs, under uniform second-order sufficient condition, controllability condition, and boundedness condition. We conduct experiments with a quadrotor motion planning problem and a partial differential equations (PDE) control problem to validate our theory, and show that the approach is significantly more efficient than alternating direction method of multipliers and as efficient as the centralized interior-point solver.

42 ENGINEERING↗
DOE OSTI2019

An Online Plug-and-Play Algorithm for Regularized Image Reconstruction

Plug-and-play priors (PnP) is a powerful framework for regularizing imaging inverse problems by using advanced denoisers within an iterative algorithm. Recent experimental evidence suggests that PnP algorithms achieve state-of-the-art performance in a range of imaging applications. Here, we introduce a new online PnP algorithm based on the proximal gradient method (PGM). The proposed algorithm uses only a subset of measurements at every iteration, which makes it scalable to very large datasets. We present a new theoretical convergence analysis, for both batch and online variants of PnP-PGM, for denoisers that do not necessarily correspond to proximal operators. We also present simulations illustrating the applicability of the algorithm to image reconstruction in diffraction tomography. Finally, the results in this paper have the potential to expand the applicability of the PnP framework to very large datasets.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

MO-G-BRE-03: Automated Continuous Monitoring of Patient Setup with Second-Check Independent Image Registration

Purpose: To create a non-supervised quality assurance program to monitor image-based patient setup. The system acts a secondary check by independently computing shifts and rotations and interfaces with Varian's database to verify therapist's work and warn against sub-optimal setups. Methods: Temporary digitally-reconstructed radiographs (DRRs) and OBI radiographic image files created by Varian's treatment console during patient setup are intercepted and used as input in an independent registration module customized for accuracy that determines the optimal rotations and shifts. To deal with the poor quality of OBI images, a histogram equalization of the live images to the DDR counterparts is performed as a pre-processing step. A search for the most sensitive metric was performed by plotting search spaces subject to various translations and convergence analysis was applied to ensure the optimizer finds the global minima. Final system configuration uses the NCC metric with 150 histogram bins and a one plus one optimizer running for 2000 iterations with customized scales for translations and rotations in a multi-stage optimization setup that first corrects and translations and subsequently rotations. Results: The system was installed clinically to monitor and provide almost real-time feedback on patient positioning. On a 2 month-basis uncorrected pitch values were of a mean 0.016° with standard deviation of 1.692°, and couch rotations of − 0.090°± 1.547°. The couch shifts were −0.157°±0.466° cm for the vertical, 0.045°±0.286 laterally and 0.084°± 0.501° longitudinally. Uncorrected pitch angles were the most common source of discrepancies. Large variations in the pitch angles were correlated with patient motion inside the mask. Conclusion: A system for automated quality assurance of therapist's registration was designed and tested in clinical practice. The approach complements the clinical software's automated registration in terms of algorithm configuration and performance and constitutes a practical approach to implement safe and cost-effective radiotherapy.

60 APPLIED LIFE SCIENCES↗