Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iterative”

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 955 records · Page 53

An implementation of the QMR method based on coupled two-term recurrences

The authors have proposed a new Krylov subspace iteration, the quasi-minimal residual algorithm (QMR), for solving non-Hermitian linear systems. In the original implementation of the QMR method, the Lanczos process with look-ahead is used to generate basis vectors for the underlying Krylov subspaces. In the Lanczos algorithm, these basis vectors are computed by means of three-term recurrences. It has been observed that, in finite precision arithmetic, vector iterations based on three-term recursions are usually less robust than mathematically equivalent coupled two-term vector recurrences. This paper presents a look-ahead algorithm that constructs the Lanczos basis vectors by means of coupled two-term recursions. Implementation details are given, and the look-ahead strategy is described. A new implementation of the QMR method, based on this coupled two-term algorithm, is described. A simplified version of the QMR algorithm without look-ahead is also presented, and the special case of QMR for complex symmetric linear systems is considered. Results of numerical experiments comparing the original and the new implementations of the QMR method are reported.

Freund, Roland W.↗

Calculation of three-dimensional (3-D) internal flow by means of the velocity-vorticity formulation on a staggered grid

A method has been developed to accurately compute the viscous flow in three-dimensional (3-D) enclosures. This method is the 3-D extension of a two-dimensional (2-D) method developed for the calculation of flow over airfoils. The 2-D method has been tested extensively and has been shown to accurately reproduce experimental results. As in the 2-D method, the 3-D method provides for the non-iterative solution of the incompressible Navier-Stokes equations by means of a fully coupled implicit technique. The solution is calculated on a body fitted computational mesh incorporating a staggered grid methodology. In the staggered grid method, the three components of vorticity are defined at the centers of the computational cell sides, while the velocity components are defined as normal vectors at the centers of the computational cell faces. The staggered grid orientation provides for the accurate definition of the vorticity components at the vorticity locations, the divergence of vorticity at the mesh cell nodes and the conservation of mass at the mesh cell centers. The solution is obtained by utilizing a fractional step solution technique in the three coordinate directions. The boundary conditions for the vorticity and velocity are calculated implicitly as part of the solution. The method provides for the non-iterative solution of the flow field and satisfies the conservation of mass and divergence of vorticity to machine zero at each time step. To test the method, the calculation of simple driven cavity flows have been computed. The driven cavity flow is defined as the flow in an enclosure driven by a moving upper plate at the top of the enclosure. To demonstrate the ability of the method to predict the flow in arbitrary cavities, results will he shown for both cubic and curved cavities.

Stremel, Paul M.↗

Method for the calculation of spacecraft umbra and penumbra shadow terminator points

A method for calculating orbital shadow terminator points is presented. The current method employs the use of an iterative process which is used for an accurate determination of shadow points. This calculation methodology is required since orbital perturbation effects can introduce large errors when a spacecraft orbits a planet in a high altitude and/or highly elliptical orbit. To compensate for the required iteration methodology, all reference frame change definitions and calculations are performed with quaternions. Quaternion algebra significantly reduces the computational time required for the accurate determination of shadow terminator points.

Ortizlongo, Carlos R.↗

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

A steady-state Kalman filter for assimilating data from a single polar orbiting satellite

A steady-state scheme for data assimilation in the context of a single, short period (relative to a day), sun-synchronous, polar-orbiting satellite is examined. If the satellite takes observations continuously, the gains, which are the weights for blending observations and predictions together, are steady in time. For a linear system forced by random noise, the optimal steady-state gains (Wiener gains) are equivalent to those of a Kalman filter. Computing the Kalman gains increases the computational cost of the model by a large factor, but computing the Wiener gains does not. The latter are computed by iteration using prior estimates of the gains to assimilate simulated observations of one run of the model, termed 'truth' into another run termed 'prediction'. At each stage, the prediction errors form the basis for the next estimate of the gains. Steady state is achieved after three or four iterations. Further simplification is achieved by making the gains depend on longitudinal distance from the observation point, not on absolute longitude. For a single-layer primitive equation model, the scheme works well even if only the mass field is observed but not the velocity field. Although the scheme was developed for Mars Observer, it should be applicable to data retrieved from Earth atmosphere satellites, for example, UARS.

Banfield, Don↗

Alternate assembly sequence databook for the Tier 2 Bus-1 option of the International Space Station

