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 487 records · Page 27

Model for Simulating a Spiral Software-Development Process

A discrete-event simulation model, and a computer program that implements the model, have been developed as means of analyzing a spiral software-development process. This model can be tailored to specific development environments for use by software project managers in making quantitative cases for deciding among different software-development processes, courses of action, and cost estimates. A spiral process can be contrasted with a waterfall process, which is a traditional process that consists of a sequence of activities that include analysis of requirements, design, coding, testing, and support. A spiral process is an iterative process that can be regarded as a repeating modified waterfall process. Each iteration includes assessment of risk, analysis of requirements, design, coding, testing, delivery, and evaluation. A key difference between a spiral and a waterfall process is that a spiral process can accommodate changes in requirements at each iteration, whereas in a waterfall process, requirements are considered to be fixed from the beginning and, therefore, a waterfall process is not flexible enough for some projects, especially those in which requirements are not known at the beginning or may change during development. For a given project, a spiral process may cost more and take more time than does a waterfall process, but may better satisfy a customer's expectations and needs. Models for simulating various waterfall processes have been developed previously, but until now, there have been no models for simulating spiral processes. The present spiral-process-simulating model and the software that implements it were developed by extending a discrete-event simulation process model of the IEEE 12207 Software Development Process, which was built using commercially available software known as the Process Analysis Tradeoff Tool (PATT). Typical inputs to PATT models include industry-average values of product size (expressed as number of lines of code), productivity (number of lines of code per hour), and number of defects per source line of code. The user provides the number of resources, the overall percent of effort that should be allocated to each process step, and the number of desired staff members for each step. The output of PATT includes the size of the product, a measure of effort, a measure of rework effort, the duration of the entire process, and the numbers of injected, detected, and corrected defects as well as a number of other interesting features. In the development of the present model, steps were added to the IEEE 12207 waterfall process, and this model and its implementing software were made to run repeatedly through the sequence of steps, each repetition representing an iteration in a spiral process. Because the IEEE 12207 model is founded on a waterfall paradigm, it enables direct comparison of spiral and waterfall processes. The model can be used throughout a software-development project to analyze the project as more information becomes available. For instance, data from early iterations can be used as inputs to the model, and the model can be used to estimate the time and cost of carrying the project to completion.

Mizell, Carolyn↗

Accuracy/Computation Performance of a New Trilateration Scheme for GPS-Style Localization

We recently introduced a new geometric trilateration (GT) method for GPS-style positioning. Preliminary singlepoint analysis using simplistic error assumptions indicates that the new scheme delivers almost indistinguishable localization accuracy as the traditional Newton-Raphson (NR) approach. Also, the same computation procedure can be used to perform high-accuracy relative positioning between a reference vehicle and an arbitrary number of target vehicles. This scheme has the potential to enable a) new mission concepts in collaborative science, b) in-situ navigation services for human Mars missions, and c) lower cost and faster acquisition of GPS signals for consumer-grade GPS products. The new GT scheme differs from the NR scheme as follows: 1. The new scheme is derived from Pythagoras Theorem, whereas the NR method is based on the principle of linear regression. 2. The NR method uses the absolute locations (xi, yi, zi)’s of the GPS satellites as input to each step of the localization computation. The GT method uses the Directional Cosines Ui’s from Earth’s center to the GPS satellite Si. 3. Both the NR method and the GT method iterate to converge to a localized solution. In each iteration step, multiple matrix operations are performed. The NR method constructs a different matrix in each iterative step, thus requires performing a new set of matrix operations in each step. The GT scheme uses the same matrix in each iteration, thus requiring computing the matrix operations only once for all subsequent iterations. In this paper, we perform an in-depth comparison between the GT scheme and the NR method in terms of a) GPS localization accuracy in the GPS operation environment, b) its sensitivity with respect to systematic errors and random errors, and c) computation load required to converge to a localization solution.

Lee, Charles↗

Coupling of the FUN3D Unstructured Flow Solver and the LASTRAC Stability Code to Model Transition

