Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Eigenvectors”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

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↗
NASA NTRS1987

Robust eigensystem assignment for flexible structures

An improved method is developed for eigenvalues and eigenvectors placement of a closed-loop control system using either state or output feedback. The method basically consists of three steps. First, the singular value of QR decomposition is used to generate an orthonormal basis that spans admissible eigenvector space corresponding to each assigned eigenvalue. Secondly, given a unitary matrix, the eigenvector set which best approximates the given matrix in the least-square sense and still satisfy eigenvalue cosntraints is determined. Thirdly, a unitary matrix is sought to minimize the error between the unitary matrix and the assignable eigenvector matrix. For use as the desired eigenvector set, two matrices, namely, the open-loop eigenvector matrix and its closest unitary matrix are proposed. The latter matrix generally encourages both minimum conditioning and control gains. In addition, the algorithm is formulated in real arithmetic for efficient implementation. To illustrate the basic concepts, numerical examples are included.

Juang, Jer-Nan↗
NASA NTRS1993

A robust multilevel simultaneous eigenvalue solver

Multilevel (ML) algorithms for eigenvalue problems are often faced with several types of difficulties such as: the mixing of approximated eigenvectors by the solution process, the approximation of incomplete clusters of eigenvectors, the poor representation of solution on coarse levels, and the existence of close or equal eigenvalues. Algorithms that do not treat appropriately these difficulties usually fail, or their performance degrades when facing them. These issues motivated the development of a robust adaptive ML algorithm which treats these difficulties, for the calculation of a few eigenvectors and their corresponding eigenvalues. The main techniques used in the new algorithm include: the adaptive completion and separation of the relevant clusters on different levels, the simultaneous treatment of solutions within each cluster, and the robustness tests which monitor the algorithm's efficiency and convergence. The eigenvectors' separation efficiency is based on a new ML projection technique generalizing the Rayleigh Ritz projection, combined with a technique, the backrotations. These separation techniques, when combined with an FMG formulation, in many cases lead to algorithms of O(qN) complexity, for q eigenvectors of size N on the finest level. Previously developed ML algorithms are less focused on the mentioned difficulties. Moreover, algorithms which employ fine level separation techniques are of O(q(sub 2)N) complexity and usually do not overcome all these difficulties. Computational examples are presented where Schrodinger type eigenvalue problems in 2-D and 3-D, having equal and closely clustered eigenvalues, are solved with the efficiency of the Poisson multigrid solver. A second order approximation is obtained in O(qN) work, where the total computational work is equivalent to only a few fine level relaxations per eigenvector.

Costiner, Sorin↗
DOE OSTI2021

Rodeo Algorithm for Quantum Computing

We present a stochastic quantum computing algorithm that can prepare any eigenvector of a quantum Hamiltonian within a selected energy interval $\ [E-\epsilon, E+\epsilon]$. In order to reduce the spectral weight of all other eigenvectors by a suppression factor δ, the required computational effort scales as $\ O[|\log \delta|/(p \epsilon)]$, where p s the squared overlap of the initial state with the target eigenvector. The method, which we call the rodeo algorithm, uses auxiliary qubits to control the time evolution of the Hamiltonian minus some tunable parameter E . In this manner, we converge to the target eigenvector with exponential accuracy in the number of measurements. In addition to preparing eigenvectors, the method can also compute the full spectrum of the Hamiltonian. We illustrate the performance with several examples. For energy eigenvalue determination with error $\epsilon$, the computational scaling is $\ O[(\log \epsilon)^2/(p \epsilon)]$. For eigenstate preparation, the computational scaling is $\ O(\log \Delta/p)$, where $\Delta$ is the magnitude of the orthogonal component of the residual vector. The speed for eigenstate preparation is exponentially faster than that for phase estimation or adiabatic evolution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS2000

Low-dimensional Representation of Error Covariance

