Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Network convergence”

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 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Dark Energy Survey Year 3 results: Simulation-based cosmological inference with wavelet harmonics, scattering transforms, and moments of weak lensing mass maps. II. cosmological results

Here, we present a simulation-based cosmological analysis using a combination of Gaussian and non-Gaussian statistics of the weak lensing mass (convergence) maps from the first three years of the Dark Energy Survey. We implement the following: (1) second and third moments; (2) wavelet phase harmonics; (3) the scattering transform. Our analysis is fully based on simulations, spans a space of seven 𝑤 Cold Dark Matter (𝑤⁢ CDM) cosmological parameters, and forward models the most relevant sources of systematics inherent in the data: masks, noise variations, clustering of the sources, intrinsic alignments, and shear and redshift calibration. We implement a neural network compression of the summary statistics, and we estimate the parameter posteriors using a simulation-based inference approach. Including and combining different non-Gaussian statistics is a powerful tool that strongly improves constraints over Gaussian statistics (in our case, the second moments); in particular, the figure of merit (𝑆 8 , Ω m ) is improved by 70% (Λ ⁢CDM) and 90% (𝑤 ⁢CDM). When all the summary statistics are combined, we achieve a 2% constraint on the amplitude of fluctuations parameter 𝑆 8 ≡ 𝜎 8 ⁢(Ω m /0.3) 0.5 , obtaining 𝑆 8 = 0.794 ±0.017 (Λ⁢ CDM) and 𝑆 8 = 0.817 ±0.021 (𝑤 ⁢CDM), and a ∼10% constraint on Ω m , obtaining Ω m =0.259 ±0.025 (Λ ⁢CDM) and Ω m = 0.273 ±0.029 (𝑤⁢ CDM). In the context of the 𝑤⁢ CDM scenario, these statistics also strengthen the constraints on the parameter 𝑤, obtaining 𝑤 <−0.72. The constraints from different statistics are shown to be internally consistent (with a 𝑝-value>0.1 for all combinations of statistics examined). We compare our results to other weak lensing results from the first three years of the Dark Energy Survey data, finding good consistency; we also compare with results from external datasets, such as planck constraints from the cosmic microwave background, finding statistical agreement, with discrepancies no greater than <2.2⁢𝜎.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

High-accuracy emulators for observables in ΛCDM, N eff, Σ m ν, and w cosmologies

ABSTRACT We use the emulation framework CosmoPower to construct and publicly release neural network emulators of cosmological observables, including the cosmic microwave background (CMB) temperature and polarization power spectra, matter power spectrum, distance-redshift relation, baryon acoustic oscillation (BAO) and redshift-space distortion (RSD) observables, and derived parameters. We train our emulators on Einstein–Boltzmann calculations obtained with high-precision numerical convergence settings, for a wide range of cosmological models including ΛCDM, wCDM, ΛCDM + Neff, and ΛCDM + Σmν. Our CMB emulators are accurate to better than 0.5 per cent out to ℓ = 104, which is sufficient for Stage-IV data analysis, and our P(k) emulators reach the same accuracy level out to $k=50 \, \, \mathrm{Mpc}^{-1}$, which is sufficient for Stage-III data analysis. We release the emulators via an online repository (CosmoPower Organisation), which will be continually updated with additional extended cosmological models. Our emulators accelerate cosmological data analysis by orders of magnitude, enabling cosmological parameter extraction analyses, using current survey data, to be performed on a laptop. We validate our emulators by comparing them to class and camb and by reproducing cosmological parameter constraints derived from Planck TT, TE, EE, and CMB lensing data, as well as from the Atacama Cosmology Telescope Data Release 4 CMB data, Dark Energy Survey Year-1 galaxy lensing and clustering data, and Baryon Oscillation Spectroscopic Survey Data Release 12 BAO and RSD data.

Astronomy & Astrophysics↗
DOE OSTI2022

Weak-Bonding Elements Lead to High Thermoelectric Performance in BaSnS 3 and SrSnS 3 : A First-Principles Study

