Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Eigenvalue algorithm”

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 109 records · Page 6

Application of spectral collocation techniques to the stability of swirling flows

The linearized stability equations in cylindrical coordinates of a Chebyshev spectral collocation method for the temporal and spatial stability of swirling flows are presently solved with the eigenvalues obtained through the use of the QZ routine. The algorithm thus created is robust and easily adaptable to a range of flow configurations encompassing internal and external flows with minor boundary condition application modifications. Accuracy and efficiency tests of the method are made for the cases of plane Poiseulle, rotating-pipe, and trailing line vortex flows.

Khorrami, Mehdi R.↗

Modeling the spatiotemporal organization of velocity storage in the vestibuloocular reflex by optokinetic studies

1. A generalized three-dimensional state space model of visual vestibular interaction was developed. Matrix and dynamical system operators associated with inputs from the semicircular canals, otolith velocity estimator, and the visual system have been incorporated into the model, which focus on their relationship to the velocity storage integrator. 2. A relationship was postulated between the eigenvalues and the direction of the eigenvectors of the system matrix and the orientation of the spatial vertical. It was assumed that the system matrix for a tilted position was a composition of two linear transformations of the system matrix for the upright position. One transformation modifies the eigenvalues of the system matrix, whereas another rotates the eigenvectors of the system matrix. The pitch and roll eigenvectors rotate with the head, whereas the yaw axis eigenvector remains approximately spatially invariant. 3. Based on the three-dimensional model, a computational procedure was formulated to identify the eigenvalues and eigenvectors of the system matrix with the use of a modification of the marquardt algorithm. With the use of data obtained from a monkey, it was shown that the three-dimensional behavior of velocity storage cannot be predicted solely in terms of its time constants, i.e., the inverse of its eigenvalues. With the use of the same eigenvalues the data could either be fit or not fit, depending on the eigenvector directions. Therefore, it is necessary to specify eigenvector directions when characterizing velocity storage in three dimensions. 4. Parameters found with the use of the Marquardt algorithm were incorporated into the model. Diagonal matrices in a head coordinate frame were introduced for coupling the visual system to the integrator and to the direct optokinetic pathway. Simulations of optokinetic nystagmus (OKN) and optokinetic after-nystagmus (OKAN) were run. The model predicted the behavior of yaw and pitch OKN and OKAN when the animal is upright. It also predicted the cross-coupling in the side down position. The trajectories in velocity space were also accurately simulated. 5. One of the predictions of the model is that when the stimulus direction is along an eigenvector, the trajectory in velocity space is a straight line. Using the "spectral width" of the residuals from a straight line sequence during OKAN, we developed a methodology to estimate how close the OKAN decay was to an eigenvector trajectory. 6. Thus we have developed a model-based approach for studying and interpreting the response characteristics of velocity storage in three dimensions.(ABSTRACT TRUNCATED AT 400 WORDS).

Non-NASA Center↗

INVESTIGATING THE FEASIBILITY AND STABILITY FOR MODELING ACOUSTIC WAVE SCATTERING USING A TIME-DOMAIN BOUNDARY INTEGRAL EQUATION WITH IMPEDANCE BOUNDARY CONDITION

Reducing aircraft noise is a major objective in the field of computational aeroacoustics. When designing next generation quiet and environmentally friendly aircraft, it is important to be able to accurately and efficiently predict the acoustic scattering by an aircraft body from a given noise source. Acoustic liners are an effective tool for aircraft noise reduction and are characterized by a frequency-dependent impedance. Converted into the time-domain using Fourier transforms, an impedance boundary condition can be used to simulate the acoustic wave scattering by geometric bodies treated with acoustic liners. This work considers using either an impedance or an admittance (inverse of impedance) boundary condition to allow for acoustic scattering problems to be modeled with geometries consisting of both un-lined and lined surfaces. Three acoustic liner models are discussed: the Extended Helmholtz Resonator Model, the Three-Parameter Impedance Model, and the Broadband Impedance Model. In both the Helmholtz and Three-Parameter models, liner impedance is specified at a given frequency, whereas the Broadband model allows for the investigation of multiple frequencies simultaneously. The impedance and admittance boundary conditions for acoustic liners are derived for each model and coupled with a time-domain boundary integral equation. The scattering solution is obtained iteratively using a boundary element method with constant spatial and third-order temporal basis functions. Time-domain boundary integral equations are unfortunately prone to numerical instabilities due to resonant frequencies resulting from non-trivial solutions in the interior domain. When reformulated with the Burton-Miller method, the instabilities are eliminated. Using a Burton-Miller reformulation, the stability of the boundary element method assuming a liner boundary condition is assessed using eigenvalue analysis. The stability of each liner model is discussed, and it is shown that the Three-Parameter and Broadband models are sufficient for modeling an acoustic liner on the surface of scattering bodies. The Helmholtz model demonstrates strict limitations for stability, whereas the Three-Parameter and Broadband models are stable for most cases. Also included in this work is an assessment of the spatial accuracy of the time-domain boundary element method with respect to the surface element basis functions, as well as a performance study of the numerical algorithm.

