SEARCH · Engineering Papers

Results for “Eigenvalues and 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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 271 records · Page 15

All sources NASA NTRS DOE OSTI

NASA NTRS1979

Linear state feedback, quadratic weights, and closed loop eigenstructures

Results are given on the relationships between closed loop eigenstructures, state feedback gain matrices of the linear state feedback problem, and quadratic weights of the linear quadratic regulator. Equations are derived for the angles of general multivariable root loci and linear quadratic optimal root loci, including angles of departure and approach. The generalized eigenvalue problem is used for the first time to compute angles of approach. Equations are also derived to find the sensitivity of closed loop eigenvalues and the directional derivatives of closed loop eigenvectors (with respect to a scalar multiplying the feedback gain matrix or the quadratic control weight). An equivalence class of quadratic weights that produce the same asymptotic eigenstructure is defined, sufficient conditions to be in it are given, a canonical element is defined, and an algorithm to find it is given. The behavior of the optimal root locus in the nonasymptotic region is shown to be different for quadratic weights with the same asymptotic properties.

Thompson, P. M.↗

NASA NTRS1980

Linear state feedback, quadratic weights, and closed loop eigenstructures

Equations are derived for the angles of general multivariable root loci and linear quadratic optimal root loci, including angles of departure and approach. The generalized eigenvalue problem is used to compute angles of approach. Equations are also derived to find the sensitivity of closed loop eigenvalue and the directional derivatives of closed loop eigenvectors. An equivalence class of quadratic weights that produce the same asymptotic eigenstructure is defined, a canonical element is defined, and an algorithm to find it is given. The behavior of the optimal root locus in the nonasymptotic region is shown to be different for quadratic weights with the same asymptotic properties. An algorithm is presented that can be used to select a feedback gain matrix for the linear state feedback problem which produces a specified asymptotic eigenstructure. Another algorithm is given to compute the asymptotic eigenstructure properties inherent in a given set of quadratic weights. Finally, it is shown that optimal root loci for nongeneric problems can be approximated by generic ones in the nonasymptotic region.

Thompson, P. M.↗

NASA NTRS1983

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.↗

NASA NTRS1984

Reduction of satellite magnetic anomaly data

Analysis of global magnetic anomaly maps derived from satellite data is facilitated by inversion to the equivalent magnetization in a constant thickness magnetic crust or, equivalently, by reduction to the pole. Previous inversions have proven unstable near the geomagnetic equator. The instability results from magnetic moment distributions which are admissible in the inversion solution but which make only small contribution to the computed values of anomaly field. Their admissibility in the solution could result from noisy or incomplete data or from small poorly resolved anomalies. The resulting magnetic moments are unrealistically large and oscillatory. Application of the method of principal components (e.g. eigenvalue decomposition and selective elimination of less significant eigenvectors) is proposed as a way of overcoming the instability and the method is demonstrated by applying it to the region around the Bangui anomaly in Central Africa.

Slud, E. V.↗

NASA NTRS1995

Expendable launch vehicle studies

Analytical support studies of expendable launch vehicles concentrate on the stability of the dynamics during launch especially during or near the region of maximum dynamic pressure. The in-plane dynamic equations of a generic launch vehicle with multiple flexible bending and fuel sloshing modes are developed and linearized. The information from LeRC about the grids, masses, and modes is incorporated into the model. The eigenvalues of the plant are analyzed for several modeling factors: utilizing diagonal mass matrix, uniform beam assumption, inclusion of aerodynamics, and the interaction between the aerodynamics and the flexible bending motion. Preliminary PID, LQR, and LQG control designs with sensor and actuator dynamics for this system and simulations are also conducted. The initial analysis for comparison of PD (proportional-derivative) and full state feedback LQR Linear quadratic regulator) shows that the split weighted LQR controller has better performance than that of the PD. In order to meet both the performance and robustness requirements, the H(sub infinity) robust controller for the expendable launch vehicle is developed. The simulation indicates that both the performance and robustness of the H(sub infinity) controller are better than that for the PID and LQG controllers. The modelling and analysis support studies team has continued development of methodology, using eigensensitivity analysis, to solve three classes of discrete eigenvalue equations. In the first class, the matrix elements are non-linear functions of the eigenvector. All non-linear periodic motion can be cast in this form. Here the eigenvector is comprised of the coefficients of complete basis functions spanning the response space and the eigenvalue is the frequency. The second class of eigenvalue problems studied is the quadratic eigenvalue problem. Solutions for linear viscously damped structures or viscoelastic structures can be reduced to this form. Particular attention is paid to Maxwell and Kelvin models. The third class of problems consists of linear eigenvalue problems in which the elements of the mass and stiffness matrices are stochastic. dynamic structural response for which the parameters are given by probabilistic distribution functions, rather than deterministic values, can be cast in this form. Solutions for several problems in each class will be presented.

