Search NASA⌕ Search

SEARCH · Search NASA

Results for “iterative methods”

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 163 records · Page 9

Normality of Monte Carlo criticality eigenfunction decomposition coefficients

A proof is presented, which shows that after a single Monte Carlo (MC) neutron transport power method iteration without normalization, the coefficients of an eigenfunction decomposition of the fission source density are normally distributed when using analog or implicit capture MC. Using a Pearson correlation coefficient test, the proof is corroborated by results from a uniform slab reactor problem, and those results also suggest that the coefficients are normally distributed with normalization. The proof and numerical test results support the application of earlier work on the convergence of eigenfunctions under stochastic operators. Knowledge of the Gaussian shape of decomposition coefficients allows researchers to determine an appropriate level of confidence in the distribution of fission sites taken from a MC simulation. This knowledge of the shape of the probability distributions of decomposition coefficients encourages the creation of new predictive convergence diagnostics. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Comparison of Two Load Prediction Methods for Strain-Gage Balances

Data from a five-component semi-span balance is used to perform a systematic comparison of the load prediction accuracy of two load prediction methods. Both methods independently obtain the load prediction equations from multivariate least squares fits of balance calibration data. The first method is called the Non-Iterative Method. This approach directly uses regression models of the individual load components of a balance for the load prediction. The second method is called the Iterative Method. This alternate approach uses a load iteration equation for the load prediction that is constructed from the regression coefficients of the gage outputs of the balance. Basic characteristics of the two methods are reviewed. Afterwards, both methods are applied to calibration, check load, and wind tunnel test data of a five-component semi-span balance. Selected analysis results are compared. These comparisons confirm that the accuracy of the two methods is the same for all practical purposes.

strain-gage balance↗

Calibration and Data Analysis of the MC-130 Air Balance

Design, calibration, calibration analysis, and intended use of the MC-130 air balance are discussed. The MC-130 balance is an 8.0 inch diameter force balance that has two separate internal air flow systems and one external bellows system. The manual calibration of the balance consisted of a total of 1854 data points with both unpressurized and pressurized air flowing through the balance. A subset of 1160 data points was chosen for the calibration data analysis. The regression analysis of the subset was performed using two fundamentally different analysis approaches. First, the data analysis was performed using a recently developed extension of the Iterative Method. This approach fits gage outputs as a function of both applied balance loads and bellows pressures while still allowing the application of the iteration scheme that is used with the Iterative Method. Then, for comparison, the axial force was also analyzed using the Non-Iterative Method. This alternate approach directly fits loads as a function of measured gage outputs and bellows pressures and does not require a load iteration. The regression models used by both the extended Iterative and Non-Iterative Method were constructed such that they met a set of widely accepted statistical quality requirements. These requirements lead to reliable regression models and prevent overfitting of data because they ensure that no hidden near-linear dependencies between regression model terms exist and that only statistically significant terms are included. Finally, a comparison of the axial force residuals was performed. Overall, axial force estimates obtained from both methods show excellent agreement as the differences of the standard deviation of the axial force residuals are on the order of 0.001 % of the axial force capacity.

Booth, Dennis↗

A Method to Solve Interior and Exterior Camera Calibration Parameters for Image Resection

An iterative method is presented to solve the internal and external camera calibration parameters, given model target points and their images from one or more camera locations. The direct linear transform formulation was used to obtain a guess for the iterative method, and herein lies one of the strengths of the present method. In all test cases, the method converged to the correct solution. In general, an overdetermined system of nonlinear equations is solved in the least-squares sense. The iterative method presented is based on Newton-Raphson for solving systems of nonlinear algebraic equations. The Jacobian is analytically derived and the pseudo-inverse of the Jacobian is obtained by singular value decomposition.

Samtaney, Ravi↗

Computation of steady axisymmetric flow using a one-dimensional time-dependent method