SnS2, an earth-abundant and ecofriendly material, is limited as a thermoelectric material because of the high lattice thermal conductivity κ L and low carrier mobility μ. By introducing weak-bonding elements Ba or Sr into the SnS 2 framework, we discovered two SnS 2 -based materials BaSnS3 and SrSnS3 with the calculated low κL values of 0.15 and 0.17 W m -1 K -1 , respectively, along the a-axis. The low group velocity and high lattice anharmonicity originating from the weakened and distorted Sn–S bonding network are found in both systems. Moreover, the vibrations of Ba and Sr induce low-lying optical phonons, which strongly couple with the acoustic phonons and strengthen the phonon scattering rates. Compared to SnS 2 , both compounds present lower single-band effective masses, smaller deformation potential constants, and better band convergence, which enhance μ with an insignificantly reduced effective mass. By solving the linearized Boltzmann transport equation with a nonempirical carrier lifetime, we predict excellent ZT values of 2.89 and 2.77 along the a-axis at 900 K in BaSnS 3 and SrSnS 3 , respectively. Further phase diagram calculations of Ba 1–x Sr x SnS 3 solid solutions propose a new compound, Ba 0.5 Sr 0.5 SnS 3 , with an even higher ZT of 3.0. Our work analyzes explicitly how weak-bonding elements enhance μ and suppress κL simultaneously in SnS 2 -analogous systems with a series of compounds nominated as potential high-performance thermoelectric materials.

36 MATERIALS SCIENCE↗
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↗
NASA NTRS1995

Stable adaptive neurocontrollers for spacecraft and space robots

This paper reviews recently developed techniques of adaptive nonlinear control using neural networks, and demonstrates their application to two important practical problems in orbital operations. An adaptive neurocontroller is first developed for spacecraft attitude control applications, and then the same design, slightly modified, is shown to be effective in the control of free-floating orbital manipulators. The algorithms discussed have guaranteed stability and convergence properties, and thus constitute viable alternatives to existing control methodologies. Simulation results are presented demonstrating the performance of each algorithm with representative dynamic models.

Sanner, Robert M.↗
DOE OSTI2025

A quantum eigenvalue solver based on tensor networks

Electronic ground states are of central importance in chemical simulations, but have remained beyond the reach of efficient classical algorithms except in cases of weak electron correlation or one-dimensional spatial geometry. We introduce a hybrid quantum-classical eigenvalue solver that constructs a wavefunction ansatz from a linear combination of matrix product states in rotated orbital bases, enabling the characterization of strongly correlated ground states with arbitrary spatial geometry. The energy is converged via a gradient-free generalized sweep algorithm based on quantum subspace diagonalization, with a potentially exponential speedup in the off-diagonal matrix element contractions upon translation into compact quantum circuits of linear depth in the number of qubits. Chemical accuracy is attained in numerical experiments for both a stretched water molecule and an octahedral arrangement of hydrogen atoms, achieving substantially better correlation energies compared to a unitary coupled-cluster benchmark, with orders of magnitude reductions in quantum resource estimates and a surprisingly high tolerance to shot noise. This proof-of-concept study suggests a promising new avenue for scaling up simulations of strongly correlated chemical systems on near-term quantum hardware.

chemistry↗
DOE OSTI2021

Distributed State Estimation Over Time-Varying Graphs: Exploiting the Age-of-Information

Here, we study the problem of designing a distributed observer for an LTI system over a time-varying communication graph. The limited existing work on this topic imposes various restrictions either on the observation model or on the sequence of communication graphs. In contrast, we propose a single-time-scale distributed observer that works under mild assumptions. Specifically, our communication model only requires strong-connectivity to be preserved over non-overlapping, contiguous intervals that are even allowed to grow unbounded over time. We show that under suitable conditions that bound the growth of such intervals, joint observability is sufficient to track the state of any discrete-time LTI system exponentially fast, at any desired rate. We also develop a variant of our algorithm that is provably robust to worst-case adversarial attacks, provided the sequence of graphs is sufficiently connected over time. The key to our approach is the notion of a "freshness-index" that keeps track of the age-of-information being diffused across the network. Such indices enable nodes to reject stale estimates of the state, and, in turn, contribute to stability of the error dynamics.