Bainum, Peter M.↗

NASA NTRS2001

Discontinuous Galerkin Methods for NonLinear Differential Systems

This talk considers simplified finite element discretization techniques for first-order systems of conservation laws equipped with a convex (entropy) extension. Using newly developed techniques in entropy symmetrization theory, simplified forms of the discontinuous Galerkin (DG) finite element method have been developed and analyzed. The use of symmetrization variables yields numerical schemes which inherit global entropy stability properties of the PDE (partial differential equation) system. Central to the development of the simplified DG methods is the Eigenvalue Scaling Theorem which characterizes right symmetrizers of an arbitrary first-order hyperbolic system in terms of scaled eigenvectors of the corresponding flux Jacobian matrices. A constructive proof is provided for the Eigenvalue Scaling Theorem with detailed consideration given to the Euler equations of gas dynamics and extended conservation law systems derivable as moments of the Boltzmann equation. Using results from kinetic Boltzmann moment closure theory, we then derive and prove energy stability for several approximate DG fluxes which have practical and theoretical merit.

Barth, Timothy↗

NASA NTRS1975

Relaxation methods in fluid mechanics

The present work considers the iterative solution of a coupled set of difference equations and examines methods that carry successive approximates to a state that is invariant with further iteration and independent of the initial guess. Methods are studied with regard to their efficiency and economy of computer resources. The basic principles of classical relaxation are set forth, with attention confined to linear elliptic equations. This discussion involves the evaluation of the spectral radius that is the magnitude of the eigenvalue with largest modulus. The subject of relaxation is then related to the study of ordinary differential equations and hyperbolic partial differential equations. Problems that occur when linearly dependent eigenvectors appear in the relaxation matrix are discussed, leading to multiply connected eigenvalues in the Jordan canonical form. Finally, a brief survey of relaxation methods used in aerodynamics is given.

Lomax, H.↗

NASA NTRS1990

Partitioning sparse matrices with eigenvectors of graphs

The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An algebraic approach for computing vertex separators is considered in this paper. It is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph. The Laplacian eigenvectors of grid graphs can be computed from Kronecker products involving the eigenvectors of path graphs, and these eigenvectors can be used to compute good separators in grid graphs. A heuristic algorithm is designed to compute a vertex separator in a general graph by first computing an edge separator in the graph from an eigenvector of the Laplacian matrix, and then using a maximum matching in a subgraph to compute the vertex separator. Results on the quality of the separators computed by the spectral algorithm are presented, and these are compared with separators obtained from other algorithms for computing separators. Finally, the time required to compute the Laplacian eigenvector is reported, and the accuracy with which the eigenvector must be computed to obtain good separators is considered. The spectral algorithm has the advantage that it can be implemented on a medium-size multiprocessor in a straightforward manner.

Pothen, Alex↗

DOE OSTI2022

The role of breakup and coalescence in fine-scale bubble-induced turbulence. II. Kinematics

