Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized eigenvalue problem”

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

A modal aeroelastic analysis scheme for turbomachinery blading

An aeroelastic analysis is developed which has general application to all types of axial-flow turbomachinery blades. The approach is based on linear modal analysis, where the blade's dynamic response is represented as a linear combination of contributions from each of its in-vacuum free vibrational modes. A compressible linearized unsteady potential theory is used to model the flow over the oscillating blades. The two-dimensional unsteady flow is evaluated along several stacked axisymmetric strips along the span of the airfoil. The unsteady pressures at the blade surface are integrated to result in the generalized force acting on the blade due to simple harmonic motions. The unsteady aerodynamic forces are coupled to the blade normal modes in the frequency domain using modal analysis. An iterative eigenvalue problem is solved to determine the stability of the blade when the unsteady aerodynamic forces are included in the analysis. The approach is demonstrated by applying it to a high-energy subsonic turbine blade from a rocket engine turbopump power turbine. The results indicate that this turbine could undergo flutter in an edgewise mode of vibration.

Smith, Todd E.↗

Implicity restarted Arnoldi/Lanczos methods for large scale eigenvalue calculations

Eigenvalues and eigenfunctions of linear operators are important to many areas of applied mathematics. The ability to approximate these quantities numerically is becoming increasingly important in a wide variety of applications. This increasing demand has fueled interest in the development of new methods and software for the numerical solution of large-scale algebraic eigenvalue problems. In turn, the existence of these new methods and software, along with the dramatically increased computational capabilities now available, has enabled the solution of problems that would not even have been posed five or ten years ago. Until very recently, software for large-scale nonsymmetric problems was virtually non-existent. Fortunately, the situation is improving rapidly. The purpose of this article is to provide an overview of the numerical solution of large-scale algebraic eigenvalue problems. The focus will be on a class of methods called Krylov subspace projection methods. The well-known Lanczos method is the premier member of this class. The Arnoldi method generalizes the Lanczos method to the nonsymmetric case. A recently developed variant of the Arnoldi/Lanczos scheme called the Implicitly Restarted Arnoldi Method is presented here in some depth. This method is highlighted because of its suitability as a basis for software development.

Sorensen, Danny C.↗

A look-ahead variant of the Lanczos algorithm and its application to the quasi-minimal residual method for non-Hermitian linear systems

The Lanczos algorithm can be used both for eigenvalue problems and to solve linear systems. However, when applied to non-Hermitian matrices, the classical Lanczos algorithm is susceptible to breakdowns and potential instabilities. In addition, the biconjugate gradient (BCG) algorithm, which is the natural generalization of the conjugate gradient algorithm to non-Hermitian linear systems, has a second source of breakdowns, independent of the Lanczos breakdowns. Here, we present two new results. We propose an implementation of a look-ahead variant of the Lanczos algorithm which overcomes the breakdowns by skipping over those steps where a breakdown or a near-breakdown would occur. The new algorithm can handle look-ahead steps of any length and requires the same number of matrix-vector products and inner products per step as the classical Lanczos algorithm without look-ahead. Based on the proposed look-ahead Lanczos algorithm, we then present a novel BCG-like approach, the quasi-minimal residual (QMR) method, which avoids the second source of breakdowns in the BCG algorithm. We present details of the new method and discuss some of its properties. In particular, we discuss the relationship between QMR and BCG, showing how one can recover the BCG iterates, when they exist, from the QMR iterates. We also present convergence results for QMR, showing the connection between QMR and the generalized minimal residual (GMRES) algorithm, the optimal method in this class of methods. Finally, we give some numerical examples, both for eigenvalue computations and for non-Hermitian linear systems.

Nachtigal, Noel M.↗

The stability of numerical boundary treatments for compact high-order finite-difference schemes