Ensemble and reduced-rank approaches to prediction and assimilation rely on low-dimensional approximations of the estimation error covariances. Here stability properties of the forecast/analysis cycle for linear, time-independent systems are used to identify factors that cause the steady-state analysis error covariance to admit a low-dimensional representation. A useful measure of forecast/analysis cycle stability is the bound matrix, a function of the dynamics, observation operator and assimilation method. Upper and lower estimates for the steady-state analysis error covariance matrix eigenvalues are derived from the bound matrix. The estimates generalize to time-dependent systems. If much of the steady-state analysis error variance is due to a few dominant modes, the leading eigenvectors of the bound matrix approximate those of the steady-state analysis error covariance matrix. The analytical results are illustrated in two numerical examples where the Kalman filter is carried to steady state. The first example uses the dynamics of a generalized advection equation exhibiting nonmodal transient growth. Failure to observe growing modes leads to increased steady-state analysis error variances. Leading eigenvectors of the steady-state analysis error covariance matrix are well approximated by leading eigenvectors of the bound matrix. The second example uses the dynamics of a damped baroclinic wave model. The leading eigenvectors of a lowest-order approximation of the bound matrix are shown to approximate well the leading eigenvectors of the steady-state analysis error covariance matrix.

Tippett, Michael K.↗
NASA NTRSDate not supplied

Mode Projection Method for Target Mode Identification

A method for projecting flight configuration eigenvectors onto the vector space of the test configuration eigenvectors is proposed. The underlying concept of the proposed method is that any flight configuration eigenvectors that can be replicated by a linear combination of test configuration eigenvectors, is correlated, if the constituent test eigenvectors are themselves correlated. Therefore, the modal test target mode shapes should be those test modes that combine to form the important modes of the flight configurations. This approach also recognizes that it is the deformed shapes that dictate what sections of the structure are “highly strained” (in a relative sense, within each mode shape), and that it is these highly strained sections that require an accurate stiffness representation to achieve an accurate model correlation.

Modal Testing↗
NASA NTRSDate not supplied

Mode Projection for Target Mode Identification

A method for projecting flight configuration eigenvectors onto the vector space of the test configuration eigenvectors is proposed. The underlying concept of the proposed method is that any flight configuration eigenvectors that can be replicated by a linear combination of test configuration eigenvectors, is correlated, if the constituent test eigenvectors are themselves correlated. Therefore, the modal test target mode shapes should be those test modes that combine to form the important modes of the flight configurations. This approach also recognizes that it is the deformed shapes that dictate what sections of the structure are “highly strained” (in a relative sense, within each mode shape), and that these “highly strained” sections require an accurate stiffness representation to achieve an accurate model correlation.

modal testing↗
NASA NTRSDate not supplied

Mode Projection Method for Target Mode Identification

A method for projecting flight configuration eigenvectors onto the vector space of the test configuration eigenvectors is proposed. The underlying concept of the proposed method is that any flight configuration eigenvectors (that can be replicated by a linear combination of test configuration eigenvectors) is correlated if the constituent test eigenvectors are themselves correlated. Therefore, the modal test target mode shapes should be those test modes that combine to form the important modes of the flight configurations. This approach also recognizes that it is the deformed shapes that dictate what sections of the structure are “highly strained” (in a relative sense, within each mode shape), and that these “highly strained” sections require an accurate stiffness representation to achieve an accurate model correlation.

Jeffrey A Peck↗
DOE OSTI2021

Delocalization of a non-Hermitian quantum walk on random media in one dimension

Highlights: • We study the localization-delocalization transition of a non-Hermitian quantum walk. • We find that the phase transition is similar to the one in the Hatano-Nelson model. • All eigenvectors get extended and all eigenvalues become complex at the transition. • This implies that the localization lengths of all eigenvectors are the same. We first review the localization–delocalization transition of a non-Hermitian random tight-binding Anderson model, called the Hatano–Nelson model. We then report a new result for a non-Hermitian extension of a discrete-time quantum walk on a one-dimensional random medium; we numerically find a delocalization transition similar to one of the Hatano–Nelson model. As a common feature to both models, at the transition point, an eigenvector gets delocalized and at the same time the corresponding energy eigenvalue (for the latter quantum-walk model, the imaginary unit times the phase of the eigenvalue of the time-evolution operator) becomes complex. One of the unique properties of the present non-Hermitian quantum walk is that the localization length of all eigenvectors is the same, and thereby all eigenstates simultaneously undergo the delocalization transition and all energy eigenvalues become complex at the same time when we turn up a non-Hermitian parameter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Solving a class of infinite-dimensional tensor eigenvalue problems by translational invariant tensor ring approximations