computational mathematics↗

Control of large flexible space structures using pole placement design techniques

A design approach via the pole placement techniques for the class of large flexible space structures is developed. The numerical problems in pole placement algorithm, arising from large dimension systems and the extremely low frequency eigenvalues which occur in large space structure models are examined. It shows these numerical difficulties may be overcome by properly selecting the sensor/actuator locations and introducing a frequency scaling scheme. The concepts of this paper are illustrated by some numerical studies on the linear feedback control design of a representative large spacecraft consisting of a small rigid core with ten radial booms (five booms 1000 ft long and five shorter booms 700 ft long) lying in a plane.

Wu, Y. W.↗

Vortex breakdown simulation based on a nonlinear inviscid model

It is shown that the inviscid equations governing steady axisymmetric flow with swirl, admit solutions with closed streamlines. Results are obtained using two different numerical algorithms. The first is based on a multigrid method for nonlinear eigenvalue problems, while the second is based on a least squares formulation.

Hafez, M. M.↗

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

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

ALARM: A highly efficient eigenvalue extraction routine for very large matrixes

A highly efficient computer program, called ALARM, for the determination of eigenvalues and eigenvectors of large symmetric matrices (over 10,000 degrees of freedom), was described. As such, it is highly useful for analyzing complex finite element and finite difference idealizations encountered in structural dynamics and acoustic probelms. The program is based upon a scheme which reduces a large matrix to an equivalent tridiagonal one of much smaller size. The main strength of the algorithm lies in its ability to retain all the information required to obtain the eigenvalues at either end of the original matrix spectrum.

Ojalvo, I. U.↗

How to Estimate Attitude from Vector Observations

The most robust estimators minimizing Wahba's loss function are Davenport's q method and the Singular Value Decomposition (SVD) method. The q method is faster than the SVD method with three or more measurements. The other algorithms are less robust since they solve the characteristic polynomial equation to find the maximum eigenvalue of Davenport's K matrix. They are only preferable when speed or processor power is an important consideration. Of these, Fast Optimal Attitude Matrix (FOAM) is the most robust and faster than the q method. Robustness is only an issue for measurements with widely differing accuracies, so the fastest algorithms, Quaternion ESTimator (QUEST), EStimator of the Optimal Quaternion (ESOQ), and ESOQ2, are well suited to star sensor applications.

Markley, F. Landis↗

Optical systolic solutions of linear algebraic equations

The philosophy and data encoding possible in systolic array optical processor (SAOP) were reviewed. The multitude of linear algebraic operations achievable on this architecture is examined. These operations include such linear algebraic algorithms as: matrix-decomposition, direct and indirect solutions, implicit and explicit methods for partial differential equations, eigenvalue and eigenvector calculations, and singular value decomposition. This architecture can be utilized to realize general techniques for solving matrix linear and nonlinear algebraic equations, least mean square error solutions, FIR filters, and nested-loop algorithms for control engineering applications. The data flow and pipelining of operations, design of parallel algorithms and flexible architectures, application of these architectures to computationally intensive physical problems, error source modeling of optical processors, and matching of the computational needs of practical engineering problems to the capabilities of optical processors are emphasized.

Neuman, C. P.↗

Spectral decomposition of a matrix using the generalized sign matrix