The stability characteristics of various compact fourth and sixth order spatial operators are assessed using the theory of Gustafsson, Kreiss and Sundstrom (G-K-S) for the semi-discrete Initial Boundary Value Problem (IBVP). These results are then generalized to the fully discrete case using a recently developed theory of Kreiss. In all cases, favorable comparisons are obtained between the G-K-S theory, eigenvalue determination, and numerical simulation. The conventional definition of stability is then sharpened to include only those spatial discretizations that are asymptotically stable. It is shown that many of the higher order schemes which are G-K-S stable are not asymptotically stable. A series of compact fourth and sixth order schemes, which are both asymptotically and G-K-S stable for the scalar case, are then developed.

Carpenter, Mark H.↗

Multigrid solvers on parallel computers

Massively parallel computers, as considered in this investigation, are not yet available. However, a large-scale parallel computer cannot usefully be designed before the hypothetical algorithms which will employ it are studied. Most of the studies of parallel partial differential equations (PDE) solvers are based on solution techniques much slower (on sequential machines) than multigrid methods. Multigrid methods are highly parallelizable. Each of their processes can simultaneously be performed at all grid points. The present investigation is concerned with a preliminary exploration of the potential of multigrid, or, more generally, Multi-Level Adaptive Techniques (MLAT) on computers with many processors. Basic processes are considered, taking into account coarse-grid approximation, relaxation, coarse-grid corrections, full multigrid algorithms, nonlinear problems and eigenvalue problems, fine-to-coarse correction, and chains of problems. Details of parallel multigrid processing are also examined.

Brandt, A.↗

Improving stability and strength characteristics of framed structures with nonlinear behavior

In this paper an optimal design procedure is introduced to improve the overall performance of nonlinear framed structures. The design methodology presented here is a multiple-objective optimization procedure whose objective functions involve the buckling eigenvalues and eigenvectors of the structure. A constant volume with bounds on the design variables is used in conjunction with an optimality criterion approach. The method provides a general tool for solving complex design problems and generally leads to structures with better limit strength and stability. Many algorithms have been developed to improve the limit strength of structures. In most applications geometrically linear analysis is employed with the consequence that overall strength of the design is overestimated. Directly optimizing the limit load of the structure would require a full nonlinear analysis at each iteration which would be prohibitively expensive. The objective of this paper is to develop an algorithm that can improve the limit-load of geometrically nonlinear framed structures while avoiding the nonlinear analysis. One of the novelties of the new design methodology is its ability to efficiently model and design structures under multiple loading conditions. These loading conditions can be different factored loads or any kind of loads that can be applied to the structure simultaneously or independently. Attention is focused on optimal design of space framed structures. Three-dimensional design problems are more complicated to carry out, but they yield insight into real behavior of the structure and can help avoiding some of the problems that might appear in planar design procedure such as the need for out-of-plane buckling constraint. Although researchers in the field of structural engineering generally agree that optimum design of three-dimension building frames especially in the seismic regions would be beneficial, methods have been slow to emerge. Most of the research in this area has dealt with the optimization of truss and plane frame structures.

Pezeshk, Shahram↗

Reanalysis and design in structural dynamics

A unified efficient formulation for the static and dynamic reanalysis of locally modified structures is presented. The reanalysis problem is to find the structural responses when some of the element properties are adjusted as a result of design modifications or when additional structures are appended to the original system. The reanalysis problem is formulated as a problem of much lower order than the original system. This is achieved by utilizing the linearity property of the structure using the pseudoload concept together with the solution of the original system. The modifications to the structure are treated as displacement-dependent pseudoloads of the system. By expressing the modified system response as linear combinations of the response of the original system and a term depending on the pseudoload, a reduced set of response equations can be obtained. In the static and sinusoidal steady state analysis, this leads to a set of linear algebraic equations. For a free vibration analysis, this results in a reduced eigenvalue problem. Using these reduced equations, a design problem can be solved; that is, the magnitude of a specified local modification for given dynamic response characteristics can be calculated. Several examples are presented to illustrate the general formulations.

Wang, B. P.↗

A study of the response of nonlinear springs

