Search NASA⌕ Search

SEARCH · Search NASA

Results for “iterative regularization”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Self-driving thin film laboratory: autonomous epitaxial atomic-layer synthesis via real-time computer vision analysis of electron diffraction

Emerging materials science platforms with the ability to make autonomous decisions on the fly are fundamentally changing the outlook and protocols for materials optimization and discovery. Because AI-driven self-navigating schemes can effectively reduce the total number of iterations needed to arrive at the "answer" (i.e. the best stochiometric composition for a desired physical property, optimum materials processing parameters, etc.) by significant margins, they have the potential to revolutionize materials and chemical manufacturing processes at large in research laboratory settings as well as in industrial plants. Here, we demonstrate a successful implementation of real-time closed-loop autonomous navigation of a multi-dimensional materials synthesis parameter space for fabricating phase-pure epitaxial films of a metastable phase of a functional oxide in a combinatorial pulsed laser deposition chamber. Sequential epitaxial growth iterations in search of the optimized recipe to stabilize the desired crystal phase were performed using frame-by-frame quantitative computer vision analysis of reflection high-energy electron diffraction (RHEED) images of the unit-cell level film being deposited. The autonomous scheme regularly resulted in > 30-fold reduction in the number of required experiments compared to a comprehensive mapping of the parameter space. The real-time workflow developed here can be readily extended to a variety of thin film synthesis platforms opening the door for self-driving atomic-level materials design as well as autonomous optimization of semiconductor manufacturing.

36 MATERIALS SCIENCE↗
NASA NTRS1983

A time-dependent approach for calculating steady inverse boundary-layer flows with separation

An unsteady inverse boundary-layer method is developed which can be used to calculate steady flows with separation. Two versions of Keller's box method with the Mechul function formulation developed by Cebeci (1976) are employed, depending on the complexity of the flow. The regular box is employed in regions of positive streamwise velocity component u, whereas the zigzag box is employed in regions where u becomes negative (t greater than 0). The regular box with the FLARE approximation is employed when t = 0 and u becomes negative in some region across the layer. Results of calculations show that the use of a time-dependent inverse boundary-layer method in which time is used as an iteration parameter provides a good approach in improving the accuracy of the solutions obtained from the FLARE approximation.

Cebeci, T.↗
NASA NTRS2003

Universal Behavior of a Cyclic Oxidation Model

A mathematical model has been generated to represent the iterative, discrete growth and spallation processes associated with cyclic oxidation. Parabolic growth kinetics (k(sub p)) over and a constant spall area (F(sub A)) were assumed, with spalling occurring interfacially at the thickest regions of the scale. Although most models require numerical techniques, the regularity and simplicity of this progression permitted an approximation by algebraic expressions. Normalization could now be performed to reflect all parametric effects, and a universal cyclic oxidation response was generated: W(sub u) = 1/2 {3J(sub u)(sup 1/2)+ J(sub u)(sup 3/2)} where W, is weight change normalized by the maximum and J(sub u) is the cycle number normalized by the number to reach maximum. Similarly, the total amount of metal consumed was represented by a single normalized curve. The factor [(S(sub c)-l)(raised dot)sqrt(F(sub A)k(sub p)DELTAt)] was identified as a general figure of merit, where S(sub c) is the mass ratio of oxide to oxygen and DELTAt is the cycle duration. A cyclic oxidation failure map was constructed, in normalized k(sub p)-F(sub A) space, as defined by the locus of points corresponding to a critical amount of metal consumption in a given time. All three constructions describe behavior for every value of growth rate, spall fraction, and cycle duration by means of single curves, but with two branches corresponding to the times before and after steady state is achieved.

Smialek, James L.↗
NASA NTRS1990

Implementation of two projection methods on a shared memory multiprocessor - DEC VAX 6240

The relative performance of two iterative schemes, based on projection techniques, is compared on a shared memory multiprocessor - VAX 6240. The CG accelerated Block-SSOR method and the CG accelerated Symmetric-Kaczmarz method are considered for the solution of large sparse nonsymmetric systems of linear equations. It is shown that the regular structure of many matrices can be exploited by the CG-accelerated Block-SSOR method to provide good speedup in a multiprocessing environment. However, the CG accelerated Symmetric-Kaczmarz method, while being a viable alternative on a scalar machine, is unable to benefit from multiprocessing.

Kamath, C.↗
NASA NTRS2011

A New Global Mascon Solution Tuned for High-Latitude Ice Studies

