Search NASA⌕ Search

SEARCH · Search NASA

Results for “eigenvalue problems”

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 775 records · Page 43
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

An integrating matrix formulation for buckling of rotating beams including the effects of concentrated masses

The integrating matrix technique of computational mechanics is extended to include the effects of concentrated masses. The stability of a flexible rotating beam with discrete masses is analyzed to determine the critical rotational speeds for buckling in the inplane and out-of-plane directions. In this problem, the beam is subjected to compressive centrifugal forces arising from steady rotation about an axis which does not pass through the clamped end of the beam. To determine the eigenvalues from which stability is assessed, the differential equations of motion are solved numerically by combining the extended integrating matrix method with an eigenanalysis. Stability boundaries for a discrete mass representation of a uniform beam are shown to asymptotically approach the stability boundaries for the corresponding continuous mass beam as the number of concentrated masses is increased. An error in the literature is also noted for the discrete mass problem concerning the behavior of the critical rotational speed for inplane buckling as the radius of rotation of the clamped end of the beam is reduced.

Lakin, William D.↗
DOE OSTI2026

Analog and symbolic computation through the Koopman framework

We develop a Koopman operator framework for studying the computational structure of dynamical systems. Specifically, we show that the resolvent of the Koopman operator provides a natural abstraction of halting, yielding a ‘Koopman halting problem’ that is recursively enumerable in general. For symbolic systems, such as those defined on Cantor space, this operator formulation captures reachability between clopen sets, while for equicontinuous systems we prove that the Koopman halting problem is decidable. Our framework demonstrates that absorbing (halting) states in coarse-grained finite automata correspond to Koopman eigenfunctions with eigenvalue one, while cycles in the transition graph impose spectral constraints associated with periodic dynamics. These results provide a unifying perspective on computation in symbolic and analog systems, showing how computational universality is reflected in operator spectra, invariant subspaces, and algebraic structures. Beyond symbolic dynamics, this operator-theoretic lens opens pathways to analyze the computational properties of a broader class of dynamical systems, including polynomial and analog models, and suggests that computational hardness may admit dynamical signatures in terms of Koopman spectral structure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Improved Fast Reactor Capability of Griffin in FY23

Griffin is a MOOSE based reactor multiphysics analysis application jointly developed by Idaho National Laboratory and Argonne National Laboratory under the DOE-NE NEAMS program. In FY23, we enhanced capabilities required for fast reactor analysis. This effort included primarily updating the cross-section generation workflow using MC2-3 for various reactor configurations, such as homogeneous, duct-heterogeneous, ring-heterogeneous, and fully-heterogeneous geometries. In addition, we initiated the implementation of a multi-cycle depletion and shuffling capability. To support fast reactor simulation capabilities, we significantly improved the performance of the DFEM-SN-based R-Z transport solver to efficiently solve ultrafine group (over 1000 groups) transport problems. Additionally, the performance of HFEM-PN was improved by introducing red-black iteration, the cmfd acceleration technique, and various optimizations. We also completed the pin power reconstruction capability to support multiphysics simulations while identifying and addressing issues associated with SPH equivalence parameter approach. These enhanced capabilities for fast reactor core simulations, specially HFEM-PN and pin power reconstruction features, were applied to benchmark problems involving ABTR and ABR-1000. These applications showcased excellent agreement with Monte Carlo and other code solutions in terms of eigenvalue, control rod worth, and assembly and pin powers.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2019

Micro Reactor Simulation Using the PROTEUS Suite in FY19

Two micro reactor cores were simulated using the MOC solver of PROTEUS: MegaPower for a heat pipe micro reactor and Holos-Quad for a high-temperature gas-cooled micro reactor. Verification of PROTEUS standalone was performed by simulating 2D and 3D core benchmark problems developed based on MegaPower and Holos-Quad. Simulation results indicated that PROTEUS successfully modelled 2D and 3D cores of the MegaPower and Holos-Quad micro reactors and PROTEUS eigenvalues agreed well with the SERPENT Monte Carlo solutions. For a heat pipe cooled micro reactor, multiphysics simulations were performed using PROTEUS / FLUENT / ANLHTP. The coupling system of the three codes were developed using Python-based drivers, which exchange the data (power, temperature, and heat rate) required for the coupling and control the boundary conditions of FLUENT and ANLHTP. The coupled system was qualitatively verified using a 3D unit assembly problem composed of six fuel rods and seven heat pipes, which was developed based on the MegaPower compositions. The steady-state problem was solved using FLUENT / ANLHTP with given asymmetric fuel powers, demonstrating the reasonable convergence of temperatures of 7 heat pipes. Transient simulations were also performed by making one out of 7 heat pipes fail. For the transient, the coupled system of PROTEUS / FLUENT / ANLHTP demonstrated reasonable changes of total power and heat pipe temperatures with time, accounting for temperature feedback effects. In this simulation, no effect of structural change was accounted for, which will be performed using ANSYS-mechanical in future along with further verification with larger or whole-core 3D problems.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2022