Here, we examine a method for solving an infinite-dimensional tensor eigenvalue problem Hx = λx, where the infinite-dimensional symmetric matrix H exhibits a translational invariant structure. We provide a formulation of this type of problem from a numerical linear algebra point of view and describe how a power method applied to e -Ht is used to obtain an approximation to the desired eigenvector. This infinite-dimensional eigenvector is represented in a compact way by a translational invariant infinite Tensor Ring (iTR). Low rank approximation is used to keep the cost of subsequent power iterations bounded while preserving the iTR structure of the approximate eigenvector. We show how the averaged Rayleigh quotient of an iTR eigenvector approximation can be efficiently computed and introduce a projected residual to monitor its convergence. In the numerical examples, we illustrate that the norm of this projected iTR residual can also be used to automatically modify the time step to ensure accurate and rapid convergence of the power method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Accelerating eigenvalue computation for nuclear structure calculations via perturbative corrections

Subspace projection methods utilizing perturbative corrections have been proposed for computing the lowest few eigenvalues and corresponding eigenvectors of large Hamiltonian matrices. In this paper, we build upon these methods and introduce the term Subspace Projection with Perturbative Corrections (SPPC) method to refer to this approach. We tailor the SPPC for nuclear many-body Hamiltonians represented in a truncated configuration interaction subspace, i.e., the no-core shell model (NCSM). We use the hierarchical structure of the NCSM Hamiltonian to partition the Hamiltonian as the sum of two matrices. The first matrix corresponds to the Hamiltonian represented in a small configuration space, whereas the second is viewed as the perturbation to the first matrix. Eigenvalues and eigenvectors of the first matrix can be computed efficiently. Because of the split, perturbative corrections to the eigenvectors of the first matrix can be obtained efficiently from the solutions of a sequence of linear systems of equations defined in the small configuration space. These correction vectors can be combined with the approximate eigenvectors of the first matrix to construct a subspace from which more accurate approximations of the desired eigenpairs can be obtained. We show by numerical examples that the SPPC method can be more efficient than conventional iterative methods for solving large-scale eigenvalue problems such as the Lanczos, block Lanczos and the locally optimal block preconditioned conjugate gradient (LOBPCG) method. The method can also be combined with other methods to avoid convergence stagnation.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

The relation between quasars’ optical spectra and variability

Abstract Brightness variation is an essential feature of quasars, but its mechanism and relationship to other physical quantities are not understood well. We aimed to find the relationship between the optical variability and spectral features to reveal the regularity behind the random variation. It is known that a quasar’s Fe ii/Hβ flux ratio and equivalent width of [O iii]5007 are negatively correlated; this is called Eigenvector 1. In this work, we visualized the relationship between the position on this Eigenvector 1 (EV1) plane and how the brightness of the quasars had changed after ∼10 yr. We conducted three analyses, using a different quasar sample in each. The first analysis showed the relation between the quasars’ distributions on the EV1 plane and how much they had changed brightness, using 13438 Sloan Digital Sky Survey quasars. This result shows how brightness changes later are clearly related to the position on the EV1 plane. In the second analysis, we plotted the sources reported as “changing-look quasars” (or “changing-state quasars”) on the EV1 plane. This result shows that the position on the EV1 plane corresponds to the activity level of each source, and the bright or dim states of them are distributed on the opposite sides divided by the typical quasar distribution. In the third analysis, we examined the transition vectors on the EV1 plane using sources with multiple-epoch spectra. This result shows that the brightening and dimming sources move on a similar path and they reach a position corresponding to the opposite activity level. We also found this trend is opposite to the empirical rule that $R_{\rm {Fe\, \small {II}}}$ positively correlated with the Eddington ratio, which has been proposed based on the trends of a large number of quasars. From all these analyses, it is indicated that quasars tend to oscillate between both sides of the distribution ridge on the EV1 plane; each of them corresponds to a dim state and a bright state. This trend in optical variation suggests that significant brightness changes, such as changing-look quasars, are expected to repeat.

Astronomy & Astrophysics↗
NASA NTRS1984

Design of multivariable feedback control systems via spectral assignment using reduced-order models and reduced-order observers

The feasibility of using reduced order models and reduced order observers with eigenvalue/eigenvector assignment procedures is investigated. A review of spectral assignment synthesis procedures is presented. Then, a reduced order model which retains essential system characteristics is formulated. A constant state feedback matrix which assigns desired closed loop eigenvalues and approximates specified closed loop eigenvectors is calculated for the reduced order model. It is shown that the eigenvalue and eigenvector assignments made in the reduced order system are retained when the feedback matrix is implemented about the full order system. In addition, those modes and associated eigenvectors which are not included in the reduced order model remain unchanged in the closed loop full order system. The full state feedback design is then implemented by using a reduced order observer. It is shown that the eigenvalue and eigenvector assignments of the closed loop full order system rmain unchanged when a reduced order observer is used. The design procedure is illustrated by an actual design problem.