We develop an iterative automated method to predict transition locations in boundary-layer flows by using the FUN3D solver to perform flow simulations and the LASTRAC code for linear stability computations. The coupling of FUN3D and LASTRAC allows for a robust physics-based approach to model boundary-layer transition by analyzing the growth of different instability waves and then using that information to iteratively update the resulting transition location. There is no user involvement during the iterative computations. We apply this automated method to subsonic flow over a flat plate with a sharp leading edge. The final solution has regions of laminar and turbulent flow with a transition onset location that agrees with experiments and stability-based correlations. This iterative automated method is also applied to an NLF(1)-0416 airfoil for conditions with and without a separation bubble. Along with predicting transition locations, we compare the streamwise distributions of surface-pressure and skin-friction coefficients to a transport-equation-based model. We consider a 6:1 prolate spheroid at three angles of attack, namely, five, ten, and fifteen degrees, where mixed-mode transition occurs due to both Tollmien-Schlichting and crossflow instabilities. The skin-friction contours and transition fronts at every angle of attack from our iterative automated method show good agreement with past experimental and computational results in the literature for the 6:1 prolate spheroid.

Transition↗

Rapid finite-difference computation of subsonic and transonic aerodynamic flows

Rapid iterative (or semidirect) computation methods are developed for the finite-difference solution of the nonlinear equations of subsonic and transonic aerodynamics. At each iteration, a fast, direct elliptic algorithm solves the entire computation field. In an application to subsonic flow over a lifting airfoil, the full nonlinear stream-function equation is solved. Finally, a direct Cauchy-Riemann solver is used for the nonlinear transonic small-disturbance equations for a biconvex airfoil. At M = 0.7, t/c = 0.1 (subcritical), three iterations on a 39 x 32 mesh (totaling 2.45 sec on an IBM 360/67 computer) obtain convergence within 0.1%. A slightly supercritical case requires seven iterations (6.75 sec) for convergence within 1%.

Martin, E. D.↗

UHMLE: Program description user guide

A program which computes maximum likelihood estimates for the general normal mixture is introduced. The program allows the user to fix any subsets of the mixture parameters; this fixed set may be redefined at various times in the iteration process. There is considerable time saved in computing the likelihoods if the diagonal form is specified. Hence, in the early iterations the diagonal assumption might be used, changing over to the full covariance mode later in the iteration process for a more refined solution. This flexibility allows the user to choose the sequence of parameter configurations in the iteration process which he feels will optimize the computation time required as well as possibly avoid convergence to suboptimal local maxima of the likelihood function.

Cobely, W. A.↗

Asymptotic behavior of vector recurrences with applications

An investigation is conducted of the behavior of a vector recurrence relation under very weak assumptions. The obtained results are used in an analysis of the iterations for nonlinear equations and a study concerning the composition of such iterations. The results can be employed in studies of one-point iterations involving the use of memory elements. Iterations for solving nonlinear equations on parallel computers can be investigated.

Feldstein, A.↗

Accelerated convergence of structured banded systems using constrained corrections

An efficient iterative method for solving a structured banded system of equations is described. The method was developed for a full potential flow program and uses a basic interation step, a dynamic relation step, and a multigrid concept of constraining iterative corrections. The solution of a large linear system of equations is examined. Efficient iterative methods have become attractive for large problems. In the nonlinear cases, these iterations may be effectively merged to improve convergence rates.

Kneile, K.↗

Heavy ion transport in the straight ahead approximation

An as yet unsolved problem in space radiation protection is the necessary relation between the external cosmic ray heavy ion fluence and the resultant environment within the spacecraft. Such a relation involves the transport of such ions through extended materials. Presented is a derivation of the solution of the transport equation for heavy ions in the straight ahead approximation for directed beam applications. An iterative scheme for the solution of the inhomogeneous integral transport equations is applied to a neon ion beam in water. The iterative scheme requires transport coefficients as input, which are determined from the available data on ion nuclear reactions. The iteration converged for the neon beam in water. Thus this iterative scheme appears to be a suitable approximation of heavy ion transport.

Wilson, J. W.↗

Calculations of transonic potential flows by a parameter free procedure

A parameter-free computational procedure for transonic potential flows around an airfoil is presented. The method is based on an inexact, Newton-like iterative scheme, and a preconditioned minimal residual algorithm is used to solve the linear system of equations arising at each iterate. This iterative procedure is formulated so that the difficulties associated with the approximate factorization technique, namely the requirement of iteration parameters and the boundary conditions for the intermediate variable are eliminated. Numerical experiments are given for potential flows around NACA 0012 airfoil with different Mach numbers and different angles of attack. These results are then compared with those obtained by the approximate factorization techniques.