The various phases to developing a methodology for studying the response of a spring-reinforced arch subjected to a point load are discussed. The arch is simply supported at its ends with both the spring and the point load assumed to be at midspan. The spring is present to off-set the typical snap through behavior normally associated with arches, and to provide a structure that responds with constant resistance over a finite displacement. The various phases discussed consist of the following: (1) development of the closed-form solution for the shallow arch case; (2) development of a finite difference analysis to study (shallow) arches; and (3) development of a finite element analysis for studying more general shallow and nonshallow arches. The two numerical analyses rely on a continuation scheme to move the solution past limit points, and to move onto bifurcated paths, both characteristics being common to the arch problem. An eigenvalue method is used for a continuation scheme. The finite difference analysis is based on a mixed formulation (force and displacement variables) of the governing equations. The governing equations for the mixed formulation are in first order form, making the finite difference implementation convenient. However, the mixed formulation is not well-suited for the eigenvalue continuation scheme. This provided the motivation for the displacement based finite element analysis. Both the finite difference and the finite element analyses are compared with the closed form shallow arch solution. Agreement is excellent, except for the potential problems with the finite difference analysis and the continuation scheme. Agreement between the finite element analysis and another investigator's numerical analysis for deep arches is also good.

Hyer, M. W.↗

Nonlinear structural dynamics analysis using a modified modal method

The procedure for predicting the nonlinear dynamic response of structural components subjected to a step loading is presented. The procedure is a modified modal method that involves a change of dependent variables from the unknown nodal degrees of freedom of the finite element model of the structure to a smaller set of generalized coordinates. This change of dependent variables uses a combination of the nonlinear static solution and some selected vibration mode shapes. The vibration mode shapes correspond to the eigenvectors obtained by solving a standard free vibration eigenvalue problem wherein the stiffness matrix is expanded about the nonlinear static solution. A strategy is also presented for determining which and how many vibration mode shapes to include in the transformation. The effect of inaccurate representation of the spatial distribution of the applied load on the nonlinear dynamic response is discussed for two classes of structural behavior. Application of the procedure to structures which exhibit a stiffening behavior and to those with a softening behavior is presented.

Knight, N. F., Jr.↗

Adiabatic quantum decoherence in many non-interacting subsystems induced by the coupling with a common boson bath

Highlights: • System–environment quantum correlation: a main solid state NMR decoherence channel. • Non-separable system–environment model yields realistic spin decoherence rates. • New open quantum system approach explains irreversible decay of refocused NMR echoes. • Adiabatic quantum decoherence is inherently irreversible and eigen-selective. This work addresses adiabatic quantum decoherence of many-body spin systems coupled with a boson field in the framework of open quantum systems theory. We generalize the traditional spin-boson model by considering a system–environment interaction Hamiltonian that represents a partition of non-interacting subsystems and highlights the collective correlation that appears exclusively due to the coupling with a common environment. Remarkably, this simple, exactly solvable model encompasses relevant aspects of a many-body open quantum system and features the subtle quantum effects that arise when the size scales up to a macroscopic level. We derive an analytical expression for the time dependence of the density matrix elements (in the preferred basis) without assuming coarse-graining. The resulting decoherence function is eigen-selective and is a complex exponential whose exponent has a real part that introduces a decay similar to that in the spin-boson model. On the contrary, the imaginary part depends on the quantum numbers and geometry of the whole partition and does not reflect the system temperature. Motivated by decoherence in solid-state NMR, and in search of realistic numerical estimations, we apply the theoretical results to a partition of dipole-coupled spin pairs in contact with a common phonon bath, using typical parameters of hydrated salts. The proposal allows estimating the decoherence time scale in terms of the system physical constants: sound velocity and eigenvalue distribution width. As a significant novelty, the decoherence function phase depends on the eigenvalue distribution throughout the sample. It plays the leading role, overshadowing the mechanism associated with the bath thermal state. Finally, we apply the formalism to describe decoherence in the “magic echo” NMR reversal experiment. We find that the system–environment correlation explains the origin of irreversibility, and both the decoherence rate value and its dependence on the dipolar frequency, are remarkably similar to the experiment.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analog and symbolic computation through the Koopman framework