A new global mascon solution has been developed with I-arc-degree spatial and IO-day temporal sampling. The global mas cons are estimated from the reduction of nearly 8 years of GRACE K-band range-rate data. Temporal and anisotropic spatial constraints have been applied for land, ocean and ice regions. The solution construction and tuning is focused towards the Greenland and Antarctic ice sheets (GIS and AIS) as well as the Gulf of Alaska mountain glaciers (GoA). Details of the solution development will be discussed, including the mascon parameter definitions, constraints, and the tuning of the constraint damping factor. Results will be presented, exploring the spatial and temporal variability of the ice sheets and GoA regions. A detailed error analysis will be discussed, including solution dependence on iteration, damping factor, forward modeling, and multitechnique comparisons. We also investigate the fundamental resolution of the solution and the spatial correlation of ice sheet inter-annual change. Finally, we discuss future improvements, including specific constraint application for the rest of the major land ice regions and improvements in solution regularization.

Luthcke, S. B.↗
DOE OSTI2021

Limited-angle computed tomography with deep image and physics priors

Computed tomography is a well-established x-ray imaging technique to reconstruct the three-dimensional structure of objects. It has been used extensively in a variety of fields, from diagnostic imaging to materials and biological sciences. One major challenge in some applications, such as in electron or x-ray tomography systems, is that the projections cannot be gathered over all the angles due to the sample holder setup or shape of the sample. This results in an ill-posed problem called the limited angle reconstruction problem. Typical image reconstruction in this setup leads to distortion and artifacts, thereby hindering a quantitative evaluation of the results. To address this challenge, we use a generative model to effectively constrain the solution of a physics-based approach. Our approach is self-training that can iteratively learn the nonlinear mapping from partial projections to the scanned object. Because our approach combines the data likelihood and image prior terms into a single deep network, it is computationally tractable and improves performance through an end-to-end training. We also complement our approach with total-variation regularization to handle high-frequency noise in reconstructions and implement a solver based on alternating direction method of multipliers. We present numerical results for various degrees of missing angle range and noise levels, which demonstrate the effectiveness of the proposed approach.

47 OTHER INSTRUMENTATION↗
NASA NTRS1988

Stability sensitivity analysis for the aeroelastic optimization of a helicopter rotor

A sensitivity study of blade stability in forward flight for a hingeless rotor with respect to structural design variables is carried out using a direct analytical method. Structural design variables include nonstructural mass distribution (spanwise and chordwise), chordwise offset of center of gravity, and blade bending stiffnesses (flap, lag and torsion). The formulation for blade steady response is based on a finite element method in space and time. The vehicle trim and blade steady response are calculated iteratively as one coupled solution using a modified Newton method. Eigenvalues corresponding to different blade modes are calculated using Floquet transition matrix theory. The formulation for derivatives of the eigenvalues with respect to design variables is implemented using a direct analytical approach (chain rule differentiation), and constitutes an integral part of the regular stability analysis. The stability sensitivity derivatives were obtained at a fraction of computation time compared to the frequently adopted finite difference method. A parametric study showed that nonstructural mass and chordwise cg offset of outboarad elements, and lag bending stiffness of inboard elements, have powerful influence on blade stability.

Lim, Joon W.↗
DOE OSTI2020

Provable Convergence of Plug-and-Play Priors With MMSE Denoisers

Plug-and-play priors (PnP) is a methodology for regularized image reconstruction that specifies the prior through an image denoiser. While PnP algorithms are well understood for denoisers performing maximum a posteriori probability (MAP) estimation, they have not been analyzed for the minimum mean squared error (MMSE) denoisers. Here we address this gap by establishing the first theoretical convergence result for the iterative shrinkage/thresholding algorithm (ISTA) variant of PnP for MMSE denoisers. We show that the iterates produced by PnP-ISTA with an MMSE denoiser converge to a stationary point of some global cost function. We validate our analysis on sparse signal recovery in compressive sensing by comparing two types of denoisers, namely the exact MMSE denoiser and the approximate MMSE denoiser obtained by training a deep neural net.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

MemXCT: Design, Optimization, Scaling, and Reproducibility of X-Ray Tomography Imaging

Here, this work extends our previous research entitled "MemXCT: Memory-centric X-ray CT Reconstruction with Massive Parallelization" that was originally published at SC19 conference (Hidayetoglu et al., 2019) with reproducibility of the computational imaging performance. X-ray computed tomography (XCT) is regularly used at synchrotron light sources to study the internal morphology of materials at high resolution. However, experimental constraints, such as radiation sensitivity, can result in noisy or undersampled measurements. Further, depending on the resolution, sample size and data acquisition rates, the resulting noisy dataset can be in the order of terabytes. Advanced iterative reconstruction techniques can produce high-quality images from noisy measurements, but their computational requirements have made their use an exception rather than the rule. We propose a novel memory-centric approach that avoids redundant computations at the expense of additional memory complexity. We develop a memory-centric iterative reconstruction system, MemXCT, that uses an optimized SpMV implementation with two-level pseudo-Hilbert ordering and multi-stage input buffering. We evaluate MemXCT on various supercomputer architectures involving KNL and GPU. MemXCT can reconstruct a large (11Kx11K) mouse brain tomogram in 10 seconds using 4096 KNL nodes (256K cores). The results presented in our original article at the SC19 were based on large-scale supercomputing resources. The MemXCT application was selected for the Student Cluster Competition (SCC) Reproducibility Challenge and evaluated on a variety of cloud computing resources by universities around the world in the SC20 conference. We summarize the results of the top-ranked SCC Reproducibility Challenge teams and identify the most pertinent measures for ensuring the reproducibility of our experiments in this article.

