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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

An implicit barotropic mode solver for MPAS-ocean using a modern Fortran solver interface

Here, we demonstrate use of a modern Fortran solver interface to manage solver algorithms for an implicit barotropic mode solver in the Model for Predictions Across Scales-Ocean (MPAS-O). ForTrilinos, a Fortran interface to Trilinos that contains a large collection of solver capabilities written in C++, has been implemented in MPAS-O to provide access to a suite of linear solver options. By virtue of the simplified wrapper and interface generator (SWIG) automation tool that generates modern Fortran interfaces to C++ code, we were able to implement the Fortran solver interface in MPAS-O using a familiar Fortran coding style while minimizing performance degradation. The ForTrilinos solver interface is written within MPAS-O’s time stepping modules as a subroutine in conjunction with MPAS-O code. Applied to an idealized ocean and a high-resolution realistic ocean test case, parallel performance of ForTrilinos solvers is examined. It is found that parallel scalability of the ForTrilinos solvers is highly dependent on the number of global synchronization points per solver iteration in each iterative solver algorithm. ForTrilinos solvers perform best compared to the Fortran hand-crafted (FHC) solver when the amount of work per processor is large enough. However, parallel scalability is better with the FHC solver and so when the work per core is modest FHC outperforms ForTrilinos. The intercomparison between the ForTrilinos and FHC solvers reveals that this performance hit in the ForTrilinos solver mostly comes from the global synchronization process, while suggesting that the matrix-vector multiplication process in the FHC solver needs to be optimized for better performance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Reconstructing magnetic deflections from sets of proton images using differential evolution

Proton imaging is a powerful technique for imaging electromagnetic fields within an experimental volume, in which spatial variations in proton fluence are a result of deflections to proton trajectories due to interaction with the fields. When deflections are large, proton trajectories can overlap, and this nonlinearity creates regions of greatly increased proton fluence on the image, known as caustics. The formation of caustics has been a persistent barrier to reconstructing the underlying fields from proton images. We have developed a new method for reconstructing the path-integrated magnetic fields, which begins to address the problem posed by caustics. Our method uses multiple proton images of the same object, each image at a different energy, to fill in the information gaps and provide some uniqueness when reconstructing caustic features. We use a differential evolution algorithm to iteratively estimate the underlying deflection function, which accurately reproduces the observed proton fluence at multiple proton energies simultaneously. We test this reconstruction method using synthetic proton images generated for three different, cylindrically symmetric field geometries at various field amplitudes and levels of proton statistics and present reconstruction results from a set of experimental images. Here, the method we propose requires no assumption of deflection linearity and can reliably solve for fields underlying linear, nonlinear, and caustic proton image features for the selected geometries and is shown to be fairly robust to noise in the input proton intensity.

47 OTHER INSTRUMENTATION↗
NASA NTRS1994

Methodology for sensitivity analysis, approximate analysis, and design optimization in CFD for multidisciplinary applications

The straightforward automatic-differentiation and the hand-differentiated incremental iterative methods are interwoven to produce a hybrid scheme that captures some of the strengths of each strategy. With this compromise, discrete aerodynamic sensitivity derivatives are calculated with the efficient incremental iterative solution algorithm of the original flow code. Moreover, the principal advantage of automatic differentiation is retained (i.e., all complicated source code for the derivative calculations is constructed quickly with accuracy). The basic equations for second-order sensitivity derivatives are presented; four methods are compared. Each scheme requires that large systems are solved first for the first-order derivatives and, in all but one method, for the first-order adjoint variables. Of these latter three schemes, two require no solutions of large systems thereafter. For the other two for which additional systems are solved, the equations and solution procedures are analogous to those for the first order derivatives. From a practical viewpoint, implementation of the second-order methods is feasible only with software tools such as automatic differentiation, because of the extreme complexity and large number of terms. First- and second-order sensitivities are calculated accurately for two airfoil problems, including a turbulent flow example; both geometric-shape and flow-condition design variables are considered. Several methods are tested; results are compared on the basis of accuracy, computational time, and computer memory. For first-order derivatives, the hybrid incremental iterative scheme obtained with automatic differentiation is competitive with the best hand-differentiated method; for six independent variables, it is at least two to four times faster than central finite differences and requires only 60 percent more memory than the original code; the performance is expected to improve further in the future.