42 ENGINEERING↗
DOE OSTI2020

Gradient-Based Multi-Area Distribution System State Estimation

The increasing distributed and renewable energy resources and controllable devices in distribution systems make fast distribution system state estimation (DSSE) crucial in system monitoring and control. We consider a large multi-phase distribution system and formulate DSSE as a weighted least squares (WLS) problem. We divide the large distribution system into smaller areas of subtree structure, and by jointly exploring the linearized power flow model and the network topology, we propose a gradient-based multi-area algorithm to exactly and efficiently solve the WLS problem. The proposed algorithm enables distributed and parallel computation of the state estimation problem without compromising any performance. Numerical results on a 4,521-node test feeder show that the designed algorithm features fast convergence and accurate estimation results. Comparison with traditional Gauss-Newton method shows that the proposed method has much better performance in distribution systems with a limited amount of reliable measurement. The real-time implementation of the algorithm tracks time-varying system states with high accuracy.

41 EE - Solar Energy Technologies Office (EE-4S)↗
NASA NTRS1995

Neural Networks For Demodulation Of Phase-Modulated Signals

Hopfield neural networks proposed for demodulating quadrature phase-shift-keyed (QPSK) signals carrying digital information. Networks solve nonlinear integral equations prior demodulation circuits cannot solve. Consists of set of N operational amplifiers connected in parallel, with weighted feedback from output terminal of each amplifier to input terminals of other amplifiers. Used to solve signal processing problems. Implemented as analog very-large-scale integrated circuit that achieves rapid convergence. Alternatively, implemented as digital simulation of such circuit. Also used to improve phase estimation performance over that of phase-locked loop.

Altes, Richard A.↗
DOE OSTI2025

A geometric framework for momentum-based optimizers for low-rank training

Low-rank pre-training and fine-tuning have recently emerged as promising techniques for reducing the computational and storage costs of large neural networks. Training low-rank parameterizations typically relies on conventional optimizers such as heavy ball momentum methods or Adam. In this work, we identify and analyze potential difficulties that these training methods encounter when used to train low-rank parameterizations of weights. In particular, we show that classical momentum methods can struggle to converge to a local optimum due to the geometry of the underlying optimization landscape. To address this, we introduce novel training strategies derived from dynamical low-rank approximation, which explicitly account for the underlying geometric structure. Our approach leverages and combines tools from dynamical low-rank approximation and momentum-based optimization to design optimizers that respect the intrinsic geometry of the parameter space. We validate our methods through numerical experiments, demonstrating faster convergence, and stronger validation metrics at given parameter budgets.

