Search NASA⌕ Search

SEARCH · Search NASA

Results for “ITERATION”

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 433 records · Page 24

Iterative Reconstruction of Coded Source Neutron Radiographs

Use of a coded source facilitates high-resolution neutron imaging through magnifications but requires that the radiographic data be deconvolved. A comparison of direct deconvolution with two different iterative algorithms has been performed. One iterative algorithm is based on a maximum likelihood estimation (MLE)-like framework and the second is based on a geometric model of the neutron beam within a least squares formulation of the inverse imaging problem. Simulated data for both uniform and Gaussian shaped source distributions was used for testing to understand the impact of non-uniformities present in neutron beam distributions on the reconstructed images. Results indicate that the model based reconstruction method will match resolution and improve on contrast over convolution methods in the presence of non-uniform sources. Additionally, the model based iterative algorithm provides direct calculation of quantitative transmission values while the convolution based methods must be normalized base on known values.

Santos-Villalobos, Hector J↗

Assessment of the dose reduction potential of a model-based iterative reconstruction algorithm using a task-based performance metrology

Purpose: Different computed tomography (CT) reconstruction techniques offer different image quality attributes of resolution and noise, challenging the ability to compare their dose reduction potential against each other. The purpose of this study was to evaluate and compare the task-based imaging performance of CT systems to enable the assessment of the dose performance of a model-based iterative reconstruction (MBIR) to that of an adaptive statistical iterative reconstruction (ASIR) and a filtered back projection (FBP) technique. Methods: The ACR CT phantom (model 464) was imaged across a wide range of mA setting on a 64-slice CT scanner (GE Discovery CT750 HD, Waukesha, WI). Based on previous work, the resolution was evaluated in terms of a task-based modulation transfer function (MTF) using a circular-edge technique and images from the contrast inserts located in the ACR phantom. Noise performance was assessed in terms of the noise-power spectrum (NPS) measured from the uniform section of the phantom. The task-based MTF and NPS were combined with a task function to yield a task-based estimate of imaging performance, the detectability index (d′). The detectability index was computed as a function of dose for two imaging tasks corresponding to the detection of a relatively small and a relatively large feature (1.5 and 25 mm, respectively). The performance of MBIR in terms of the d′ was compared with that of ASIR and FBP to assess its dose reduction potential. Results: Results indicated that MBIR exhibits a variability spatial resolution with respect to object contrast and noise while significantly reducing image noise. The NPS measurements for MBIR indicated a noise texture with a low-pass quality compared to the typical midpass noise found in FBP-based CT images. At comparable dose, the d′ for MBIR was higher than those of FBP and ASIR by at least 61% and 19% for the small feature and the large feature tasks, respectively. Compared to FBP and ASIR, MBIR indicated a 46%–84% dose reduction potential, depending on task, without compromising the modeled detection performance. Conclusions: The presented methodology based on ACR phantom measurements extends current possibilities for the assessment of CT image quality under the complex resolution and noise characteristics exhibited with statistical and iterative reconstruction algorithms. The findings further suggest that MBIR can potentially make better use of the projections data to reduce CT dose by approximately a factor of 2. Alternatively, if the dose held unchanged, it can improve image quality by different levels for different tasks.

60 APPLIED LIFE SCIENCES↗

Soft syndrome iterative decoding of quantum LDPC codes and hardware architectures

In practical quantum error correction implementations, the measurement of syndrome information is an unreliable step—typically modeled as a binary measurement outcome flipped with some probability. However, the measured syndrome is in fact a discretized value of the continuous voltage or current values obtained in the physical implementation of the syndrome extraction. In this paper, we use this “soft” or analog information to benefit iterative decoders for decoding quantum low-density parity-check (QLDPC) codes. Syndrome-based iterative belief propagation decoders are modified to utilize the soft syndrome to correct both data and syndrome errors simultaneously. We demonstrate the advantages of the proposed scheme not only in terms of comparison of thresholds and logical error rates for quasi-cyclic lifted-product QLDPC code families but also with faster convergence of iterative decoders. Additionally, we derive hardware (FPGA) architectures of these soft syndrome decoders and obtain similar performance in terms of error correction to the ideal models even with reduced precision in the soft information. The total latency of the hardware architectures is about 600 ns (for the QLDPC codes considered) in a 20 nm CMOS process FPGA device, and the area overhead is almost constant—less than 50% compared to min-sum decoders with noisy syndromes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Ranger-based Iterative Random Forest

