Search NASA⌕ Search

SEARCH · Search NASA

Results for “Iterative algorithms”

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

Kinetics Measurements in Resistive Electrolytes Using Ring-Disk Electrode: Ring as Current “Shield” Enables Uniform Disk Current Distribution

Rotating disk electrodes are commonly used for electrochemical kinetics measurements. A major disadvantage of these types of electrodes is their nonuniform secondary current distribution, especially when performing electroanalytical measurements in resistive electrolytes. Such nonuniform current distribution can render the values of kinetics constants extracted from the disk electrode to be highly inaccurate. Furthermore, one emerging class of electrolytes that suffer from low ionic conductivities is deep eutectic solvents (DES). DES are a promising class of electrolytes for various emerging applications; however, due to their resistive nature, the secondary current distribution when using them is typically highly nonuniform. For example, the Wagner number when measuring Cu²⁺/Cu⁺ kinetics in choline chloride–ethylene glycol DES (1:4 molar ratio of ChCl:EG) is very low (<0.1), indicating highly nonuniform current distribution over the disk electrode. We show here that the Cu²⁺/Cu⁺ exchange current density measured using disk electrodes is very inaccurate due to the aforementioned nonuniform current distribution. To obtain uniform disk current distribution, we employ here a coplanar concentric rotating ring-disk electrode (RRDE), where the ring serves the function of a current “shield.” Specifically, we show using modeling that the ring minimizes the current distribution nonuniformity at the disk by effectively shielding the disk against current spikes near the disk edge. This enables improved precision in electrode kinetics measurements for the Cu²⁺/Cu⁺ couple in resistive DES. To enable broad applicability of this technique, an analytical expression based on the Wagner number is integrated into an iterative algorithm to help users identify ring conditions to achieve uniform current distribution and thus improved electroanalytics at the disk.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Temporal X-ray Reconstruction using Temporal and Spectral Measurements at LCLS

Transverse deflecting structures (TDSs) are widely used in accelerator physics to measure the longitudinal density of particle bunches. When used in combination with a dispersive section, the whole longitudinal phase space density can be imaged. At the Linac Coherent Light Source (LCLS), the installation of such a device downstream of the undulators enables the reconstruction of the X-ray temporal intensity profile by comparing longitudinal phase space distributions with lasing on and lasing off. However, the resolution of this TDS is limited to around 1 fs rms (root mean square), and therefore, it is not possible to resolve single self-amplified spontaneous emission (SASE) spikes within an X-ray photon pulse. By combining the power spectrum from a high resolution photon spectrometer and the temporal structure from the TDS, the overall resolution is enhanced, thus allowing the observation of temporal, single SASE spikes. The combined data from the spectrometer and the TDS is analysed using an iterative algorithm to obtain the actual intensity profile. In this paper, we present some improvements to the reconstruction algorithm as well as real data taken at LCLS.

47 OTHER INSTRUMENTATION↗

Surface enrichment dictates block copolymer orientation

Orientation of block copolymer (BCP) morphology in thin films is critical to applications as nanostructured coatings. Despite being well-studied, the ability to control BCP orientation across all possible block constituents remains challenging. Here, in this study, we deploy coarse-grained molecular dynamics simulations to study diblock copolymer ordering in thin films, focusing on chain makeup, substrate surface energy, and surface tension disparity between the two constituent blocks. We explore the multi-dimensional parameter space of ordering using a machine-learning approach, where an autonomous loop using a Gaussian process (GP) control algorithm iteratively selects high-value simulations to compute. The GP kernel was engineered to capture known symmetries. The trained GP model serves as both a complete map of system response, and a robust means of extracting material knowledge. We demonstrate that the vertical orientation of BCP phases depends on several counter-balancing energetic contributions, including entropic and enthalpic material enrichment at interfaces, distortion of morphological objects through the film depth, and of course interfacial energies. BCP lamellae are found more resistant to these effects, and thus more robustly form vertical orientations across a broad range of conditions; while BCP cylinders are found to be highly sensitive to surface tension disparity.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Modeling the co-assembly of binary nanoparticles