Taylor, Arthur C., III↗
DOE OSTI2021

An uncertainty-focused database approach to extract spatiotemporal trends from qualitative and discontinuous lake-status histories

Changes in lake status are often interpreted as palaeoclimate indicators due to their dependence on precipitation and evaporation. The Global Lake Status Database (GLSDB) has since long provided a standardised synopsis of qualitative lake status over the last 30,000 14C years. Potential sources of uncertainty however are not recorded in the GLSDB. Here we present an updated and improved relational-database framework that incorporates uncertainty in both chronology and the interpretation of palaeoenvironmental data. The database uses peer-reviewed palaeolimnological studies to produce a consensus on qualitative lake-status histories, whose chronologies are revised and standardized through the recalibration of radiocarbon dates and the application of Bayesian age-depth modelling for stratigraphic archives. Quantitative information on absolute water-level elevation is preserved if available from geomorphological sources. We also propose a new probabilistic analytical framework that accounts for these uncertainties to reconstruct synoptic, integrated environmental signals. The process is based on a Monte Carlo algorithm that iteratively samples individual lake-status histories within the limits of their uncertainties to produce many possible scenarios. We then use Recursively-Subtracted Empirical Orthogonal Function analysis to extract dominant patterns of lake-status variability from these scenarios. As a proof of concept, we apply this framework to 67 sites in eastern and southern Africa whose lake-status histories cover part of the late Pleistocene and/or Holocene. We show that, despite the sometimes large temporal and interpretation uncertainties, and the inclusion of highly discontinuous lake-status time series, identifying the major known millennial-scale climatic phases during the last 20,000 years is possible. Our framework was also able to identify an antiphased response between the lake basins in eastern and interior southern Africa to these changes. Here, we propose that our new database and methodology framework serves as a template for efficient lake-status data synthesis, encourages the incorporation of lake-status data in palaeoclimate syntheses, and expands the possibilities for the use of such data in the evaluation of climate models.

58 GEOSCIENCES↗
DOE OSTI2026

Adsorption Hysteresis Under Control: Tuning Host–Guest Interactions via a Genetic Algorithm

Mesoporous adsorbent materials offer a large volumetric capacity; however, cyclic adsorption/desorption processes in these systems often suffer from hysteresis and may require a significant pressure swing to access this capacity. To mitigate hysteresis, a proposed strategy is to include nucleation sites on the walls of the mesoporous material to facilitate droplet and bubble formation, lowering the free energy barriers to the respective phase transitions. It is unclear, however, what combination of adsorbate− adsorbent interactions and spatial patterning would be beneficial for a given application, considering that improvements to some sorption properties may come at the expense of other attributes. To understand these interconnected observables, we examine two model systems, planar-slit and cylindrical pores with tunable interaction sites, using GPU-accelerated transition matrix Monte Carlo simulations. The simulations provide a free energy map of the pressure−adsorption space in a matter of minutes, which we use to track adsorption isotherm characteristics as a function of adsorbent properties. We then leverage the rapid acquisition of simulation data to construct a genetic algorithm to iteratively modify interaction sites of the slit-pore wall to minimize the hysteresis of this system without sacrificing uptake. We find that the adsorption branch of the isotherm is easily modulated via the average host−guest interaction strength, but desorption is only adjustable if there is a suitable bubble nucleation site. Within the context of a slit-pore system, we identify relative interaction strengths and patch sizes required to gain control over both branches of the hysteresis loop.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Reinforcement learning for real-time process control in high-temperature superconductor manufacturing