Iterative Random Forest (iRF) is an improvement upon the classic Random Forest, using weighted iterations to distill the forests. Ranger is a C++ implementation of random forest or recursive partitioning, particularly suited for high dimensional data. Ranger-Based iRF uses Ranger as a base Random Forest codebase upon which iterative and scalability aspects have been added.

Jacobson, DanielA↗

An efficient iterative algorithm for computation of scattering from dielectric objects.

We have developed an efficient iterative algorithm for electromagnetic scattering of arbitrary but relatively smooth dielectric objects. The algorithm iteratively adapts the equivalent surface currents until the electromagnetic fields inside and outside the dielectric objects match the boundary conditions. Theoretical convergence is analyzed for two examples that solve scattering of plane waves incident upon air/dielectric slabs of semi-infinite and finite thicknesses. We applied the iterative algorithm for simulation of sinusoidally-perturbed dielectric slab on one side and the method converged for such unsmooth surfaces. We next simulated the shift in radiation pattern of a 6-inch dielectric lens for different offsets of the feed antenna on the focal plane. The result is compared to that of the Geometrical Optics (GO).

36 MATERIALS SCIENCE↗

RISE: robust iterative surface extension for sub-nanometer X-ray mirror fabrication

Precision optics have been widely required in many advanced technological applications. X-ray mirrors, as an example, serve as the key optical components at synchrotron radiation and free electron laser facilities. They are rectangular silicon or glass substrates where a rectangular Clear Aperture (CA) needs to be polished to sub-nanometer Root Mean Squared (RMS) to keep the imaging capability of the incoming X-ray wavefront at the diffraction limit. The convolutional polishing model requires a CA to be extended with extra data, from which the dwell time is calculated via deconvolution. However, since deconvolution is very sensitive to boundary errors and noise, the existing surface extension methods can hardly fulfill the sub-nanometer requirement. On one hand, the figure errors in a CA were improperly modeled during the extension, leading to continuity issues along the boundary. On the other hand, uncorrectable high-frequency errors and noise were also extended. In this study, we propose a novel Robust Iterative Surface Extension (RISE) method that resolves these problems with a data fitting strategy. RISE models the figure errors in a CA with orthogonal polynomials and ensures that only correctable errors are fit and extended. Combined with boundary conditions, an iterative refinement of dwell time is then proposed to compensate the errors brought by the extension and deconvolution, which drastically reduces the estimated figure error residuals in a CA while the increase of total dwell time is negligible. To our best knowledge, RISE is the first data fitting-based surface extension method and is the first to optimize dwell time based on iterative extension. An experimental verification of RISE is given by fabricating two elliptic cylinders (10 mm × 80 mm CAs) starting from a sphere with a radius of curvature around 173 m using ion beam figuring. The figure errors in the two CAs greatly improved from 204.96 nm RMS and 190.28 nm RMS to 0.62 nm RMS and 0.71 nm RMS, respectively, which proves that RISE is an effective method for sub-nanometer level X-ray mirror fabrication.

36 MATERIALS SCIENCE↗

Eliminating Signal Bias Caused by Vacuum System Backstreaming in the Diagnostic Residual Gas Analyzer of ITER

