SEARCH · Search NASA
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.
Discrete linear vibration systems viscous damping local modifications effect on eigenvalues and vectors, using Weissenburgers procedure in matrix form
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).
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.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
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.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
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).
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).
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.
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.
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.
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.
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.
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.
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.