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 379 records · Page 21

A linear method for analyzing lightning field changes

A constrained, least-squares method for analyzing multiple-station measurements of lightning field changes (delta Es) is introduced. Previous methods have attempted to fit the spatial pattern of lightning delta Es using nonlinear models, such as a point charge (Q) or a point dipole (P) model. With the linear method, the delta Es are described not by models but by a general volume charge distribution that is deposited on a large (40 x 40 x 20 cu km) Cartesian grid above the measuring network. A linear system of equations is used to relate the measured delta Es to the charges that are deposited at each grid point. With this approach, the information content of the measurements can be quantified by an eigenanalysis of the covariance matrix of the linear system. Constraints can be used to reduce the infinity of possible solutions to the linear system and also to reduce systematic biases that can be introduced by the method of solution. It is shown that a Landweber iterative method, derived from the general method of steepest descent, can be used to solve the linear system and that the resulting volume charge distributions are generally consistent with computer-simulated charge sources, when these sources are over the measuring network. The Landweber iteration has also provided solutions for natural lightning events that are consistent with Q- and P-model results.

Koshak, William J.↗

An inverse method for subcritical flows

An exact method is presented for two-dimensional subsonic flow within the limitations of the tangent gas approximation. While Woods (1961) studied these equations and proposed iterative methods for the solution of both the iterative and inverse problems, the inverse method here presented is noniterative and exact. It is shown that the direct Euler solution over the designed airfoil is very close to the input speed distribution, and that the constraints necessitated by upstream condition and closure requirements are easily incorporated.

Daripa, P. K.↗

A matrix-free cone complementarity approach for solving large-scale nonsmooth, rigid body dynamics.

This paper proposes an iterative method that can simulate mechanical systems featuring a large number of contacts and joints between rigid bodies. The numerical method behaves as a contractive mapping that converges to the solution of a cone complementarity problem by means of iterated fixed-point steps with separable projections onto convex manifolds. Since computational speed and robustness are important issues when dealing with a large number of frictional contacts, we have performed special algorithmic optimizations in order to translate the numerical scheme into a matrix-free algorithm with O(n) space complexity and easy implementation. A modified version, that can run on parallel computers is discussed. A multithreaded version of the method has been used to simulate systems with more than a million contacts with friction.

99 GENERAL AND MISCELLANEOUS↗

Iterative procedure for in-situ EUV optical testing with an incoherent source

We propose an iterative method for in-situ optical testing under partially coherent illumination that relies on the rapid computation of aerial images. In this method a known pattern is imaged with the test optic at several planes through focus. A model is created that iterates through possible aberration maps until the through-focus series of aerial images matches the experimental result. The computation time of calculating the through-focus series is significantly reduced by a-SOCS, an adapted form of the Sum Of Coherent Systems (SOCS) decomposition. In this method, the Hopkins formulation is described by an operator S which maps the space of pupil aberrations to the space of aerial images. This operator is well approximated by a truncated sum of its spectral components.

36 MATERIALS SCIENCE↗

A single field of view method for retrieving tropospheric temperature profiles from cloud-contaminated radiance data

An iterative method is presented to retrieve single field of view (FOV) tropospheric temperature profiles directly from cloud-contaminated radiance data. A well-defined temperature profile may be calculated from the radiative transfer equation (RTE) for a partly cloudy atmosphere when the average fractional cloud amount and cloud-top height for the FOV are known. A cloud model is formulated to calculate the fractional cloud amount from an estimated cloud-top height. The method is then examined through use of simulated radiance data calculated through vertical integration of the RTE for a partly cloudy atmosphere using known values of cloud-top height(s) and fractional cloud amount(s). Temperature profiles are retrieved from the simulated data assuming various errors in the cloud parameters. Temperature profiles are retrieved from NOAA-4 satellite-measured radiance data obtained over an area dominated by an active cold front and with considerable cloud cover and compared with radiosonde data. The effects of using various guessed profiles and the number of iterations are considered.

Hodges, D. B.↗

Note: Excited State Studies of Ozone using State-Specific Multireference Coupled Cluster Methods

