Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iterative”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,333 records · Page 74
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

An iterative CMB lensing estimator minimizing instrumental noise bias

Noise maps from cosmic microwave background (CMB) experiments are generally statistically anisotropic, due to scanning strategies, atmospheric conditions, or instrumental effects. Any mismodeling of this complex noise can bias the reconstruction of the lensing potential and the measurement of the lensing power spectrum from the observed CMB maps. We introduce a new CMB lensing estimator based on the maximum (MAP) reconstruction that is minimally sensitive to these instrumental noise biases. By modifying the likelihood to rely exclusively on correlations between CMB map splits with independent noise realizations, we minimize autocorrelations that contribute to biases. In the regime of many independent splits, this maximum closely approximates the optimal MAP reconstruction of the lensing potential. In simulations, we demonstrate that this method is able to determine lensing observables that are immune to any noise mismodeling with a negligible cost in signal-to-noise ratio. Our estimator enables unbiased and nearly optimal lensing reconstruction for next-generation CMB surveys.

Legrand, Louis [University of Cambridge (United Ki↗
DOE OSTI2017

Approximate Computing Techniques for Iterative Graph Algorithms

Approximate computing enables processing of large-scale graphs by trading off quality for performance. Approximate computing techniques have become critical not only due to the emergence of parallel architectures but also the availability of large scale datasets enabling data-driven discovery. Using two prototypical graph algorithms, PageRank and community detection, we present several approximate computing heuristics to scale the performance with minimal loss of accuracy. We present several heuristics including loop perforation, data caching, incomplete graph coloring and synchronization, and evaluate their efficiency. We demonstrate performance improvements of up to 83% for PageRank and up to 450x for community detection, with low impact of accuracy for both the algorithms. We expect the proposed approximate techniques will enable scalable graph analytics on data of importance to several applications in science and their subsequent adoption to scale similar graph algorithms.

Panyala, Ajay R.↗
DOE OSTI2023

A Model Calibration Method for Grid-Forming Inverters Using Iterative Bayesian Optimization

As inverter-based resources (IBRs) are rapidly deployed, especially at the distribution and microgrid levels, the need to include their accurate representations in power systems models increases. With well-calibrated models, IBR-interactions can be examined, preventing any stability and operational issues, especially in islanded systems. This paper proposes a method to calibrate generic inverter models using Bayesian optimization, but with a parameter-grouping approach to improve speed and accuracy. This approach is illustrated for a grid-forming inverter using synthetic data and field measurements from a simple IBRbased microgrid. Tests show that the calibration algorithm has modest computation cost and is robust to noisy measurements..

Biswas, Shuchismita↗