We develop a Koopman operator framework for studying the computational structure of dynamical systems. Specifically, we show that the resolvent of the Koopman operator provides a natural abstraction of halting, yielding a ‘Koopman halting problem’ that is recursively enumerable in general. For symbolic systems, such as those defined on Cantor space, this operator formulation captures reachability between clopen sets, while for equicontinuous systems we prove that the Koopman halting problem is decidable. Our framework demonstrates that absorbing (halting) states in coarse-grained finite automata correspond to Koopman eigenfunctions with eigenvalue one, while cycles in the transition graph impose spectral constraints associated with periodic dynamics. These results provide a unifying perspective on computation in symbolic and analog systems, showing how computational universality is reflected in operator spectra, invariant subspaces, and algebraic structures. Beyond symbolic dynamics, this operator-theoretic lens opens pathways to analyze the computational properties of a broader class of dynamical systems, including polynomial and analog models, and suggests that computational hardness may admit dynamical signatures in terms of Koopman spectral structure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An integration scheme to determine the dynamic response of a launch vehicle with several payloads

The coupled equations of motion of a system composed of a launch vehicle and multiple payloads are derived. In the process, it is shown how superfluous interface degrees of freedom on the booster side can be accommodated in the formulation. The discrete system equations are directly integrated, avoiding the solution of an expensive system eigenvalue problem. A modified Newmark-Chan-Beta numerical integration scheme is used to obtain the response. The unique form of the equations of motion allow for a quick and accurate solution both for the response and the internal loads. Although completely general, the presented technique is most effective when the number of interface degrees of freedom is relatively small compared to the overall number of degrees of freedom of the system. The technique is applied to the case of the S.T.S.-S.T.-OMS Kit system. Finally, an evaluation of the presented method is included.

Engels, R. C.↗

A sequential linear optimization approach for controller design

A linear optimization approach with a simple real arithmetic algorithm is presented for reliable controller design and vibration suppression of flexible structures. Using first order sensitivity of the system eigenvalues with respect to the design parameters in conjunction with a continuation procedure, the method converts a nonlinear optimization problem into a maximization problem with linear inequality constraints. The method of linear programming is then applied to solve the converted linear optimization problem. The general efficiency of the linear programming approach allows the method to handle structural optimization problems with a large number of inequality constraints on the design vector. The method is demonstrated using a truss beam finite element model for the optimal sizing and placement of active/passive-structural members for damping augmentation. Results using both the sequential linear optimization approach and nonlinear optimization are presented and compared. The insensitivity to initial conditions of the linear optimization approach is also demonstrated.

Horta, L. G.↗

Methods for the solution of radiative transfer equation

To obtain an exact solution of the radiative-transfer equation in media where both absorption and scattering are significant, the usual approach is to use a numerical method. Three methods are known in the literature: invariant imbedding, eigenvalue-eigenfunction, and matrix doubling. This paper examines the practical application of these methods to the problem of emission from an inhomogeneous (Rayleigh) layer, the effects of layer parameters on the stability. It is found that invariant imbedding is most suitable for computing emission from an inhomogeneous layer with a temperature profile but tends to be unstable as the optical thickness of the layer increases beyond 0.5. On the other hand, the matrix-doubling method is stable for arbitrary optical thickness but is not suitable for handling multilayers. The eigenvalue-eigenfunction method is more stable than the invariant imbedding as optical thickness increases up to 2.0. It also permits temperature profile in the layer, but the computation is much more complicated. It is less stable than the matrix-doubling method when optical thickness is larger than 2.0. In general, the choice of a method is dependent on the nature of the problem.

Chen, M. F.↗

Construction and parameterization of all static and dynamic H2-optimal state feedback solutions, optimal fixed modes, and fixed decoupling zeros

This paper considers an H2 optimization problem via state feedback. The class of problems dealt with here are general singular type which have a left invertible transfer matrix function from the control input to the controlled output. This class subsumes the regular H2 optimization problems. The paper constructs and parameterizes all the static and dynamic H2 optimal state feedback solutions. Moreover, all the eigenvalues of an optimal closed-loop system are characterized. All optimal closed-loop systems share a set of eigenvalues which are termed here as the optimal fixed modes. Every H2 optimal controller must assign among the closed-loop eigenvalues the set of optimal fixed modes. This set of optimal fixed modes includes a set of optimal fixed decoupling zeros which shows the minimum absolutely necessary number and locations of pole-zero cancellations present in any H2 optimal design. It is shown that both the sets of optimal fixed modes and optimal fixed decoupling zeros do not vary depending upon whether the static or the dynamic controllers are used.

