Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 37 records · Page 2

Numerical Comparison of Periodic MoM (Method of Moments) and BMIA (Banded Matrix Iteration Method)

The most popular numerical technique in rough surface scattering is the Method of Moments (MoM). Since the scattering patch size is finite, the edge current must be suppressed to obtain accurate scattering cross sections. Two standard ways to minimize the edge current are periodic boundary conditions and incident wave tapering. We compare the accuracy & computational requirements of these methods.

Method of Moments Banded Matrix Iteration Method M↗

An iterative method for computing a symplectic SVD-like decomposition

In this paper, we present an effective iterative method for computing symplectic SVD-like decomposition for a 2n-by-m rectangular real matrix A. The main purpose here is a block-power iterative method with the ortho-symplectic SR decomposition in the normalization step. We compute an k-block symplectic SVD-like decomposition, namely A{sub k}=S{sub k}Σ{sub k}V{sub k}{sup T} where S{sub k}∈ℝ{sup 2n×2k} is symplectic and V{sub k}∈ℝ{sup m×2k} is orthogonal. For large matrices, we usually have to compute only part of eigenvalues. The main interest of the proposed method is to efficiently compute the desired number of ordered in magnitude eigenvalues of structured matrices.

97 MATHEMATICS AND COMPUTING↗

Parallel iterative methods for sparse linear and nonlinear equations

As three-dimensional models are gaining importance, iterative methods will become almost mandatory. Among these, preconditioned Krylov subspace methods have been viewed as the most efficient and reliable, when solving linear as well as nonlinear systems of equations. There has been several different approaches taken to adapt iterative methods for supercomputers. Some of these approaches are discussed and the methods that deal more specifically with general unstructured sparse matrices, such as those arising from finite element methods, are emphasized.

Saad, Youcef↗

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.↗

Improved Criticality Convergence via a Modified Monte Carlo Power Iteration Method

Monte Carlo transport codes typically estimate the fundamental mode of a nuclear system via a power iteration method. If the eigenvalues of the system are denoted $k$ 1 , $k$ 2 , $k$ 3 ..." with $k$ 1 > $k$ 2 ≥ $k$ 3 ≥ $k$ 4 ··· > 0, and corresponding eigenfunctions Ψ $m$ , it is well known that the Ψ $m$ mode disappears after $n$ iterations as ($k$ $m$ /$k$ 1 ) $n$ . When the dominance ratio $k$ 2 /$k$ 1 is near unity, the convergence to Ψ 1 can be very slow, even if the convergence to $k$ 1 is fast. The convergence to Ψ 1 sometimes can be dramatically improved by estimating Ψ 1 and Ψ 2 . A Monte Carlo implementation of the modified power iteration method requires the neutrons representing Ψ 2 to have both negative and positive weights because Ψ 2 cannot be of one sign. Thus, Ψ 2 is a sum of negatively and positively weighted neutrons. Instead of summing using point detector methods, a new simple binning procedure accelerates convergence to Ψ 1 .

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Stability Analysis of Inline ZFP Compression for Floating-Point Data in Iterative Methods

Currently, the dominating constraint in many high performance computing applications is data capacity and bandwidth, in both internode communications and even moreso in intranode data motion. A new approach to address this limitation is to make use of data compression in the form of a compressed data array. Storing data in a compressed data array and converting to standard IEEE-754 types as needed during a computation can reduce the pressure on bandwidth and storage. However, repeated conversions (lossy compression and decompression) introduce additional approximation errors, which need to be shown to not significantly affect the simulation results. Here, we extend recent work that analyzed the error of a single use of compression and decompression of the ZFP compressed data array representation to the case of time-stepping and iterative schemes, where an advancement operator is repeatedly applied in addition to the conversions. We show that the accumulated error for iterative methods involving fixed-point and time evolving iterations is bounded under standard constraints. An upper bound is established on the number of additional iterations required for the convergence of stationary fixed-point iterations. An additional analysis of traditional forward and backward error of stationary iterative methods using ZFP compressed arrays is also presented. The results of several 1D, 2D, and 3D test problems are provided to demonstrate the correctness of the theoretical bounds.

97 MATHEMATICS AND COMPUTING↗

Iterative methods for solving nonlinear problems of nuclear reactor criticality

