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 919 records · Page 51

Possibilistic clustering for shape recognition

Clustering methods have been used extensively in computer vision and pattern recognition. Fuzzy clustering has been shown to be advantageous over crisp (or traditional) clustering in that total commitment of a vector to a given class is not required at each iteration. Recently fuzzy clustering methods have shown spectacular ability to detect not only hypervolume clusters, but also clusters which are actually 'thin shells', i.e., curves and surfaces. Most analytic fuzzy clustering approaches are derived from Bezdek's Fuzzy C-Means (FCM) algorithm. The FCM uses the probabilistic constraint that the memberships of a data point across classes sum to one. This constraint was used to generate the membership update equations for an iterative algorithm. Unfortunately, the memberships resulting from FCM and its derivatives do not correspond to the intuitive concept of degree of belonging, and moreover, the algorithms have considerable trouble in noisy environments. Recently, the clustering problem was cast into the framework of possibility theory. Our approach was radically different from the existing clustering methods in that the resulting partition of the data can be interpreted as a possibilistic partition, and the membership values may be interpreted as degrees of possibility of the points belonging to the classes. An appropriate objective function whose minimum will characterize a good possibilistic partition of the data was constructed, and the membership and prototype update equations from necessary conditions for minimization of our criterion function were derived. The ability of this approach to detect linear and quartic curves in the presence of considerable noise is shown.

Keller, James M.↗

Aerodynamic shape optimization via sensitivity analysis on decomposed computational domains

Direct and iterative method considered to be most applicable to large systems of linear equations arising in discrete sensitivity analysis are assessed. Based on a single-domain grid, computations are performed using a banded matrix solver and an iterative solver, the generalized minimum residual (GMRES) method. The banded matrix solver is found to be generally the most economical method for those applications where the number of right-hand sides is large (i.e., a large number of design variables or a large number of adjoint vectors). For systems of equations that are too large to be solved by direct methods, an approach is proposed whereby the computational domain is divided into small subdomains, and each subdomain is solved separately.

Eleshaky, Mohamed E.↗

Modal test/analysis correlation of Space Station structures using nonlinear sensitivity