In fusion neutral gas analysis, such as with the Diagnostic Residual Gas Analyzer (DRGA) for ITER, the primary measurement range of interest comprises the low-amu species (1 to 6), especially deuterium and helium. The challenge in successfully obtaining accurate measurements is two-fold. First, the sensitivity of the method must be sufficient to resolve trace amounts accurately; typically, one percent or less. Second, the gas signal from the fusion processes must be free of bias caused by the latent presence (from system outgassing and/or vacuum backstreaming) of these gases to enable accurate interpretation of the measured signal. This latter criterion can be problematic for the lightest gases since there is a propensity for some fraction of the pumped gas load to undergo a phenomenon known as backstreaming. This behavior is manifested in pumping systems for gas properties related to relative atomic weight (lightest) and size (smallest). Backstreaming results in a significant amount of the pumped gas undertaking a reverse flow and re-entering the measurement region; thus, contaminating the forward, real-time measurement. To fully eliminate this adverse effect, a conductance-limiting device – or orifice – has been installed in the high-vacuum pumping system of the present ITER DRGA prototype. The system was already equipped with a secondary turbomolecular pump (TMP), but with limited effectiveness against backstreaming in the inter-pump volume (IPV). This orifice is placed within the suction inlet coupling of the secondary TMP, which is downstream of the IPV. Its objective is to eliminate the backstreaming phenomenon by increasing the back pressure in the IPV. However, the orifice sizing must take into consideration other factors, such as the diagnostic measurement objectives. For example, in the ITER DRGA, one of the measurement requirements is a dynamic response time of ~1s. Fortunately, an added benefit of the pumping restriction created by the orifice is that the upstream pressure increase is beneficial for the DRGA’s optical gas analysis (OGA) sensors. These sensors are attached to the IPV in the present design. The glow discharges, when used as an OGA light source, will typically have a brighter light emission with increasing plasma cell pressure. In addition to the fusion machine research sector, there are other potential applications of this pumping technique where the monitoring of lighter gas concentrations is essential, such as the photolithography process for the semiconductor fabrication of integrated circuits. This presentation will describe the vacuum system used to demonstrate a process to eliminate backstreaming as well as show test results to verify the accomplishment of this critical objective.

Marcus, Chris↗

Formation and Sustainment of ITPs in ITER with the Baseline Heating Mix

Plasmas with internal transport barriers (ITBs) are a potential and attractive route to steady-state operation in ITER. These plasmas exhibit radially localized regions of improved con nement with steep pressure gradients in the plasma core, which drive large bootstrap current and generate hollow current pro les and negative shear. This work examines the formation and sustainment of ITBs in ITER with electron cyclotron heating and current drive. It is shown that, with a trade-o of the power delivered to the equatorial and to the upper launcher, the sustainment of steady-state ITBs can be demonstrated in ITER with the baseline heating con guration.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Asynchronous Iterative Solvers for Extreme-Scale Computing (Final Report)

This is the final report for the project: Asynchronous Iterative Solvers for Extreme-Scale Computing. This was a collaborative project. This report only covers the activities specific to Georgia Institute of Technology. The project investigated and developed iterative solvers that operate asynchronously, thereby avoiding the high cost of synchronization that is apparent when using standard, synchronous iterative solvers at extreme levels of parallelism.

97 MATHEMATICS AND COMPUTING↗

Halo currents and vertical displacements after ITER disruptions

Axisymmetric control of the vertical position of highly shaped tokamaks, such as ITER, requires active feedback. In ITER, this control will be lost during the period in which the plasma current decays following a thermal quench of a disruption; the decay is sufficiently rapid that the surrounding walls in ITER can be approximated as perfect conductors. When axisymmetric feedback control was required before the disruption, it is shown that the edge safety factor tends to drop as the plasma current decays following a thermal quench. When the q = 2 surface approaches the plasma edge, a strong nonaxisymmetric halo current is expected to arise, which could occur when the plasma current has decayed less than 20% from the predisruption magnitude.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A successive overrelaxation iterative technique for an adaptive equalizer

An adaptive strategy for the equalization of pulse-amplitude-modulated signals in the presence of intersymbol interference and additive noise is reported. The successive overrelaxation iterative technique is used as the algorithm for the iterative adjustment of the equalizer coefficents during a training period for the minimization of the mean square error. With 2-cyclic and nonnegative Jacobi matrices substantial improvement is demonstrated in the rate of convergence over the commonly used gradient techniques. The Jacobi theorems are also extended to nonpositive Jacobi matrices. Numerical examples strongly indicate that the improvements obtained for the special cases are possible for general channel characteristics. The technique is analytically demonstrated to decrease the mean square error at each iteration for a large range of parameter values for light or moderate intersymbol interference and for small intervals for general channels. Analytically, convergence of the relaxation algorithm was proven in a noisy environment and the coefficient variance was demonstrated to be bounded.

Kosovych, O. S.↗

Iterative methods for plasma sheath calculations: Application to spherical probe

