Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iteration 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

Iterative spectral methods and spectral solutions to compressible flows

A spectral multigrid scheme is described which can solve pseudospectral discretizations of self-adjoint elliptic problems in O(N log N) operations. An iterative technique for efficiently implementing semi-implicit time-stepping for pseudospectral discretizations of Navier-Stokes equations is discussed. This approach can handle variable coefficient terms in an effective manner. Pseudospectral solutions of compressible flow problems are presented. These include one dimensional problems and two dimensional Euler solutions. Results are given both for shock-capturing approaches and for shock-fitting ones.

Hussaini, M. Y.↗

Convergence of Newton's method for a single real equation

Newton's method for finding the zeroes of a single real function is investigated in some detail. Convergence is generally checked using the Contraction Mapping Theorem which yields sufficient but not necessary conditions for convergence of the general single point iteration method. The resulting convergence intervals are frequently considerably smaller than actual convergence zones. For a specific single point iteration method, such as Newton's method, better estimates of regions of convergence should be possible. A technique is described which, under certain conditions (frequently satisfied by well behaved functions) gives much larger zones where convergence is guaranteed.

Campbell, C. W.↗

Graphical and Numerical Description of Strain-Gage Balance Interactions

A new approach for the graphical and numerical description of balance interactions is presented. The approach uses data from single-component loads as input. This choice has the two advantages. First, the number of applied loads is at the minimum needed for interactions to be observed. In addition, the loads used for the description of interactions can easily be repeated at different sites. Output differences relative to the outputs of the zero load point of a load series are used for the description of interactions. Similarly, load differences relative to the loads of the zero load point of a load series are used for the description of the loads. Interactions are plotted versus the load differences for each load component while omitting the outputs of the primary gage of the chosen load component. The resulting plots have a characteristic star pattern as interactions are zero at zero load. Numerical estimates of the slopes of the interactions can be reverse-engineered from the load prediction equations of a balance if calibration data is examined. The slopes are the off-diagonal coefficients of the inverse of the matrix that has the coefficients of the linear terms of the fitted loads if the Non-Iterative Method is used for the analysis. Similarly, the slopes are the off-diagonal coefficients of the inverse of the matrix that is the non-iterative part of the primary load iteration equation if the Iterative Method is used for the analysis. Data from the calibration of a force balance is processed to illustrate the proposed graphical and numerical description of interactions.

wind tunnel test↗

Graphical and Numerical Description of Strain-Gage Balance Interactions

A new approach for the graphical and numerical description of strain-gage balance interactions is presented. The approach uses data from single-component loads as input. This choice has the two advantages. First, the number of applied loads is at the minimum needed for interactions to be observed. In addition, the loads used for the description of interactions can easily be repeated at different sites. Output differences relative to the outputs of the zero load point of a load series are used for the description of interactions. Similarly, load differences relative to the loads of the zero load point of a load series are used for the description of the loads. Interactions are plotted versus the load differences for each load component while omitting outputs of the primary gage of the chosen load component. The resulting plots have a star pattern as all interactions are zero at zero load. Estimates of the slopes of the interactions can be obtained from the load prediction equations of a balance if calibration data is examined. The slopes are the off-diagonal coefficients of the inverse of the matrix that has the coefficients of the linear terms of the fitted loads if the Non-Iterative Method is used for the analysis. Similarly, the slopes are the off-diagonal coefficients of the inverse of the matrix that is the non-iterative part of the primary load iteration equation if the Iterative Method is used for the analysis. Data sets from a manual and a machine calibration of a force balance are processed to illustrate the proposed description of interactions.

strain-gage balance↗

Influence of Primary Gage Sensitivities on the Convergence of Balance Load Iterations

