Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “EIGENVECTOR”

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 199 records · Page 11

A method of surface marker location optimization for tumor motion estimation in lung stereotactic body radiation therapy

Purpose: Accurately localizing lung tumor localization is essential for high-precision radiation therapy techniques such as stereotactic body radiation therapy (SBRT). Since direct monitoring of tumor motion is not always achievable due to the limitation of imaging modalities for treatment guidance, placement of fiducial markers on the patient’s body surface to act as a surrogate for tumor position prediction is a practical alternative for tracking lung tumor motion during SBRT treatments. In this work, the authors propose an innovative and robust model to solve the multimarker position optimization problem. The model is able to overcome the major drawbacks of the sparse optimization approach (SOA) model. Methods: The principle-component-analysis (PCA) method was employed as the framework to build the authors’ statistical prediction model. The method can be divided into two stages. The first stage is to build the surrogate tumor matrix and calculate its eigenvalues and associated eigenvectors. The second stage is to determine the “best represented” columns of the eigenvector matrix obtained from stage one and subsequently acquire the optimal marker positions as well as numbers. Using 4-dimensional CT (4DCT) and breath hold CT imaging data, the PCA method was compared to the SOA method with respect to calculation time, average prediction accuracy, prediction stability, noise resistance, marker position consistency, and marker distribution. Results: The PCA and SOA methods which were both tested were on all 11 patients for a total of 130 cases including 4DCT and breath-hold CT scenarios. The maximum calculation time for the PCA method was less than 1 s with 64 752 surface points, whereas the average calculation time for the SOA method was over 12 min with 400 surface points. Overall, the tumor center position prediction errors were comparable between the two methods, and all were less than 1.5 mm. However, for the extreme scenarios (breath hold), the prediction errors for the PCA method were not only smaller, but were also more stable than for the SOA method. Results obtained by imposing a series of random noises to the surrogates indicated that the PCA method was much more noise resistant than the SOA method. The marker position consistency tests using various combinations of 4DCT phases to construct the surrogates suggested that the marker position predictions of the PCA method were more consistent than those of the SOA method, in spite of surrogate construction. Marker distribution tests indicated that greater than 80% of the calculated marker positions fell into the high cross correlation and high motion magnitude regions for both of the algorithms. Conclusions: The PCA model is an accurate, efficient, robust, and practical model for solving the multimarker position optimization problem to predict lung tumor motion during SBRT treatments. Due to its generality, PCA model can also be applied to other imaging guidance system whichever using surface motion as the surrogates.

60 APPLIED LIFE SCIENCES↗

Inverse Subspace Iteration for Spectral Stochastic Finite Element Methods

We study random eigenvalue problems in the context of spectral stochastic finite elements. In particular, given a parameter-dependent, symmetric positive-definite matrix operator, we explore the performance of algorithms for computing its eigenvalues and eigenvectors represented using polynomial chaos expansions. We formulate a version of stochastic inverse subspace iteration, which is based on the stochastic Galerkin finite element method, and we compare its accuracy with that of Monte Carlo and stochastic collocation methods. The coefficients of the eigenvalue expansions are computed from a stochastic Rayleigh quotient. Our approach allows the computation of interior eigenvalues by deflation methods, and we can also compute the coefficients of multiple eigenvectors using a stochastic variant of the modified Gram-Schmidt process. The effectiveness of the methods is illustrated by numerical experiments on benchmark problems arising from vibration analysis.

97 MATHEMATICS AND COMPUTING↗

Optimal Transfer Operators in Algebraic Two-Level Methods for Nonsymmetric and Indefinite Problems