The computer cost of a Poisson-Vlasov iteration procedure for the numerical solution of a steady-state collisionless plasma-sheath problem depends on: (1) the nature of the chosen iterative algorithm, (2) the position of the outer boundary of the grid, and (3) the nature of the boundary condition applied to simulate a condition at infinity (as in three-dimensional probe or satellite-wake problems). Two iterative algorithms, in conjunction with three types of boundary conditions, are analyzed theoretically and applied to the computation of current-voltage characteristics of a spherical electrostatic probe. The first algorithm was commonly used by physicists, and its computer costs depend primarily on the boundary conditions and are only slightly affected by the mesh interval. The second algorithm is not commonly used, and its costs depend primarily on the mesh interval and slightly on the boundary conditions.

Parker, L. W.↗

Convergence of an iterative procedure for large-scale static analysis of structural components

The paper proves convergence of an iterative procedure for calculating the deflections of built-up component structures which can be represented as consisting of a dominant, relatively stiff primary structure and a less stiff secondary structure, which may be composed of one or more substructures that are not connected to one another but are all connected to the primary structure. The iteration consists in estimating the deformation of the primary structure in the absence of the secondary structure on the assumption that all mechanical loads are applied directly to the primary structure. The j-th iterate primary structure deflections at the interface are imposed on the secondary structure, and the boundary loads required to produce these deflections are computed. The cycle is completed by applying the interface reaction to the primary structure and computing its updated deflections. It is shown that the mathematical condition for convergence of this procedure is that the maximum eigenvalue of the equation relating primary-structure deflection to imposed secondary-structure deflection be less than unity, which is shown to correspond with the physical requirement that the secondary structure be more flexible at the interface boundary.

Austin, F.↗

An iterative decoupling solution method for large scale Lyapunov equations

A great deal of attention has been given to the numerical solution of the Lyapunov equation. A useful classification of the variety of solution techniques are the groupings of direct, transformation, and iterative methods. The paper summarizes those methods that are at least partly favorable numerically, giving special attention to two criteria: exploitation of a general sparse system matrix structure and efficiency in resolving the governing linear matrix equation for different matrices. An iterative decoupling solution method is proposed as a promising approach for solving large-scale Lyapunov equation when the system matrix exhibits a general sparse structure. A Fortran computer program that realizes the iterative decoupling algorithm is also discussed.

Athay, T. M.↗

Comparison of results obtained by solving the radiative transfer equation with an iterative method and a spherical harmonics method

Fluxes and intensities of light scattered by a model atmosphere are computed by a spherical harmonics approximation and by an iterative method of solving the radiative transfer equation and are compared. The large differences in the net fluxes and intensities reported by Dave and Armstrong (1974) for the two methods are reduced here by making a few changes in the iterative routine. Decreasing the polar angle increment from 2 to 1 deg in the iterative method of computing the source function does not improve the results as suggested by Dave and Armstrong.

Bahethi, O. P.↗

A block iterative LU solver for weakly coupled linear systems

A hybrid technique, called the block iterative LU solver, is proposed for solving the linear equations resulting from a finite element numerical analysis of certain fluid dynamics problems where the equations are weakly coupled between distinct sets of variables. Either the block Jacobi iterative method or the block Gauss-Seidel iterative solver is combined with LU decomposition.

Cooke, C. H.↗

A multigrid algorithm for steady transonic potential flows around aerofoils using Newton iteration

The application of multigrid relaxation to transonic potential flow calculation was investigated. Conservative potential flows around aerofoils were taken as test problems. The solution algorithm was based on Newton iteration. It was found that the iteration to the circulation has to be kept outside the multigrid algorithm. To obtain meaningful norms of residuals, difference formulas with asymptotic scaling were introduced. Nonlinear instability problems were solved by upwind differencing using mass flux vector splitting instead of artificial viscosity or artificial density. It is suggested that the algorithms efficiency be increased by improving the iteration on the shock positions even though this is a highly nonlinear process.

Boestoel, J. W.↗

An iterative finite element-integral technique for predicting sound radiation from turbofan inlets

A new iterative solution technique for predicting the sound field radiated from a turbofan inlet is presented. The sound field is divided into two regions; the sound field within the inlet which is computed using the finite element method and the radiation field outside the inlet which is calculated using an integral solution technique. A 'unified' solution is obtained by matching the finite element and integral solutions at the interface between the interior and exterior regions. The applicability of the iterative technique is demonstrated by considering several simple cases for which exact or 'classical' solutions for the sound field are available. These examples show that the proper solution is obtained within five iterations. The overall accuracy of the method is demonstrated by comparison with experimental data.

Horowitz, S. J.↗