Computational Aspects of Single-Molecule Kinetics for Coupled Catalytic Cycles: A Spectral Analysis

Catalysis from single active sites is analyzed using methods developed from single molecule kinetics. Using a stochastic Markov state description, the observable properties of general catalytic networks of reactions are expressed using an eigenvalue decomposition of the transition matrix for the Markov process. By the use of a sensitivity analysis, the necessary eigenvalues and eigenvectors are related to the energies of controlling barriers and wells located along the reaction routes. A generalization of the energetic span theory allows the eigenvalues to be computed from several activation energies corresponding to distinct barrier-well pairings. The formalism is demonstrated accurately for model problems for a physically realistic mechanism for an alkene hydrogenation reaction on a single atom catalyst.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1966

Matrix methods and automation in structural engineering

The partial differential equations of motion of shell structures subject to arbitrary loads may be extremely difficult or even impossible to solve. Since the digital computer is now an available tool for the structural engineer, current research has been directed toward methods which involve matrix formulation of large systems of algebraic equations and matrix solutions for discrete elements rather than the solution of the partial differential equations. These methods require rapid and accurate computer solutions. Recognizing the accuracy problems inherent in working with large matrices, a comprehensive survey of available computer programs was performed for large matrix inversion and for eigenvalue and eigenvector solutions under a Research Grant from the National Aeronautics and Space Administration and the techniques are developed in this paper for using these programs most efficiently for structural applications. The contents of the paper include: automation of matrix compilation, methods of very large matrix inversion and solution of simultaneous equation, and techniques for finding eigenvalues and vectors. In addition, a finite element stiffness matrix approach developed at the Denver Research Institute for both plates and shells subject to arbitrary dynamic loads is described as it was instrumented with complete automation on the digital computer.

Anita S West↗
NASA NTRS1980

Design of a robust multivariable proportional plus integral controller via spectral assignment

A new design procedure for a class of multivariable integral plus proportional servo control systems is presented. The procedure utilizes a null space formulation of the eigensystem assignment problem assuming complete state feedback. Reduced order observers are used to estimate unavailable states. The resulting system realizes arbitrary closed-loop eigenvalues, approximates specified modal behavior and achieves low eigensystem sensitivity with respect to plant parameter variations. A tutorial example to illustrate the design procedure is included.

Mielke, R. R.↗
NASA NTRS1987

An analysis of the vertical structure equation for arbitrary thermal profiles

The vertical structure equation is a singular Sturm-Liouville problem whose eigenfunctions describe the vertical dependence of the normal modes of the primitive equations linearized about a given thermal profile. The eigenvalues give the equivalent depths of the modes. The spectrum of the vertical structure equation and the appropriateness of various upper boundary conditions, both for arbitrary thermal profiles were studied. The results depend critically upon whether or not the thermal profile is such that the basic state atmosphere is bounded. In the case of a bounded atmosphere it is shown that the spectrum is always totally discrete, regardless of details of the thermal profile. For the barotropic equivalent depth, which corresponds to the lowest eigen value, upper and lower bounds which depend only on the surface temperature and the atmosphere height were obtained. All eigenfunctions are bounded, but always have unbounded first derivatives. It was proved that the commonly invoked upper boundary condition that vertical velocity must vanish as pressure tends to zero, as well as a number of alternative conditions, is well posed. It was concluded that the vertical structure equation always has a totally discrete spectrum under the assumptions implicit in the primitive equations.

Cohn, Stephen E.↗
NASA NTRS1989

An analysis of the vertical structure equation for arbitrary thermal profiles

The vertical structure equation is a singular Sturm-Liouville problem whose eigenfunctions describe the vertical dependence of the normal modes of the primitive equations linearized about a given thermal profile. The eigenvalues give the equivalent depths of the modes. The spectrum of the vertical structure equation and the appropriateness of various upper boundary conditions, both for arbitrary thermal profiles were studied. The results depend critically upon whether or not the thermal profile is such that the basic state atmosphere is bounded. In the case of a bounded atmosphere it is shown that the spectrum is always totally discrete, regardless of details of the thermal profile. For the barotropic equivalent depth, which corresponds to the lowest eigen value, upper and lower bounds which depend only on the surface temperature and the atmosphere height were obtained. All eigenfunctions are bounded, but always have unbounded first derivatives. It was proved that the commonly invoked upper boundary condition that vertical velocity must vanish as pressure tends to zero, as well as a number of alternative conditions, is well posed. It was concluded that the vertical structure equation always has a totally discrete spectrum under the assumptions implicit in the primitive equations.

