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 91 records · Page 5

Vlasov equation eigenvalues and eigenvectors for Fourier-Hermite dispersion matrices of order greater than 1,000

The connection between the Van Kampen and Landau representations of the Vlasov equations has been extended to Fourier-Hermite expansions containing more than 1000 terms by taking advantage of the properties of tridiagonal matrices. These numerical results are regarded as conclusive indications of the nonuniformly convergent behavior of the approximation curve in the limit of an infinite number of terms and represent an extension of work begun by Grant (1967) and by Grant and Feix (1967).

Grant, F. C.↗

On the design derivatives of eigenvalues and eigenvectors for distributed parameter systems

In this paper, analytic expressions are obtained for the design derivatives of eigenvalues and eigenfunctions of self-adjoint linear distributed parameter systems. Explicit treatment of boundary conditions is avoided by casting the eigenvalue equation into integral form. Results are expressed in terms of the linear operators defining the eigenvalue problem, and are therefore quite general. Sufficiency conditions appropriate to structural optimization of eigenvalues are obtained.

Reiss, R.↗

A parallel algorithm for the eigenvalues and eigenvectors for a general complex matrix

A new parallel Jacobi-like algorithm is developed for computing the eigenvalues of a general complex matrix. Most parallel methods for this parallel typically display only linear convergence. Sequential norm-reducing algorithms also exit and they display quadratic convergence in most cases. The new algorithm is a parallel form of the norm-reducing algorithm due to Eberlein. It is proven that the asymptotic convergence rate of this algorithm is quadratic. Numerical experiments are presented which demonstrate the quadratic convergence of the algorithm and certain situations where the convergence is slow are also identified. The algorithm promises to be very competitive on a variety of parallel architectures.

Shroff, Gautam↗

Spatial orientation of the vestibular system

1. A simplified three-dimensional state space model of visual vestibular interaction was formulated. Matrix and dynamical system operators representing coupling from the semicircular canals and the visual system to the velocity storage integrator were incorporated into the model. 2. It was postulated 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 while another rotates the pitch and roll eigenvectors with the head, while maintaining the yaw axis eigenvector approximately spatially invariant. Using this representation, the response characteristics of the pitch, roll, and yaw eye velocity were obtained in terms of the eigenvalues and associated eigenvectors. 3. Using OKAN data obtained from monkeys and comparing to the model predictions, the eigenvalues and eigenvectors of the system matrix were identified as a function of tilt to the side or of tilt to the prone positions, using a modification of the Marquardt algorithm. The yaw eigenvector for right-side-down tilt and for downward pitch cross-coupling was approximately 30 degrees from the spatial vertical. For the prone position, the eigenvector was computed to be approximately 20 degrees relative to the spatial vertical. For both side-down and prone positions, oblique OKN induced along eigenvector directions generated OKAN which decayed to zero along a straight line with approximately a single time constant. This was verified by a spectral analysis of the residual sequence about the straight line fit to the decaying data. The residual sequence was associated with a narrow autocorrelation function and a wide power spectrum. 4. Parameters found using the Marquardt algorithm were incorporated into the model. Diagonal matrices in a head coordinate frame were introduced to represent the direct pathway and the coupling of the visual system to the integrator. Model simulations predicted the behavior of yaw and pitch OKN and OKAN when the animal was upright, as well as the cross-coupling in the tilted position. The trajectories in velocity space were also accurately simulated. 5. There were similarities between the monkey eigenvectors and human perception of the spatial vertical. For side-down tilts and downward eye velocity cross-coupling, there was only an Aubert (A) effect. For upward eye velocity cross-coupling there were both Muller (E) and Aubert (A) effects. The mean of the eigenvectors for upward and downward eye velocities overlay human 1 x g perceptual data.(ABSTRACT TRUNCATED AT 400 WORDS).

NASA Discipline Neuroscience↗

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↗

SU-C-BRA-07: Variability of Patient-Specific Motion Models Derived Using Different Deformable Image Registration Algorithms for Lung Cancer Stereotactic Body Radiotherapy (SBRT) Patients