Consider an algebraic two-level method applied to the 𝑛-dimensional linear system 𝐴⁢𝒙 = 𝒃 using fine-space preconditioner (i.e., “relaxation” or “smoother”) 𝑀, with 𝑀 ≈ 𝐴, restriction and interpolation 𝑅 and 𝑃, and algebraic coarse-space operator 𝐴 𝑐 : = 𝑅 ∗ ⁢𝐴⁢𝑃. Then, what are the best possible transfer operators 𝑅 and 𝑃 of a given dimension 𝑛 𝑐 < 𝑛? Brannick et al. [12] showed that when 𝐴 and 𝑀 are Hermitian positive definite (HPD), the optimal interpolation is such that its range contains the 𝑛 𝑐 smallest generalized eigenvectors of the matrix pencil (𝐴, 𝑀). Recently, in Ali et al. [5] we generalized this framework to the non-HPD setting, by considering both right (interpolation) and left (restriction) generalized eigenvectors of (𝐴, 𝑀) and defining corresponding nonsymmetric transfer operators {𝑅#, 𝑃#}. Tight convergence bounds for {𝑅#, 𝑃#} are derived in spectral radius, as well as a proof of pseudo-optimality. Note, {𝑅#, 𝑃#} are typically complex valued, which is not practical for real-valued problems. Here, in this work, we build on [5], first characterizing all inner products in which the coarse-space correction defined by {𝑅#, 𝑃#} is orthogonal. We then develop tight two-level convergence bounds in these norms, and prove that the underlying transfer operators {𝑅#, 𝑃#} are genuinely optimal. As a special case, our theory both recovers and extends the HPD results from [12]. Finally, we show how to construct optimal, real-valued transfer operators in the case of that 𝐴 and 𝑀 are real valued, but are not HPD. Numerical examples arising from a discretized advection-reaction equation, wave-equation, and Stokes equations are used to verify and illustrate the theory.

97 MATHEMATICS AND COMPUTING↗

Demonstration of the rodeo algorithm on a quantum computer

The rodeo algorithm is an efficient algorithm for eigenstate preparation and eigenvalue estimation for any observable on a quantum computer. This makes it a promising tool for studying the spectrum and structure of atomic nuclei as well as other fields of quantum many-body physics. The only requirement is that the initial state has sufficient overlap probability with the desired eigenstate. While it is exponentially faster than well-known algorithms such as phase estimation and adiabatic evolution for eigenstate preparation, it has yet to be implemented on an actual quantum device. In this work, we apply the rodeo algorithm to determine the energy levels of a random one-qubit Hamiltonian, resulting in a relative error of 0.08% using mid-circuit measurements on the IBM Q device Casablanca. This surpasses the accuracy of directly-prepared eigenvector expectation values using the same quantum device. We take advantage of the high-accuracy energy determination and use the Hellmann-Feynman theorem to compute eigenvector expectation values for a different random one-qubit observable. For the Hellmann-Feynman calculations, we find a relative error of 0.7%. Here, we conclude by discussing possible future applications of the rodeo algorithm for multi-qubit Hamiltonians.

algorithm↗

Principal Component Analysis for Extremes and Application to U.S. Precipitation

Here, we propose a method for analyzing extremal behavior through the lens of a most efficient basis of vectors. The method is analogous to principal component analysis, but is based on methods from extreme value analysis. Specifically, rather than decomposing a covariance or correlation matrix, we obtain our basis vectors by performing an eigendecomposition of a matrix that describes pairwise extremal dependence. We apply the method to precipitation observations over the contiguous United States. We find that the time series of large coefficients associated with the leading eigenvector shows very strong evidence of a positive trend, and there is evidence that large coefficients of other eigenvectors have relationships with El Niño–Southern Oscillation.

54 ENVIRONMENTAL SCIENCES↗

Proposed ACE Covariance Format (Version 1.0)

A new ACE format for covariance data is proposed. Rather than storing an upper triangular matrix, the principal eigenvalues and eigenvectors of the matrix for an isotope are stored. The eigenvectors are used by MCNP6 to reconstruct an approximate covariance matrix. The matrix consists of blocks corresponding to ZA/MT pairs. Each block uses the same unionized energy grid. The information is stored into a contiguous block of information in an array called XSS. The array JXS(.,ISOTOPE) gives the pointer to the start of the covariance block for that isotope.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Higher-Mode Applications of Fission Matrix Capability for MCNP

In this work, the fission matrix method, implemented into MCNP6, is used to study criticality calculations and compute quantities of practical use. Physically, the fission matrix consists of spatial transition terms between two fission generations. With a sufficiently refined mesh (achieved here with a sparse storage scheme) these rates can be accurately tallied without knowledge of the correct fission distribution. The matrix can then be solved for K-eigenvalues and eigenvectors. The right and left eigenvectors correspond to forward and adjoint fission source modes, respectively.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Randomized Cholesky Preconditioning for Graph Partitioning Applications

A graph is a mathematical representation of a network; we say it consists of a set of vertices, which are connected by edges. Graphs have numerous applications in various fields, as they can model all sorts of connections, processes, or relations. For example, graphs can model intricate transit systems or the human nervous system. However, graphs that are large or complicated become difficult to analyze. This is why there is an increased interest in the area of graph partitioning, reducing the size of the graph into multiple partitions. For example, partitions of a graph representing a social network might help identify clusters of friends or colleagues. Graph partitioning is also a widely used approach to load balancing in parallel computing. The partitioning of a graph is extremely useful to decompose the graph into smaller parts and allow for easier analysis. There are different ways to solve graph partitioning problems. For this work, we focus on a spectral partitioning method which forms a partition based upon the eigenvectors of the graph Laplacian (details presented in Acer, et. al.). This method uses the LOBPCG algorithm to compute these eigenvectors. LOBPCG can be accelerated by an operator called a preconditioner. For this internship, we evaluate a randomized Cholesky (rchol) preconditioner for its effectiveness on graph partitioning problems with LOBPCG. We compare it with two standard preconditioners: Jacobi and Incomplete Cholesky (ichol). This research was conducted from August to December 2021 in conjunction with Sandia National Laboratories.

97 MATHEMATICS AND COMPUTING↗

The general linear inverse problem - Implication of surface waves and free oscillations for earth structure.

The discrete general linear inverse problem reduces to a set of m equations in n unknowns. There is generally no unique solution, but we can find k linear combinations of parameters for which restraints are determined. The parameter combinations are given by the eigenvectors of the coefficient matrix. The number k is determined by the ratio of the standard deviations of the observations to the allowable standard deviations in the resulting solution. Various linear combinations of the eigenvectors can be used to determine parameter resolution and information distribution among the observations. Thus we can determine where information comes from among the observations and exactly how it constraints the set of possible models. The application of such analyses to surface-wave and free-oscillation observations indicates that (1) phase, group, and amplitude observations for any particular mode provide basically the same type of information about the model; (2) observations of overtones can enhance the resolution considerably; and (3) the degree of resolution has generally been overestimated for many model determinations made from surface waves.

Wiggins, R. A.↗

SYMAT, COVAR: Test Procedures for Matrix Calculations

The FORTRAN subroutine SYMAT and related subroutines are described. In essence SYMAT is an iterative algorithm in which the problem of finding eigenvalues and eigenvectors of a real symmetric matrix is transformed into an equivalent problem of finding eigenvalues and eigenvectors of an infinite sequence of matrices of order two. A DEMO PROGRAM contains a subroutine COVAR which is used to compute the covariance matrix (denoted by A) of a data matrix (denoted by X). Since a covariance matrix is symmetric it can be analyzed by using subroutine SYMAT.

Morris, W. L.↗

Information content of IRIS spectra

Spectra from the satellite instrument IRIS (infra red interferometer spectrometer) were examined to find the number of independent variables needed to describe these broadband high spectral resolution data. The radiated power in the atmospheric window from 771 to 981/cm was the first parameter chosen for fitting observed spectra. At succeeding levels of analysis the residual variability (observed spectrum - best fit spectrum) in an ensemble of observations was partioned into spectral eigenvectors. The eigenvector describing the largest fraction of this variability was examined for a strong spectral signature; the power in the corresponding spectral band was then used as the next fitting parameter. The measured power in nine spectral intervals, when inserted in the spectral fitting functions, was adequate to describe most spectra to within the noise level of IRIS. Considerations of relative signal strength and scales of atmospheric variability suggest a combination sounder (multichannel-broad field of view) scanner (window channel-small field of view) as an efficient observing instrument.

Price, J. C.↗

Analytical and experimental investigation of a 1/8-scale dynamic model of the shuttle orbiter. Volume 1: Summary report

A 1/8-scale structural dynamics model of the space shuttle orbiter was analyzed using the NASA Structural Analysis System (NASTRAN). Comparison of the calculated eigenvalues with preliminary test data for the unrestrained condition indicate that the analytical model was consistently stiffer, being about 20% higher in the first mode. The eigenvectors show reasonably good agreement with test data. A series of analytical and experimental investigations undertaken to resolve the discrepancy are described. Modifications in the NASTRAN model based upon these investigations resulted in close agreement for both eigenvalues and eigenvectors.

Mason, P. W.↗

Numerical techniques for the linear, nonadiabatic stellar pulsation problem

The linear, nonadiabatic eigenvalue problem is formulated using Castor's method for calculating radial pulsations of stellar models. Both left and right eigenvectors are calculated. Initial eigenvalues for the linear, nonadiabatic solutions are obtained from the adiabatic eigenvalues and left and right eigenvectors. The orthogonality relation is obtained. Simple formulas for the Newton method are given. The iteration procedure is constrained to improve convergence. The Newton method is less satisfactory than the secant method for difficult cases. The linear, nonadiabatic solutions are shown to be sensitive to the number of zones with tau smaller than 2/3, and the value of (P/P sub r) surface or tau (surface). Optimum values can be determined for the number of zones and tau (surface). Application of the method to Population II Cepheids is briefly presented.

Bednarek, T. A.↗

Information content in Iris spectra

Spectra from the satellite instrument Iris (infrared interferometer spectrometer) were examined to find the number of independent variables needed to describe the broad-band high-resolution spectral data. The radiated power in the atmospheric window from 771 to 981 per cm was the first parameter chosen for fitting observed spectra. At succeeding levels of analysis, the residual variability (observed spectrum minus best-fit spectrum) in an ensemble of observations was partitioned into spectral eigenvectors. The eigenvector describing the largest fraction of this variability was examined for a strong spectral signature; the power in the corresponding spectral band was then used as the next fitting parameter. The measured power in nine spectral intervals, when it was inserted in the spectral-fitting functions, was adequate to describe most spectra to within the noise level of Iris. Considerations of relative signal strength and scales of atmospheric variability suggest a combination sounder (multichannel, broad field of view) scanner (window channel, small field of view) as an efficient observing instrument.

Price, J. C.↗

Characteristic vector analysis as a technique for signature extraction of remote ocean color data

Characteristic vector analysis is being used to extract spectral signatures of suspended matter in the ocean from remote ocean color data collected with MOCS (Multichannel Ocean Color Sensor), a multispectral scanner. Spectral signatures appear to be obtainable either directly from characteristic vectors or through a transformation of these eigenvectors. Quantification of the suspended matter associated with each resulting signature seems feasible using associated coefficients generated by the technique. This paper presents eigenvectors associated with algae, 'sediment', acid waste, sewage sludge, and oil. The results suggest an efficient method of transmitting from satellites multispectral data of pollution in our oceans.

Grew, G. W.↗

On adaptive modal control of large flexible spacecraft

A recently developed strategy for adaptive sampled-data control of distributed parameter systems based on a plant modal expansion description and modal simultaneous identification and regulation algorithms is presented with frequent reference to the annular momentum control device (AMCD) test example. The requirements of observation spillover reduction and modal eigenvector shape prespecification, which are especially crucial to the proposed adaptive control strategy, are addressed. Individual low pass time filtering of sensed AMCD particle displacements is proposed for observation spillover reduction. A layered scheme incorporating 'eigenvector' shape improvement is outlined to combat the expansion basis prespecification requirement.

Johnson, C. R., Jr.↗

Research on the application of a decoupling algorithm for structure analysis

The mathematical theory for decoupling mth-order matrix differential equations is presented. It is shown that the decoupling precedure can be developed from the algebraic theory of matrix polynomials. The role of eigenprojectors and latent projectors in the decoupling process is discussed and the mathematical relationships between eigenvalues, eigenvectors, latent roots, and latent vectors are developed. It is shown that the eigenvectors of the companion form of a matrix contains the latent vectors as a subset. The spectral decomposition of a matrix and the application to differential equations is given.

Denman, E. D.↗

Preliminary demonstration of a robust controller design method

Alternative computational procedures for obtaining a feedback control law which yields a control signal based on measurable quantitites are evaluated. The three methods evaluated are: (1) the standard linear quadratic regulator design model; (2) minimization of the norm of the feedback matrix, k via nonlinear programming subject to the constraint that the closed loop eigenvalues be in a specified domain in the complex plane; and (3) maximize the angles between the closed loop eigenvectors in combination with minimizing the norm of K also via the constrained nonlinear programming. The third or robust design method was chosen to yield a closed loop system whose eigenvalues are insensitive to small changes in the A and B matrices. The relationship between orthogonality of closed loop eigenvectors and the sensitivity of closed loop eigenvalues is described. Computer programs are described.

Anderson, L. R.↗