The paper presents iterative methods for calculating the neutron flux distribution in nonlinear problems of nuclear reactor criticality. Algorithms for solving equations for variations in the neutron flux are considered. Convergence of the iterative processes is studied for two nonlinear problems in which macroscopic interaction cross sections are functionals of the spatial neutron distribution. In the first problem, the neutron flux distribution depends on the water coolant density, and in the second one, it depends on the fuel temperature. Simple relationships connecting the vapor content and the temperature with the neutron flux are used.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

An accelerated monotone iterative method for the quantum-corrected energy transport model

A non-stationary monotone iterative method is proposed and analyzed for the quantum-corrected energy transport model in nanoscale semiconductor device simulation. For the density-gradient equations, it is analytically and numerically shown that the convergence rate of the method is optimal in the sense of Gummel's decoupling iteration. This is a globally convergent method in the sense that the initial guess can be taken as a lower or an upper solution which is independent of applied voltages. The method integrates the monotone parameters, grid sizes, and Scharfetter-Gummel fitting in an adaptive and automatic way to treat the singularly perturbed nature of the model that incurs boundary, junction, and quantum potential layers in the device.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Characterization of the Impact of Soft Errors on Iterative Methods

Soft errors caused by transient bit flips have the potential to significantly impact an application’s behavior. This has motivated the design of an array of techniques to detect, isolate, and correct soft errors using microarchitectural, architectural, compilation-based, or application-level techniques to minimize their impact on the executing application. The first step towards the design of good error detection/correction techniques involves an understanding of an application’s vulnerability to soft errors. In this paper, we present the first comprehensive characterization of the impact of soft errors on the convergence characteristics of six iterative methods using application-level fault injection. In particular, we consider the use of iterative methods to incrementally solve a linear systems of equations, which constitutes the core kernel in many scientific applications. We analyze the impact of soft errors in terms of the type of error (single- vs multi-bit), the distribution and location of bits affected, the data structure and the statement impacted, and variation with time. In addition to understanding the vulnerability of iterative solvers to soft errors, this characterization can aid the design of fault injection campaigns that ensure systematic coverage.

fault injection, iterative methods, Silent data co↗

Refinement of overlapping local/global iteration method based on Monte Carlo/p-CMFD calculations

In this paper, the overlapping local/global (OLG) iteration method based on Monte Carlo/p-CMFD calculations is refined in two aspects. One is the consistent use of estimators to generate homogenized scattering cross sections. Another is that the incident or exiting angular interval is divided into multi-angular bins to modulate albedo boundary conditions for local problems. Numerical tests show that, compared to the one angle bin case in a previous study, the four angle bin case shows significantly improved results. (authors)

97 MATHEMATICS AND COMPUTING↗

Block-Iterative Methods for 3D Constant-Coefficient Stencils on GPUs and Multicore CPUs

Block iterative methods are extremely important as smoothers for multigrid methods, as preconditioners for Krylov methods, and as solvers for diagonally dominant linear systems. Developing robust and efficient smoother algorithms suitable for current and evolving GPU and multicore CPU systems is a significant challenge. We address this issue in the case of constant-coefficient stencils arising in the solution of elliptic partial differential equations on structured 3D uniform and adaptively refined block structured grids. Robust, highly parallel implementations of block Jacobi and chaotic block Gauss-Seidel algorithms with exact inversion of the blocks are developed using different parallelization techniques. Experimental results for NVIDIA Fermi/Kepler GPUs and AMD multicore systems are presented.

97 MATHEMATICS AND COMPUTING↗

Iterative methods for elliptic finite element equations on general meshes

Iterative methods for arbitrary mesh discretizations of elliptic partial differential equations are surveyed. The methods discussed are preconditioned conjugate gradients, algebraic multigrid, deflated conjugate gradients, an element-by-element techniques, and domain decomposition. Computational results are included.

Nicolaides, R. A.↗

Accelerated modulus-based matrix splitting iteration method for a class of nonlinear complementarity problems

In this paper, we reformulate a class of nonlinear complementarity problems as the implicit fixed-point equations. We demonstrate accelerated modulus-based matrix splitting iteration method. We show their convergence by assuming that the system matrix is positive definite or the splitting of the system matrix are H{sub +}-compatible splitting and discuss the choice of the optimal parameter. Furthermore, we give two-step accelerated modulus-based matrix splitting iteration method, which may achieve higher computing efficiency. Numerical experiments are presented to show the effectiveness of the method.

97 MATHEMATICS AND COMPUTING↗