The JSC International Space Station program office requested that SSB prepare a databook to document the alternate space station assembly sequence known as Tier 2, which assumes that the Russian participation has been eliminated and that the functions that were supplied by the Russians (propulsion, resupply, initial attitude control, communications, etc.) are now supplied by the U.S. Tier 2 utilizes the Lockheed Bus-l to replace much of the missing Russian functionality. The space station at each stage of its buildup during the Tier 2 assembly sequence is characterized in terms of of properties, functionality, resource balances, operations, logistics, attitude control, microgravity environment and propellant usage. The assembly sequence as analyzed was defined by JSC as a first iteration, with subsequent iterations required to address some of the issues that the analysis in this databook identified. Several significant issues were identified, including: less than desirable orbit lifetimes, shortage of EVA, large flight attitudes, poor microgravity environments, and reboost propellant shortages. Many of these issues can be resolved but at the cost of possible baseline modifications and revisions in the proposed Tier 2 assembly sequence.

Brewer, L. M.↗

Sensitivity analysis for aeroacoustic and aeroelastic design of turbomachinery blades

A new method for computing the effect that small changes in the airfoil shape and cascade geometry have on the aeroacoustic and aeroelastic behavior of turbomachinery cascades is presented. The nonlinear unsteady flow is assumed to be composed of a nonlinear steady flow plus a small perturbation unsteady flow that is harmonic in time. First, the full potential equation is used to describe the behavior of the nonlinear mean (steady) flow through a two-dimensional cascade. The small disturbance unsteady flow through the cascade is described by the linearized Euler equations. Using rapid distortion theory, the unsteady velocity is split into a rotational part that contains the vorticity and an irrotational part described by a scalar potential. The unsteady vorticity transport is described analytically in terms of the drift and stream functions computed from the steady flow. Hence, the solution of the linearized Euler equations may be reduced to a single inhomogeneous equation for the unsteady potential. The steady flow and small disturbance unsteady flow equations are discretized using bilinear quadrilateral isoparametric finite elements. The nonlinear mean flow solution and streamline computational grid are computed simultaneously using Newton iteration. At each step of the Newton iteration, LU decomposition is used to solve the resulting set of linear equations. The unsteady flow problem is linear, and is also solved using LU decomposition. Next, a sensitivity analysis is performed to determine the effect small changes in cascade and airfoil geometry have on the mean and unsteady flow fields. The sensitivity analysis makes use of the nominal steady and unsteady flow LU decompositions so that no additional matrices need to be factored. Hence, the present method is computationally very efficient. To demonstrate how the sensitivity analysis may be used to redesign cascades, a compressor is redesigned for improved aeroelastic stability and two different fan exit guide vanes are redesigned for reduced downstream radiated noise. In addition, a framework detailing how the two-dimensional version of the method may be used to redesign three-dimensional geometries is presented.

Lorence, Christopher B.↗

An approach to verification and validation of a reliable multicasting protocol

This paper describes the process of implementing a complex communications protocol that provides reliable delivery of data in multicast-capable, packet-switching telecommunication networks. The protocol, called the Reliable Multicasting Protocol (RMP), was developed incrementally using a combination of formal and informal techniques in an attempt to ensure the correctness of its implementation. Our development process involved three concurrent activities: (1) the initial construction and incremental enhancement of a formal state model of the protocol machine; (2) the initial coding and incremental enhancement of the implementation; and (3) model-based testing of iterative implementations of the protocol. These activities were carried out by two separate teams: a design team and a V&V team. The design team built the first version of RMP with limited functionality to handle only nominal requirements of data delivery. In a series of iterative steps, the design team added new functionality to the implementation while the V&V team kept the state model in fidelity with the implementation. This was done by generating test cases based on suspected errant or off-nominal behaviors predicted by the current model. If the execution of a test was different between the model and implementation, then the differences helped identify inconsistencies between the model and implementation. The dialogue between both teams drove the co-evolution of the model and implementation. Testing served as the vehicle for keeping the model and implementation in fidelity with each other. This paper describes (1) our experiences in developing our process model; and (2) three example problems found during the development of RMP.

Callahan, John R.↗

An Approach to Verification and Validation of a Reliable Multicasting Protocol

This paper describes the process of implementing a complex communications protocol that provides reliable delivery of data in multicast-capable, packet-switching telecommunication networks. The protocol, called the Reliable Multicasting Protocol (RMP), was developed incrementally using a combination of formal and informal techniques in an attempt to ensure the correctness of its implementation. Our development process involved three concurrent activities: (1) the initial construction and incremental enhancement of a formal state model of the protocol machine; (2) the initial coding and incremental enhancement of the implementation; and (3) model-based testing of iterative implementations of the protocol. These activities were carried out by two separate teams: a design team and a V&V team. The design team built the first version of RMP with limited functionality to handle only nominal requirements of data delivery. In a series of iterative steps, the design team added new functionality to the implementation while the V&V team kept the state model in fidelity with the implementation. This was done by generating test cases based on suspected errant or offnominal behaviors predicted by the current model. If the execution of a test was different between the model and implementation, then the differences helped identify inconsistencies between the model and implementation. The dialogue between both teams drove the co-evolution of the model and implementation. Testing served as the vehicle for keeping the model and implementation in fidelity with each other. This paper describes (1) our experiences in developing our process model; and (2) three example problems found during the development of RMP.

