SEARCH · Engineering Papers
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.
Interferometric tomography in the presence of an opaque object is investigated. The developed iterative algorithm does not need to augment the missing information. It is based on the successive reconstruction of the difference field, the difference between the object field to be reconstructed and its estimate, only in the difined region. The application of the algorithm results in stable convergence.
A constrained iterative image restoration method is applied to multichannel diffraction-limited imagery. This method is based on the Gerchberg-Papoulis algorithm utilizing incomplete information and partial constraints. The procedure is described using the orthogonal projection operators which project onto two prescribed subspaces iteratively. Some of its properties and limitations are also presented. The selection of appropriate constraints was emphasized in a practical application. Multichannel microwave images, each having different spatial resolution, were restored to a common highest resolution to demonstrate the effectiveness of the method. Both noise-free and noisy images were used in this investigation.
Interferometric tomography in the presence of an opaque object has been investigated. In principle the developed iterative algorithm does not need to augment the missing information. It is based on the successive reconstruction of the difference field, the difference between the object field to be reconstructed and its estimate, in the defined region only. The application of the algorithm results in stable convergence.
Coherent x-ray imaging and scattering from accelerator based sources such as synchrotrons continue to impact biology, medicine, technology, and materials science. Many synchrotrons around the world are currently undergoing major upgrades to increase their available coherent x-ray flux by approximately two orders of magnitude. The improvement of synchrotrons may enable imaging of materials in operando at the atomic scale which may revolutionize battery and catalysis technologies. Current algorithms used for phase retrieval in coherent x-ray imaging are based on the projection onto sets method. These traditional iterative phase retrieval methods will become more computationally expensive as they push towards atomic resolution and may struggle to converge. Additionally, these methods do not incorporate physical information that may additionally constrain the solution. In this work, we present an algorithm which incorporates molecular dynamics into Bragg coherent diffraction imaging (BCDI). This algorithm, which we call PRAMMol (Phase Retrieval with Atomic Modeling and Molecular Dynamics) combines statistical techniques with molecular dynamics to solve the phase retrieval problem. We present several examples where our algorithm is applied to simulated coherent diffraction from 3D crystals and show convergence to the correct solution at the atomic scale.
The Asynchronous Iterative Solvers for Extreme-Scale Computing (AsyncIS) project aims to explore more efficient numerical algorithms by decreasing their overhead. AsyncIS does this by replacing the outer Krylov subspace solver with an asynchronous optimized Schwarz method, thereby removing the global synchronization and bulk synchronous operations typically used in numerical codes. AsyncIS—a U.S. Department of Energy (DOE)-funded collaboration between Georgia Tech, the University of Tennessee, Knoxville, Temple University, and Sandia National Laboratories—also focuses on the development and optimization of asynchronous preconditioners (i.e., preconditioners that are generated and/or applied in an asynchronous fashion). The novel preconditioning algorithms that provide fine-grained parallelism enable preconditioned Krylov solvers to run efficiently on large-scale distributed systems and manycore accelerators like GPUs.
The Evolutionary aLgorithm for Iterative Studies of Aeromechanics (ELISA) was developed in support of the Rotorcraft Optimization for the Advancement of Mars eXploration (ROAMX) project. ELISA was developed to enable aerodynamic rotor hover optimization for low Reynolds number flows in the Mars atmosphere. The first objective of the algorithm allows for unconventional airfoil parameterization and multi-objective airfoil geometry optimization using OVERFLOW. The Pareto-optimal airfoil sets are converted to a set of Pareto-optimal airfoil decks, providing the lowest drag air foil geometry for each angle of attack, removing the need to arbitrarily select the airfoils to be used in the rotor optimization. The second objective allows for rotor geometry optimization with simultaneous maximization of blade loading and minimization of rotor power using the comprehensive analysis CAMRADII. The result is a Pareto-optimal rotor set, providing the lowest power rotor for each attainable blade loading, and one of the first tools for hover-optimized rotors for high-subsonic low Reynolds number conditions. The airfoil thickness can be modified after the airfoil optimization is complete, allowing for a post-airfoil-optimization adjustment of blade thickness to facilitate conforming to external structural analyses requirements. The relevance of the code is demonstrated with case studies for the ROAMX rotor optimization for Ingenuity-sized single rotors in the Mars atmosphere, a performance study optimizing the chord and twist of Ingenuity’s coaxial rotor resulting in the Sample Recovery Helicopters candidate rotor, and high-subsonic low Reynolds number airfoil optimization providing novel insights for higher-efficiency low Reynolds number airfoil geometries and flow physics.
The recent commissioning of a movable monochromator at the 34-ID-C endstation of the Advanced Photon Source has vastly simplified the collection of Bragg coherent diffraction imaging (BCDI) data from multiple Bragg peaks of sub-micrometre scale samples. Laue patterns arising from the scattering of a polychromatic beam by arbitrarily oriented nanocrystals permit their crystal orientations to be computed, which are then used for locating and collecting several non-co-linear Bragg reflections. The volumetric six-component strain tensor is then constructed by combining the projected displacement fields that are imaged using each of the measured reflections via iterative phase retrieval algorithms. Complications arise when the sample is heterogeneous in composition and/or when multiple grains of a given lattice structure are simultaneously illuminated by the polychromatic beam. Here, a workflow is established for orienting and mapping nanocrystals on a substrate of a different material using scanning Laue diffraction microscopy. The capabilities of the developed algorithms and procedures with both synthetic and experimental data are demonstrated. The robustness is verified by comparing experimental texture maps obtained with Laue diffraction microscopy at the beamline with maps obtained from electron back-scattering diffraction measurements on the same patch of gold nanocrystals. Such tools provide reliable indexing for both isolated and densely distributed nanocrystals, which are challenging to image in three dimensions with other techniques.
This paper describes new multilevel acceleration methods for solving the multigroup neu- tron transport eigenvalue problems. These multilevel algorithms use different projection and prolongation operators in the phase space. The Nonlinear Diffusion Acceleration (NDA) method with multiple grids in energy is formulated with the prolongation oper- ator based on multiplication iterative correction and linear-in-energy mapping. Another multilevel NDA method uses the projection operator with coarsening in energy between the high-order transport and low-order NDA equations. The third algorithm is formu- lated with the partial-current based CMFD low-order equations and applies projection operators in space and energy. The numerical results are presented.
This slide presentation reviews the use of iterative transform phase retrieval in the analysis of the Green Bank Radio Telescope (GBT) Data. It reviews the NASA projects that have used phase retrieval, and the testbed for the algorithm to be used for the James Webb Space Telescope. It shows the comparison of phase retrieval with an interferometer, and reviews the two approaches used for phase retrieval, iterative transform (ITA) or parametric (non-linear least squares model fitting). The concept of ITA Phase Retrieval is reviewed, and the application to Radio Antennas is reviewed. The presentation also examines the National Radio Astronomy Observatory (NRAO) data from the GBT, and the Fourier model that NRAO uses to analyze the data. The challenge for ITA phase retrieval is reviewed, and the coherent approximation for incoherent data is shown. The validity of the approximation is good for a large tilt. There is a review of the proof of concept of the Phase Review simulation using the input wavefront, and the initial sampling parameters estimate from the focused GBT data.
The fourth quarter of the project was spent developing an error analysis of the s-step Lanczos and CG algorithms. Our theoretical bounds and numerical experiments show that the numerical behavior of the algorithm can be significantly improved by using extra precision in a small part of the computation related to the computation and application of the Gram matrix. We have published a technical report which includes all steps of the analysis [8]; a shortened version for journal submission is in preparation. We plan to submit this paper in the following weeks. Activities related to this also include a collaboration with Ichitaro Yamazaki on gathering performance results for these new mixed precision s-step Krylov subspace methods using single/double precision on GPUs. Namely, we would like to obtain performance results that show that the performance overhead of using double the working precision in these select computations is minimal. Other activities include attending biweekly xSDK meetings and presenting a pitch talk on this work to the group on February 25, 2021. In the remainder of the document, we summarize our findings on the potential for mixed precision in classical Krylov subspace methods and s-step Krylov subspace methods, as well as key opportunities for future work.
Optical metamaterial device design has enjoyed a long track of success over the past 50 years leading to the manipulation of light over a wide range of wavelengths spanning the ultraviolet to the far infrared. The manipulation of light over such wavelengths has already led to many technological advancements such as the design of selective radiative absorbers for solar energy, daytime passive cooling using deep space, and optical invisibility cloaks for defense applications. Further disruptive advancements in energy, defense, computing, and biomedical fields could be enabled or enhanced by future optical metamaterial devices. These technologies could lead to increased energy efficiency and hence reduced national primary energy consumption, cheap long duration energy storage, and next generation solid-state heat engines. But historically the methods to invent and develop all of these devices have been time- consuming and based mostly on intuition and iteration. Finding an optimal design can take years. In this project we developed a machine learning-based algorithm capable of automatically generating device designs to produce desired optical properties, reducing the design cycle life in certain situations to be almost instantaneous.
Here, we provide a modification to the quantum phase estimation algorithm (QPEA) [Abrams and Lloyd, Phys. Rev. Lett. 83, 5162 (1999); Cleve et al., Proc. R. Soc. A 454, 339 (1998); Nielsen and Chuang, Quantum computation and quantum information, 2002.] inspired by classical windowing methods for spectral density estimation. From this modification we obtain an upper bound in the cost that implies a cubic improvement with respect to the algorithm's error rate. Numerical evaluation of the costs also demonstrates an improvement. Moreover, with similar techniques, we detail an iterative projective measurement method for ground state preparation that gives an exponential improvement over previous bounds using QPEA. Numerical tests that confirm the expected scaling behavior are also obtained. For these numerical tests we have used a lattice Thirring model as testing ground. Using well-known perturbation theory results, we also show how to more appropriately estimate the cost scaling with respect to state error instead of evolution operator error.
4D time-space reconstruction of dynamic events or deforming objects using X-ray computed tomography (CT) is an important inverse problem in non-destructive evaluation. Conventional back-projection based reconstruction methods assume that the object remains static for the duration of several tens or hundreds of X-ray projection measurement images (reconstruction of consecutive limited-angle CT scans). However, this is an unrealistic assumption for many in-situ experiments that causes spurious artifacts and inaccurate morphological reconstructions of the object. To solve this problem, we propose to perform a 4D time-space reconstruction using a distributed implicit neural representation (DINR) network that is trained using a novel distributed stochastic training algorithm. Our DINR network learns to reconstruct the object at its output by iterative optimization of its network parameters such that the measured projection images best match the output of the CT forward measurement model. Here, we use a forward measurement model that is a function of the DINR outputs at a sparsely sampled set of continuous valued 4D object coordinates. Unlike previous neural representation architectures that forward and back propagate through dense voxel grids that sample the object's entire time-space coordinates, we only propagate through the DINR at a small subset of object coordinates in each iteration resulting in an order-of-magnitude reduction in memory and compute for training. DINR leverages distributed computation across several compute nodes and GPUs to produce high-fidelity 4D time-space reconstructions. We use both simulated parallel-beam and experimental cone-beam X-ray CT datasets to demonstrate the superior performance of our approach.
We discuss a method for recovering complex structure factors from many simultaneously excited Bragg beam intensities is described. The method is applied to simulated transmission electron diffraction data over a wide range of crystal thickness and beam energies. The method is based on iterated projections between structure and scattering matrices, which are related by a matrix unitary transformation, exponential, which we invert. The algorithm removes multiple-scattering perturbations from diffraction data and might be extended to other fields, including X-ray and neutron diffraction and cryo-electron microscopy. Because coherent multiple scattering involves interference between Bragg beams, the method also solves the phase problem. Unlike dynamical inversion from electron microscope images or ptychography data, the method, which starts with Bragg beam intensities, provides complex structure factors unaffected by focusing errors or resolution limitations imposed by lenses. We provide inversions from simulated data with 441 simultaneously excited Bragg beams over a range of thickness and beam energy. We discuss the retrieval of chirality information from enantiomorphs, the efficient incorporation of symmetry information using the irreducible representation of the group of structure matrices, and the effect of HOLZ lines to provide three-dimensional information.
For optimization problems with linear equality constraints, we prove that the (1,1) block of the inverse KKT matrix remains unchanged when projected onto the nullspace of the constraint matrix. In this work, we develop reduced compact representations of the limited-memory inverse BFGS Hessian to compute search directions efficiently when the constraint Jacobian is sparse. Orthogonal projections are implemented by a sparse QR factorization or a preconditioned LSQR iteration. In numerical experiments two proposed trust-region algorithms improve in computation times, often significantly, compared to previous implementations of related algorithms and compared to IPOPT.
Accumulate-repeat-accumulate-accumulate (ARAA) codes have been proposed, inspired by the recently proposed accumulate-repeat-accumulate (ARA) codes. These are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. ARAA codes can be regarded as serial turbolike codes or as a subclass of low-density parity-check (LDPC) codes, and, like ARA codes they have projected graph or protograph representations; these characteristics make it possible to design high-speed iterative decoders that utilize belief-propagation algorithms. The objective in proposing ARAA codes as a subclass of ARA codes was to enhance the error-floor performance of ARA codes while maintaining simple encoding structures and low maximum variable node degree.
There are two main requirements for practical simulation of unsteady flow at high Reynolds number: the algorithm must accurately propagate discontinuous flow fields without excessive artificial viscosity, and it must have some adaptive capability to concentrate computational effort where it is most needed. We satisfy the first of these requirements with a second-order Godunov method similar to those used for high-speed flows with shocks, and the second with a grid-based refinement scheme which avoids some of the drawbacks associated with unstructured meshes. These two features of our algorithm place certain constraints on the projection method used to enforce incompressibility. Velocities are cell-based, leading to a Laplacian stencil for the projection which decouples adjacent grid points. We discuss features of the multigrid and multilevel iteration schemes required for solution of the resulting decoupled problem. Variable-density flows require use of a modified projection operator--we have found a multigrid method for this modified projection that successfully handles density jumps of thousands to one. Numerical results are shown for the 2D adaptive and 3D variable-density algorithms.
The Evolutionary aLgorithm for Iterative Studies of Aeromechanics (ELISA) software was developed in support of the Rotorcraft Optimization for the Advancement of Mars eXploration (ROAMX) project. ELISA was developed to enable aerodynamic rotor hover optimization for low Reynolds number flows in the Mars atmosphere. ELISA comprises two modules. The first module is dedicated to airfoil optimization and allows for the creation of multi-objective Pareto optimal (PO) airfoil sets with the airfoil performance evaluation performed using OVERFLOW. The second module is dedicated to rotor hover performance optimization and generates multi-objective PO rotor sets with the rotor performance evaluation performed using the comprehensive analysis code CAMRAD II. This paper presents recent updates to the ELISA optimization toolset. The airfoil module now includes variation in section Reynolds number, alongside simultaneous maximization of section lift and minimization of section drag. Consequently, the rotor optimization module can query PO airfoil sets (as a function of section lift, drag, and Reynolds number) and generate PO C81 decks tailored to specific Reynolds numbers, eliminating the need for adequate initial chord guesses and allowing for arbitrary rotor solidities to be studied. Furthermore, the rotor optimization has been extended to incorporate a third dimension, alongside maximization of blade loading and minimization of rotor power. This enables optimization across a relevant density range on Mars, presenting the lowest power rotor hover geometry, for each attainable blade loading, for each density. The goal of this work is to present the relevance of recent updates to the ELISA optimization toolset, by showing full rotor hover optimization using unconventional airfoils across a practical Mars density range, and by presenting various optimizations for changing blade numbers with unconstrained solidity in the Mars atmosphere.