Wong, Y. S.↗

Asymptotic (h tending to infinity) absolute stability for BDFs applied to stiff differential equations

Methods based on backward differentiation formulas (BDFs) for solving stiff differential equations require iterating to approximate the solution of the corrector equation on each step. One hope for reducing the cost of this is to make do with iteration matrices that are known to have errors and to do no more iterations than are necessary to maintain the stability of the method. This paper, following work by Klopfenstein, examines the effect of errors in the iteration matrix on the stability of the method. Application of the results to an algorithm is discussed briefly.

Krogh, F. T.↗

Multidisciplinary systems optimization by linear decomposition

In a typical design process major decisions are made sequentially. An illustrated example is given for an aircraft design in which the aerodynamic shape is usually decided first, then the airframe is sized for strength and so forth. An analogous sequence could be laid out for any other major industrial product, for instance, a ship. The loops in the discipline boxes symbolize iterative design improvements carried out within the confines of a single engineering discipline, or subsystem. The loops spanning several boxes depict multidisciplinary design improvement iterations. Omitted for graphical simplicity is parallelism of the disciplinary subtasks. The parallelism is important in order to develop a broad workfront necessary to shorten the design time. If all the intradisciplinary and interdisciplinary iterations were carried out to convergence, the process could yield a numerically optimal design. However, it usually stops short of that because of time and money limitations. This is especially true for the interdisciplinary iterations.

Sobieski, J.↗

A family of new efficient arrays for matrix multiplication

The authors present a regular iterative algorithm for matrix multiplication and show that several well-known matrix multiplication arrays are directly obtained from it, differing only in the choice of iteration vector. They then present a regular iterative algorithm for matrix multiplication using the method of Winograd (1968) and show in detail how to derive one array from this algorithmic description. Other arrays in the same family can similarly be obtained for different choices of the iteration space. The new arrays compute the product of two matrices faster than available conventional arrays and use a smaller number of processor cells.

Jagadish, H. V.↗

Aerodynamic optimization by simultaneously updating flow variables and design parameters

The application of conventional optimization schemes to aerodynamic design problems leads to inner-outer iterative procedures that are very costly. An alternative approach is presented based on the idea of updating the flow variable iterative solutions and the design parameter iterative solutions simultaneously. Two schemes based on this idea are applied to problems of correcting wind tunnel wall interference and optimizing advanced propeller designs. The first of these schemes is applicable to a limited class of two-design-parameter problems with an equality constraint. It requires the computation of a single flow solution. The second scheme is suitable for application to general aerodynamic problems. It requires the computation of several flow solutions in parallel. In both schemes, the design parameters are updated as the iterative flow solutions evolve. Computations are performed to test the schemes' efficiency, accuracy, and sensitivity to variations in the computational parameters.

Rizk, M. H.↗

Parallel conjugate gradient algorithms for manipulator dynamic simulation

Parallel conjugate gradient algorithms for the computation of multibody dynamics are developed for the specialized case of a robot manipulator. For an n-dimensional positive-definite linear system, the Classical Conjugate Gradient (CCG) algorithms are guaranteed to converge in n iterations, each with a computation cost of O(n); this leads to a total computational cost of O(n sq) on a serial processor. A conjugate gradient algorithms is presented that provide greater efficiency using a preconditioner, which reduces the number of iterations required, and by exploiting parallelism, which reduces the cost of each iteration. Two Preconditioned Conjugate Gradient (PCG) algorithms are proposed which respectively use a diagonal and a tridiagonal matrix, composed of the diagonal and tridiagonal elements of the mass matrix, as preconditioners. Parallel algorithms are developed to compute the preconditioners and their inversions in O(log sub 2 n) steps using n processors. A parallel algorithm is also presented which, on the same architecture, achieves the computational time of O(log sub 2 n) for each iteration. Simulation results for a seven degree-of-freedom manipulator are presented. Variants of the proposed algorithms are also developed which can be efficiently implemented on the Robot Mathematics Processor (RMP).

Fijany, Amir↗

