Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Convergent”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Convergence Analysis of Fixed Point Chance Constrained Optimal Power Flow Problems

For optimal power flow problems with chance constraints, a particularly effective method is based on a fixed point iteration applied to a sequence of deterministic power flow problems. However, a priori, the convergence of such an approach is not necessarily guaranteed. Here this article analyses the convergence conditions for this fixed point approach, and reports numerical experiments including for large IEEE networks.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Convergence in simulating global soil organic carbon by structurally different models after data assimilation

Abstract Current biogeochemical models produce carbon–climate feedback projections with large uncertainties, often attributed to their structural differences when simulating soil organic carbon (SOC) dynamics worldwide. However, choices of model parameter values that quantify the strength and represent properties of different soil carbon cycle processes could also contribute to model simulation uncertainties. Here, we demonstrate the critical role of using common observational data in reducing model uncertainty in estimates of global SOC storage. Two structurally different models featuring distinctive carbon pools, decomposition kinetics, and carbon transfer pathways simulate opposite global SOC distributions with their customary parameter values yet converge to similar results after being informed by the same global SOC database using a data assimilation approach. The converged spatial SOC simulations result from similar simulations in key model components such as carbon transfer efficiency, baseline decomposition rate, and environmental effects on carbon fluxes by these two models after data assimilation. Moreover, data assimilation results suggest equally effective simulations of SOC using models following either first‐order or Michaelis–Menten kinetics at the global scale. Nevertheless, a wider range of data with high‐quality control and assurance are needed to further constrain SOC dynamics simulations and reduce unconstrained parameters. New sets of data, such as microbial genomics‐function relationships, may also suggest novel structures to account for in future model development. Overall, our results highlight the importance of observational data in informing model development and constraining model predictions.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance

A recent quantum simulation of observables of the kicked Ising model on 127 qubits implemented circuits that exceed the capabilities of exact classical simulation. We show that several approximate classical methods, based on sparse Pauli dynamics and tensor network algorithms, can simulate these observables orders of magnitude faster than the quantum experiment and can also be systematically converged beyond the experimental accuracy. Our most accurate technique combines a mixed Schrödinger and Heisenberg tensor network representation with the Bethe free entropy relation of belief propagation to compute expectation values with an effective wave function–operator sandwich bond dimension >16,000,000, achieving an absolute accuracy, without extrapolation, in the observables of <0.01, which is converged for many practical purposes. We thereby identify inaccuracies in the experimental extrapolations and suggest how future experiments can be implemented to increase the classical hardness.

Science & Technology - Other Topics↗
DOE OSTI2024

Stochastic Trust-Region Algorithm in Random Subspaces with Convergence and Expected Complexity Analyses

Here, this work proposes a framework for large-scale stochastic derivative-free optimization (DFO) by introducing STARS, a trust-region method based on iterative minimization in random subspaces. This framework is both an algorithmic and theoretical extension of a random subspace derivative-free optimization (RSDFO) framework, and an algorithm for stochastic optimization with random models (STORM). Moreover, like RSDFO, STARS achieves scalability by minimizing interpolation models that approximate the objective in low-dimensional affine subspaces, thus significantly reducing per-iteration costs in terms of function evaluations and yielding strong performance on largescale stochastic DFO problems. The user-determined dimension of these subspaces, when the latter are defined, for example, by the columns of so-called Johnson-Lindenstrauss transforms, turns out to be independent of the dimension of the problem. For convergence purposes, inspired by the analyses of RSDFO and STORM, both a particular quality of the subspace and the accuracies of random function estimates and models are required to hold with sufficiently high, but fixed, probabilities. Using martingale theory under the latter assumptions, an almost sure global convergence of STARS to a first-order stationary point is shown, and the expected number of iterations required to reach a desired first-order accuracy is proved to be similar to that of STORM and other stochastic DFO algorithms, up to constants.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

The arbitrary-order virtual element method for linear elastodynamics models. Convergence, stability and dispersion-dissipation analysis.