The modal correlation problem is formulated as a constrained optimization problem for validation of finite element models (FEM's). For large-scale structural applications, a pragmatic procedure for substructuring, model verification, and system integration is described to achieve effective modal correlations. The space station substructure FEM's are reduced using Lanczos vectors and integrated into a system FEM using Craig-Bampton component modal synthesis. The optimization code is interfaced with MSC/NASTRAN to solve the problem of modal test/analysis correlation; that is, the problem of validating FEM's for launch and on-orbit coupled loads analysis against experimentally observed frequencies and mode shapes. An iterative perturbation algorithm is derived and implemented to update nonlinear sensitivity (derivatives of eigenvalues and eigenvectors) during optimizer iterations, which reduced the number of finite element analyses.

Gupta, Viney K.↗

An installed nacelle design method using multiblock Euler solver

An efficient multiblock Euler design method was developed for designing a nacelle installed on geometrically complex airplane configurations. This approach employed a design module based on a direct iterative surface curvature method developed at NASA-Langley. A multiblock Euler flow solver was used for computing flow around complex geometries. The flow solver used a finite-volume formulation with explicit time-stepping to solve the Euler equations. It used a multiblock version of the multigrid method to accelerate the convergence of the calculations. The design module successively updated the surface geometry to reduce the difference between the computed and target pressure distributions. In the flow solver, the change in surface geometry was simulated by applying surface transpiration boundary conditions to avoid repeated grid generation during design iterations. Smoothness of the designed surface was ensured by alternate application of streamwise and circumferential smoothings.

Chen, H. C.↗

Designing reduced-order linear multivariable controllers using experimentally derived plant data

An iterative numerical algorithm for simultaneously improving multiple performance and stability robustness criteria for multivariable feedback systems is developed. The unsatisfied design criteria are improved by updating the free parameters of an initial, stabilizing controller's state-space matrices. Analytical expressions for the gradients of the design criteria are employed to determine a parameter correction that improves all of the feasible, unsatisfied design criteria at each iteration. A controller design is performed using the algorithm with experimentally derived data from a large space structure test facility. Experimental results of the controller's performance at the facility are presented.

Frazier, W. G.↗

Visual display aid for orbital maneuvering - Design considerations

This paper describes the development of an interactive proximity operations planning system that allows on-site planning of fuel-efficient multiburn maneuvers in a potential multispacecraft environment. Although this display system most directly assists planning by providing visual feedback to aid visualization of the trajectories and constraints, its most significant features include: (1) the use of an 'inverse dynamics' algorithm that removes control nonlinearities facing the operator, and (2) a trajectory planning technique that separates, through a 'geometric spreadsheet', the normally coupled complex problems of planning orbital maneuvers and allows solution by an iterative sequence of simple independent actions. The visual feedback of trajectory shapes and operational constraints, provided by user-transparent and continuously active background computations, allows the operator to make fast, iterative design changes that rapidly converge to fuel-efficient solutions. The planning tool provides an example of operator-assisted optimization of nonlinear cost functions.

Grunwald, Arthur J.↗

Vibration of thermally buckled composite plates with initial deflections using triangular elements

A consistent finite element formulation is presented for the analysis of thermal postbuckling and free vibration of thermally buckled thin, laminated composite plates subjected to large temperature change. The influence of moderately large initial imperfections in deflection on the thermal postbuckling deflection and the vibration characteristics of the buckled plate is also investigated. The finite element equations of motion are derived from the principle of virtual work. These equations can be mathematically separated into two sets and solved in sequence. The first set of equations yields the particular solution of static thermal postbuckling deflection, and the second set of equations gives the homogeneous solution of vibration characteristics on the buckled plate. The first set of static equations is solved by using Newton-Raphson iteration method. The tangent stiffness matrix in the final iteration is equal to the total stiffness matrix of the second set of dynamic equations. This feature saves tremendous computation time in comparing with using the conventional approach. The influence of lamination angle, temperature distribution, plate planform of arbitrary shape, and boundary support conditions on postbuckling and vibration behavior are investigated.

Zhou, R. C.↗

Confidence bounds on structural reliability

Different approaches for quantifying physical, statistical, and model uncertainties associated with the distribution parameters which are aimed at determining structural reliability are described. Confidence intervals on the distribution parameters of the input random variables are estimated using four algorithms to evaluate uncertainty of the response. Design intervals are evaluated using either Monte Carlo simulation or an iterative approach. A first order approach can be used to compute a first approximation of the design interval, but its accuracy is not satisfactory. The regression approach which combines the iterative approach with Monte Carlo simulation is capable of providing good results if the performance function can be accurately represented using regression analysis. It is concluded that the design interval-based approach seems to be quite general and takes into account distribution and model uncertainties.

Mehta, S. R.↗

Structural design utilizing updated, approximate sensitivity derivatives

A method to improve the computational efficiency of structural optimization algorithms is investigated. In this method, the calculations of 'exact' sensitivity derivatives of constraint functions are performed only at selected iterations during the optimization process. The sensitivity derivatives utilized within other iterations are approximate derivatives which are calculated using an inexpensive derivative update formula. Optimization results are presented for an analytic optimization problem (i.e., one having simple polynomial expressions for the objective and constraint functions) and for two structural optimization problems. The structural optimization results indicate that up to a factor of three improvement in computation time is possible when using the updated sensitivity derivatives.

Scotti, Stephen J.↗

On the static stability of forward swept propfans

An hybrid Euler solver coupled with a NASTRAN structural analysis is used to investigate the static stability characteristics of two forward swept propfan blades. The designs, having same geometry but different structural properties - one being statically stable and the other unstable, are analyzed. The stable design takes more iterations to converge than previously designed aft swept blades. The unstable design diverges to an unrealistic shape within five iterations.

Srivastava, R.↗

The L sub 1 finite element method for pure convection problems

The least squares (L sub 2) finite element method is introduced for 2-D steady state pure convection problems with smooth solutions. It is proven that the L sub 2 method has the same stability estimate as the original equation, i.e., the L sub 2 method has better control of the streamline derivative. Numerical convergence rates are given to show that the L sub 2 method is almost optimal. This L sub 2 method was then used as a framework to develop an iteratively reweighted L sub 2 finite element method to obtain a least absolute residual (L sub 1) solution for problems with discontinuous solutions. This L sub 1 finite element method produces a nonoscillatory, nondiffusive and highly accurate numerical solution that has a sharp discontinuity in one element on both coarse and fine meshes. A robust reweighting strategy was also devised to obtain the L sub 1 solution in a few iterations. A number of examples solved by using triangle and bilinear elements are presented.

Jiang, Bo-Nan↗

Phase-retrieval algorithms for a complicated optical system

Phase-retrieval algorithms have been developed that handle a complicated optical system that requires multiple Fresnellike transforms to propagate from one end of the system to the other including the absorption by apertures in more than one plane and allowance for bad detector pixels. Gradient-search algorithms and generalizations of the iterative-transform phase-retrieval algorithms are derived. Analytic expressions for the gradient of an error metric, with respect to polynomial coefficients and with respect to point-by-point phase descriptions, are given. The entire gradient can be computed with the number of transforms required to propagate a wave front from one end of the optical system to the other and back again, independent of the number of coefficients or phase points. This greatly speeds the computation. The reconstruction of pupil amplitude is also given. A convergence proof of the generalized iterative transform algorithm is given. These improved algorithms permit a more accurate characterization of complicated optical systems from their point spread functions.

Fienup, J. R.↗

Polarimetric signatures of a coniferous forest canopy based on vector radiative transfer theory

Complete polarization signatures of a coniferous forest canopy are studied by the iterative solution of the vector radiative transfer equations up to the second order. The forest canopy constituents (leaves, branches, stems, and trunk) are embedded in a multi-layered medium over a rough interface. The branches, stems and trunk scatterers are modeled as finite randomly oriented cylinders. The leaves are modeled as randomly oriented needles. For a plane wave exciting the canopy, the average Mueller matrix is formulated in terms of the iterative solution of the radiative transfer solution and used to determine the linearly polarized backscattering coefficients, the co-polarized and cross-polarized power returns, and the phase difference statistics. Numerical results are presented to investigate the effect of transmitting and receiving antenna configurations on the polarimetric signature of a pine forest. Comparison is made with measurements.

Karam, M. A.↗

Refining image segmentation by integration of edge and region data

An iterative parallel region growing (IPRG) algorithm previously developed by Tilton (1989) produces hierarchical segmentations of images from finer to coarser resolution. An ideal segmentation does not always correspond to one single iteration but to several different ones, each one producing the 'best' result for a separate part of the image. With the goal of finding this ideal segmentation, the results of the IPRG algorithm are refined by utilizing some additional information, such as edge features, and by interpreting the tree of hierarchical regions.

Le Moigne, Jacqueline↗

Demonstration of multipoint design procedures for transonic airfoils

Two multipoint design procedures were applied to reduce the wave drag of a baseline airfoil at two design points. The first procedure iteratively averages two intermediate airfoil shapes, each one redesigned at one of the two design points, to develop an improved airfoil. The second procedure iteratively averages two pressure distributions, each one obtained from an intermediate airfoil redesigned at one of the two design points, to develop an improved airfoil. Successful application of each procedure to design an improved airfoil for design points with similar chordwise pressure distributions, shock locations, and shock strengths is demonstrated. Application of a combination of both procedures to design an improved airfoil at design points with dissimilar chordwise pressure distributions, shock locations, and shock strengths is also presented. Results from wind tunnel tests of the baseline airfoil and of the improved airfoil for the dissimilar design points verified the predicted drag improvements.

Mineck, Raymond E.↗

Updating finite element dynamic models using an element-by-element sensitivity methodology

A sensitivity-based methodology for improving the finite element model of a given structure using test modal data and a few sensors is presented. The proposed method searches for both the location and sources of the mass and stiffness errors and does not interfere with the theory behind the finite element model while correcting these errors. The updating algorithm is derived from the unconstrained minimization of the squared L sub 2 norms of the modal dynamic residuals via an iterative two-step staggered procedure. At each iteration, the measured mode shapes are first expanded assuming that the model is error free, then the model parameters are corrected assuming that the expanded mode shapes are exact. The numerical algorithm is implemented in an element-by-element fashion and is capable of 'zooming' on the detected error locations. Several simulation examples which demonstate the potential of the proposed methodology are discussed.

Farhat, Charbel↗

A possibilistic approach to clustering

Fuzzy clustering has been shown to be advantageous over crisp (or traditional) clustering methods in that total commitment of a vector to a given class is not required at each image pattern recognition iteration. Recently fuzzy clustering methods have shown spectacular ability to detect not only hypervolume clusters, but also clusters which are actually 'thin shells', i.e., curves and surfaces. Most analytic fuzzy clustering approaches are derived from the 'Fuzzy C-Means' (FCM) algorithm. The FCM uses the probabilistic constraint that the memberships of a data point across classes sum to one. This constraint was used to generate the membership update equations for an iterative algorithm. Recently, we cast the clustering problem into the framework of possibility theory using an approach in which the resulting partition of the data can be interpreted as a possibilistic partition, and the membership values may be interpreted as degrees of possibility of the points belonging to the classes. We show the ability of this approach to detect linear and quartic curves in the presence of considerable noise.

Krishnapuram, Raghu↗

Models of thermal relaxation mechanics for particle simulation methods

A comparative study is conducted of the simulation of molecular vibrational relaxation in rarefied flows by means of existing models and a novel phenomenological microscopic model. This improved technique iterates between translation-rotation and rotation-vibration exchanges; equilibrium is in this way promoted if the model for the latter process is compatible with quantized oscillators. The iteration-equipartition model retains computational simplicity and promotes thermal equilibrium, even in the case of nondegenerate anharmonic quantized oscillators and multispecies gas mixtures.

Haas, Brian L.↗