Vertical excitation energies obtained with state-specific multi-reference coupled cluster (MRCC) methods are reported for the ozone molecule. Using state-specific MRCC non-iterative methods with singles, doubles, and non-iterative triples (MRCCSD(T)) we obtain 4.40 eV for the challenging doubly excited 21A1 state when using a reliable model space. This estimate is in good agreement with experiment (4.5 eV). We also compare our MRCC results with the excitation energies obtained with high-order equation-of-motion coupled cluster methods

ab initio↗

A modified secant method for unconstrained minimization

A gradient-secant algorithm for unconstrained optimization problems is presented. The algorithm uses Armijo gradient method iterations until it reaches a region where the Newton method is more efficient, and then switches over to a secant form of operation. It is concluded that an efficient method for unconstrained minimization has been developed, and that any convergent minimization method can be substituted for the Armijo gradient method.

Polak, E.↗

Multiple zeros of polynomials

For polynomials of higher degree, iterative numerical methods must be used. Four iterative methods are presented for approximating the zeros of a polynomial using a digital computer. Newton's method and Muller's method are two well known iterative methods which are presented. They extract the zeros of a polynomial by generating a sequence of approximations converging to each zero. However, both of these methods are very unstable when used on a polynomial which has multiple zeros. That is, either they fail to converge to some or all of the zeros, or they converge to very bad approximations of the polynomial's zeros. This material introduces two new methods, the greatest common divisor (G.C.D.) method and the repeated greatest common divisor (repeated G.C.D.) method, which are superior methods for numerically approximating the zeros of a polynomial having multiple zeros. These methods were programmed in FORTRAN 4 and comparisons in time and accuracy are given.

Wood, C. A.↗

Accuracies of three computationally efficient algorithms for computing atmospheric transmittances

Three algorithms for calculating polychromatic atmospheric transmittance functions have been tested using a set of eleven distinct temperature profiles in order to compare transmittance accuracies achievable by the three methods. The comparison of rms errors demonstrates that the iterative method of McMillin and Fleming (1976) is the most accurate of the efficient algorithms currently available for gases with constant mixing ratios; its accuracy approaches that of the spectroscopic parameters and the computational approximations used in the ground-truth line-by-line calculations. The method of Arking et al. (1974), while less accurate, has the advantage of being perfectly general and easily adapted to cases where spectral bandwidths are varied

Mcmillin, L. M.↗

Experience with the matched filtered weighted-shift-and-add method

It is presently demonstrated that while the matched filter formulated by Ribak (1986) for the extension of the weighted-shift-and-add (WSA) method successfully reduces photon statistics-dominated specklegrams, the iterative method originally proposed by Ribak does not converge in the case of photon-noisy specklegrams for objects having more than one maxima. Attention is accordingly given to methods for rendering the procedure more 'artificially intelligent'. An error matrix is defined that is useful in evaluating the validity of the results produced by the matched filter extension of the WSA method.

Hege, E. Keith↗

Efficient use of direct solvers for the calculation of compressible flows

While the direct solution of systems of linear equations resulting from fluid dynamic problems has generally not been practical in the past, it is presently demonstrated that the direct method is often more efficient than the most popular iterative schemes when constructed in such a way as to take advantage of presently available vector processing capabilities and large memory. The vertical line Gauss-Seidel algorithm was chosen as the iterative method to be compared with the direct method. It is fond that the direct method becomes efficient only when large residual reductions are desired.

Riggins, David W.↗

Parallel Preconditioning for CFD Problems on the CM-5