An iterative numerical method for computing steady, three dimensional, viscous, compressible flow fields, about aerodynamic bodies was studied. In order to develop the iterative method economically, the primary emphasis was directed towards supersonic, axisymmetric flow. However, the technique readily extends to three spatial dimensions. The viscous flow field about a cone-cylinder-flare body was calculated and compared to existing experimental data. Numerical predictions of the cone boundary layer and the flow field shock wave structure agreed with corresponding measurements. A separation was calculated at the cylinder-flare junction in six iterations; however, the size of the vortex did not correspond to the measured size. It was estimated that fifty iterations would be required to properly define the vortex. It was concluded that the iteration technique is of limited value for plane two dimensional and axisymmetrix flows, but of great value for three-dimensional flows.

Walitt, L.↗

Comparison of Electrical Output Format Options for the Analysis of Strain-Gage Balance Calibration Data

Fundamental characteristics of three gage output formats are discussed that may be used to both interpret and analyze wind tunnel strain-gage balance data. The first output format uses raw outputs, i.e., absolute voltage measurements, for the analysis. This choice requires an intercept term in the regression model of the outputs if the Iterative Method is chosen for the load prediction. Raw outputs can be used for the analysis of all known output characteristics as long as the Iterative Method is applied. However, raw outputs cannot be used to analyze data of a balance with bi-directional outputs if the Non-Iterative Method is chosen for the analysis. The second output format, i.e., difference type 1, uses the difference between raw outputs and the natural zeros of the balance gages for the analysis. In this case, the use of the intercept term becomes optional. Analysis results for difference type 1 will exactly match analysis results obtained by using raw outputs as long as identical math models are used for the regression analysis. In addition, difference type 1 may be used to analyze data of a balance with bi directional outputs if an analyst prefers to process data using the Non-Iterative Method. The third output format, i.e., difference type 2, uses the difference between raw outputs and the outputs of the zero load point of a load series for the data analysis. The application of this format is only recommended if the maximum magnitude of all tare loads of a given balance calibration data set is less than two percent of capacity. Data from the calibration of a force balance is used to illustrate the application of the three gage output formats.

Wind Tunnel Strain-Gage Balance↗

Improved Convergence and Robustness of USM3D Solutions on Mixed-Element Grids

Several improvements to the mixed-elementUSM3Ddiscretization and defect-correction schemes have been made. A new methodology for nonlinear iterations, called the Hierarchical Adaptive Nonlinear Iteration Method, has been developed and implemented. The Hierarchical Adaptive Nonlinear Iteration Method provides two additional hierarchies around a simple and approximate preconditioner of USM3D. The hierarchies are a matrix-free linear solver for the exact linearization of Reynolds-averaged Navier-Stokes equations and a nonlinear control of the solution update. Two variants of the Hierarchical Adaptive Nonlinear Iteration Method are assessed on four benchmark cases, namely, a zero-pressure-gradient flat plate, a bump-in-channel configuration, the NACA 0012 airfoil, and a NASA Common Research Model configuration. The new methodology provides a convergence acceleration factor of 1.4 to 13 over the preconditioner-alone method representing the baseline solver technology.

Pandya, Mohagna J.↗

Improved Convergence and Robustness of USM3D Solutions on Mixed-Element Grids

Several improvements to the mixed-element USM3D discretization and defect-correction schemes have been made. A new methodology for nonlinear iterations, called the Hierarchical Adaptive Nonlinear Iteration Method, has been developed and implemented. The Hierarchical Adaptive Nonlinear Iteration Method provides two additional hierarchies around a simple and approximate preconditioner of USM3D. The hierarchies are a matrix-free linear solver for the exact linearization of Reynolds-averaged Navier-Stokes equations and a nonlinear control of the solution update. Two variants of the Hierarchical Adaptive Nonlinear Iteration Method are assessed on four benchmark cases, namely, a zero-pressure-gradient flat plate, a bump-in-channel configuration, the NACA 0012 airfoil, and a NASA Common Research Model configuration. The new methodology provides a convergence acceleration factor of 1.4 to 13 over the preconditioner-alone method representing the baseline solver technology.

Pandya, Mohagna J.↗

Image-based iterative compensation of motion artifacts in computed tomography

