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

Map-based cosmology inference with lognormal cosmic shear maps

ABSTRACT Most cosmic shear analyses to date have relied on summary statistics (e.g. ξ+ and ξ−). These types of analyses are necessarily suboptimal, as the use of summary statistics is lossy. In this paper, we forward-model the convergence field of the Universe as a lognormal random field conditioned on the observed shear data. This new map-based inference framework enables us to recover the joint posterior of the cosmological parameters and the convergence field of the Universe. Our analysis properly accounts for the covariance in the mass maps across tomographic bins, which significantly improves the fidelity of the maps relative to single-bin reconstructions. We verify that applying our inference pipeline to Gaussian random fields recovers posteriors that are in excellent agreement with their analytical counterparts. At the resolution of our maps – and to the extent that the convergence field can be described by the lognormal model – our map posteriors allow us to reconstruct all summary statistics (including non-Gaussian statistics). We forecast that a map-based inference analysis of LSST-Y10 data can improve cosmological constraints in the σ8–Ωm plane by $\approx\!{30}{{\ \rm per\ cent}}$ relative to the currently standard cosmic shear analysis. This improvement happens almost entirely along the $S_8=\sigma _8\Omega _{\rm m}^{1/2}$ directions, meaning map-based inference fails to significantly improve constraints on S8.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Robust ab initio predictions for dimensionless ratios of 𝐸⁢2 and radius observables. I. Electric quadrupole moments and deformation

We report that converged results for 𝐸⁢2 observables are notoriously challenging to obtain in ab initio no-core configuration interaction approaches. Matrix elements of the 𝐸⁢2 operator are sensitive to the large-distance tails of the nuclear wave function, which converge slowly in an oscillator basis expansion. Similar convergence challenges beset ab initio prediction of the nuclear charge radius. However, we exploit systematic correlations between the calculated 𝐸⁢2 and radius observables to yield meaningful predictions for relations among these observables. In particular, we examine ab initio predictions for dimensionless ratios of the form 𝑄/𝑟 2 for nuclei throughout the 𝑝 shell. Meaningful predictions for electric quadrupole moments may then be made by calibrating to the ground-state charge radius, if experimentally known, or vice versa. Moreover, these dimensionless ratios provide ab initio insight into the nuclear quadrupole deformation.

ab initio calculations↗
DOE OSTI2025

Robust ab initio predictions for dimensionless ratios of 𝐸⁢2 and radius observables. II. Estimation of 𝐸⁢2 transition strengths by calibration to the charge radius

Converged results for 𝐸⁢2 observables are notoriously challenging to obtain in ab initio no-core configuration interaction approaches. Matrix elements of the 𝐸⁢2 operator are sensitive to the large-distance tails of the nuclear wave function, which converge slowly in an oscillator basis expansion. Similar convergence challenges beset ab initio prediction of the nuclear charge radius. However, we exploit systematic correlations between the calculated 𝐸⁢2 and radius observables to yield meaningful predictions for relations among these observables. In particular, we examine ab initio predictions for dimensionless ratios of the form 𝐵⁡(𝐸⁢2)/(𝑒 2 ⁢𝑟 4 ) for nuclei throughout the 𝑝 shell. Finally, meaningful predictions for 𝐸⁢2 transition strengths may then be made by calibrating to the ground-state charge radius if experimentally known.

ab initio calculations↗
DOE OSTI2020

Accurate and efficient description of interacting carriers in quantum nanostructures by selected configuration interaction and perturbation theory