Schotthoefer, Steffen [ORNL] (ORCID:00000002156965↗
DOE OSTI2020

Deep Generative Models that Solve PDEs: Distributed Computing for Training Large Data-Free Models

Recent progress in scientific machine learning (SciML) has opened up the possibility of training novel neural network architectures that solve complex partial differential equations (PDEs). Several (nearly data free) approaches have been recently reported that successfully solve PDEs, with examples including deep feed forward networks, generative networks, and deep encoder-decoder networks. However, practical adoption of these approaches is limited by the difficulty in training these models, especially to make predictions at large output resolutions (≥1024×1024). Here we report on a software framework for data parallel distributed deep learning that resolves the twin challenges of training these large SciML models - training in reasonable time as well as distributing the storage requirements. Our framework provides several out of the box functionality including (a) loss integrity independent of number of processes, (b) synchronized batch normalization, and (c) distributed higher-order optimization methods. We show excellent scalability of this framework on both cloud as well as HPC clusters, and report on the interplay between bandwidth, network topology and bare metal vs cloud. We deploy this approach to train generative models of sizes hitherto not possible, showing that neural PDE solvers can be viably trained for practical applications. We also demonstrate that distributed higher-order optimization methods are 2-3× faster than stochastic gradient-based methods and provide minimal convergence drift with higher batch-size.

PDEs↗
DOE OSTI2021

Bayesian sparse learning with preconditioned stochastic gradient MCMC and its applications

Deep neural networks have been successfully employed in an extensive variety of research areas, including solving partial differential equations. Despite its significant success, there are some challenges in effectively training DNN, such as avoiding overfitting in over-parameterized DNNs and accelerating the optimization in DNNs with pathological curvature. Here, we propose a Bayesian type sparse deep learning algorithm. The algorithm utilizes a set of spike-and-slab priors for the parameters in the deep neural network. The hierarchical Bayesian mixture will be trained using an adaptive empirical method. That is, one will alternatively sample from the posterior using preconditioned stochastic gradient Langevin Dynamics (PSGLD), and optimize the latent variables via stochastic approximation. The sparsity of the network is achieved while optimizing the hyperparameters with adaptive searching and penalizing. A popular SG-MCMC approach is Stochastic gradient Langevin dynamics (SGLD). However, considering the complex geometry in the model parameter space in nonconvex learning, updating parameters using a universal step size in each component as in SGLD may cause slow mixing. To address this issue, we apply a computationally manageable preconditioner in the updating rule, which provides a step-size parameter to adapt to local geometric properties. Moreover, by smoothly optimizing the hyperparameter in the preconditioning matrix, our proposed algorithm ensures a decreasing bias, which is introduced by ignoring the correction term in the preconditioned SGLD. According to the existing theoretical framework, we show that the proposed algorithm can asymptotically converge to the correct distribution with a controllable bias under mild conditions. Numerical tests are performed on both synthetic regression problems and learning solutions of elliptic PDE, which demonstrate the accuracy and efficiency of the present work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

A Hybrid-Learning Algorithm for Online Dynamic State Estimation in Multimachine Power Systems

With the increasing penetration of distributed generators in the smart grids, having knowledge of rapid real-time electromechanical dynamic states has become crucial to system stability control. Conventional Supervisory Control and Data Acquisition (SCADA)-based dynamic state estimation (DSE) techniques are limited by the slow sampling rates, while the emerging phasor measurement units (PMUs) technology enables rapid real-time measurements at network nodes. Using generator bus terminal voltages, we propose a hybrid-learning DSE (HL-DSE) algorithm to estimate the synchronous machine rotor angle and speed in real time. The HL-DSE takes the power system model into account and trains neuroestimators with real-time data in an online manner. Compared with traditional DSE methods, the HL-DSE overcomes limitations by using a data-driven approach in conjunction with the physical power system model. The time efficiency, accuracy, convergence, and robustness of the proposed algorithm are tested under noises and fault conditions in both small- and large-scale test systems. Simulation results show that the proposed HL-DSE is much more computationally efficient than widely used Kalman filter (KF)-based methods while maintaining comparable accuracy and robustness. In particular, HL-DSE is over 100 times faster than square-root unscented KF (SR-UKF) and 80 times faster than extended KF (EKF). The advantages and challenges of the HL-DSE are also discussed.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

A Non-cooperative Game-based Approach to Distributed Beam Scheduling in Millimeter-Wave Networks

We consider the distributed beam scheduling problem in mm-Wave networks where the base stations may belong to different operators and there is no centralized coordination among them. Our goal is to design distributed beam scheduling algorithms such that the network utility, which is defined as a logarithm function of the average throughput of the user equipment, can be maximized. We propose a non-cooperative game-based scheduling approach where the base stations are modeled as players that greedily maximize their own utilities. The Nash Equilibrium (NE) then provides a distributed solution to the network utility maximization problem. By employing the Lyapunov optimization, the asymptotic optimality of the proposed scheduling can be guaranteed. We prove the existence and provide sufficient conditions which guarantee the uniqueness of the NE by establishing an equivalence to the Variational Inequality (VI) problem. We also propose a parallel power adaptation algorithm which is proved to converge to the NE. Numerical results show the superiority of the proposed scheduling over several distributed baseline schemes.

99 GENERAL AND MISCELLANEOUS↗
NASA NTRS1992

The VLBA correlator: Real-time in the distributed era

The correlator is the signal processing engine of the Very Long Baseline Array (VLBA). Radio signals are recorded on special wideband (128 Mb/s) digital recorders at the 10 telescopes, with sampling times controlled by hydrogen maser clocks. The magnetic tapes are shipped to the Array Operations Center in Socorro, New Mexico, where they are played back simultaneously into the correlator. Real-time software and firmware controls the playback drives to achieve synchronization, compute models of the wavefront delay, control the numerous modules of the correlator, and record FITS files of the fringe visibilities at the back-end of the correlator. In addition to the more than 3000 custom VLSI chips which handle the massive data flow of the signal processing, the correlator contains a total of more than 100 programmable computers, 8-, 16- and 32-bit CPUs. Code is downloaded into front-end CPU's dependent on operating mode. Low-level code is assembly language, high-level code is C running under a RT OS. We use VxWorks on Motorola MVME147 CPU's. Code development is on a complex of SPARC workstations connected to the RT CPU's by Ethernet. The overall management of the correlation process is dependent on a database management system. We use Ingres running on a Sparcstation-2. We transfer logging information from the database of the VLBA Monitor and Control System to our database using Ingres/NET. Job scripts are computed and are transferred to the real-time computers using NFS, and correlation job execution logs and status flow back by the route. Operator status and control displays use windows on workstations, interfaced to the real-time processes by network protocols. The extensive network protocol support provided by VxWorks is invaluable. The VLBA Correlator's dependence on network protocols is an example of the radical transformation of the real-time world over the past five years. Real-time is becoming more like conventional computing. Paradoxically, 'conventional' computing is also adopting practices from the real-time world: semaphores, shared memory, light-weight threads, and concurrency. This appears to be a convergence of thinking.

Wells, D. C.↗
NASA NTRS1992

Essentially nonoscillatory postprocessing filtering methods

High order accurate centered flux approximations used in the computation of numerical solutions to nonlinear partial differential equations produce large oscillations in regions of sharp transitions. Here, we present a new class of filtering methods denoted by Essentially Nonoscillatory Least Squares (ENOLS), which constructs an upgraded filtered solution that is close to the physically correct weak solution of the original evolution equation. Our method relies on the evaluation of a least squares polynomial approximation to oscillatory data using a set of points which is determined via the ENO network. Numerical results are given in one and two space dimensions for both scalar and systems of hyperbolic conservation laws. Computational running time, efficiency, and robustness of method are illustrated in various examples such as Riemann initial data for both Burgers' and Euler's equations of gas dynamics. In all standard cases, the filtered solution appears to converge numerically to the correct solution of the original problem. Some interesting results based on nonstandard central difference schemes, which exactly preserve entropy, and have been recently shown generally not to be weakly convergent to a solution of the conservation law, are also obtained using our filters.

Lafon, F.↗
DOE OSTI2023

Overlapping Domain Coupling of Multidimensional and System Codes in NEAMS - Pronghorn and SAM

This report describes the implementation and testing of domain-overlapping coupling of the Pronghorn and SAM codes. Both Pronghorn and SAM are codes developed by the DOE Nuclear Energy Advanced Modeling and Simulation (NEAMS) program for analysis of advanced nuclear reactors. Pronghorn focuses on analyzing multi-dimensional core flow conditions, while SAM focuses on analysis of the entire system including, among other components, piping, pumps, and heat exchangers. It is desirable for many advanced reactor thermal-hydraulics simulations to couple Pronghorn and SAM to obtain self-consistent solutions in the core and the system. The domain-overlapping coupling approach provides a robust and numerically efficient candidate for this coupling. We describe the algorithm for obtaining self-consistent solutions between a SAM network of flow channels and an overlapped multi-dimensional Pronghorn domain. The algorithm is tested for a variety of simple canonical test problems and a model of the Molten Salt Reactor Experiment (MSRE). Results demonstrate that the domain overlapping coupling approach provides consistent pressure, mass flow rate, enthalpy, and passive scalar distributions between Pronghorn and SAM and converges reliably and efficiently (at most 15 iterations, usually much less than 10) for the considered test problems.

97 MATHEMATICS AND COMPUTING↗