We design the conforming virtual element method for the numerical approximation of the two dimensional elastodynamics problem. We prove stability and convergence of the semi-discrete approximation and derive optimal error estimates under $\textit{h}$-refinement in both the energy and the $L^2$ norms, and optimal error estimates under $\textit{p}$-refinement in the energy norm. The performance of the proposed virtual element method is assessed on a set of different computational meshes, including non-convex cells up to order four in the h-refinement setting. Exponential convergence is also experimentally observed under p-refinement. Finally, we present a dispersion-dissipation analysis for both the semi-discrete and fully-discrete schemes, showing that polygonal meshes behave as classical simplicial/quadrilateral grids in terms of dispersion-dissipation properties.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Monte Carlo Statistical Convergence

This document reviews Monte Carlo Statistical Convergence over the last 60 years, based on the real World state of computers over this time. Stress is placed on providing examples of what was and was not practically possible over this period of time. I present a few examples to illustrate convergence based not only on sample size, but also how cross sections can be modelled.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Proxy Applications for Converged Workloads: DMC LDRD Initiative

Modern scientific applications are complicated and require coordination of several components. Proxy application driven software-hardware co-design plays a vital role in driving innovation among the developments of applications, software infrastructure and hardware architecture. Proxy applications are self-contained and simplified codes that are intended to model the performance-critical computations within applications. Applications executing on modern High Performance Computing (HPC) systems are susceptible to network congestion, insufficient memory bandwidth within and across compute nodes, and inadvertent loss of performance due to bugs and unoptimized programming models. Modern numerical simulations and machine learning models play a critical role in studying physical phenomenon under myriad uncertainties. Such applications often exhibit irregular computation and memory accesses at specific regions of the application code, which can contribute to various performance bottlenecks at scale. To mitigate such issues and prepare the next generation hardware for a variety of computation and data movement contingencies, a well-known practice is to consider "proxy" applications as representative motifs for various classes of scientific applications. While there is disagreement in the HPC community on the mechanisms of construction of the proxy applications, there is a strong consensus on their positive impact in co-design. Proxy Applications for Converged Workloads (PACER) is about facilitating software-hardware co-design through proxy applications with the goal of improving the performance of converged science workflows on heterogeneous systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Impact of K-factor on Short Circuit Program Convergence for Inverter-Based Resources during Faults

Classical short-circuit programs that linearize the power network are no longer applicable for inverter based resources (IBRs), necessitating an iterative approach. Phasor domain programs can model the IBRs using an iterative approach considering nonlinear fault responses. In phasor domain models, the IBR can be modeled as a voltage controlled current source (VCCS) in tabular form with positive, negative, and zero sequence information for balanced and unbalance short-circuit faults. In the VCCS modeling of the IBR, positive and negative incremental reactive current, also known as the k-factor, plays an important role in short circuit program convergence. In this work, a few approaches: conventional VCCS modeling with a k-factor of 2, conventional VCCS modeling with a k-factor of 2 with modified pre-fault voltages, VCCS characteristics based on the power flow solution with a k-factor of 2, and VCCS characteristics based on the power flow solution with a k-factor of 1 are investigated for short circuit program convergence under higher IBR penetration. The IEEE 39 bus New England Test System is taken as the test system, and simulations are carried out in PSS®CAPE 15.0.26 simulation software. Simulation results demonstrate that IBR penetration is higher for the VCCS model, which corresponds to the power flow solution with k-factor 1, compared to other approaches.

42 ENGINEERING↗
DOE OSTI2025

Monitoring L2 Milestone Summary: Converged HPC Center-Wide Data Analytics

This document is the summary for the ASC 2025 L2 milestone Converged HPC Center-Wide Data Analytics. It describes the convergence of the center-wide monitoring at LC, the data sources involved, and different ways this has enabled analyzing and gaining insights from the data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Hierarchical Inference of the Lensing Convergence from Photometric Catalogs with Bayesian Graph Neural Networks