This second part of our research explores the kinematic aspect of fine-scale bubble-induced turbulence (BIT) to (i) present the effect of bubble breakup and coalescence and (ii) compare it against the universal kinematic fine-scale turbulence characteristics reported in the literature. To this end, we simulate a dilute bubbly system of 0.5% void fraction using two distinct numerical simulations. In the volume-of-fluid (VoF) simulation, bubbles undergo breakup and coalescence. In the immersed boundary method (IBM) simulation, however, they act as rigid spheres. We also perform a simulation of classical homogeneous isotropic turbulence (HIT). The first important outcome of this study is that BIT is radically different from HIT in terms of its kinematic fine-scale characteristics. In the vorticity-dominating regions, BIT exhibits a weak vortex stretching. This weak vortex stretching is due to (a) the intermediate strain-rate eigenvalues skewed weakly to positive and (b) the extensive strain-rate eigenvector aligning perpendicular to the vorticity vector. The BIT has, on average, not only a weak enstrophy production but also a weak strain production in strain-dominating regions. The weak strain production is due to (a) the presence of vortex stretching in highly strained fluid elements and (b) the absolute magnitude of compressive strain-rate eigenvalue being as close to the extensive strain-rate eigenvalue. Thus, none of the kinematic fine-scale HIT characteristics is noted for BIT. The second important conclusion is that bubble breakup and coalescence play little to no influence on the kinematics of fine-scale BIT as VoF and IBM simulations produce similar results.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2023

A universal variational quantum eigensolver for non-Hermitian systems

Abstract Many quantum algorithms are developed to evaluate eigenvalues for Hermitian matrices. However, few practical approach exists for the eigenanalysis of non-Hermintian ones, such as arising from modern power systems. The main difficulty lies in the fact that, as the eigenvector matrix of a general matrix can be non-unitary, solving a general eigenvalue problem is inherently incompatible with existing unitary-gate-based quantum methods. To fill this gap, this paper introduces a Variational Quantum Universal Eigensolver (VQUE), which is deployable on noisy intermediate scale quantum computers. Our new contributions include: (1) The first universal variational quantum algorithm capable of evaluating the eigenvalues of non-Hermitian matrices—Inspired by Schur’s triangularization theory, VQUE unitarizes the eigenvalue problem to a procedure of searching unitary transformation matrices via quantum devices; (2) A Quantum Process Snapshot technique is devised to make VQUE maintain the potential quantum advantage inherited from the original variational quantum eigensolver—With additional $$O(log_{2}{N})$$ O ( l o g 2 N ) quantum gates, this method efficiently identifies whether a unitary operator is triangular with respect to a given basis; (3) Successful deployment and validation of VQUE on a real noisy quantum computer, which demonstrates the algorithm’s feasibility. We also undertake a comprehensive parametric study to validate VQUE’s scalability, generality, and performance in realistic applications.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Hamiltonian Truncation Effective Theory

Hamiltonian truncation is a non-perturbative numerical method for calculating observables of a quantum field theory. The starting point for this method is to truncate the interacting Hamiltonian to a finite-dimensional space of states spanned by the eigenvectors of the free Hamiltonian H_0 H 0 with eigenvalues below some energy cutoff E_\text{max} E max . In this work, we show how to treat Hamiltonian truncation systematically using effective field theory methodology. We define the finite-dimensional effective Hamiltonian by integrating out the states above E_\text{max} E max . The effective Hamiltonian can be computed by matching a transition amplitude to the full theory, and gives corrections order by order as an expansion in powers of 1/E_\text{max} 1 / E max . The effective Hamiltonian is non-local, with the non-locality controlled in an expansion in powers of H_0/E_\text{max} H 0 / E max . The effective Hamiltonian is also non-Hermitian, and we discuss whether this is a necessary feature or an artifact of our definition. We apply our formalism to 2D \lambda\phi^4 λ ϕ 4 theory, and compute the the leading 1/E_\text{max}^2 1 / E max 2 corrections to the effective Hamiltonian. We show that these corrections nontrivially satisfy the crucial property of separation of scales. Numerical diagonalization of the effective Hamiltonian gives residual errors of order 1/E_\text{max}^3 1 / E max 3 , as expected by our power counting. We also present the power counting for 3D \lambda \phi^4 λ ϕ 4 theory and perform calculations that demonstrate the separation of scales in this theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1983

