Search NASA⌕ Search

SEARCH · Search NASA

Results for “eigenvalue problem”

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 451 records · Page 25
All sourcesNASA NTRSDOE OSTI
NASA NTRS1985

A method to stabilize linear systems using eigenvalue gradient information

Formal optimization methods and eigenvalue gradient information are used to develop a stabilizing control law for a closed loop linear system that is initially unstable. The method was originally formulated by using direct, constrained optimization methods with the constraints being the real parts of the eigenvalues. However, because of problems in trying to achieve stabilizing control laws, the problem was reformulated to be solved differently. The method described uses the Davidon-Fletcher-Powell minimization technique to solve an indirect, constrained minimization problem in which the performance index is the Kreisselmeier-Steinhauser function of the real parts of all the eigenvalues. The method is applied successfully to solve two different problems: the determination of a fourth-order control law stabilizes a single-input single-output active flutter suppression system and the determination of a second-order control law for a multi-input multi-output lateral-directional flight control system. Various sets of design variables and initial starting points were chosen to show the robustness of the method.

Wieseman, C. D.↗
NASA NTRS1977

Complex eigenvalue extraction in NASTRAN by the tridiagonal reduction (FEER) method

An extension of the Tridiagonal Reduction (FEER) method to complex eigenvalue analysis in NASTRAN is described. As in the case of real eigenvalue analysis, the eigensolutions closest to a selected point in the eigenspectrum are extracted from a reduced, symmetric, tridiagonal eigenmatrix whose order is much lower than that of the full size problem. The reduction process is effected automatically, and thus avoids the arbitrary lumping of masses and other physical quantities at selected grid points. The statement of the algebraic eigenvalue problem admits mass, damping and stiffness matrices which are unrestricted in character, i.e., they may be real, complex, symmetric or unsymmetric, singular or non-singular.

Newman, M.↗
NASA NTRS1982

Nonlinear Marangoni convection in bounded layers. I - Circular cylindrical containers. II - Rectangular cylindrical containers

Liquid undergoing nonlinear Marangoni instability in a circular cylinder is examined, with attention given to roll-cell development and interaction. Surface deflections are neglected and the side walls are considered as adiabatic and impenetrable, allowing the liquid to freely slip. The nonlinear convective states are calculated and their stability is defined. The behavior and amplitude of cells forming in the liquid, heated from below, are modeled in order to derive all the transport properties. A new small parameter is formulated which is related to the critical Marangoni number of the infinite matrix expressing the eigenvalue expansion of the problem. The observed roll cell amplitudes and transport properties are shown to be available from simple eigenvalues, with double eigenvalues, indicating the existence of two roll-states as predicted by linear theory, nonlinear theory indicates transitions from one steady convective state to another.

Rosenblat, S.↗
NASA NTRS2003

Quantum Adiabatic Optimization and Combinatorial Landscapes

In this paper we analyze the performance of the Quantum Adiabatic Evolution (QAE) algorithm on a variant of Satisfiability problem for an ensemble of random graphs parametrized by the ratio of clauses to variables, gamma = M / N. We introduce a set of macroscopic parameters (landscapes) and put forward an ansatz of universality for random bit flips. We then formulate the problem of finding the smallest eigenvalue and the excitation gap as a statistical mechanics problem. We use the so-called annealing approximation with a refinement that a finite set of macroscopic variables (verses only energy) is used, and are able to show the existence of a dynamic threshold gamma = gammad, beyond which QAE should take an exponentially long time to find a solution. We compare the results for extended and simplified sets of landscapes and provide numerical evidence in support of our universality ansatz.

Smelyanskiy, V. N.↗
NASA NTRS1988

Stability of semi-discrete approximations for hyperbolic initial-boundary-value problems. II - Asymptotic estimates

The stability of semi-discrete approximations for hyperbolic initial-boundary-value problems is considered. Asymptotic estimates of the eigenvalues of the finite-domain problem are given. These estimates are used to examine questions relating the normal mode analysis of the finite-domain problem and the normal mode quarter-plane analysis of the Gustafsson, Kreiss, and Sundstroem theory.

Warming, Robert F.↗
NASA NTRS1974

Application of antiresonance theory to helicopters

Antiresonance theory is the principle underlying nonresonant nodes in a structure, and covers both nonresonant nodes occurring naturally and those introduced by devices such as dynamic absorbers and antiresonant isolators. The dynamic antiresonant vibration isolator (DAVI) and the nodale module are examples of the applications of transfer antiresonances. It is shown that antiresonances are eigenvalues, and that they can be determined by matrix iteration. Applications of antiresonance theory to helicopter engineering problems, using the antiresonant eigenvalue equation are suggested.

Bartlett, F. D., Jr.↗
NASA NTRS1987