Cohn, Stephen E.↗
NASA NTRS1992

A generalized Lyapunov theory for robust root clustering of linear state space models with real parameter uncertainty

The problem of analyzing and designing controllers for linear systems subject to real parameter uncertainty is considered. An elegant, unified theory for robust eigenvalue placement is presented for a class of D-regions defined by algebraic inequalities by extending the nominal matrix root clustering theory of Gutman and Jury (1981) to linear uncertain time systems. The author presents explicit conditions for matrix root clustering for different D-regions and establishes the relationship between the eigenvalue migration range and the parameter range. The bounds are all obtained by one-shot computation in the matrix domain and do not need any frequency sweeping or parameter gridding. The method uses the generalized Lyapunov theory for getting the bounds.

Yedavalli, R. K.↗
NASA NTRS1981

Two-dimensional integrating matrices on rectangular grids

The use of integrating matrices in solving differential equations associated with rotating beam configurations is examined. In vibration problems, by expressing the equations of motion of the beam in matrix notation, utilizing the integrating matrix as an operator, and applying the boundary conditions, the spatial dependence is removed from the governing partial differential equations and the resulting ordinary differential equations can be cast into standard eigenvalue form. Integrating matrices are derived based on two dimensional rectangular grids with arbitrary grid spacings allowed in one direction. The derivation of higher dimensional integrating matrices is the initial step in the generalization of the integrating matrix methodology to vibration and stability problems involving plates and shells.

Lakin, W. D.↗
DOE OSTI2020

Linear beam stability in periodic focusing systems: Krein signature and band structure

The general question of how a beam becomes unstable has been one of the fundamental research topics among beam and accelerator physicists for several decades. In this study, we revisited the general problem of linear beam stability in periodic focusing systems by applying the concepts of Krein signature and band structure. We numerically calculated the eigenvalues and other associated characteristics of one-period maps, and discussed the stability properties of single-particle motions with skew quadrupoles and envelope perturbations in high-intensity beams on an equal footing. In particular, an application of the Krein theory to envelope instability analysis was newly attempted in this study. Finally, the appearance of instabilities is interpreted as the result of the collision between eigenmodes of opposite Krein signatures and the formation of a band gap.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2026

The Eigenvector-Eigenvalue Identity and other pragmatic topics in linear algebra for physicists

Diagonalization of an Hermitian matrix is a common task in physics. All of us have diagonalized 2x2 matrices but few have diagonalized a 3x3 matrix algebraically except in special simplifying cases. In this colloquium, I will discuss the mathematics and methods for diagonalizing small, but larger than 2x2 marices, and discuss the recently rediscovered Eigenvector-Eigenvalue identity. As an explicit, pragmatic example I will use the propagation of neutrino's propagating through matter which is inherently a 3x3 problem.

Parke, Stephen [Fermilab] (ORCID:0000000320286782)↗
NASA NTRS2000

Model Refinement Using Eigensystem Assignment

IA novel approach for the refinement of finite-element-based analytical models of flexible structures is presented. The proposed approach models the possible refinements in the mass, damping, and stiffness matrices of the finite element model in the form of a constant gain feedback with acceleration, velocity, and displacement measurements, respectively. Once the free elements of the structural matrices have been defined, the problem of model refinement reduces to obtaining position, velocity, and acceleration gain matrices with appropriate sparsity that reassign a desired subset of the eigenvalues of the model, along with partial mode shapes, from their baseline values to those obtained from system identification test data. A sequential procedure is used to assign one conjugate pair of eigenvalues at each step using symmetric output feedback gain matrices, and the eigenvectors are partially assigned, while ensuring that the eigenvalues assigned in the previous steps are not disturbed. The procedure can also impose that gain matrices be dissipative to guarantee the stability of the refined model. A numerical example, involving finite element model refinement for a structural testbed at NASA Langley Research Center (Controls-Structures-Interaction Evolutionary model) is presented to demonstrate the feasibility of the proposed approach.

Maghami, Peiman G.↗
NASA NTRS1989

Using deflation in the pole assignment problem with output feedback

