Search NASA⌕ Search

SEARCH · Search NASA

Results for “iterative method”

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 127 records · Page 7

Parallel solution of finite element equations

The paper examines several parallel processing solution algorithms for finite element equations arising in linear equilibrium problems. Two basic groups of algorithms, direct and iterative, are investigated with respect to a number of parallel computer architectures and associated selection criteria. The direct algorithms include: LR-Gauss, Crout, Cholesky, Cyclic Reduction and WZ-factorization. The iterative methods examined are: Accelerated Gauss-Seidel, Surrogate Stiffness, Jacobi, Series Expansion, and Energy Monte Carlo. For real-time applications, where the object is to minimize the execution time, Cyclic Reduction appears to be best suited. This assumes a computer with an unlimited number of parallel processors. However, for computers with a limited number of parallel processors that must be used efficiently, both Gauss factorization and Jacobi-like iterative methods rank favorably.

Salama, M.↗

Hidden Connections between Regression Models of Strain-Gage Balance Calibration Data

Hidden connections between regression models of wind tunnel strain-gage balance calibration data are investigated. These connections become visible whenever balance calibration data is supplied in its design format and both the Iterative and Non-Iterative Method are used to process the data. First, it is shown how the regression coefficients of the fitted balance loads of a force balance can be approximated by using the corresponding regression coefficients of the fitted strain-gage outputs. Then, data from the manual calibration of the Ames MK40 six-component force balance is chosen to illustrate how estimates of the regression coefficients of the fitted balance loads can be obtained from the regression coefficients of the fitted strain-gage outputs. The study illustrates that load predictions obtained by applying the Iterative or the Non-Iterative Method originate from two related regression solutions of the balance calibration data as long as balance loads are given in the design format of the balance, gage outputs behave highly linear, strict statistical quality metrics are used to assess regression models of the data, and regression model term combinations of the fitted loads and gage outputs can be obtained by a simple variable exchange.

Ulbrich, Norbert↗

Solution of the symmetric eigenproblem AX=lambda BX by delayed division

Delayed division is an iterative method for solving the linear eigenvalue problem AX = lambda BX for a limited number of small eigenvalues and their corresponding eigenvectors. The distinctive feature of the method is the reduction of the problem to an approximate triangular form by systematically dropping quadratic terms in the eigenvalue lambda. The report describes the pivoting strategy in the reduction and the method for preserving symmetry in submatrices at each reduction step. Along with the approximate triangular reduction, the report extends some techniques used in the method of inverse subspace iteration. Examples are included for problems of varying complexity.

Thurston, G. A.↗

Inventing and improving ribozyme function: rational design versus iterative selection methods

Two major strategies for generating novel biological catalysts exist. One relies on our knowledge of biopolymer structure and function to aid in the 'rational design' of new enzymes. The other, often called 'irrational design', aims to generate new catalysts, in the absence of detailed physicochemical knowledge, by using selection methods to search a library of molecules for functional variants. Both strategies have been applied, with considerable success, to the remodeling of existing ribozymes and the development of ribozymes with novel catalytic function. The two strategies are by no means mutually exclusive, and are best applied in a complementary fashion to obtain ribozymes with the desired catalytic properties.

Review, Tutorial↗

Prediction of BVI Noise for an Active Twist Rotor Using a Loosely Coupled CFD/CSD Method and Comparison to Experimental Data

Numerical predictions of the acoustic characteristics of an Active Twist Rotor (ATR), using two methods to compute the rotor blade aerodynamics and elastic blade motion are compared to experimental data from a wind tunnel test in the NASA Langley Transonic Dynamics Tunnel (TDT) in 2000. The first method, a loosely coupled iterative method, utilizes the Computational Fluid Dynamics (CFD) code OVERFLOW 2 and the Computational Structural Dynamics (CSD) code CAMRAD II. The second method utilizes the CAMRAD II free-wake model only. The harmonic active-twist control to the main rotor blade system is identified with three parameters - harmonic actuation frequency, actuation amplitude, and control phase angle. The resulting aerodynamics and blade motion data from the two methods are then used in the acoustics code PSU-WOPWOP to predict acoustic pressure on a spherical array of equally spaced observers surrounding the rotor. This spherical distribution of pressure is used to compute the sound power level representing baseline and actuated conditions. Sound power levels for three categories of noise are defined as - blade-vortex interaction sound power level (BVIPWL), low frequency sound power level (LFPWL), and overall sound power level, OAPWL. Comparisons with measured data indicate the CFD/CSD analysis successfully captures the trends in sound power levels and the effects of active-twist control at advance ratios of 0.14 and 0.17. The free-wake model predictions show inconsistent sound power levels relative to the trends in the experimental and CFD data. This paper presents the first ever comparison between CFD/CSD acoustic predictions for an active-twist rotor and experimental measurements.