An algorithm for spectral decomposition is presented which does not require knowledge of eigenvalues and eigenvectors. A set of eigenprojectors are defined which covers the entire spectrum of a matrix, and special attention is given to the projection on the zero eigenvalue. Some useful applications are discussed in the paper.

Denman, E. D.↗

Computation of vibration mode elastic-rigid and effective weight coefficients from finite-element computer program output

Post-processing algorithms are given to compute the vibratory elastic-rigid coupling matrices and the modal contributions to the rigid-body mass matrices and to the effective modal inertias and masses. Recomputation of the elastic-rigid coupling matrices for a change in origin is also described. A computational example is included. The algorithms can all be executed by using standard finite-element program eigenvalue analysis output with no changes to existing code or source programs.

Levy, R.↗

Frequency domain synthesis of optimal inputs for adaptive identification and control

The input design problem of selecting appropriate inputs for use in SISO adaptive identification and model reference adaptive control algorithms is considered. Averaging theory is used to characterize the optimal inputs in the frequency domain. The design problem is formulated as an optimization problem which maximizes the smallest eigenvalue of the average information matrix over power constrained signals, and the global optimal solution is obtained using a convergent numerical algorithm. A bound on the frequency search range required in the design algorithm has been determined in terms of the desired performance.

Fu, Li-Chen↗

Optimal trajectories for aeroassisted orbital transfer

Consideration is given to classical and minimax problems involved in aeroassisted transfer from high earth orbit (HEO) to low earth orbit (LEO). The transfer is restricted to coplanar operation, with trajectory control effected by means of lift modulation. The performance of the maneuver is indexed to the energy expenditure or, alternatively, the time integral of the heating rate. Firist-order optimality conditions are defined for the classical approach, as are a sequential gradient-restoration algorithm and a combined gradient-restoration algorithm. Minimization techniques are presented for the aeroassisted transfer energy consumption and time-delay integral of the heating rate, as well as minimization of the pressure. It is shown that the eigenvalues of the Jacobian matrix of the differential system is both stiff and unstable, implying that the sequential gradient restoration algorithm in its present version is unsuitable. A new method, involving a multipoint approach to the two-poing boundary value problem, is recommended.

Miele, A.↗

Eigensolver for a Sparse, Large Hermitian Matrix

A parallel-processing computer program finds a few eigenvalues in a sparse Hermitian matrix that contains as many as 100 million diagonal elements. This program finds the eigenvalues faster, using less memory, than do other, comparable eigensolver programs. This program implements a Lanczos algorithm in the American National Standards Institute/ International Organization for Standardization (ANSI/ISO) C computing language, using the Message Passing Interface (MPI) standard to complement an eigensolver in PARPACK. [PARPACK (Parallel Arnoldi Package) is an extension, to parallel-processing computer architectures, of ARPACK (Arnoldi Package), which is a collection of Fortran 77 subroutines that solve large-scale eigenvalue problems.] The eigensolver runs on Beowulf clusters of computers at the Jet Propulsion Laboratory (JPL).

Tisdale, E. Robert↗

Direct and implicit optical matrix-vector algorithms

New direct and implicit algorithms for optical matrix-vector and systolic array processors are considered. Direct rather than indirect algorithms to solve linear systems and implicit rather than explicit solutions to solve second-order partial differential equations are discussed. In many cases, such approaches more properly utilize the advantageous features of optical systolic array processors. The matrix-decomposition operation (rather than solution of the simplified matrix-vector equation that results) is recognized as the computationally burdensome aspect of such problems that should be computed on an optical system. The Householder QR matrix-decomposition algorithm is considered as a specific example of a direct solution. Extensions to eigenvalue computation and formation of matrices of special structure are also noted.

Casasent, D.↗

Multigrid calculations of 3-D turbulent viscous flows

Convergence properties of a multigrid algorithm, developed to calculate compressible viscous flows, are analyzed by a vector sequence eigenvalue estimate. The full 3-D Reynolds-averaged Navier-Stokes equations are integrated by an implicit multigrid scheme while a k-epsilon turbulence model is solved, uncoupled from the flow equations. Estimates of the eigenvalue structure for both single and multigrid calculations are compared in an attempt to analyze the process as well as the results of the multigrid technique. The flow through an annular turbine is used to illustrate the scheme's ability to calculate complex 3-D flows.

Yokota, Jeffrey W.↗