Purpose: This article presents an iterative method for compensation of motion artifacts for slowly rotating computed tomography (CT) systems. Patient's motion introduces inconsistencies among projections and yields severe reconstruction artifacts for free-breathing acquisitions. Streaks and doubling of structures can appear and the resolution is limited by strong blurring. Methods: The rationale of the proposed motion compensation method is to iteratively correct the reconstructed image by first decomposing the perceived motion in projection space, then reconstructing the motion artifacts in image space, and finally subtracting the artifacts from an initial image. The initial image is reconstructed from the acquired data and might contain motion blur artifacts but, nevertheless, is considered as a reference for estimating the reconstruction artifacts. Results: Qualitative and quantitative figures are shown for experiments based on numerically simulated projections of a sequence of clinical images resulting from a respiratory-gated helical CT acquisition. The border of the diaphragm becomes progressively sharper and the contrast improves for small structures in the lungs. Conclusions: The originality of the technique stems from the fact that the patient motion is not explicitly estimated but the motion artifacts are reconstructed in image space. This approach could provide sharp static anatomical images on interventional C-arm systems or on slowly rotating X-ray equipments in radiotherapy.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A communication-avoiding, hybrid-parallel, rank-revealing orthogonalization method.

Orthogonalization consumes much of the run time of many iterative methods for solving sparse linear systems and eigenvalue problems. Commonly used algorithms, such as variants of Gram-Schmidt or Householder QR, have performance dominated by communication. Here, 'communication' includes both data movement between the CPU and memory, and messages between processors in parallel. Our Tall Skinny QR (TSQR) family of algorithms requires asymptotically fewer messages between processors and data movement between CPU and memory than typical orthogonalization methods, yet achieves the same accuracy as Householder QR factorization. Furthermore, in block orthogonalizations, TSQR is faster and more accurate than existing approaches for orthogonalizing the vectors within each block ('normalization'). TSQR's rank-revealing capability also makes it useful for detecting deflation in block iterative methods, for which existing approaches sacrifice performance, accuracy, or both. We have implemented a version of TSQR that exploits both distributed-memory and shared-memory parallelism, and supports real and complex arithmetic. Our implementation is optimized for the case of orthogonalizing a small number (5-20) of very long vectors. The shared-memory parallel component uses Intel's Threading Building Blocks, though its modular design supports other shared-memory programming models as well, including computation on the GPU. Our implementation achieves speedups of 2 times or more over competing orthogonalizations. It is available now in the development branch of the Trilinos software package, and will be included in the 10.8 release.

99 GENERAL AND MISCELLANEOUS↗

Analytic Solution to the Problem of Aircraft Electric Field Mill Calibration