Chen, Ben M.↗

System identification in the microcomputer environment

An implementation of an algorithm for system identification, the eigenvalue realization algorithm (ERA), on a microcomputer is reported. Test results are presented to show that accurate structural identification can be performed in a microcomputer environment. It is also shown that the memory limits (640 K) of small machines are generally adequate for solving large scale problems (e.g., Hankel matrices with 15,000 elements), with run times being on the order of several minutes.

Garcia, Ephrahim↗

A discourse on sensitivity analysis for discretely-modeled structures

A descriptive review is presented of the most recent methods for performing sensitivity analysis of the structural behavior of discretely-modeled systems. The methods are generally but not exclusively aimed at finite element modeled structures. Topics included are: selections of finite difference step sizes; special consideration for finite difference sensitivity of iteratively-solved response problems; first and second derivatives of static structural response; sensitivity of stresses; nonlinear static response sensitivity; eigenvalue and eigenvector sensitivities for both distinct and repeated eigenvalues; and sensitivity of transient response for both linear and nonlinear structural response.

Adelman, Howard M.↗

Comparitive Study of High-Order Positivity-Preserving WENO Schemes

In gas dynamics and magnetohydrodynamics flows, physically, the density ρ and the pressure p should both be positive. In a standard conservative numerical scheme, however, the computed internal energy is The ideas of Zhang & Shu (2012) and Hu et al. (2012) precisely address the aforementioned issue. Zhang & Shu constructed a new conservative positivity-preserving procedure to preserve positive density and pressure for high-order Weighted Essentially Non-Oscillatory (WENO) schemes by the Lax-Friedrichs flux (WENO/LLF). In general, WENO/LLF is obtained by subtracting the kinetic energy from the total energy, resulting in a computed p that may be negative. Examples are problems in which the dominant energy is kinetic. Negative ρ may often emerge in computing blast waves. In such situations the computed eigenvalues of the Jacobian will become imaginary. Consequently, the initial value problem for the linearized system will be ill posed. This explains why failure of preserving positivity of density or pressure may cause blow-ups of the numerical algorithm. The adhoc methods in numerical strategy which modify the computed negative density and/or the computed negative pressure to be positive are neither a conservative cure nor a stable solution. Conservative positivity-preserving schemes are more appropriate for such flow problems. too dissipative for flows such as turbulence with strong shocks computed in direct numerical simulations (DNS) and large eddy simulations (LES). The new conservative positivity-preserving procedure proposed in Hu et al. (2012) can be used with any high-order shock-capturing scheme, including high-order WENO schemes using the Roe's flux (WENO/Roe). The goal of this study is to compare the results obtained by non-positivity-preserving methods with the recently developed positivity-preserving schemes for representative test cases. In particular the more di cult 3D Noh and Sedov problems are considered. These test cases are chosen because of the negative pressure/density most often exhibited by standard high-order shock-capturing schemes. The simulation of a hypersonic nonequilibrium viscous shock tube that is related to the NASA Electric Arc Shock Tube (EAST) is also included. EAST is a high-temperature and high Mach number viscous nonequilibrium ow consisting of 13 species. In addition, as most common shock-capturing schemes have been developed for problems without source terms, when applied to problems with nonlinear and/or sti source terms these methods can result in spurious solutions, even when solving a conservative system of equations with a conservative scheme. This kind of behavior can be observed even for a scalar case as well as for the case consisting of two species and one reaction.. This EAST example indicated that standard high-order shock-capturing methods exhibit instability of density/pressure in addition to grid-dependent discontinuity locations with insufficient grid points. The evaluation of these test cases is based on the stability of the numerical schemes together with the accuracy of the obtained solutions.

Schemes↗