With high efficiency and low energy loss, high-temperature superconductors (HTS) have demonstrated their profound applications in various fields, such as medical imaging, transportation, accelerators, microwave devices, and power systems. The high-field applications of HTS tapes have raised the demand for producing cost-effective tapes with long lengths in superconductor manufacturing. However, achieving the uniform and enhanced performance of a long HTS tape is challenging due to the unstable growth conditions in the manufacturing process. Although it is confirmed that the process parameters during the advanced metal organic chemical vapor deposition (A-MOCVD) process influence the uniformity of the produced HTS tapes, the high-dimensional process parameter signals and their complicated interactions make it difficult to develop an effective control policy. In this paper, we propose a local measure for the uniformity of HTS tapes to provide instant feedback for our control policy. Then, we model the manufacturing of HTS tapes as a Markov decision process (MDP) with continuous state and action spaces to assess the instant reward in real time in our feedback control model. As our MDP involves continuous and high-dimensional state and action spaces, a neural fitted Q-iteration (NFQ) algorithm is adopted to solve the MDP with artificial neural network (ANN) function approximation. The collinearity of process parameters can restrict our capability of adjusting the process parameters, which is addressed by the principal component analysis (PCA) in our method. The control policy adjusts the PCA of process parameters using the NFQ algorithm. In conclusion, based on our case studies on real A-MOCVD dataset, the obtained control policy increases the average uniformity of tapes by 5.6% and performs especially well on sample HTS tapes with a low uniformity.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Application of HRGS for forensic characterization of uranium oxides, pure uranium metals and uranium alloys

A nondestructive iterative method for uranium-bearing material characterization with HRGS developed earlier in (J. appl. Rad. Isotopes, 166 (2020) 109433) is applied to determine matrix densities and uranium isotope masses of a variety of uranium materials, namely uranium ore, UO 2 and U 3 O 8 powders, fuel elements in the form of UO2 microspheres, uranium metal and uranium alloys. It is shown that U 3 O 8 powders with uranium mass fraction of about 84% can be distinguished from the powders of UO 2 with uranium mass fraction of about 87%; uranium products in the form of liquid or loose powder with matrix density of 0.5-2.0 g/cm 3 can be distinguished from uranium products in the form of compacted fuel elements with matrix density of 6.0-10.0 g/cm 3 and from pure metal uranium and uranium alloys with matrix density of 14.0- 19.0 g/cm 3 . In fuel microspheres based on UO2 the uranium mass fraction 88.02% measured by HRGS is consistent, within the measurement uncertainties, with the results of isotope dilution mass spectrometry 87.76±0.64 % and also is confirmed by X-ray diffraction technique. The uranium mass fraction of the uranium ore estimated as 0.08% by HRGS is consistent, within the measurement uncertainties, with the value 0.09±0.01% determined with WDXRF. Densities of two different uranium metal samples, estimated as 18.42 g/cm 3 and 19.33 g/cm 3 by HRGS are consistent with values 18.24±0.55 g/cm 3 and 18.86±0.59 g/cm 3 , respectively, obtained by the gas pycnometry technique.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2024

T RI M E ++: Multi-threaded triangular meshing in two dimensions

We present T RI M E ++, a multi-threaded software library designed for generating two-dimensional meshes for intricate geometric shapes using the Delaunay triangulation. Multi-threaded parallel computing is implemented throughout the meshing procedure, making it suitable for fast generation of large-scale meshes. Three iterative meshing algorithms are implemented: the DistMesh algorithm, the centroidal Voronoi diagram meshing, and a hybrid of the two. We compare the performance of the three meshing methods in T RI M E ++, and show that the hybrid method retains the advantages of the other two. The software library achieves significant parallel speedup when generating large-scale meshes containing between 10 4 to 10 7 points. T RI M E ++ can handle complicated geometries and generates adaptive meshes of high quality.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Compact spectroscopy of keV to MeV X-rays from a laser wakefield accelerator

We reconstruct spectra of secondary X-rays from a tunable 250–350 MeV laser wakefield electron accelerator from single-shot X-ray depth-energy measurements in a compact (7.5 × 7.5 × 15 cm), modular X-ray calorimeter made of alternating layers of absorbing materials and imaging plates. X-rays range from few-keV betatron to few-MeV inverse Compton to > 100 MeV bremsstrahlung emission, and are characterized both individually and in mixtures. Geant4 simulations of energy deposition of single-energy X-rays in the stack generate an energy-vs-depth response matrix for a given stack configuration. An iterative reconstruction algorithm based on analytic models of betatron, inverse Compton and bremsstrahlung photon energy distributions then unfolds X-ray spectra, typically within a minute. We discuss uncertainties, limitations and extensions of both measurement and reconstruction methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