It is by no means a simple task to retrieve storm electric fields from an aircraft instrumented with electric field mill sensors. The presence of the aircraft distorts the ambient field in a complicated way. Before retrievals of the storm field can be made, the field mill measurement system must be "calibrated". In other words, a relationship between impressed (i.e., ambient) electric field and mill output must be established. If this relationship can be determined, it is mathematically inverted so that ambient field can be inferred from the mill outputs. Previous studies have primarily focused on linear theories where the relationship between ambient field and mill output is described by a "calibration matrix" M. Each element of the matrix describes how a particular component of the ambient field is enhanced by the aircraft. For example the product M(sub ix), E(sub x), is the contribution of the E(sub x) field to the i(th) mill output. Similarly, net aircraft charge (described by a "charge field component" E(sub q)) contributes an amount M(sub iq)E(sub q) to the output of the i(th) sensor. The central difficulty in obtaining M stems from the fact that the impressed field (E(sub x), E(sub y), E(sub z), E(sub q) is not known but is instead estimated. Typically, the aircraft is flown through a series of roll and pitch maneuvers in fair weather, and the values of the fair weather field and aircraft charge are estimated at each point along the aircraft trajectory. These initial estimates are often highly inadequate, but several investigators have improved the estimates by implementing various (ad hoc) iterative methods. Unfortunately, none of the iterative methods guarantee absolute convergence to correct values (i.e., absolute convergence to correct values has not been rigorously proven). In this work, the mathematical problem is solved directly by analytic means. For m mills installed on an arbitrary aircraft, it is shown that it is possible to solve for a single 2m-vector that provides all other needed variables (i.e., the unknown fair weather field, the unknown aircraft charge, and the unknown matrix M). Numerical tests of the solution, effects of measurement errors, and studies of solution non-uniqueness are ongoing as of this writing.

Koshak, William↗

A Universal Algorithm for the Detection of Bi-directional Gage Output Characteristics

A universal algorithm was developed that may be used to assess the bi-directional characteristics of the gage outputs of a wind tunnel strain-gage balance. The algorithm assumes that balance loads and gage outputs are described in the design format of the balance. It can also be applied to balance calibration data that is processed by using either the Iterative Method or the Non-Iterative Method. The algorithm uses an estimate of the bi-directional part of a gage output at load capacity as input. In addition, the statistical significance of the principle absolute value term in the regression model of either the gage output or the related primary load component is determined. A gage output is assumed to be bi-directional if two conditions are fulfilled: the bi-directional part of the output at load capacity exceeds 0.5 percent of the maximum output at load capacity; the p-value of the principle absolute value term of the regression model of the balance data is less than the threshold of 0.001. Data from the calibration of two six-component force balances and one five-component semi-span balance are used to illustrate the application of the universal detection algorithm.

wind tunnel test↗

Space-Dependent Wielandt Shift Methods for Multigroup Diffusion Eigenvalue Problems

In the calculation of neutronic eigenfunctions and eigenvalues, it is often desirable to approximate the neutron transport equation by a diffusion equation that requires significantly less computational resources to solve. Even when a full transport solution is needed, the solution of the diffusion system can be used to accelerate iterative methods for calculating the transport eigenfunction and eigenvalue. The convergence rate of the basic power iteration method for eigenvalue problems is governed by the dominance ratio; realistic reactor core problems often have high dominance ratios and the power iteration method can converge slowly as a result. A common technique for accelerating the convergence of power iteration is the Wielandt shift (WS) method, which reduces the dominance ratio by 'shifting' the eigenvalue spectrum using an estimate of the desired eigenvalue. WS provides a significant speedup over power iteration if the eigenvalue estimate is close to the true eigenvalue, but it can be difficult to obtain such an estimate. In practice, the shift in the WS method can be dynamically updated in the iteration scheme, in a way that depends on the eigenvalue estimates from the most recent iterations. We present a physically-motivated Space-Dependent Wielandt Shift (SDWS) for solving multigroup diffusion eigenvalue problems. The space-dependence of the eigenvalue shift in SDWS enables a more effective acceleration of the power iteration scheme than WS at the beginning of the iteration scheme, when the current estimate of the eigenvalue is not close to the actual eigenvalue. Several variants of SDWS are discussed here, including an SDWS method that combines the strengths of SDWS (in the early iterations) with those of standard WS (in the later iterations). Numerical results from a 1-D multigroup diffusion problem demonstrate an order of magnitude speedup over power iteration and a 41% speedup over a standard WS technique. This speedup is problem-dependent and appears to be greater for 'more difficult' problems. In this summary, the term 'speedup' refers to a reduction in the number of iterations required to converge to the correct eigenvalue and eigenfunction. Because the scattering is treated fully implicitly (i.e., it is part of the left-hand side of the diffusion system and directly inverted), the computational cost of a single iteration does not vary significantly among the methods discussed in this summary. The number of iterations is therefore representative of the total computational cost for a method. We acknowledge that certain iterative solvers for linear systems (e.g., GMRES) require more computational time to converge when the system is nearly singular (i.e., when a very aggressive Wielandt shift is applied). Nonetheless, when using SDWS in the manner described in this summary, we have seen that the reduction in computational time from reducing the number of power iterations generally outweighs the extra computational time required by iterative solvers such as GMRES. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

pnnl/IMIC

The first step toward the design of good error detection/correction techniques involves an understanding of an application’s vulnerability to soft errors. To study the behavior of iterative methods in the presence of soft errors, we inject errors during the execution of these methods. In particular, we study the impact of one error (single- or multi-bit) on the execution of iterative methods. We use real life datasets from the SuiteSparse Matrix Collection (https://sparse.tamu.edu) and widely used iterative solver library (Iterative Methods Library, IML++ v1.2a). We instrument the iterative solver implementations so that our error injection methodology can control the iteration, vector, position, number of bits and position of the bits of the error injection. We employed 6 solvers and 28 datasets, performed a total of 1,744,800 error injection runs and collected more than 2.5TB data.

Mutlu, Burcu↗

Calculation of Higher Eigenpairs of the Transport Equation Using IRAM Based on Domain Decomposition

The higher eigenpairs of the neutron transport (or diffusion) equation are useful in core flux distribution reconstruction, transient analysis, stability analysis, and loading pattern optimization. There are various methods for the calculation of higher eigenpairs, such as the power iteration method with filtering technique, the Generalized Modified Power Method (GMPM), the power iteration method with innovative boundary conditions for symmetric cores, and Krylov subspace methods. In regard to Krylov subspace methods, the Implicitly Restarted Arnoldi Method (IRAM) and ORTHOMIN were implemented to calculate higher eigenpairs for both transport and diffusion equations. In Warsa's work, however, there was a significant drawback that problems with energy upscatter could not be treated efficiently. In Modak's work, the mode to which his method was likely to converge depended on the shape of initial guess flux, and only one mode could be computed each time, making it impractical for real use. Furthermore, the computational burden for higher eigenpairs is generally much larger than for only the first eigenpair, especially for neutron transport equations. Therefore, the implementation of parallel computation for higher eigenpairs is essential to improve the efficiency, and no such work has been reported in literature so far. In this summary, we propose an innovative method to calculate higher eigenpairs of the neutron transport equation based on high performance computation. In this method, 2D Matrix Method of Characteristic (MMOC) is used to discretize the neutron transport equation; IRAM is used to evaluate higher eigenpairs; spatial domain decomposition is used to realize parallel computation. The highlight of this method is using the MGMD PGMRES (Multi-Group and Multi-Domain coupled Parallel Generalized Minimal Residual Method) algorithm to simultaneously accelerate the upscatter iterations and the inner interface angular fluxes iterations, avoiding the drawback in Warsa's method and the efficiency problem of conventional Jacobi iteration. To the best of our knowledge, our work represents the first application of IRAM based on domain decomposition for higher eigenpairs.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A parallel iterative solution method for systems of nonlinear hyperbolic equations

An iterative algorithm suitable for the solution of a system of nonlinear hyperbolic partial differentiation equations in multiple dimensions is discussed. Current numerical methods for systems of nonlinear PDEs have limited parallelism due to strong coupling between the equations. This method decouples the PDEs by linearizing the convention coefficient for a space-time domain. This provides large grain parallelism. The linearization also allows the treatment of some terms in the equations as source terms, providing more freedom to choose from a wider variety of numerical methods. Smaller grain parallelism may be exploited within the solves for each equation. Thus, the method has potential for parallelism at several levels.

Scroggs, Jeffrey S.↗

Iterative PNS method for attached flows with upstream influence

A stable global-iteration procedure is developed by utilizing successive sweeps, from inflow to outflow boundaries, of a parabolized Navier-Stokes code for attached, steady supersonic flow. It is shown that the procedure converges in about ten or fewer iterations, and allows for the upstream influence within the subsonic region of a supersonic boundary layer. An implicit forward difference is employed in the subsonic region to evaluate the pressure-gradient term in the streamwise momentum equation. The pressure-gradient term is normally approximated in standard single-sweep parabolized methods, suppressing the upstream influence. The iterative results obtained demonstrate the validity of the single-sweep method for weak interactions. For hypersonic viscous interaction on a flat plate at a Mach number of 5.8, it is found that the single-sweep method has a small error that vanishes as the Reynolds number of the flow is increased. However, the skin friction has an error of about 10 percent for low Reynolds numbers and for hot wall conditions. The application of this method to laminar two-dimensional flow over weak expansion and compression corners shows that the pressure and skin friction results in the vicinity of the expansion corner compare favorably with a time-dependent Navier-Stokes numerical solution.

Rakich, J. V.↗