Population Control of Self-Replicating Systems: Option C

From the conception and development of the theory of self-replicating automata by John von Neumann, others have expanded on his theories. In 1980, Georg von Tiesenhausen and Wesley A. Darbro developed a report which is a "first' in presenting the theories in a conceptualized engineering setting. In that report several options involving self-replicating systems are presented. One of the options allows each primary to generate n replicas, one in each sequential time frame after its own generation. Each replica is limited to a maximum of m ancestors. This study involves determining the state vector of the replicas in an efficient manner. The problem is cast in matrix notation, where F = fij is a non-diagonalizable matrix. Any element fij represents the number of elements of type j = (c,d) in time frame k+1 generated from type i = (a,b) in time frame k. It is then shown that the state vector is: bar F(k)=bar F (non-zero) X F sub K = bar F (non-zero) xmx J sub kx m sub-1 where J is a matrix in Jordan form having the same eigenvalues as F. M is a matrix composed of the eigenvectors and the generalized eigenvectors of F.

Mccord, R. L.↗

NASA NTRS1989

Numerical methods in Markov chain modeling

Several methods for computing stationary probability distributions of Markov chains are described and compared. The main linear algebra problem consists of computing an eigenvector of a sparse, usually nonsymmetric, matrix associated with a known eigenvalue. It can also be cast as a problem of solving a homogeneous singular linear system. Several methods based on combinations of Krylov subspace techniques are presented. The performance of these methods on some realistic problems are compared.

Philippe, Bernard↗

NASA NTRS1996

Visualization of 3-D tensor fields

Second-order tensor fields have applications in many different areas of physics, such as general relativity and fluid mechanics. The wealth of multivariate information in tensor fields makes them more complex and abstract than scalar and vector fields. Visualization is a good technique for scientists to gain new insights from them. Visualizing a 3-D continuous tensor field is equivalent to simultaneously visualizing its three eigenvector fields. In the past, research has been conducted in the area of two-dimensional tensor fields. It was shown that degenerate points, defined as points where eigenvalues are equal to each other, are the basic singularities underlying the topology of tensor fields. Moreover, it was shown that eigenvectors never cross each other except at degenerate points. Since we live in a three-dimensional world, it is important for us to understand the underlying physics of this world. In this report, we describe a new method for locating degenerate points along with the conditions for classifying them in three-dimensional space. Finally, we discuss some topological features of three-dimensional tensor fields, and interpret topological patterns in terms of physical properties.

Hesselink, L.↗

DOE OSTI2026

Lindblad many-body scars

Quantum many-body scars have received much recent attention for being both intriguing nonergodic states in otherwise quantum chaotic systems and promising candidates to encode quantum information efficiently. So far, these studies have mostly been restricted to Hermitian systems. Here, we study many-body scars in many-body quantum chaotic systems coupled to a Markovian bath, which we term Lindblad many-body scars. They are defined as simultaneous eigenvectors of the Hamiltonian and dissipative parts of the vectorized Liouvillian. Importantly, because their eigenvalues are purely real, they are not related to revivals. The number and nature of the scars depend on both the symmetry of the Hamiltonian and the choice of jump operators. For a dissipative four-body Sachdev-Ye-Kitaev (SYK) model with 𝑁 fermions, either Majorana or complex, we construct analytically some of these Lindblad scars while others could only be obtained numerically. As an example of the former, we identify 𝑁/2+1 scars for complex fermions due to the 𝑈⁡(1) symmetry of the model and two scars for Majorana fermions as a consequence of the parity symmetry. Similar results are obtained for a dissipative XXZ spin chain. We also characterize the physical properties of Lindblad scars. First, the operator size is independent of the disorder realization and has a vanishing variance. By contrast, the operator size for nonscarred states, believed to be quantum chaotic, is well described by a distribution centered around a specific size and a finite variance, which could be relevant for a precise definition of the eigenstate thermalization hypothesis in dissipative quantum chaos. Moreover, the entanglement entropy of these scars has distinct features such as a strong dependence on the partition choice and, in certain cases, a large entanglement.