High-level coupled-cluster energetics by merging moment expansions with selected configuration interaction

Inspired by our earlier semi-stochastic work aimed at converging high-level coupled-cluster (CC) energetics, we propose a novel form of the CC(P; Q) theory in which the stochastic Quantum Monte Carlo propagations, used to identify dominant higher-than-doubly excited determinants, are replaced by the selected configuration interaction (CI) approach using the perturbative selection made iteratively (CIPSI) algorithm. The advantages of the resulting CIPSI-driven CC(P; Q) methodology are illustrated by a few molecular examples, including the dissociation of F 2 and the automerization of cyclobutadiene, where we recover the electronic energies corresponding to the CC calculations with a full treatment of singles, doubles, and triples based on the information extracted from compact CI wave functions originating from relatively inexpensive Hamiltonian diagonalizations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Static and dynamic magnetic properties of honeycomb lattice antiferromagnets Na 2 M 2 TeO 6 , M = Co and Ni

The magnetic structures and spin dynamics of Na 2 CO 2 TeO 6 and Na 2 Ni 2 TeO 6 are investigated by means of elastic and inelastic neutron scattering measurements and the results are discussed in the context of a generalized Kitaev-Heisenberg model on a honeycomb lattice with strong spin-orbit coupling. The large number of parameters involved in the Hamiltonian model is evaluated by using an iterative optimization algorithm capable of extracting model solutions and simultaneously estimating their uncertainty. The analyses indicate that both Co 2+ (d 7 ) and Ni 2+ (d 8 ) antiferromagnets realize bond-dependent anisotropic nearest-neighbor interactions and support the theoretical predictions for the realization of Kitaev physics in 3 d electron systems with effective spins S = 1/2 and 1. By studying the Na-doped system Na 2.4 Ni 2 TeO 6 , we show that the control of Na content can provide an effective route for fine-tuning the magnetic lattice dimensionality, as well as to controlling the bond-dependent anisotropic interactions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Inversion of Many-Beam Bragg Intensities for Phasing by Iterated Projections: Removal of Multiple Scattering Artifacts from Diffraction Data

An iterated projection algorithm (N-Phaser) is developed that reconstructs a scattering potential from N-beam multiple Bragg scattered intensities. The method may be used to eliminate multiple scattering artifacts from electron diffraction data, solving the phase problem and increasing the thicknesses of samples used in materials science, solid-state chemistry, and small molecule crystallography. For high-energy transmission electron diffraction, we show that the algorithm recovers accurate complex structure factors from a wide range of thicknesses, orientations, and relativistic beam energies, and does not require known thickness or atomic-resolution data if sufficient multiple scattering occurs. Furthermore, extensions to Cryo-electron microscopy and Micro-electron diffraction are suggested.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Reinforcement Learning of Structured Stabilizing Control for Linear Systems With Unknown State Matrix

This paper delves into designing feedback control gains for a continuous-time linear quadratic regulator (LQR) problem that is constrained to certain predefined structure with unknown state matrix. We bring forth the ideas from reinforcement learning (RL) in conjunction with sufficient stability and performance guarantees in order to design these structured gains using the trajectory measurements of states and controls. Here we first formulate a model-based framework using dynamic programming (DP) to embed the structural constraint to the LQR gain computation in the continuous-time setting, and then subsequently, formulate a policy iteration RL algorithm that can alleviate the requirement of known state matrix in conjunction with maintaining the feedback gain structure. The design enables a distributed learning control design which is necessary for many large-scale cyber-physical systems. Theoretical guarantees are provided for stability and convergence of the structured reinforcement learning (SRL) algorithm. We validate our theoretical results with numerical simulations on a multi-agent networked linear time-invariant (LTI) dynamic system.

42 ENGINEERING↗
DOE OSTI2020

Phased: Phase-Aware Submodularity-Based Energy Disaggregation