Abstract In this work, we present a binary assembly model that can predict the co-assembly structure and spatial frequency spectra of monodispersed nanoparticles with two different particle sizes. The approach relies on an iterative algorithm based on geometric constraints, which can simulate the assembly patterns of particles with two distinct diameters, size distributions, and at various mixture ratios on a planar surface. The two-dimensional spatial-frequency spectra of the modeled assembles can be analyzed using fast Fourier transform analysis to examine their frequency content. The simulated co-assembly structures and spectra are compared with assembled nanoparticles fabricated using transfer coating method are in qualitative agreement with the experimental results. The co-assembly model can also be used to predict the peak spatial frequency and the full-width at half-maximum bandwidth, which can lead to the design of the structure spectra by selection of different monodispersed particles. This work can find applications in fabrication of non-periodic nanostructures for functional surfaces, light extraction structures, and broadband nanophotonics.

Mohanty, Saurav (ORCID:0009000302592855)↗

Deblurring galaxy images with Tikhonov regularization on magnitude domain

Abstract We propose a regularization-based deblurring method that works efficiently for galaxy images. The spatial resolution of a ground-based telescope is generally limited by seeing conditions and is much worse than space-based telescopes. This circumstance has generated considerable research interest in the restoration of spatial resolution. Since image deblurring is a typical inverse problem and often ill-posed, solutions tend to be unstable. To obtain a stable solution, much research has adopted regularization-based methods for image deblurring, but the regularization term is not necessarily appropriate for galaxy images. Although galaxies have an exponential or Sérsic profile, the conventional regularization assumes the image profiles to behave linearly in space. The significant deviation between the assumption and real situations leads to blurring of the images and smoothing out the detailed structures. Clearly, regularization on logarithmic domain, i.e., magnitude domain, should provide a more appropriate assumption, which we explore in this study. We formulate a problem of deblurring galaxy images by an objective function with a Tikhonov regularization term on a magnitude domain. We introduce an iterative algorithm minimizing the objective function with a primal–dual splitting method. We investigate the feasibility of the proposed method using simulation and observation images. In the simulation, we blur galaxy images with a realistic point spread function and add both Gaussian and Poisson noise. For the evaluation with the observed images, we use galaxy images taken by the Subaru HSC-SSP. Both of these evaluations show that our method successfully recovers the spatial resolution of the deblurred images and significantly outperforms the conventional methods. The code is publicly available from the GitHub 〈https://github.com/kzmurata-astro/PSFdeconv_amag〉.

Murata, Kazumi↗

Testing $f(R)$ gravity with scale dependent cosmic void velocity profiles

Here, we study the impact of cosmological scale modifications to general relativity on the dynamics of halos within voids by comparing N-body simulations incorporating Hu-Sawicki f(R) gravity, with |f R0 | = 10 -6 and 10 -5 , to those of Λ CDM. By examining the radial velocity statistics within voids classified based on their size and density-profile, as “rising” (R-type) or “shell” (S-type), we find that halo motions in small R-type voids, with effective radius <15 Mpc/h, reveal distinctive differences between f(R) and Λ CDM cosmologies. To understand this observed effect, we study the linear and nonlinear fifth forces, and develop an iterative algorithm to accurately solve the nonlinear fifth force equation. We use this to characterize the Chameleon screening mechanism in voids and contrast the behavior with that observed in gravitationally collapsed objects. The force analysis underscores how smaller R-type voids exhibit the highest ratios of fifth force to Newtonian force, which source distinguishable differences in the velocity profiles and thereby provide rich environments in which to constrain gravity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Iterative Bragg peak removal on X-ray absorption spectra with automatic intensity correction

This study introduces a novel iterative Bragg peak removal with automatic intensity correction (IBR-AIC) methodology for X-ray absorption spectroscopy (XAS), specifically addressing the challenge of Bragg peak interference in the analysis of crystalline materials. The approach integrates experimental adjustments and sophisticated post-processing, including an iterative algorithm for robust calculation of the scaling factor of the absorption coefficients and efficient elimination of the Bragg peaks, a common obstacle in accurately interpreting XAS data, particularly in crystalline samples. The method was thoroughly evaluated on dilute catalysts and thin films, with fluorescence mode and large-angle rotation. The results underscore the technique's effectiveness, adaptability and substantial potential in improving the precision of XAS data analysis. While demonstrating significant promise, the method does have limitations related to signal-to-noise ratio sensitivity and the necessity for meticulous angle selection during experimentation. Overall, IBR-AIC represents a significant advancement in XAS, offering a pragmatic solution to Bragg peak contamination challenges, thereby expanding the applications of XAS in understanding complex materials under diverse experimental conditions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Mapping Arbitrarily Sparse Two-body Interactions on One-dimensional Quantum Circuits