47 OTHER INSTRUMENTATION↗
NASA NTRS1987

Simulated annealing in networks for computing possible arrangements for red and green cones

Attention is given to network models in which each of the cones of the retina is given a provisional color at random, and then the cones are allowed to determine the colors of their neighbors through an iterative process. A symmetric-structure spin-glass model has allowed arrays to be generated from completely random arrangements of red and green to arrays with approximately as much disorder as the parafoveal cones. Simulated annealing has also been added to the process in an attempt to generate color arrangements with greater regularity and hence more revealing moirepatterns than than the arrangements yielded by quenched spin-glass processes. Attention is given to the perceptual implications of these results.

Ahumada, Albert J., Jr.↗
DOE OSTI2022

Sequential linear integer programming for integer optimal control with total variation regularization

We propose a trust-region method that solves a sequence of linear integer programs to tackle integer optimal control problems regularized with a total variation penalty. The total variation penalty implies that the considered integer control problems admit minimizers. We introduce a local optimality concept for the problem, which arises from the infinite-dimensional perspective. In the case of a one-dimensional domain of the control function, we prove convergence of the iterates produced by our algorithm to points that satisfy first-order stationarity conditions for local optimality. We demonstrate the theoretical findings on a computational example.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1992

A VLSI implementation of DCT using pass transistor technology

A VLSI design for performing the Discrete Cosine Transform (DCT) operation on image blocks of size 16 x 16 in a real time fashion operating at 34 MHz (worst case) is presented. The process used was Hewlett-Packard's CMOS26--A 3 metal CMOS process with a minimum feature size of 0.75 micron. The design is based on Multiply-Accumulate (MAC) cells which make use of a modified Booth recoding algorithm for performing multiplication. The design of these cells is straight forward, and the layouts are regular with no complex routing. Two versions of these MAC cells were designed and their layouts completed. Both versions were simulated using SPICE to estimate their performance. One version is slightly faster at the cost of larger silicon area and higher power consumption. An improvement in speed of almost 20 percent is achieved after several iterations of simulation and re-sizing.

Kamath, S.↗
DOE OSTI2025

On the Sampling-Based Computation of Nash Equilibria Under Uncertainty via the Nikaido–Isoda Function

We consider the computation of an equilibrium of a stochastic Nash equilibrium problem, where the player objectives are assumed to be L 0 -Lipschitz continuous and convex, given rival decisions with convex and closed player-specific feasibility sets. To address this problem, we consider minimizing a suitably defined value function defined using the Nikaido–Isoda function. Such an avenue does not necessitate either monotonicity properties of the concatenated gradient map or potentiality requirements on the game but does require a suitable regularity requirement under which a stationary point is a Nash equilibrium. We design and analyze a sampling-enabled projected-gradient-response method, reliant on inexact resolution of a player-level best-response subproblem. Here, by deriving suitable Lipschitzian guarantees on the value function, we derive both asymptotic guarantees for the sequence of generated iterates as well as rate and complexity guarantees for computing a stationary point by appropriate choices of the sampling rate and inexactness sequence.

Nikaido-Isoda function↗
DOE OSTI2023

Shadow energy functionals and potentials in Born–Oppenheimer molecular dynamics

In Born–Oppenheimer molecular dynamics (BOMD) simulations based on the density functional theory (DFT), the potential energy and the interatomic forces are calculated from an electronic ground state density that is determined by an iterative self-consistent field optimization procedure, which, in practice, never is fully converged. The calculated energies and forces are, therefore, only approximate, which may lead to an unphysical energy drift and instabilities. Here, we discuss an alternative shadow BOMD approach that is based on backward error analysis. Instead of calculating approximate solutions for an underlying exact regular Born–Oppenheimer potential, we do the opposite. Instead, we calculate the exact electron density, energies, and forces, but for an underlying approximate shadow Born–Oppenheimer potential energy surface. In this way, the calculated forces are conservative with respect to the approximate shadow potential and generate accurate molecular trajectories with long-term energy stabilities. We show how such shadow Born–Oppenheimer potentials can be constructed at different levels of accuracy as a function of the integration time step, δt, from the constrained minimization of a sequence of systematically improvable, but approximate, shadow energy density functionals. For each energy functional, there is a corresponding ground state Born–Oppenheimer potential. These pairs of shadow energy functionals and potentials are higher-level generalizations of the original “zeroth-level” shadow energy functionals and potentials used in extended Lagrangian BOMD. The proposed shadow energy functionals and potentials are useful only within this extended dynamical framework, where also the electronic degrees of freedom are propagated as dynamical field variables together with the atomic positions and velocities. The theory is quite general and can be applied to MD simulations using approximate DFT, Hartree–Fock, or semi-empirical methods, as well as to coarse-grained flexible charge models.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1981