The connection between the convergence of wind tunnel balance load iterations and the existence of the primary gage sensitivities of a balance is discussed. First, basic elements of two load iteration equations that the iterative method uses in combination with results of a calibration data analysis for the prediction of balance loads are reviewed. Then, the connection between the primary gage sensitivities, the load format, the gage output format, and the convergence characteristics of the load iteration equation choices is investigated. A new criterion is also introduced that may be used to objectively determine if the primary gage sensitivity of a balance gage exists. Then, it is shown that both load iteration equations will converge as long as a suitable regression model is used for the analysis of the balance calibration data, the combined influence of non linear terms of the regression model is very small, and the primary gage sensitivities of all balance gages exist. The last requirement is fulfilled, e.g., if force balance calibration data is analyzed in force balance format. Finally, it is demonstrated that only one of the two load iteration equation choices, i.e., the iteration equation used by the primary load iteration method, converges if one or more primary gage sensitivities are missing. This situation may occur, e.g., if force balance calibration data is analyzed in direct read format using the original gage outputs. Data from the calibration of a six component force balance is used to illustrate the connection between the convergence of the load iteration equation choices and the existence of the primary gage sensitivities.

Ulbrich, Norbert Manfred↗

Computation of three-dimensional viscous flows using a space-marching method

A space-marching method, developed to compute three-dimensional flows for internal geometries, has been utilized to predict viscous flows through a curved duct and over a swept wing. The Navier-Stokes equations have been posed as an initial value problem by neglecting the streamwise viscous diffusion terms and by treating the pressure gradient as a known source term. The resulting equations have been solved by a non-iterative (single pass) algorithm at each streamwise step. The results are compared with earlier computations (based on iterative methods) and the experimental data. The agreement between the present predictions, the experimental data, and the earlier predictions is good for the cases computed. The computation time is only a fraction of the iterative methods.

Murthy, K. N. S.↗

A comparison of multiprocessor scheduling methods for iterative data flow architectures

A comparative study is made between the Algorithm to Architecture Mapping Model (ATAMM) and three other related multiprocessing models from the published literature. The primary focus of all four models is the non-preemptive scheduling of large-grain iterative data flow graphs as required in real-time systems, control applications, signal processing, and pipelined computations. Important characteristics of the models such as injection control, dynamic assignment, multiple node instantiations, static optimum unfolding, range-chart guided scheduling, and mathematical optimization are identified. The models from the literature are compared with the ATAMM for performance, scheduling methods, memory requirements, and complexity of scheduling and design procedures.

Storch, Matthew↗

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

Hybrid eigensolvers for nuclear configuration interaction calculations

We examine and compare several iterative methods for solving large-scale eigenvalue problems arising from nuclear structure calculations. In particular, we discuss the possibility of using block Lanczos method, a Chebyshev filtering based subspace iterations and the residual minimization method accelerated by direct inversion of iterative subspace (RMM-DIIS) and describe how these algorithms compare with the standard Lanczos algorithm and the locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm. Although the RMM-DIIS method does not exhibit rapid convergence when the initial approximations to the desired eigenvectors are not sufficiently accurate, it can be effectively combined with either the block Lanczos or the LOBPCG method to yield a hybrid eigensolver that has several desirable properties. We will describe a few practical issues that need to be addressed to make the hybrid solver efficient and robust.

97 MATHEMATICS AND COMPUTING↗

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

An Efficient High-Order Solver for Diffusion Equations with Strong Anisotropy on Non-Anisotropy-Aligned Meshes

This paper concerns numerical solution of the diffusion equation with strong anisotropy on meshes not aligned with the anisotropic vector field. In order to resolve the numerical pollution for simulations on a non-anisotropy-aligned mesh and reduce the associated high computational cost we propose an effective preconditioner, extending our previous work. Similar to the anisotropy-aligned mesh case, we apply the auxiliary space preconditioning framework to design a preconditioner where a continuous finite element space is used as the auxiliary space for the discontinuous finite element space. The key component is an effective line smoother that can mitigate the high-frequency errors perpendicular to the magnetic field. We design a graph-based approach to find such a line smoother that is approximately perpendicular to the vector fields when the mesh does not align with the anisotropy. Finally, numerical experiments for several benchmark problems are presented, demonstrating the effectiveness and robustness of the proposed preconditioner when applied to Krylov iterative methods.

97 MATHEMATICS AND COMPUTING↗