Fogarty, David E.↗

Preconditioned Mixed Spectral Element Methods for Elasticity and Stokes Problems

Preconditioned iterative methods for the indefinite systems obtained by discretizing the linear elasticity and Stokes problems with mixed spectral elements in three dimensions are introduced and analyzed. The resulting stiffness matrices have the structure of saddle point problems with a penalty term, which is associated with the Poisson ratio for elasticity problems or with stabilization techniques for Stokes problems. The main results of this paper show that the convergence rate of the resulting algorithms is independent of the penalty parameter, the number of spectral elements Nu and mildly dependent on the spectral degree eta via the inf-sup constant. The preconditioners proposed for the whole indefinite system are block-diagonal and block-triangular. Numerical experiments presented in the final section show that these algorithms are a practical and efficient strategy for the iterative solution of the indefinite problems arising from mixed spectral element discretizations of elliptic systems.

Pavarino, Luca F.↗

Statistical versus nonstatistical temperature inversion methods

Vertical temperature profiles are derived from radiation measurements by inverting the integral equation of radiative transfer. Because of the nonuniqueness of the solution, the particular temperature profile obtained depends on the numerical inversion technique used and the type of auxiliary information incorporated in the solution. The choice of an inversion algorithm depends on many factors; including the speed and size of computer, the availability of representative statistics, and the accuracy of initial data. Results are presented for a numerical study comparing two contrasting inversion methods: the statistical-matrix inversion method and the nonstatistical-iterative method. These were found to be the most applicable to the problem of determining atmospheric temperature profiles. Tradeoffs between the two methods are discussed.

Smith, W. L.↗

Dynamic response of laminated composite plates using a three-dimensional hybrid-stress finite-element formulation

A method of analysis of dynamic response of laminated composite plates is presented. The analysis is carried by using a hybrid-stress finite element numerical technique. By using this approach, the response of simply supported laminated plates subjected to sinusoidal loading are investigated. For the solution of the finite element equations of motion of free vibrations and dynamic response problems, two effective methods of solution, the space iteration method and the Newmark direct integration method are used. These two methods are discussed here.

Liou, W. J.↗

Parallel Newton-Krylov-Schwarz algorithms for the transonic full potential equation

We study parallel two-level overlapping Schwarz algorithms for solving nonlinear finite element problems, in particular, for the full potential equation of aerodynamics discretized in two dimensions with bilinear elements. The overall algorithm, Newton-Krylov-Schwarz (NKS), employs an inexact finite-difference Newton method and a Krylov space iterative method, with a two-level overlapping Schwarz method as a preconditioner. We demonstrate that NKS, combined with a density upwinding continuation strategy for problems with weak shocks, is robust and, economical for this class of mixed elliptic-hyperbolic nonlinear partial differential equations, with proper specification of several parameters. We study upwinding parameters, inner convergence tolerance, coarse grid density, subdomain overlap, and the level of fill-in in the incomplete factorization, and report their effect on numerical convergence rate, overall execution time, and parallel efficiency on a distributed-memory parallel computer.

Cai, Xiao-Chuan↗

High-Order Implicit-Explicit Multi-Block Time-stepping Method for Hyperbolic PDEs

This work seeks to explore and improve the current time-stepping schemes used in computational fluid dynamics (CFD) in order to reduce overall computational time. A high-order scheme has been developed using a combination of implicit and explicit (IMEX) time-stepping Runge-Kutta (RK) schemes which increases numerical stability with respect to the time step size, resulting in decreased computational time. The IMEX scheme alone does not yield the desired increase in numerical stability, but when used in conjunction with an overlapping partitioned (multi-block) domain significant increase in stability is observed. To show this, the Overlapping-Partition IMEX (OP IMEX) scheme is applied to both one-dimensional (1D) and two-dimensional (2D) problems, the nonlinear viscous Burger's equation and 2D advection equation, respectively. The method uses two different summation by parts (SBP) derivative approximations, second-order and fourth-order accurate. The Dirichlet boundary conditions are imposed using the Simultaneous Approximation Term (SAT) penalty method. The 6-stage additive Runge-Kutta IMEX time integration schemes are fourth-order accurate in time. An increase in numerical stability 65 times greater than the fully explicit scheme is demonstrated to be achievable with the OP IMEX method applied to 1D Burger's equation. Results from the 2D, purely convective, advection equation show stability increases on the order of 10 times the explicit scheme using the OP IMEX method. Also, the domain partitioning method in this work shows potential for breaking the computational domain into manageable sizes such that implicit solutions for full three-dimensional CFD simulations can be computed using direct solving methods rather than the standard iterative methods currently used.

Nielsen, Tanner B.↗

An adaptive grid algorithm for one-dimensional nonlinear equations