Polynomial approximation of functions of matrices and its application to the solution of a general system of linear equations

During the process of solving a mathematical model numerically, there is often a need to operate on a vector v by an operator which can be expressed as f(A) while A is NxN matrix (ex: exp(A), sin(A), A sup -1). Except for very simple matrices, it is impractical to construct the matrix f(A) explicitly. Usually an approximation to it is used. In the present research, an algorithm is developed which uses a polynomial approximation to f(A). It is reduced to a problem of approximating f(z) by a polynomial in z while z belongs to the domain D in the complex plane which includes all the eigenvalues of A. This problem of approximation is approached by interpolating the function f(z) in a certain set of points which is known to have some maximal properties. The approximation thus achieved is almost best. Implementing the algorithm to some practical problem is described. Since a solution to a linear system Ax = b is x= A sup -1 b, an iterative solution to it can be regarded as a polynomial approximation to f(A) = A sup -1. Implementing the algorithm in this case is also described.

Tal-Ezer, Hillel↗
DOE OSTI2020

Comparison of Generation of Higher-Order Neutron Scattering Cross Sections

The generation of high-order neutron scattering cross sections consistent with high-fidelity simulations remains an area of active research. Popular options include generating cross sections from continuous energy Monte Carlo calculations or generating cross sections from a deterministic neutron transport calculation with high-fidelity tabulated cross sections. Both options present challenges. Monte Carlo simulations can naturally process continuous energy cross section data and allow for the general description of anisotropic neutron scattering given a scattering law. However, Monte Carlo simulations are inherently related to particle weighting and it has been suggested that this may be unacceptable for generating high-order neutron scattering cross sections. Deterministic neutron transport calculations can easily calculate high-order moments of the flux to appropriately calculate higher-order neutron scattering cross sections but are generally limited by discretization of space, energy, and angle. In this work, the trade-offs between generation of high-order neutron scattering cross sections via Monte Carlo and deterministic neutron transport methods are investigated. The methods implemented in the Monte Carlo computer program Serpent and the deterministic fast reactor neutron cross section generator MC2-3 are compared. Cross sections resulting from these methods are used in Rattlesnake, a deterministic neutron transport code developed by Idaho National Laboratory (INL), and results are compared to a reference continuous energy Monte Carlo calculation. Whereas previous work investigating the effects of anisotropic neutron scattering has focused on light water reactor (LWR) simulations, this work focuses on high-order neutron scattering cross sections as they relate to fast reactor simulations. To investigate the consequences of the Serpent and MC2-3 methodologies, a test problem is developed. The test problem is a one-dimensional geometry with fast reactor materials designed to demonstrate deep penetration and exacerbate the effects of high-order neutron scattering. Based on the results of the deep penetration test problem, it is concluded that P3 neutron scattering cross sections are sufficient to describe anisotropic scattering in fast reactor materials. Any neutron scattering of order higher than P3 offers negligible change in the eigenvalue of the test problem. Additionally, it is determined that the methodology as implemented in Serpent is applicable for generating high-order neutron scattering cross sections through at least P3 in fast reactor materials.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

OpenMC

OpenMC is an open source, community-developed framework for performing Monte Carlo particle transport calculations.It is capable of simulating neutron and photon transport below ~50 MeV and also includes a model for bremsstrahlung production of photons by electrons/positrons. Fixed source, k-eigenvalue, and subcritical multiplication problems can be solved. Problem geometries can be modeled either using constructive solid geometry or a CAD representation. A flexible and efficient tally system enables a wide variety of physical quantities to be tallied and analyzed. OpenMC can run in parallel using a hybrid MPI and OpenMP programming model and has been extensively tested on leadership class supercomputers. A built-in Bateman equation solver enables the modeling of material composition changes due to irradiation. One of the unique features of OpenMC is its rich, extensible Python and C/C++ programming interfaces that enable programming pre- and post-processing, multigroup cross section generation, workflow automation, multiphysics coupling, and the visualization of geometry and tally results. In addition to the core Monte Carlo transport solver and associated APIs, OpenMC includes a Python-based nuclear data interface that enables power users to inspect, modify,and perform various types of nuclear data processing on ENDF, ACE, and OpenMC¿s native HDF5 files

ROMANO, PaulK.↗
NASA NTRS1990

Analytical and experimental study of the vibration of bonded beams with a lap joint

A theoretical model to study the flexural vibration of a bonded lap joint system is described in this paper. First, equations of motion at the joint region are derived using a differential element approach. The transverse displacements of the upper and lower beam are considered to be different. The adhesive is assumed to be linearly viscoelastic and the widely used Kelvin-Voight model is used to represent the viscoelastic behavior of the adhesive. The shear force at the interface between the adhesive and the beam is obtained from the simple bending motion equations of the two beams. The resulting equations of motion are combined with the equations of transverse vibration of the beams in the unjointed regions. These are later solved as a boundary value problem to obtain the eigenvalues and eigenvectors of the system. The model can be used to predict the natural frequencies, modal damping ratios, and mode shapes of the system for free vibration. Good agreement between numerical and experimental results was obtained for a system of graphite epoxy beams lap-jointed by an epoxy adhesive.