We consider an assignment problem arising in Fermionic-swap based mapping of the one-body and two-body interaction terms in simulating time evolution of a sparse second-quantized electronic structure Hamiltonian on a quantum computer. Relative efficiency of different swap networks depends on the relative costs of performing a swap layer and computing a Hamiltonian interaction term. Under the assumption that the interaction term cost dominates the computation, we develop an iterative algorithm that uses hypergraph optimal linear arrangement (HOLA) and partial distance-2 coloring to exploit arbitrary sparsity in the Hamiltonian for efficient computation using swap networks. Using a set of 122 problems from computational chemistry, we demonstrate performance improvements up to 100% relative to the state-of-the-art approaches for one-body terms and up to 86% utilization for two-body terms relative to a theoretical peak utilization. To the best of our knowledge, this is the first study to exploit arbitrary sparsity in orbital interactions for efficient computation on one-dimensional qubit connectivity layouts. The proposed algorithms form the basis for extension to map general k-body interactions that arise in other domains onto generalized qubit connectivity layouts.

quantum computing, Combinatorial Optimization, hyp↗

Multi-Area Model-Free State Estimation via Distributed Tensor Decomposition

This paper proposes a model-free method for distribution system state estimation based on tensor completion using canonical polyadic decomposition. In particular, we consider a setting where the network is divided into multiple areas. The measured physical quantities at buses located in the same area are processed by an area controller. A third-order tensor is constructed to collect these measured quantities. The measurements are analyzed locally to recover the full state information of the network. A closed-form iterative algorithm based on the alternating direction method of multipliers is developed to obtain the low-rank factors of the whole network state tensor where information exchange happens only between neighboring areas. To demonstrate the efficacy of the developed algorithm, numerical simulations are carried out using an IEEE test system.

alternating direction method of multipliers↗

Advancing the Frontiers of Deep Learning for Low-Dose 3D Cone-Beam CT Reconstruction

X-ray computed tomography (CT) is an important noninvasive medical imaging modality for studying the structural details of internal organs. Image reconstruction in CT is an inverse problem of recovering an object's internal structure from the absorption profile of X-ray beams (sinogram) measured using a detector. The classical variational approach for CT reconstruction minimizes an energy functional using an appropriate iterative algorithm. Motivated by the success of deep learning (DL), researchers have begun to leverage training data and enhanced computing capabilities in recent years to produce high-fidelity reconstructed images. Nonetheless, much of the academic research in DL algorithms for CT has focused primarily on the two-dimensional setting (with simplified forward operators and noise model) for proofs-of-concept, and a comprehensive benchmarking of various classical and data-driven CT reconstruction approaches has not beenundertaken. The key objective of our CT reconstruction grand challenge was to promote methodological advancements for both classical and DL-based approaches for clinical CT with a reasonably accurately simulated 3D CT forward operator and noise model. We have utilized the publicly available LIDC-IDRI dataset and simulated sinograms and FDK images corresponding to two dose levels (clinical- and low-dose, constituting two tracks of the challenge) starting from the normal-dose images as the ground truth. In this paper, we summarize the motivation, context, and results of our challenge, and highlight the future research directions in DL for clinical CT.

X-ray tomography↗

Uncertainty-Proof Hosting Capacity with Surrogate Affine Policy

Physical constraints must be enforced when dis-tributed energy resources, such as PV, are integrated into distribution network. Hosting capacity (HC) is thus introduced to define the maximum renewable that distribution system can accommodate. When the grid is further pushed towards low-carbon, many research efforts are devoted to increasing HC. Security and cost-efficiency become even more important in determining HC. This work proposes an uncertainty-proof HC with surrogate affine policy. Flexible resources are leveraged to increase HC. We propose a novel hybrid two-stage AC model with variable uncertainty set. An iterative algorithm is designed to solve the problem. The proposed model and solution approach are validated in modified 141-node feeders, and HC performance is also analyzed.