Callahan, John R.↗

Formulation for Simultaneous Aerodynamic Analysis and Design Optimization

An efficient approach for simultaneous aerodynamic analysis and design optimization is presented. This approach does not require the performance of many flow analyses at each design optimization step, which can be an expensive procedure. Thus, this approach brings us one step closer to meeting the challenge of incorporating computational fluid dynamic codes into gradient-based optimization techniques for aerodynamic design. An adjoint-variable method is introduced to nullify the effect of the increased number of design variables in the problem formulation. The method has been successfully tested on one-dimensional nozzle flow problems, including a sample problem with a normal shock. Implementations of the above algorithm are also presented that incorporate Newton iterations to secure a high-quality flow solution at the end of the design process. Implementations with iterative flow solvers are possible and will be required for large, multidimensional flow problems.

Hou, G. W.↗

An approach to the constrained design of natural laminar flow airfoils

A design method has been developed by which an airfoil with a substantial amount of natural laminar flow can be designed, while maintaining other aerodynamic and geometric constraints. After obtaining the initial airfoil's pressure distribution at the design lift coefficient using an Euler solver coupled with an integml turbulent boundary layer method, the calculations from a laminar boundary layer solver are used by a stability analysis code to obtain estimates of the transition location (using N-Factors) for the starting airfoil. A new design method then calculates a target pressure distribution that will increase the larninar flow toward the desired amounl An airfoil design method is then iteratively used to design an airfoil that possesses that target pressure distribution. The new airfoil's boundary layer stability characteristics are determined, and this iterative process continues until an airfoil is designed that meets the laminar flow requirement and as many of the other constraints as possible.

Green, Bradford Earl↗

Thermal and Mechanical Buckling Analysis of Hypersonic Aircraft Hat-Stiffened Panels With Varying Face Sheet Geometry and Fiber Orientation

Mechanical and thermal buckling behavior of monolithic and metal-matrix composite hat-stiffened panels were investigated. The panels have three types of face-sheet geometry: Flat face sheet, microdented face sheet, and microbulged face sheet. The metal-matrix composite panels have three types of face-sheet layups, each of which is combined with various types of hat composite layups. Finite-element method was used in the eigenvalue extractions for both mechanical and thermal buckling. The thermal buckling analysis required both eigenvalue and material property iterations. Graphical methods of the dual iterations are shown. The mechanical and thermal buckling strengths of the hat-stiffened panels with different face-sheet geometry are compared. It was found that by just microdenting or microbulging of the face sheet, the axial, shear, and thermal buckling strengths of both types of hat-stiffened panels could be enhanced considerably. This effect is more conspicuous for the monolithic panels. For the metal-matrix composite panels, the effect of fiber orientations on the panel buckling strengths was investigated in great detail, and various composite layup combinations offering, high panel buckling strengths are presented. The axial buckling strength of the metal-matrix panel was sensitive to the change of hat fiber orientation. However, the lateral, shear, and thermal buckling strengths were insensitive to the change of hat fiber orientation.

Ko, William L.↗

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

Multigrid Methods for EHL Problems

In many bearings and contacts, forces are transmitted through thin continuous fluid films which separate two contacting elements. Objects in contact are normally subjected to friction and wear which can be reduced effectively by using lubricants. If the lubricant film is sufficiently thin to prevent the opposing solids from coming into contact and carries the entire load, then we have hydrodynamic lubrication, where the lubricant film is determined by the motion and geometry of the solids. However, for loaded contacts of low geometrical conformity, such as gears, rolling contact bearings and cams, this is not the case due to high pressures and this is referred to as Elasto-Hydrodynamic Lubrication (EHL) In EHL, elastic deformation of the contacting elements and the increase in fluid viscosity with pressure are very significant and cannot be ignored. Since the deformation results in changing the geometry of the lubricating film, which in turn determines the pressure distribution, an EHL mathematical model must simultaneously satisfy the complex elasticity (integral) and the Reynolds lubrication (differential) equations. The nonlinear and coupled nature of the two equations makes numerical calculations computationally intensive. This is especially true for highly loaded problems found in practice. One novel feature of these problems is that the solution may exhibit sharp pressure spikes in the outlet region. To this date both finite element and finite difference methods have been used to solve EHL problems with perhaps greater emphasis on the use of the finite difference approach. In both cases, a major computational difficulty is ensuring convergence of the nonlinear equations solver to a steady state solution. Two successful methods for achieving this are direct iteration and multigrid methods. Direct iteration methods (e.g Gauss Seidel) have long been used in conjunction with finite difference discretizations on regular meshes. Perhaps one of the best examples of the application of such methods is the recent Effective Influence Method of Dowson and Wang. Multigrid methods have also been used with great success by Venner and Venner and Lubrecht with a good summary being given by Venner. As both these finite difference discretization based approaches appear to provide an efficient way of solving EHL problems, it is important to understand their relative merits. This paper is a first attempt at providing such an understanding in the context of EHL point contact problem, (contact of two spheres), in which the contact zone is a point and an ellipse or circle for unloaded and loaded dry contacts respectively. Since the film thickness and the contact width are generally small compared to the local radius of curvature of the two surfaces, the reduced geometry of the surfaces in the contact area can be accurately approximated to the contact between a paraboloid and a flat surface. The layout of the remainder of this paper is as follows. In section 2 we introduce the form of the equations to be solved. The Effective Influence Newton Method is described in Section 3 while Section 4 describes the Multigrid method to be used. Sections 5 and 6 describe the test problems to be used in the comparison between the two methods and compare the performance of the two methods. Section 7 concludes the paper with an argument of the two methods and suggests some future research directions.