A direct algorithm is suggested for the computation of a linear output feedback for a multi input, multi output system such that the resultant closed-loop matrix has eigenvalues that include a specified set of eigenvalues. The algorithm uses deflation based on unitary similarity transformations. Thus researchers hope the algorithm is numerically stable; however, this has not been proven as yet.

Miminis, George↗
DOE OSTI2016

Monte Carlo Techniques for Nuclear Systems - Theory Lectures

These are lecture notes for a Monte Carlo class given at the University of New Mexico. The following topics are covered: course information; nuclear eng. review & MC; random numbers and sampling; computational geometry; collision physics; tallies and statistics; eigenvalue calculations I; eigenvalue calculations II; eigenvalue calculations III; variance reduction; parallel Monte Carlo; parameter studies; fission matrix and higher eigenmodes; doppler broadening; Monte Carlo depletion; HTGR modeling; coupled MC and T/H calculations; fission energy deposition. Solving particle transport problems with the Monte Carlo method is simple - just simulate the particle behavior. The devil is in the details, however. These lectures provide a balanced approach to the theory and practice of Monte Carlo simulation codes. The first lectures provide an overview of Monte Carlo simulation methods, covering the transport equation, random sampling, computational geometry, collision physics, and statistics. The next lectures focus on the state-of-the-art in Monte Carlo criticality simulations, covering the theory of eigenvalue calculations, convergence analysis, dominance ratio calculations, bias in Keff and tallies, bias in uncertainties, a case study of a realistic calculation, and Wielandt acceleration techniques. The remaining lectures cover advanced topics, including HTGR modeling and stochastic geometry, temperature dependence, fission energy deposition, depletion calculations, parallel calculations, and parameter studies. This portion of the class focuses on using MCNP to perform criticality calculations for reactor physics and criticality safety applications. It is an intermediate level class, intended for those with at least some familiarity with MCNP. Class examples provide hands-on experience at running the code, plotting both geometry and results, and understanding the code output. The class includes lectures & hands-on computer use for a variety of Monte Carlo calculations. Beginning MCNP users are encouraged to review LA-UR-09-00380, "Criticality Calculations with MCNP: A Primer (3nd Edition)" (available at http:// mcnp.lanl.gov under "Reference Collection") prior to the class. No Monte Carlo class can be complete without having students write their own simple Monte Carlo routines for basic random sampling, use of the random number generator, and simplified particle transport simulation.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2018

Solving many-body Schrödinger equations with kinetic energy partition method

We present a general formulation of our previously developed kinetic energy partition (KEP) method for solving many-bodySchrödinger equations. In atomic physics, as well as in general molecular and solid state physics, solving many-electronSchrödinger equations is a very challenging task, often called Dirac’s challenge. The central problem is how to properly handle the electron–electron Coulomb repulsion interactions. Using the KEP solution scheme, in addition to dividing the kinetic energy into partial terms, the electron–electron Coulomb interaction is also separated into parts to be associated with a “negative mass” kinetic energy term. Therefore, the full Hamiltonian can be expressed as a simple sum of subsystem Hamiltonians, each representing an effective one-body problem. Using a Hartree-like product in constructing the wave-function, we achieve fast convergence in the calculations of the ground state energies. First, the model Moshinsky atoms are used to illustrate the solution procedure. We then apply this new KEP method to harmonium atoms and obtain precise energies with an error less than 5% using only two basis functions from each subsystem. It is thus very promising that this methodology, when further extended, can be useful for general many-body systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Quantum advantages for Pauli channel estimation

We show that entangled measurements provide an exponential advantage in sample complexity for Pauli channel estimation, which is both a fundamental problem and a practically important subroutine for benchmarking near-term quantum devices. The specific task we consider is to simultaneously learn all the eigenvalues of an n-qubit Pauli channel to ±ε precision. We give an estimation protocol with an n-qubit ancilla that succeeds with high probability using only O(n/ε 2 ) copies of the Pauli channel, while proving that any ancilla-free protocol (possibly with adaptive control and channel concatenation) would need at least Ω(2 n/3 ) rounds of measurement. We further study the advantages provided by a small number of ancillas. For the case that a k-qubit ancilla (k≤n) is available, we obtain a sample complexity lower bound of Ω(2 (n-k)/3 ) for any nonconcatenating protocol, and a stronger lower bound of Ω(n 2n-k ) for any nonadaptive, nonconcatenating protocol, which is shown to be tight. We also show how to apply the ancilla-assisted estimation protocol to a practical quantum benchmarking task in a noise-resilient and sample-efficient manner, given reasonable noise assumptions. Our results provide a practically interesting example for quantum advantages in learning and also bring insights for quantum benchmarking.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