hosting capacity↗

Impacts of floating-point non-associativity on reproducibility for HPC and deep learning applications

Run to run variability in parallel programs caused by floating-point non-associativity has been known to significantly affect reproducibility in iterative algorithms, due to accumulating errors. Non-reproducibility can critically affect the efficiency and effectiveness of correctness testing for stochastic programs. Recently, the sensitivity of deep learning training and inference pipelines to floating-point non-associativity has been found to sometimes be extreme. It can prevent certification for commercial applications, accurate assessment of robustness and sensitivity, and bug detection. New approaches in scientific computing applications have coupled deep learning models with high-performance computing, leading to an aggravation of debugging and testing challenges. Here we perform an investigation of the statistical properties of floating-point non-associativity within modern parallel programming models, and analyze performance and productivity impacts of replacing atomic operations with deterministic alternatives on GPUs. We examine the recently-added deterministic options in PyTorch within the context of GPU deployment for deep learning, uncovering and quantifying the impacts of input parameters triggering run to run variability and reporting on the reliability and completeness of the documentation. Finally, we evaluate the strategy of exploiting automatic determinism that could be provided by deterministic hardware, using the Groq LPUTM accelerator for inference portions of the deep learning pipeline. We demonstrate the benefits that a hardware-based strategy can provide within reproducibility and correctness efforts.

Shanmugavelu, Sanjif↗

A Theoretical Approach for Reliability Within Information Supply Chains With Cycles and Negations

Complex networks of information processing systems, or information supply chains, present challenges for performance analysis. Here, we establish a mathematical setting, in which a process within an information supply chain can be analyzed in terms of the functionality of the system’s components. Principles of this methodology are rigorously defended and induce a model for determining the reliability for the various products in these networks. Our model does not limit us from having cycles in the network, as long as the cycles do not contain negation. It is shown that our approach to reliability resolves the nonuniqueness caused by cycles in a probabilistic Boolean network. An iterative algorithm is given to find the reliability values of the model, using a process that can be fully automated. This automated method of discerning reliability is beneficial for systems managers. As a systems manager considers systems modification, such as the replacement of owned and maintained hardware systems with cloud computing resources, the need for comparative analysis of system reliability is paramount. The model is extended to handle conditional knowledge about the network, allowing one to make predictions of weaknesses in the system. Finally, to illustrate the model’s flexibility over different forms, it is demonstrated on a system of components and subcomponents.

97 MATHEMATICS AND COMPUTING↗

Multiarea Distribution System State Estimation via Distributed Tensor Completion

Here, this paper proposes a model-free distribution system state estimation method based on tensor completion using canonical polyadic decomposition. In particular, we consider a setting where the network is divided into multiple areas. The measured physical quantities at buses located in the same area are processed by an area controller. A three-way tensor is constructed to collect these measured quantities. The measurements are analyzed locally to recover the full state information of the network. A distributed closed-form iterative algorithm based on the alternating direction method of multipliers is developed to obtain the low-rank factors of the whole network state tensor where information exchange happens only between neighboring areas. The convergence properties of the distributed algorithm and the sufficient conditions on the number of samples for each smaller network that guarantee the identifiability of the factors of the state tensor are presented. To demonstrate the efficacy of the proposed algorithm and to check the identifiability conditions, numerical simulations are carried out using the IEEE 123-bus system and a large-scale real utility feeder.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Effects of Aluminum Plate Initial Residual Stress on Machined-Part Distortion