In this paper, we present a method to accurately and efficiently calculate many-body states of interacting carriers in quantum nanostructures based on a combination of iterative selection of configurations and perturbation theory. This method enables investigations of large excitonic complexes and multielectron systems with near full configuration interaction accuracy, even though only a small subspace of the full many-body Hilbert space is sampled, thus saving orders of magnitudes in computational resources. Important advantages of this method are that the convergence is controlled by a single parameter, the threshold, and that ground and excited states can be treated on an equal footing. On the example of InAsP nanowire quantum dots described using a million-atom tight-binding approach, we demonstrate the extreme efficiency of the method by numerical studies of large excitonic complexes filling up to the fourth electronic shell. We find that the method generally converges fast as a function of the threshold, profiting from a significant acceleration due to the perturbative corrections. The role of the choice of single-particle basis states is discussed. It is found that the algorithm converges faster in the Hartree-Fock basis only for highly charged systems, where Coulomb repulsion dominates. Finally, based on the observation that second-order perturbative energy corrections only depend on off-diagonal elements of the many-body Hamiltonian, we present a way to accurately calculate many-body states that requires only a relatively small number of Coulomb matrix elements.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Full-potential KKR within the removed-sphere method: A practical and accurate solution to the Poisson equation

Here an efficient and accurate generalization of the removed-sphere method (RSM) to solve the Poisson equation for total charge density in a solid with space-filling convex Voronoi polyhedra (VPs) and any symmetry is presented. The generalized RSM avoids the use of multipoles and VP shape functions for cellular integrals, which have associated ill-convergent large, double-internal L sums in spherical-harmonic expansions, so that fast convergence in single-L sums is reached. Our RSM adopts full Ewald formulation to work for all configurations or when symmetry breaking occurs, such as for atomic displacements or elastic constant calculations. The structure-dependent coefficients A L that define RSM can be calculated once for a fixed structure and speed up the whole self-consistent-field procedure. The accuracy and rapid convergence properties are confirmed using two analytic models, including the Coulomb potential and energy. We then implement the full-potential RSM using the Green's function Korringa-Kohn-Rostoker (KKR) method for real applications and compare the results with other first-principle methods and experimental data, showing that they are equally as accurate.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Importance of nonuniform Brillouin zone sampling for ab initio Bethe-Salpeter equation calculations of exciton binding energies in crystalline solids

Excitons are prevalent in semiconductors and insulators, and their binding energies are critical for optoelectronic applications. The state-of-the-art method for first-principles calculations of excitons in extended systems is the ab initio GW-Bethe-Salpeter equation (BSE) approach, which can require a fine sampling of reciprocal space to accurately resolve solid-state exciton properties. Here, in this study, we show, for a range of semiconductors and insulators, that the commonly employed approach of uniformly sampling the Brillouin zone can lead to underconverged exciton binding energies, as impractical grid sizes are required to achieve adequate convergence. We further show that nonuniform sampling of the Brillouin zone, focused on the region of reciprocal space where the exciton wave function resides, enables efficient rapid numerical convergence of exciton binding energies at a given level of theory. We propose a well-defined convergence procedure, which can be carried out at relatively low computational cost and which in some cases leads to a correction of previous best theoretical estimates by almost a factor of 2, qualitatively changing the predicted exciton physics. These results call for the adoption of nonuniform sampling methods for ab initio GW-BSE calculations and for revisiting previously computed values for exciton binding energies of many systems.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Ab initio nucleon-nucleus elastic scattering with chiral effective field theory uncertainties