Nurgat, Elyas↗

Multilevel Algorithm for Atmospheric Data Assimilation

A multiscale algorithm for the problem of optimal statistical interpolation of observed data has been developed. This problem includes the calculation of the vector of the 'analyzed' (best estimated) atmosphere flow field w(sup a) by the formula: w(sup a) = w(sup f) + P(sup f) H(sup T) y, where the quantity y is defined by the equation (H P(sup f) H(sup T) + R)y = w(sup o) - H w(sup f), using the given model forecast first guess w(sup f) and the vector of observations w(sup o); H is an interpolation operator from the regular grid to the observation network, P(sup f) is the forecast error covariance matrix, and R is the observation error covariance matrix. At this initial stage the case of univariate analysis of single level radiosonde height data is considered. The matrix R is assumed to be diagonal, and the matrix P(sup f) is assumed to be given by the formula P(sub ij)(sup f) = sigma(sub i)(sup f) mu(sub ij) sigma(sub j)(sub f), where mu(sub ij) is a smooth, decreasing function of the distance between the i-th and the j-th points. In this paper we describe a multiscale iterative process based on a multiresolution, simultaneous displacement technique and a localized variational calculation of iteration parameters.

Brandt, Achi↗

Quasi-Optimal Schwarz Methods for the Conforming Spectral Element Discretization

Fast methods are proposed for solving the system K(sub N)x = b resulting from the discretization of self-adjoint elliptic equations in three dimensional domains by the spectral element method. The domain is decomposed into hexahedral elements, and in each of these elements the discretization space is formed by polynomials of degree N in each variable. Gauss-Lobatto-Legendre (GLL) quadrature rules replace the integrals in the Galerkin formulation. This system is solved by the preconditioned conjugate gradients method. The conforming finite element space on the GLL mesh consisting of piecewise Q(sub 1) elements produces a stiffness matrix K(sub h) that is spectrally equivalent to the spectral element stiffness matrix K(sub N). The action of the inverse of K(sub h) is expensive for large problems, and is therefore replaced by a Schwarz preconditioner B(sub h) of this finite element stiffness matrix. The preconditioned operator then becomes B(sub h)(exp -l)K(sub N). The technical difficulties stem from the nonregularity of the mesh. Tools to estimate the convergence of a large class of new iterative substructuring and overlapping Schwarz preconditioners are developed. This technique also provides a new analysis for an iterative substructuring method proposed by Pavarino and Widlund for the spectral element discretization.

Casarin, Mario↗

A Note on Multigrid Theory for Non-nested Grids and/or Quadrature

We provide a unified theory for multilevel and multigrid methods when the usual assumptions are not present. For example, we do not assume that the solution spaces or the grids are nested. Further, we do not assume that there is an algebraic relationship between the linear algebra problems on different levels. What we provide is a computationally useful theory for adaptively changing levels. Theory is provided for multilevel correction schemes, nested iteration schemes, and one way (i.e., coarse to fine grid with no correction iterations) schemes. We include examples showing the applicability of this theory: finite element examples using quadrature in the matrix assembly and finite volume examples with non-nested grids. Our theory applies directly to other discretizations as well.

Douglas, C. C.↗

Numerical Study of Multigrid Methods with Various Smoothers for the Elliptical Grid Generation Equations

A robust solver for the elliptic grid generation equations is sought via a numerical study. The system of PDEs is discretized with finite differences, and multigrid methods are applied to the resulting nonlinear algebraic equations. Multigrid iterations are compared with respect to the robustness and efficiency. Different smoothers are tried to improve the convergence of iterations. The methods are applied to four 2D grid generation problems over a wide range of grid distortions. The results of the study help to select smoothing schemes and the overall multigrid procedures for elliptic grid generation.

Golik, W. L.↗