Eigenstate thermalization↗

NASA NTRS1999

Practical Aspects of Stabilized FEM Discretizations of Nonlinear Conservation Law Systems with Convex Extension

This talk considers simplified finite element discretization techniques for first-order systems of conservation laws equipped with a convex (entropy) extension. Using newly developed techniques in entropy symmetrization theory, simplified forms of the Galerkin least-squares (GLS) and the discontinuous Galerkin (DG) finite element method have been developed and analyzed. The use of symmetrization variables yields numerical schemes which inherit global entropy stability properties of the POE system. Central to the development of the simplified GLS and DG methods is the Degenerative Scaling Theorem which characterizes right symmetrizes of an arbitrary first-order hyperbolic system in terms of scaled eigenvectors of the corresponding flux Jacobean matrices. A constructive proof is provided for the Eigenvalue Scaling Theorem with detailed consideration given to the Euler, Navier-Stokes, and magnetohydrodynamic (MHD) equations. Linear and nonlinear energy stability is proven for the simplified GLS and DG methods. Spatial convergence properties of the simplified GLS and DO methods are numerical evaluated via the computation of Ringleb flow on a sequence of successively refined triangulations. Finally, we consider a posteriori error estimates for the GLS and DG demoralization assuming error functionals related to the integrated lift and drag of a body. Sample calculations in 20 are shown to validate the theory and implementation.

Barth, Timothy↗

NASA NTRS1986

Sensitivity analysis and approximation methods for general eigenvalue problems

Optimization of dynamic systems involving complex non-hermitian matrices is often computationally expensive. Major contributors to the computational expense are the sensitivity analysis and reanalysis of a modified design. The present work seeks to alleviate this computational burden by identifying efficient sensitivity analysis and approximate reanalysis methods. For the algebraic eigenvalue problem involving non-hermitian matrices, algorithms for sensitivity analysis and approximate reanalysis are classified, compared and evaluated for efficiency and accuracy. Proper eigenvector normalization is discussed. An improved method for calculating derivatives of eigenvectors is proposed based on a more rational normalization condition and taking advantage of matrix sparsity. Important numerical aspects of this method are also discussed. To alleviate the problem of reanalysis, various approximation methods for eigenvalues are proposed and evaluated. Linear and quadratic approximations are based directly on the Taylor series. Several approximation methods are developed based on the generalized Rayleigh quotient for the eigenvalue problem. Approximation methods based on trace theorem give high accuracy without needing any derivatives. Operation counts for the computation of the approximations are given. General recommendations are made for the selection of appropriate approximation technique as a function of the matrix size, number of design variables, number of eigenvalues of interest and the number of design points at which approximation is sought.

Murthy, D. V.↗

DOE OSTI2021

A Flexible Power Method for Solving Infinite Dimensional Tensor Eigenvalue Problems

We propose a flexible power method for computing the leftmost, i.e., algebraically smallest, eigenvalue of an infinite dimensional tensor eigenvalue problem, $H x = \lambda x$, where the infinite dimensional symmetric matrix $H$ exhibits a translational invariant structure. We assume the smallest eigenvalue of $H$ is simple and apply a power iteration of $e^{-H}$ with the eigenvector represented in a compact way as a translational invariant infinite Tensor Ring (iTR). Hence, the infinite dimensional eigenvector can be represented by a finite number of iTR cores of finite rank. In order to implement this power iteration, we use a small parameter $t$ so that the infinite matrix-vector operation $e^{-Ht}x$ can efficiently be approximated by the Lie product formula, also known as Suzuki--Trotter splitting, and we employ a low rank approximation through a truncated singular value decomposition on the iTR cores in order to keep the cost of subsequent power iterations bounded. We also use an efficient way for computing the iTR Rayleigh quotient and introduce a finite size iTR residual which is used to monitor the convergence of the Rayleigh quotient and to modify the timestep $t$. In this paper, we discuss 2 different implementations of the flexible power algorithm and illustrate the automatic timestep adaption approach for several numerical examples.

Beeumen, Roel Van↗