An empirical investigation of methods for nonsymmetric linear systems

The present investigation is concerned with a comparison of methods for solving linear algebraic systems which arise from finite difference discretizations of the elliptic convection-diffusion equation in a planar region Omega with Dirichlet boundary conditions. Such linear systems are typically of the form Ax = b where A is an N x N sparse nonsymmetric matrix. In a discussion of discretizations, it is assumed that a regular rectilinear mesh of width h has been imposed on Omega. The discretizations considered include central differences, upstream differences, and modified upstream differences. Six methods for solving Ax = b are considered. Three variants of Gaussian elimination have been chosen as representatives of state-of-the-art software for direct methods under different assumptions about pivoting. Three iterative methods are also included.

Sherman, A. H.↗
NASA NTRS1988

Analysis of spectra using correlation functions

A novel method is presented for the quantitative analysis of spectra based on the properties of the cross correlation between a real spectrum and either a numerical synthesis or laboratory simulation. A new goodness-of-fit criterion called the heteromorphic coefficient H is proposed that has the property of being zero when a fit is achieved and varying smoothly through zero as the iteration proceeds, providing a powerful tool for automatic or near-automatic analysis. It is also shown that H can be rendered substantially noise-immune, permitting the analysis of very weak spectra well below the apparent noise level and, as a byproduct, providing Doppler shift and radial velocity information with excellent precision. The technique is in regular use in the Atmospheric Trace Molecule Spectroscopy (ATMOS) project and operates in an interactive, realtime computing environment with turn-around times of a few seconds or less.

Beer, Reinhard↗
NASA NTRS2000

Time-resolved diffusion tomographic 2D and 3D imaging in highly scattering turbid media

A method for imaging objects in highly scattering turbid media. According to one embodiment of the invention, the method involves using a plurality of intersecting source/detectors sets and time-resolving equipment to generate a plurality of time-resolved intensity curves for the diffusive component of light emergent from the medium. For each of the curves, the intensities at a plurality of times are then inputted into the following inverse reconstruction algorithm to form an image of the medium: wherein W is a matrix relating output at source and detector positions r.sub.s and r.sub.d, at time t, to position r, .LAMBDA. is a regularization matrix, chosen for convenience to be diagonal, but selected in a way related to the ratio of the noise, to fluctuations in the absorption (or diffusion) X.sub.j that we are trying to determine: .LAMBDA..sub.ij =.lambda..sub.j .delta..sub.ij with .lambda..sub.j = /<.DELTA.Xj.DELTA.Xj> Y is the data collected at the detectors, and X.sup.k is the kth iterate toward the desired absorption information. An algorithm, which combines a two dimensional (2D) matrix inversion with a one-dimensional (1D) Fourier transform inversion is used to obtain images of three dimensional hidden objects in turbid scattering media.

Alfano, Robert R.↗
NASA NTRS1999

Time-resolved diffusion tomographic 2D and 3D imaging in highly scattering turbid media

A method for imaging objects in highly scattering turbid media. According to one embodiment of the invention, the method involves using a plurality of intersecting source/detectors sets and time-resolving equipment to generate a plurality of time-resolved intensity curves for the diffusive component of light emergent from the medium. For each of the curves, the intensities at a plurality of times are then inputted into the following inverse reconstruction algorithm to form an image of the medium: ##EQU1## wherein W is a matrix relating output at source and detector positions r.sub.s and r.sub.d, at time t, to position r, .LAMBDA. is a regularization matrix, chosen for convenience to be diagonal, but selected in a way related to the ratio of the noise, to fluctuations in the absorption (or diffusion) X.sub.j that we are trying to determine: .LAMBDA..sub.ij =.lambda..sub.j .delta..sub.ij with .lambda..sub.j = /<.DELTA.Xj.DELTA.Xj> Y is the data collected at the detectors, and X.sup.k is the kth iterate toward the desired absoption information. An algorithm, which combines a two dimensional (2D) matrix inversion with a one-dimensional (1D) Fourier transform inversion is used to obtain images of three dimensional hidden objects in turbid scattering media.

Alfano, Robert R.↗