Mielke, R. R.↗
NASA NTRS1985

Design of multivariable feedback control systems via spectral assignment using reduced-order models and reduced-order observers

The feasibility of using reduced order models and reduced order observers with eigenvalue/eigenvector assignment procedures is investigated. A review of spectral assignment synthesis procedures is presented. Then, a reduced order model which retains essential system characteristics is formulated. A constant state feedback matrix which assigns desired closed loop eigenvalues and approximates specified closed loop eigenvectors is calculated for the reduced order model. It is shown that the eigenvalue and eigenvector assignments made in the reduced order system are retained when the feedback matrix is implemented about the full order system. In addition, those modes and associated eigenvectors which are not included in the reduced order model remain unchanged in the closed loop full order system. The fulll state feedback design is then implemented by using a reduced order observer. It is shown that the eigenvalue and eigenvector assignments of the closed loop full order system remain unchanged when a reduced order observer is used. The design procedure is illustrated by an actual design problem.

Mielke, R. R.↗
NASA NTRS1984

Description of sunspot cycles by orthogonal functions

Based on the principal component analysis technique and evidence for a 22-yr double-sunspot cycle periodicity. The time series of sunspot numbers is represented as a sum of mutually orthogonal eigenvectors in the time domain. It is shown that the first two eigenvectors account for about 90 percent of the cumulative 'signal power,' and that this is sufficient for reconstruction of the raw data curve. It is also noted that the second eigenvector behaves as the time derivative of the first, and that a phase-plane plot of these eigenvectors (i.e. a plot of a variable vs. its rate of change) suggests that the sun's sunspot cycle is driven by an oscillator; the implication is that, embedded within the sun, a chronometer is at work (e.g. Dicke, 1979).

Teuber, D. L.↗
NASA NTRS1987

Modal decoupling insensitivity

This note deals with the design of an output feedback control system such that selected closed-loop eigenvalues are insensitive, while the corresponding eigenvectors preserve a prescribed decoupling under parameter variation. This results in restricting specified elements of an eigenvector to be insensitive, rather than the entire eigenvector. This requirement is henceforth referred to as modal decoupling insensitivity. Sufficient conditions for modal decoupling insensitivity are derived. These conditions offer the advantage of increased flexibility in eigenvector assignment, but the constraint on the feedback matrix is more restrictive. A numerical example is presented to illustrate the design procedure.

Raman, K. V.↗
NASA NTRS1988

An O(N squared) method for computing the eigensystem of N by N symmetric tridiagonal matrices by the divide and conquer approach

An efficient method is proposed to solve the eigenproblem of N by N Symmetric Tridiagonal (ST) matrices. Unlike the standard eigensolvers which necessitate O(N cubed) operations to compute the eigenvectors of such ST matrices, the proposed method computes both the eigenvalues and eigenvectors with only O(N squared) operations. The method is based on serial implementation of the recently introduced Divide and Conquer (DC) algorithm. It exploits the fact that by O(N squared) of DC operations, one can compute the eigenvalues of N by N ST matrix and a finite number of pairs of successive rows of its eigenvector matrix. The rest of the eigenvectors--all of them or one at a time--are computed by linear three-term recurrence relations. Numerical examples are presented which demonstrate the superiority of the proposed method by saving an order of magnitude in execution time at the expense of sacrificing a few orders of accuracy.

Gill, Doron↗
NASA NTRS1990

Robust eigensystem assignment for second-order estimators

An approach for the robust eigensystem assignment of flexible structures using full state or output feedback is developed. Using the second-order dynamic equations, the approach can assign the eigenvalues of the system via velocity and displacement feedbacks, or acceleration and velocity feedbacks. The eigenvalues and eigenvectors of the system are assigned, via the second-order eigenvalue problem for the structural system, in two steps. First, an orthonormal basis spanning the attainable closed-loop eigenvector space corresponding to each desired closed-loop eigenvalue is generated using the Singular Value or QR decompositions. Second, a sequential procedure is used to choose a set of closed-loop eigenvectors that are as close as possible to the column space of a well-conditioned target matrix. Among the possible choices of the target matrix, the closest unitary matrix to the open-loop eigenvector matrix appears to be a suitable choice. A numerical example is given to illustrate the proposed algorithm.

Juang, Jer-Nan↗