Purpose: To study the variability of patient-specific motion models derived from 4-dimensional CT (4DCT) images using different deformable image registration (DIR) algorithms for lung cancer stereotactic body radiotherapy (SBRT) patients. Methods: Motion models are derived by 1) applying DIR between each 4DCT image and a reference image, resulting in a set of displacement vector fields (DVFs), and 2) performing principal component analysis (PCA) on the DVFs, resulting in a motion model (a set of eigenvectors capturing the variations in the DVFs). Three DIR algorithms were used: 1) Demons, 2) Horn-Schunck, and 3) iterative optical flow. The motion models derived were compared using patient 4DCT scans. Results: Motion models were derived and the variations were evaluated according to three criteria: 1) the average root mean square (RMS) difference which measures the absolute difference between the components of the eigenvectors, 2) the dot product between the eigenvectors which measures the angular difference between the eigenvectors in space, and 3) the Euclidean Model Norm (EMN), which is calculated by summing the dot products of an eigenvector with the first three eigenvectors from the reference motion model in quadrature. EMN measures how well an eigenvector can be reconstructed using another motion model derived using a different DIR algorithm. Results showed that comparing to a reference motion model (derived using the Demons algorithm), the eigenvectors of the motion model derived using the iterative optical flow algorithm has smaller RMS, larger dot product, and larger EMN values than those of the motion model derived using Horn-Schunck algorithm. Conclusion: The study showed that motion models vary depending on which DIR algorithms were used to derive them. The choice of a DIR algorithm may affect the accuracy of the resulting model, and it is important to assess the suitability of the algorithm chosen for a particular application. This project was supported, in part, through a Master Research Agreement with Varian Medical Systems, Inc, Palo Alto, CA.

60 APPLIED LIFE SCIENCES↗

SU-E-J-151: Day-To-Day Variations in Fraction-Specific Motion Modeling Using Patient 4DCBCT Images

Purpose: The goal of this study is to quantify the interfraction reproducibility of patient-specific motion models derived from 4DCBCT acquired on the day of treatment of lung cancer stereotactic body radiotherapy (SBRT) patients. Methods: Motion models are derived from patient 4DCBCT images acquired daily over 3–5 fractions of treatment by 1) applying deformable image registration between each 4DCBCT image and a reference phase from that day, resulting in a set of displacement vector fields (DVFs), and 2) performing principal component analysis (PCA) on the DVFs to derive a motion model. The motion model from the first day of treatment is compared to motion models from each successive day of treatment to quantify variability in motion models generated from different days. Four SBRT patient datasets have been acquired thus far in this IRB approved study. Results: Fraction-specific motion models for each fraction and patient were derived and PCA eigenvectors and their associated eigenvalues are compared for each fraction. For the first patient dataset, the average root mean square error between the first two eigenvectors associated with the highest two eigenvalues, in four fractions was 0.1, while it was 0.25 between the last three PCA eigenvectors associated with the lowest three eigenvalues. It was found that the eigenvectors and eigenvalues of PCA motion models for each treatment fraction have variations and the first few eigenvectors are shown to be more stable across treatment fractions than others. Conclusion: Analysis of this dataset showed that the first two eigenvectors of the PCA patient-specific motion models derived from 4DCBCT were stable over the course of several treatment fractions. The third, fourth, and fifth eigenvectors had larger variations.

60 APPLIED LIFE SCIENCES↗

Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory

We present two efficient iterative algorithms for solving the linear response eigen- value problem arising from the time dependent density functional theory. Although the matrix to be diagonalized is nonsymmetric, it has a special structure that can be exploited to save both memory and floating point operations. In particular, the nonsymmetric eigenvalue problem can be transformed into a product eigenvalue problem that is self-adjoint with respect to a K-inner product. This product eigenvalue problem can be solved efficiently by a modified Davidson algorithm and a modified locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm that make use of the K-inner product. The solution of the product eigenvalue problem yields one component of the eigenvector associated with the original eigenvalue problem. However, the other component of the eigenvector can be easily recovered in a postprocessing procedure. Therefore, the algorithms we present here are more efficient than existing algorithms that try to approximate both components of the eigenvectors simultaneously. The efficiency of the new algorithms is demonstrated by numerical examples.

97 MATHEMATICS AND COMPUTING↗

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↗

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↗

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↗