Energy disaggregation is the task of discerning the energy consumption of individual appliances from aggregated measurements, which holds promise for understanding and reducing energy usage. In this paper, we propose PHASED, an optimization approach for energy disaggregation that has two key features: PHASED (i) exploits the structure of power distribution systems to make use of readily available measurements that are neglected by existing methods, and (ii) poses the problem as a minimization of a difference of sub-modular functions. We leverage this form by applying a discrete optimization variant of the majorization-minimization algorithm to iteratively minimize a sequence of global upper bounds of the cost function to obtain high-quality approximate solutions. PHASED improves the disaggregation accuracy of state-of-the-art models by up to 61% and achieves better prediction on heavy load appliances.

ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATION↗
DOE OSTI2020

mpfit: a robust method for fitting atomic resolution images with multiple Gaussian peaks

The standard technique for sub-pixel estimation of atom positions from atomic resolution scanning transmission electron microscopy images relies on fitting intensity maxima or minima with a two-dimensional Gaussian function. While this is a widespread method of measurement, it can be error prone in images with non-zero aberrations, strong intensity differences between adjacent atoms or in situations where the neighboring atom positions approach the resolution limit of the microscope. Here we demonstrate mpfit, an atom finding algorithm that iteratively calculates a series of overlapping two-dimensional Gaussian functions to fit the experimental dataset and then subsequently uses a subset of the calculated Gaussian functions to perform sub-pixel refinement of atom positions. Based on both simulated and experimental datasets presented in this work, this approach gives lower errors when compared to the commonly used single Gaussian peak fitting approach and demonstrates increased robustness over a wider range of experimental conditions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Far-field thermal imaging below diffraction limit

Non-uniform self-heating and temperature hotspots are major concerns compromising the performance and reliability of submicron electronic and optoelectronic devices. At deep submicron scales where effects such as contact-related artifacts and diffraction limits accurate measurements of temperature hotspots, non-contact thermal characterization can be extremely valuable. In this work, we use a Bayesian optimization framework with generalized Gaussian Markov random field (GGMRF) prior model to obtain accurate full-field temperature distribution of self-heated metal interconnects from their thermoreflectance thermal images (TRI) with spatial resolution 2.5 times below Rayleigh limit for 530nm illumination. Finite element simulations along with TRI experimental data were used to characterize the point spread function of the optical imaging system. In addition, unlike iterative reconstruction algorithms that use ad hoc regularization parameters in their prior models to obtain the best quality image, we used numerical experiments and finite element modeling to estimate the regularization parameter for solving a real experimental inverse problem.

42 ENGINEERING↗
DOE OSTI2024

MENT-Flow: maximum-entropy phase space tomography using normalizing flows

Generative models can be trained to reproduce low-dimensional projections of high-dimensional phase space distributions. Normalizing flows are generative models that parameterize invertible transformations, allowing exact probability density evaluation and sampling. Consequently, flows are unbiased entropy estimators and could be used to solve the high-dimensional maximum-entropy tomography (MENT) problem. In this work, we evaluate a flow-based MENT solver (MENT-Flow) against exact maximum-entropy solutions and Minerbo's iterative MENT algorithm in two dimensions.

Hoover, Austin↗
DOE OSTI2021

Safeguards-Informed Hybrid Imagery Dataset [Poster]

Deep Learning computer vision models require many thousands of properly labelled images for training, which is especially challenging for safeguards and nonproliferation, given that safeguards-relevant images are typically rare due to the sensitivity and limited availability of the technologies. Creating relevant images through real-world staging is costly and limiting in scope. Expert-labeling is expensive, time consuming, and error prone. We aim to develop a data set of both realworld and synthetic images that are relevant to the nuclear safeguards domain that can be used to support multiple data science research questions. In the process of developing this data, we aim to develop a novel workflow to validate synthetic images using machine learning explainability methods, testing among multiple computer vision algorithms, and iterative synthetic data rendering. We will deliver one million images – both real-world and synthetically rendered – of two types uranium storage and transportation containers with labelled ground truth and associated adversarial examples.

97 MATHEMATICS AND COMPUTING↗