Effective interactions for nucleon-nucleus elastic scattering from first principles require the use of the same nucleon-nucleon interaction in the structure and reaction calculations and a consistent treatment of the relevant operators at each order. Systematic investigations of the effect of truncation uncertainties of chiral nucleon-nucleon ( N N ) forces have been carried out for scattering observables in the two- and three-nucleons system as well as for bound-state properties of light nuclei. Here we extend this type of study to proton and neutron elastic scattering for 16 O and 12 C. Using the frameworks of the spectator expansion of multiple scattering theory as well as the no-core shell model, we employ one specific chiral interaction from the LENPIC collaboration and consistently calculate the leading-order effective nucleon-nucleus interaction up to the third chiral order, from which we extract elastic scattering observables. Then we apply pointwise as well as correlated uncertainty quantification for the estimation of the chiral truncation error. We calculate and analyze proton elastic scattering observables for 16 O and 12 C as well as neutron elastic scattering observables for 12 C between 65 and 185 MeV projectile kinetic energy. We find in all cases qualitatively similar results for the chiral truncation uncertainties as in few-body systems and assess them using similar diagnostic tools. The order-by-order convergence of the scattering observables for 16 O and 12 C is very reasonable around 100 MeV, while for higher energies the chiral expansion parameter becomes too large for convergence. Comparing proton and neutron differential cross sections reveals that their description is comparable up to around 100 MeV. Here, we also find a nearly perfect correlation between the differential cross section for neutron scattering and the N N Wolfenstein amplitudes for small momentum transfers. The diagnostic tools for studying order-by-order convergence in observables in few-body systems can be employed for observables in nucleon-nucleus scattering with only minor modifications provided the momentum scale in the problems is not too large. We also find that the chiral N N interaction on which our study is based gives a very good description of differential cross sections for 16 O and 12 C as low as 65-MeV projectile energy, particularly in the forward direction. In addition, the very forward direction of the neutron differential cross section mirrors the behavior of the N N interaction amazingly well.

6 ≤ A ≤ 19↗
DOE OSTI2022

Dark Energy Survey Year 3 results: Cosmology with moments of weak lensing mass maps

We present a cosmological analysis using the second and third moments of the weak lensing mass (convergence) maps from the first three years of data (Y3) data of the Dark Energy Survey. The survey spans an effective area of 4139 square degrees and uses the images of over 100 million galaxies to reconstruct the convergence field. The second moment of the convergence as a function of smoothing scale contains information similar to standard shear 2-point statistics. The third moment, or the skewness, contains additional non-Gaussian information. The data is analyzed in the context of the Λ CDM model, varying five cosmological parameters and 19 nuisance parameters modeling astrophysical and measurement systematics. Our modeling of the observables is completely analytical, and has been tested with simulations in our previous methodology study. We obtain a 1.7% measurement of the amplitude of fluctuations parameter S 8 ≡ σ 8 ( Ω m / 0.3 ) 0.5 = 0.784 ± 0.013 . The measurements are shown to be internally consistent across redshift bins, angular scales, and between second and third moments. In particular, the measured third moment is consistent with the expectation of gravitational clustering under the Λ CDM model. The addition of the third moment improves the constraints on S 8 and Ω m by ∼ 15 % and ∼ 25 % compared to an analysis that only uses second moments. We compare our results with Planck constraints from the cosmic microwave background, finding a 2.2 – 2.8 σ tension in the full parameter space, depending on the combination of moments considered. The third moment, independently, is in 2.8 σ tension with Planck, and thus provides a cross-check on the analyses of 2-point correlations.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Postprocessing techniques for gradient percolation predictions on the square lattice

In this work, we revisit the classic problem of site percolation on a regular square lattice. In particular, we investigate the effect of quantization bias errors on percolation threshold predictions for large probability gradients and propose a mitigation strategy. We demonstrate through extensive computational experiments that the assumption of a linear relationship between probability gradient and percolation threshold used in previous investigations is invalid. Moreover, we demonstrate that, due to skewness in the distribution of occupation probabilities visited the average does not converge monotonically to the true percolation threshold. Furthermore, we identify several alternative metrics which do exhibit monotonic (albeit not linear) convergence and document their observed convergence rates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Azimuthal Drive Asymmetry in Inertial Confinement Fusion Implosions on the National Ignition Facility