Computational aspects of helicopter trim analysis and damping levels from Floquet theory

Helicopter trim settings of periodic initial state and control inputs are investigated for convergence of Newton iteration in computing the settings sequentially and in parallel. The trim analysis uses a shooting method and a weak version of two temporal finite element methods with displacement formulation and with mixed formulation of displacements and momenta. These three methods broadly represent two main approaches of trim analysis: adaptation of initial-value and finite element boundary-value codes to periodic boundary conditions, particularly for unstable and marginally stable systems. In each method, both the sequential and in-parallel schemes are used and the resulting nonlinear algebraic equations are solved by damped Newton iteration with an optimally selected damping parameter. The impact of damped Newton iteration, including earlier-observed divergence problems in trim analysis, is demonstrated by the maximum condition number of the Jacobian matrices of the iterative scheme and by virtual elimination of divergence. The advantages of the in-parallel scheme over the conventional sequential scheme are also demonstrated.

Gaonkar, Gopal H.↗

Surface tension and buoyancy-driven flow in a non-isothermal liquid bridge

The Navier-Stokes-Boussinesq equations governing the transport of momentum, mass and heat in a nonisothermal liquid bridge with a temperature-dependent surface tension are solved using a vorticity-stream-function formulation together with a nonorthogonal coordinate transformation. The equations are discretized using a pseudo-unsteady semi-implicit finite difference scheme and are solved by the ADI method. A Picard-type iteration is adopted which consists of inner and outer iterative processes. The outer iteration is used to update the shape of the free surface. Two schemes have been used for the outer iteration; both use the force balance normal to the free surface as the distinguished boundary condition. The first scheme involves successive approximation by the direct solution of the distinguished boundary condition. The second scheme uses the artificial force imbalance between the fluid pressure, viscous and capillary forces at the free surface which arises when the boundary condition for force balance normal to the surface is not satisfied. This artificial imbalance is then used to change the surface shape until the distinguished boundary condition is satisfied. These schemes have been used to examine a variety of model liquid bridge situations including purely thermocapillary-driven flow situations and mixed thermocapillary- and bouyancy-driven flow.

Zhang, Yiqiang↗

Preconditioned conjugate-gradient methods for low-speed flow calculations

An investigation is conducted into the viability of using a generalized Conjugate Gradient-like method as an iterative solver to obtain steady-state solutions of very low-speed fluid flow problems. Low-speed flow at Mach 0.1 over a backward-facing step is chosen as a representative test problem. The unsteady form of the two dimensional, compressible Navier-Stokes equations is integrated in time using discrete time-steps. The Navier-Stokes equations are cast in an implicit, upwind finite-volume, flux split formulation. The new iterative solver is used to solve a linear system of equations at each step of the time-integration. Preconditioning techniques are used with the new solver to enhance the stability and convergence rate of the solver and are found to be critical to the overall success of the solver. A study of various preconditioners reveals that a preconditioner based on the Lower-Upper Successive Symmetric Over-Relaxation iterative scheme is more efficient than a preconditioner based on Incomplete L-U factorizations of the iteration matrix. The performance of the new preconditioned solver is compared with a conventional Line Gauss-Seidel Relaxation (LGSR) solver. Overall speed-up factors of 28 (in terms of global time-steps required to converge to a steady-state solution) and 20 (in terms of total CPU time on one processor of a CRAY-YMP) are found in favor of the new preconditioned solver, when compared with the LGSR solver.

Ajmani, Kumud↗

Multivariable frequency domain identification via 2-norm minimization

The author develops a computational approach to multivariable frequency domain identification, based on 2-norm minimization. In particular, a Gauss-Newton (GN) iteration is developed to minimize the 2-norm of the error between frequency domain data and a matrix fraction transfer function estimate. To improve the global performance of the optimization algorithm, the GN iteration is initialized using the solution to a particular sequentially reweighted least squares problem, denoted as the SK iteration. The least squares problems which arise from both the SK and GN iterations are shown to involve sparse matrices with identical block structure. A sparse matrix QR factorization method is developed to exploit the special block structure, and to efficiently compute the least squares solution. A numerical example involving the identification of a multiple-input multiple-output (MIMO) plant having 286 unknown parameters is given to illustrate the effectiveness of the algorithm.

Bayard, David S.↗