Richards' equation, which models the flow of liquid through unsaturated porous media, is highly nonlinear and difficult to solve. Step gradients in the field variables require the use of fine grids and small time step sizes. The numerical instabilities caused by the nonlinearities often require the use of iterative methods such as Picard or Newton interation. These difficulties result in large CPU requirements in solving Richards equation. With this in mind, adaptive and multigrid methods are investigated for use with nonlinear equations such as Richards' equation. Attention is focused on one-dimensional transient problems. To investigate the use of multigrid and adaptive grid methods, a series of problems are studied. First, a multigrid program is developed and used to solve an ordinary differential equation, demonstrating the efficiency with which low and high frequency errors are smoothed out. The multigrid algorithm and an adaptive grid algorithm is used to solve one-dimensional transient partial differential equations, such as the diffusive and convective-diffusion equations. The performance of these programs are compared to that of the Gauss-Seidel and tridiagonal methods. The adaptive and multigrid schemes outperformed the Gauss-Seidel algorithm, but were not as fast as the tridiagonal method. The adaptive grid scheme solved the problems slightly faster than the multigrid method. To solve nonlinear problems, Picard iterations are introduced into the adaptive grid and tridiagonal methods. Burgers' equation is used as a test problem for the two algorithms. Both methods obtain solutions of comparable accuracy for similar time increments. For the Burgers' equation, the adaptive grid method finds the solution approximately three times faster than the tridiagonal method. Finally, both schemes are used to solve the water content formulation of the Richards' equation. For this problem, the adaptive grid method obtains a more accurate solution in fewer work units and less computation time than required by the tridiagonal method. The performance of the adaptive grid method tends to degrade as the solution process proceeds in time, but still remains faster than the tridiagonal scheme.

Gutierrez, William E.↗

Subsonic panel method for designing wing surfaces from pressure distribution

An iterative method has been developed for designing wing section contours corresponding to a prescribed subcritical distribution of pressure. The calculations are initialized by using a surface panel method to analyze a baseline wing or wing-fuselage configuration. A first-order expansion to the baseline panel method equations is then used to calculate a matrix containing the partial derivative of potential at each control point with respect to each unknown geometry parameter. In every iteration cycle, the matrix is used both to calculate the geometry perturbation and to analyze the perturbed geometry. The distribution of potential on the perturbed geometry is established by simple linear extrapolation from the baseline solution. The extrapolated potential is converted to pressure by Bernoulli's equation. Not only is the accuracy of the approach good for very large perturbations, but the computing cost of each complete iteration cycle is substantially less than one analysis solution by a conventional panel method.

Bristow, D. R.↗

Solving large-scale dynamic systems using band Lanczos method in Rockwell NASTRAN on CRAY X-MP

The improved cost effectiveness using better models, more accurate and faster algorithms and large scale computing offers more representative dynamic analyses. The band Lanczos eigen-solution method was implemented in Rockwell's version of 1984 COSMIC-released NASTRAN finite element structural analysis computer program to effectively solve for structural vibration modes including those of large complex systems exceeding 10,000 degrees of freedom. The Lanczos vectors were re-orthogonalized locally using the Lanczos Method and globally using the modified Gram-Schmidt method for sweeping rigid-body modes and previously generated modes and Lanczos vectors. The truncated band matrix was solved for vibration frequencies and mode shapes using Givens rotations. Numerical examples are included to demonstrate the cost effectiveness and accuracy of the method as implemented in ROCKWELL NASTRAN. The CRAY version is based on RPK's COSMIC/NASTRAN. The band Lanczos method was more reliable and accurate and converged faster than the single vector Lanczos Method. The band Lanczos method was comparable to the subspace iteration method which was a block version of the inverse power method. However, the subspace matrix tended to be fully populated in the case of subspace iteration and not as sparse as a band matrix.

Gupta, V. K.↗

Some recent developments in spectral methods

This paper is solely devoted to spectral iterative methods including spectral multigrid methods. These techniques are explained with reference to simple model problems. Some Navier-Stokes algorithms based on these techniques are mentioned. Results on transition simulation using these algorithms are presented.

Hussaini, M. Y.↗

Relaxation method of compensation in an optical correlator

An iterative method is proposed for the sharpening of programmable filters in a 4-f optical correlator. Continuously variable spatial light modulators (SLMs) permit the fine adjustment of optical processing filters so as to compensate for the departures from ideal behavior of a real optical system. Although motivated by the development of continuously variable phase-only SLMs, the proposed sharpening method is also applicable to amplitude modulators and, with appropriate adjustments, to binary modulators as well. A computer simulation is presented that illustrates the potential effectiveness of the method: an image is placed on the input to the correlator, and its corresponding phase-only filter is adjusted (allowed to relax) so as to produce a progressively brighter and more centralized peak in the correlation plane. The technique is highly robust against the form of the system's departure from ideal behavior.

Juday, Richard D.↗