Data from nuclear diagnostics present correlated signatures of azimuthal implosion asymmetry in recent indirect-drive inertial confinement fusion (ICF) implosion campaigns performed at the National Ignition Facility (NIF). The mean hot-spot velocity, inferred from the Doppler shift of 14 MeV neutrons produced by deuterium-tritium (DT) fusion, is systematically directed toward one azimuthal half of the NIF target chamber, centered on φ ≈ 7 0 ° . Areal density ( ρ R ) asymmetry of the converged DT fuel, inferred from nuclear activation diagnostics, presents a minimum ρ R in the same direction as the hot-spot velocity and with Δ ρ R amplitude correlated with velocity magnitude. These two correlated observations, which are seen in all recent campaigns with cryogenic layers of DT fuel, are an understood signature of asymmetry in the fuel convergence, implying a systematic azimuthal drive asymmetry across a wide range of shot and target configurations. The direction of the implied radiation asymmetry is observed to cluster toward the hohlraum diagnostic windows. Furthermore, this low-mode asymmetry degrades hot-spot conditions at peak convergence and limits implosion performance and yield

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Ensuring Solution Uniqueness in Three-Phase Power System State Estimation

This paper is concerned with the issue of potential non-unique solutions in three-phase state estimation. Theory of observability analysis for positive sequence power system state estimation is based on certain assumptions that avoid possibility of multiple solutions. Also, it is shown that observability of a positive sequence network remains independent of the network parameters or the operating state. When extending single-phase observability analysis directly to the three-phase case, this paper considers the possibility of converging to multiple solutions, i.e. solution non-uniqueness, even for cases where state estimator successfully converges. The study illustrates via numerical examples the likelihood of converging to entirely different solutions for certain network parameters. It also examines how the operating state, particularly under unbalanced loading, leads to solution non-uniqueness. The paper then describes an alternative approach to ensure a unique solution in three-phase state estimation. This method aims to accurately and uniquely estimate the state of any unbalanced three-phase system, irrespective of load imbalance, network configuration, existence of synchronous generators or transformers.

Power System State Estimation, Three-Phase, Distri↗
DOE OSTI2026

An Adaptive Multiparameter Penalty Selection Method for Multiconstraint and Multiblock ADMM

This work presents a new method for online selection of multiple penalty parameters for the alternating direction method of multipliers (ADMM) algorithm applied to optimization problems with multiple constraints or functions with block matrix components. ADMM is widely used for solving constrained optimization problems in a variety of fields, including signal and image processing. Implementations of ADMM often utilize a single hyperparameter, referred to as the penalty parameter, which needs to be tuned to control the rate of convergence. However, in problems with multiple constraints, ADMM may demonstrate slow convergence regardless of penalty parameter selection due to scale differences between constraints. Accounting for scale differences between constraints to improve convergence in these cases requires introducing a penalty parameter for each constraint. The proposed method is able to adaptively account for differences in scale between constraints, providing robustness with respect to problem transformations and initial selection of penalty parameters. It is also simple to understand and implement. Our numerical experiments demonstrate that the proposed method performs favorably compared to a variety of existing penalty parameter selection methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Multilevel Conditional Disturbance Rejection Control for Satellite Attitude Tracking

Recently, the conditional disturbance rejection controller (CDRC) was proposed to improve control performance by leveraging disturbances that have beneficial effects on the system. However, it only considers disturbances acting on the state variable directly influenced by them. Although fast convergence of this state can be achieved with the CDRC, it may unintentionally affect the convergence of the output (i.e., the primary state). Here, in this article, a multilevel CDRC is proposed to enhance satellite attitude control performance by accounting for the effect of disturbances on both attitude (output) and angular velocity. The extended state observer is employed to estimate the lumped disturbance, including the modeling errors and external disturbances. Then, a backstepping-based controller with the multilevel disturbance rejection law (ML-DRL) is designed for attitude tracking. The ML-DRL is developed to improve the control performance by using a disturbance with a damping effect on both attitude and velocity. Faster convergence of attitude and velocity can be achieved by conditionally compensating for the disturbance. The stability of the proposed control method is analyzed by demonstrating that the errors are bounded as time tends to infinity. The attitude control performance of the proposed method is evaluated through numerical examples conducted using the MATLAB/Simulink Multibody tool.

Active disturbance rejection control (ADRC)↗
DOE OSTI2020