Rao, M. D.↗
NASA NTRS1992

A new direction in hydrodynamic stability: Beyond eigenvalues

Fluid flows that are smooth at low speeds become unstable and then turbulent at higher speeds. This phenomenon has traditionally been investigated by linearizing the equations of flow and looking for unstable eigenvalues of the linearized problem, but the results agree poorly in many cases with experiments. Nevertheless, it has become clear in recent years that linear effects play a central role in hydrodynamic instability. A reconciliation of these findings with the traditional analysis can be obtained by considering the 'pseudospectra' of the linearized problem, which reveals that small perturbations to the smooth flow in the form of streamwise vortices may be amplified by factors on the order of 10(exp 5) by a linear mechanism, even though all the eigenmodes are stable. The same principles apply also to other problems in the mathematical sciences that involve non-orthogonal eigenfunctions.

Trefethen, Lloyd N.↗
NASA NTRS1990

Frequency domain FIR and IIR adaptive filters

A discussion of the LMS adaptive filter relating to its convergence characteristics and the problems associated with disparate eigenvalues is presented. This is used to introduce the concept of proportional convergence. An approach is used to analyze the convergence characteristics of block frequency-domain adaptive filters. This leads to a development showing how the frequency-domain FIR adaptive filter is easily modified to provide proportional convergence. These ideas are extended to a block frequency-domain IIR adaptive filter and the idea of proportional convergence is applied. Experimental results illustrating proportional convergence in both FIR and IIR frequency-domain block adaptive filters is presented.

Lynn, D. W.↗
NASA NTRS1982

Application of a systematic finite-element model modification technique to dynamic analysis of structures

A systematic finite-element model modification technique has been applied to two small problems and a model of the main wing box of a research drone aircraft. The procedure determines the sensitivity of the eigenvalues and eigenvector components to specific structural changes, calculates the required changes and modifies the finite-element model. Good results were obtained where large stiffness modifications were required to satisfy large eigenvalue changes. Sensitivity matrix conditioning problems required the development of techniques to insure existence of a solution and accelerate its convergence. A method is proposed to assist the analyst in selecting stiffness parameters for modification.

Robinson, J. C.↗
NASA NTRS1992

Design of bearings for rotor systems based on stability

Design of rotor systems incorporating stable behavior is of great importance to manufacturers of high speed centrifugal machinery since destabilizing mechanisms (from bearings, seals, aerodynamic cross coupling, noncolocation effects from magnetic bearings, etc.) increase with machine efficiency and power density. A new method of designing bearing parameters (stiffness and damping coefficients or coefficients of the controller transfer function) is proposed, based on a numerical search in the parameter space. The feedback control law is based on a decentralized low order controller structure, and the various design requirements are specified as constraints in the specification and parameter spaces. An algorithm is proposed for solving the problem as a sequence of constrained 'minimax' problems, with more and more eigenvalues into an acceptable region in the complex plane. The algorithm uses the method of feasible directions to solve the nonlinear constrained minimization problem at each stage. This methodology emphasizes the designer's interaction with the algorithm to generate acceptable designs by relaxing various constraints and changing initial guesses interactively. A design oriented user interface is proposed to facilitate the interaction.

Dhar, D.↗
NASA NTRS1973

An automated procedure for computing flutter eigenvalues.

A new, fast and economical automated procedure for implementing the traditional V-g method of flutter solution is described. The procedure requires as input the generalized aerodynamic forces for a range of reduced frequencies obtained from an aerodynamic program. These aerodynamic forces are interpolated with respect to reduced frequency using a newly developed, partially tabulated cubic spline that is both fast in execution and economical in storage. The flutter solution is then obtained using an eigenvalue routine that has been developed to take advantage of the parametric nature of the V-g type of solution. Furthermore, the routine takes care of the fundamental and troublesome problem of properly sorting the output eigenvalues. By solving the root-sorting problem, the interpolation for flutter crossings and automatic plotting are accomplished efficiently. The computational techniques used in this new program are described and some sample results are given.

Desmarais, R. N.↗
NASA NTRS1972

Eigenvalues of singular differential operators by finite difference methods. I.

Approximation of the eigenvalues of certain self-adjoint operators defined by a formal differential operator in a Hilbert space. In general, two problems are studied. The first is the problem of defining a suitable Hilbert space operator that has eigenvalues. The second problem concerns the finite difference operators to be used.

Baxley, J. V.↗