Abstract We present a Bayesian graph neural network (BGNN) that can estimate the weak lensing convergence ( κ ) from photometric measurements of galaxies along a given line of sight (LOS). The method is of particular interest in strong gravitational time-delay cosmography (TDC), where characterizing the “external convergence” ( κ ext ) from the lens environment and LOS is necessary for precise Hubble constant ( H 0 ) inference. Starting from a large-scale simulation with a κ resolution of ∼1′, we introduce fluctuations on galaxy–galaxy lensing scales of ∼1″ and extract random sight lines to train our BGNN. We then evaluate the model on test sets with varying degrees of overlap with the training distribution. For each test set of 1000 sight lines, the BGNN infers the individual κ posteriors, which we combine in a hierarchical Bayesian model to yield constraints on the hyperparameters governing the population. For a test field well sampled by the training set, the BGNN recovers the population mean of κ precisely and without bias (within the 2 σ credible interval), resulting in a contribution to the H 0 error budget well under 1%. In the tails of the training set with sparse samples, the BGNN, which can ingest all available information about each sight line, extracts a stronger κ signal compared to a simplified version of the traditional method based on matching galaxy number counts, which is limited by sample variance. Our hierarchical inference pipeline using BGNNs promises to improve the κ ext characterization for precision TDC. The code is available as a public Python package, Node to Joy ⏬ .

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Stability and convergence of nuclear detonations in white dwarf collisions

We investigate the numerical stability of thermonuclear detonations in 1D accelerated reactive shocks and 2D binary collisions of equal-mass magnetized and unmagnetized white dwarf stars. To achieve high resolution at initiation sites, we devised geometric gridding and mesh velocity strategies specially adapted to the unique requirements of head-on collisional geometries, scenarios in which one expects maximum production of iron-group products. We study the effects of grid resolution and the limiting of temperature, energy, and reactants for different stellar masses, separations, magnetic fields, inigenerationtial compositions, detonation mechanisms, and limiter parameters across a range of cell sizes from 1 to 100 km. Our results set bounds on the parameter space of limiter amplitudes for which both temperature- and energy-limiting procedures yield consistent and monotonically convergent solutions. Within these bounds, we find that grid resolutions of 5 km or better are necessary for uncertainties in total released energy and iron-group products to drop below 10%. Intermediate-mass products (e.g., calcium) exhibit similar convergence trends but with somewhat greater uncertainty. These conclusions apply equally to pure C/O white dwarfs, multispecies compositions (including helium shells), magnetized and unmagnetized cores, and either single or multiple detonation scenarios.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Experimental Validation of Approximate Dynamic Programming Based Optimization and Convergence on Microgrid Applications

Stochastic optimization can better address uncertainties in power system problems. However, when state space and action space become large, many existing approaches become computationally expensive and even infeasible. Approximate dynamic programming (ADP) attracts researchers’ attention as a powerful tool for solving power system optimization problems with reduced computational cost. In this paper, in light of the existing literature, we investigate how the ADP approach with post-decision value function approximation converges to the nearly optimal solution with improved computational speed and experimentally validate the performance of the approach for a microgrid energy optimization problem. The approximation error versus the number of iteration is studied for convergence analysis of the post-decision ADP. A flowchart is provided to illustrate the proposed ADP algorithm for a microgrid energy optimization problem. The performance of ADP and dynamic programming (DP) is compared in terms of optimization error and computational time. It has found that the post-decision ADP approach can achieve competitive optimality with improved computational speed compared to the traditional DP.

Das, Avijit↗
DOE OSTI2022

Enhancements to Overset Methods for Achieving Higher Accuracy and Solution Convergence: Preprint

Overset methods, when utilized within a multi-solver framework, provide a very flexible and powerful toolset for analyzing moving body problem. However, many overset framework suffer from several deficiencies such as (1) convergence degradation of the non-linear iterative schemes (2) difficulty in achieving higher-order accuracy and (3) high computational costs over long simulation times. In this work, we explore approaches that mitigate these deficiencies and provide a pathway for improved accuracy and fidelity of overset methods. A high-order, discontinuous Galerkin solver is integrated into an existing overset framework and applied to an unsteady ROBIN fuselage case. For convergence acceleration, an Overset-GMRES linear solver with a timestep controller is applied to a DLR-F6 aircraft steady simulation and an unsteady, notional rotor-fuselage. Finally the same rotor-fuselage case as well as the JVX rotor/wing case is simulated using a reduced-order aerodynamic model.

aerospace↗
DOE OSTI2022

High-contrast, convergent x-ray imaging with laser-Compton sources