Decentralized Schemes with Overlap for Solving Graph-Structured Optimization Problems

We present a new algorithmic paradigm for the decentralized solution of graph-structured optimization problems that arise in the estimation and control of network systems. A key and novel design concept of the proposed approach is that it uses overlapping subdomains to promote and accelerate convergence. We show that the algorithm converges if the size of the overlap is sufficiently large and that the convergence rate improves exponentially with the size of the overlap. The proposed approach provides a bridge between fully decentralized and centralized architectures and is flexible in that it enables the implementation of asynchronous schemes, handling of constraints, and balancing of computing, communication, and data privacy needs. The proposed scheme is tested in an estimation problem for a 9241-node power network and we show that it outperforms the alternating direction method of multipliers.

asynchronous↗
DOE OSTI2022

Distributed Finite-Time Termination for Consensus Algorithm in Switching Topologies

Here, in this article, we present a finite-time stopping criterion for consensus algorithms in networks with dynamic communication topology. Prior state of the art has established convergence to the consensus value; however, the asymptotic convergence of these algorithms poses a challenge in practical settings where the response from agents is required in finite time. To this end, we propose a maximum-minimum protocol that propagates the global maximum and minimum values of agent states (while running the consensus algorithm) in the network. This article focuses on establishing that the global maximum and minimum values are strictly monotonic even for a dynamic topology, and they can be used to distributively ascertain the closeness to convergence in finite time. We rigorously show that each node can have access to the global maximum and minimum by running the proposed maximum-minimum protocol to realize a finite-time stopping criterion for the otherwise asymptotic consensus algorithm. The practical utility of the algorithm is illustrated through experiments where each agent is instantiated by a NodeJS socket.io server.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Fair Concurrent Training of Multiple Models in Federated Learning

Federated learning (FL) enables collaborative learning across multiple clients. In most FL work, all clients train a single learning task. However, the recent proliferation of FL applications may increasingly require multiple FL tasks to be trained simultaneously, sharing clients’ computing resources, which we call Multiple-Model Federated Learning (MMFL). Current MMFL algorithms use naïve average-based client-task allocation schemes that often lead to unfair performance when FL tasks have heterogeneous difficulty levels, as the more difficult tasks may need more client participation to train effectively. Furthermore, in the MMFL setting, we face a further challenge that some clients may prefer training specific tasks to others, and may not even be willing to train other tasks, e.g., due to high computational costs, which may exacerbate unfairness in training outcomes across tasks. We address both challenges by firstly designing FedFairMMFL, a difficulty-aware algorithm that dynamically allocates clients to tasks in each training round, based on the tasks’ current performance levels. We provide guarantees on the resulting task fairness and FedFairMMFL’s convergence rate. We then propose novel auction designs that incentivizes clients to train multiple tasks, so as to fairly distribute clients’ training efforts across the tasks, and extend our convergence guarantees to this setting. Here, we finally evaluate our algorithm with multiple sets of learning tasks on real world datasets, showing that our algorithm improves fairness by improving the final model accuracy and convergence speed of the worst performing tasks, while maintaining the average accuracy across tasks.

Federated learning↗
DOE OSTI2021

A Privacy-Preserving Distributed Control of Optimal Power Flow

Here, we consider a distributed optimal power flow formulated as an optimization problem that maximizes a nondifferentiable concave function. Solving such a problem by the existing distributed algorithms can lead to data privacy issues because the solution information exchanged within the algorithms can be utilized by an adversary to infer the data. To preserve data privacy, in this paper we propose a differentially private projected subgradient (DP-PS) algorithm that includes a solution encryption step. We show that a sequence generated by DP-PS converges in expectation, in probability, and with probability 1. Moreover, we show that the rate of convergence in expectation is affected by a target privacy level of DP-PS chosen by the user. We conduct numerical experiments that demonstrate the convergence and data privacy preservation of DP-PS.

24 POWER TRANSMISSION AND DISTRIBUTION↗