Up to today, preconditioning methods on massively parallel systems have faced a major difficulty. The most successful preconditioning methods in terms of accelerating the convergence of the iterative solver such as incomplete LU factorizations are notoriously difficult to implement on parallel machines for two reasons: (1) the actual computation of the preconditioner is not very floating-point intensive, but requires a large amount of unstructured communication, and (2) the application of the preconditioning matrix in the iteration phase (i.e. triangular solves) are difficult to parallelize because of the recursive nature of the computation. Here we present a new approach to preconditioning for very large, sparse, unsymmetric, linear systems, which avoids both difficulties. We explicitly compute an approximate inverse to our original matrix. This new preconditioning matrix can be applied most efficiently for iterative methods on massively parallel machines, since the preconditioning phase involves only a matrix-vector multiplication, with possibly a dense matrix. Furthermore the actual computation of the preconditioning matrix has natural parallelism. For a problem of size n, the preconditioning matrix can be computed by solving n independent small least squares problems. The algorithm and its implementation on the Connection Machine CM-5 are discussed in detail and supported by extensive timings obtained from real problem data.

Simon, Horst D.↗

Improvements in the mesh-based convergence diagnostics for Monte Carlo eigenvalue simulations

Using the Monte Carlo method to compute eigenvalue problems based on the power iteration method is widely used. However, the convergence needs accurate diagnostics method in order to maintain the accuracy of the results and the efficiency of the simulation. Recently, we used the linear regression model for convergence diagnostics based on the local information, the mesh-wise cycle-wise flux estimates. Our previous analyses examined properties and demonstrated certain capability of this method. However, several aspects still need further investigation. In this paper, we use additional simulation examples and perform comparisons in order to better understand the capabilities and limitations of this diagnostics method. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Comparison of linear inversion methods by examination of the duality between iterative and inverse matrix methods

Linear numerical inversion methods applied to atmospheric remote sounding generally can be categorized in two ways: (1) iterative, and (2) inverse matrix methods. However, these two categories are not unrelated; a duality exists between them. In other words, given an iterative scheme, a corresponding inverse matrix method exists, and conversely. This duality concept is developed for the more familiar linear methods. The iterative duals are compared with the classical linear iterative approaches and their differences analyzed. The importance of the initial profile in all methods is stressed. Calculations using simulated data are made to compare accuracies and to examine the dependence of the solution on the initial profile.

Fleming, H. E.↗

A general solution strategy of modified power method for higher mode solutions

A general solution strategy of the modified power iteration method for calculating higher eigenmodes has been developed and applied in continuous energy Monte Carlo simulation. The new approach adopts four features: 1) the eigen decomposition of transfer matrix, 2) weight cancellation for higher modes, 3) population control with higher mode weights, and 4) stabilization technique of statistical fluctuations using multi-cycle accumulations. The numerical tests of neutron transport eigenvalue problems successfully demonstrate that the new strategy can significantly accelerate the fission source convergence with stable convergence behavior while obtaining multiple higher eigenmodes at the same time. The advantages of the new strategy can be summarized as 1) the replacement of the cumbersome solution step of high order polynomial equations required by Booth's original method with the simple matrix eigen decomposition, 2) faster fission source convergence in inactive cycles, 3) more stable behaviors in both inactive and active cycles, and 4) smaller variances in active cycles. Advantages 3 and 4 can be attributed to the lower sensitivity of the new strategy to statistical fluctuations due to the multi-cycle accumulations. The application of the modified power method to continuous energy Monte Carlo simulation and the higher eigenmodes up to 4th order are reported for the first time in this paper. -- Graphical abstract: -- Highlights: •Modified power method is applied to continuous energy Monte Carlo simulation. •Transfer matrix is introduced to generalize the modified power method. •All mode based population control is applied to get the higher eigenmodes. •Statistic fluctuation can be greatly reduced using accumulated tally results. •Fission source convergence is accelerated with higher mode solutions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Blade design and analysis using a modified Euler solver

An iterative method for blade design based on Euler solver and described in an earlier paper is used to design compressor and turbine blades providing shock free transonic flows. The method shows a rapid convergence, and indicates how much the flow is sensitive to small modifications of the blade geometry, that the classical iterative use of analysis methods might not be able to define. The relationship between the required Mach number distribution and the resulting geometry is discussed. Examples show how geometrical constraints imposed upon the blade shape can be respected by using free geometrical parameters or by relaxing the required Mach number distribution. The same code is used both for the design of the required geometry and for the off-design calculations. Examples illustrate the difficulty of designing blade shapes with optimal performance also outside of the design point.

Leonard, O.↗