Techniques are provided for the production of high-contrast, x-ray and/or gamma-ray radiographic images. The images have minimal contributions from object-dependent background radiation. The invention utilizes the low divergence, quasi-monoenergetic, x-ray or gamma-ray output from a laser-Compton source in combination with x-ray optical technologies to produce a converging x-ray or gamma-ray beam with which to produce a high-contrast, shadowgraph of a specific object. The object to be imaged is placed within the path of the converging beam between the x-ray optical assembly and the focus of the x-ray beam produced by that assembly. The beam is then passed through an optically thick pinhole located at the focus of the beam. Downstream of the pinhole, the inverted shadowgraph of the object is then recorded by an appropriate 2D detector array.

Barty, Christopher P. J.↗
DOE OSTI2021

On the Strong Convergence of Forward-Backward Splitting in Reconstructing Jointly Sparse Signals

We consider the problem of reconstructing an infinite set of sparse, finite-dimensional vectors, that share a common sparsity pattern, from incomplete measurements. This is in contrast to the work (Daubechies et al., Pure Appl. Math. 57(11), 1413–1457, 2004), where the single vector signal can be infinite-dimensional, and (Fornasier and Rauhut, SIAM J. Numer. Anal. 46(2), 577613, 2008), which extends the aforementioned work to the joint sparse recovery of finite number of infinite-dimensional vectors. In our case, to take account of the joint sparsity and promote the coupling of nonvanishing components, we employ a convex relaxation approach with mixed norm penalty ℓ 2,1 . This paper discusses the computation of the solutions of linear inverse problems with such relaxation by a forward-backward splitting algorithm. However, since the solution matrix possesses infinitely many columns, the arguments of Daubechies et al. (Pure Appl. Math. 57(11), 1413–1457, 2004) no longer apply. As such, we establish new strong convergence results for the algorithm, in particular when the set of jointly sparse vectors is infinite.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Numerical simulations of onset and growth of Rayleigh–Taylor instability involving solids in converging geometry

Numerical simulation of Rayleigh–Taylor instabilities involving solids has been carried out in a spherically converging geometry. A solid shell is driven toward the center by high-pressure gas outside. Low-pressure gas inside the shell is then compressed, causing the solid shell to slow down and eventually bounce back. Here, simulation results show the absence of the onset condition unlike in the planar geometry equivalent. Results also show that disturbance growth seems to be strongly associated with the deformation direction instead of the acceleration direction. For example, when the interface is compressed in the cross-stream direction, the disturbance at the gas–solid interface grows even under the Rayleigh–Taylor stable situation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Atomic resolution convergent beam electron diffraction analysis using convolutional neural networks

Two types of convolutional neural network (CNN) models, a discrete classification network and a continuous regression network, were trained to determine local sample thickness from convergent beam diffraction (CBED) patterns of SrTiO 3 collected in a scanning transmission electron microscope (STEM) at atomic column resolution. Acquisition of atomic resolution CBED patterns for this purpose requires careful balancing of CBED feature size in pixels, acquisition speed, and detector dynamic range. The training datasets were derived from multislice simulations, which must be convolved with incoherent source broadening. Sample thicknesses were also determined using quantitative high-angle annular dark-field (HAADF) STEM images acquired simultaneously. The regression CNN performed well on sample thinner than 35 nm, with 70% of the CNN results within 1 nm of HAADF thickness, and 1.0 nm overall root mean square error between the two measurements. The classification CNN was trained for a thicknesses up to 100 nm and yielded 66% of CNN results within one classification increment of 2 nm of HAADF thickness. Our approach depends on methods from computer vision including transfer learning and image augmentation.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Valence Electron Distributions from Sub-Angstrom Convergent Beam Electron Diffraction

Modern aberration-corrected scanning transmission electron microscopes can acquire four-dimensional data sets (“4D STEM”) by recording convergent beam electron diffraction (CBED) patterns, using precisely positioned, sub-angstrom probes. Here, we demonstrate that these patterns can probe the site symmetry, atomic displacements, and valence electron distributions at individual atomic columns. To this end, 4D STEM CBED patterns were acquired from SrTiO 3 single crystals and compared with patterns calculated using scattering potentials derived from density functional theory. Here, we show that an aspherical valence electron charge build-up at the oxygen sites causes intensity asymmetries in the low-angle scattering portion of the patterns. Using strained SrTiO 3 films containing subtle polar displacements within nanometer-sized domains, it is shown that the high-angle scattering portion in each pattern is sensitive to atomic displacements.

36 MATERIALS SCIENCE↗