Dimensional tolerances for high-speed-machined aluminum products continue to tighten due to the demand for automated assembly of complex monolithic parts in aerospace and other industries. Understanding the contribution of inherent residual stress in wrought Al 7050-T7451 plate, common in aircraft manufacture, to distortion of high-aspect-ratio machined parts is critical but remains problematic due to the alloy's low residual stress magnitude over large geometries. Prior investigations into residual stress effects on machined part distortion suffer inadequate characterizations of the wrought material stress field, either because of low fidelity due to “slitting” methods, confounding effects in machined-layer removal methods, or small sample size when using neutron diffraction (ND). In this work, inherent residual stress is measured via ND at 860 locations in a 90.5 mm thick Al 7050-T7451 plate having dimensions 399 mm in the rolling direction and 335 mm in the transverse direction. Unlike prior studies, the ND residual stress is reconstructed using an iterative algorithm to ensure fully compatible, equilibrated 3D field prior to examining its effect on distortion. Further, the findings from simulations and experiments show that inherent residual stress alone could distort a high-aspect-ratio part beyond aerospace industry requirements, that slitting measurements may not sufficiently characterize residual stress for predicted distortion, and that parts machined from different plate thickness locations could exhibit reversed distortion patterns. Thus, research into distortion prediction that considers machining should carefully characterize and reconstruct inherent residual stress so that the coupled machining effects are accurately modeled.

36 MATERIALS SCIENCE↗

Randomized probe imaging through deep k-learning

Randomized probe imaging (RPI) is a single-frame diffractive imaging method that uses highly randomized light to reconstruct the spatial features of a scattering object. The reconstruction process, known as phase retrieval, aims to recover a unique solution for the object without measuring the far-field phase information. Typically, reconstruction is done via time-consuming iterative algorithms. In this work, we propose a fast and efficient deep learning based method to reconstruct phase objects from RPI data. The method, which we call deep k-learning, applies the physical propagation operator to generate an approximation of the object as an input to the neural network. This way, the network no longer needs to parametrize the far-field diffraction physics, dramatically improving the results. Deep k-learning is shown to be computationally efficient and robust to Poisson noise. The advantages provided by our method may enable the analysis of far larger datasets in photon starved conditions, with important applications to the study of dynamic phenomena in physical science and biological engineering.

Guo, Zhen (ORCID:0000000213473451)↗

Physics-assisted generative adversarial network for X-ray tomography

X-ray tomography is capable of imaging the interior of objects in three dimensions non-invasively, with applications in biomedical imaging, materials science, electronic inspection, and other fields. The reconstruction process can be an ill-conditioned inverse problem, requiring regularization to obtain satisfactory results. Recently, deep learning has been adopted for tomographic reconstruction. Unlike iterative algorithms which require a distribution that is known a priori , deep reconstruction networks can learn a prior distribution through sampling the training distributions. In this work, we develop a Physics-assisted Generative Adversarial Network (PGAN), a two-step algorithm for tomographic reconstruction. In contrast to previous efforts, our PGAN utilizes maximum-likelihood estimates derived from the measurements to regularize the reconstruction with both known physics and the learned prior. Compared with methods with less physics assisting in training, PGAN can reduce the photon requirement with limited projection angles to achieve a given error rate. The advantages of using a physics-assisted learned prior in X-ray tomography may further enable low-photon nanoscale imaging.

47 OTHER INSTRUMENTATION↗

Information content of and the ability to reconstruct dichroic X-ray tomography and laminography

Dichroic tomography is a 3D imaging technique in which the polarization of the incident beam is used to induce contrast due to the magnetization or orientation of a sample. The aim is to reconstruct not only the optical density but the dichroism of the sample. The theory of dichroic tomographic and laminographic imaging in the parallel-beam case is discussed as well as the problem of reconstruction of the sample’s optical properties. The set of projections resulting from a single tomographic/laminographic measurement is not sufficient to reconstruct the magnetic moment for magnetic circular dichroism unless additional constraints are applied or data are taken at two or more tilt angles. For linear dichroism, three polarizations at a common tilt angle are insufficient for unconstrained reconstruction. However, if one of the measurements is done at a different tilt angle than the other, or the measurements are done at a common polarization but at three distinct tilt angles, then there is enough information to reconstruct without constraints. Possible means of applying constraints are discussed. Furthermore, it is shown that for linear dichroism, the basic assumption that the absorption through a ray path is the integral of the absorption coefficient, defined on the volume of the sample, along the ray path, is not correct when dichroism or birefringence is strong. This assumption is fundamental to tomographic methods. An iterative algorithm for reconstruction of linear dichroism is demonstrated on simulated data.

Marcus, Matthew A. (ORCID:0000000325277586)↗