Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 1,027 records · Page 57
All sourcesNASA NTRSDOE OSTI
NASA NTRS1999

Reusable Launch Vehicle Control in Multiple Time Scale Sliding Modes

A reusable launch vehicle control problem during ascent is addressed via multiple-time scaled continuous sliding mode control. The proposed sliding mode controller utilizes a two-loop structure and provides robust, de-coupled tracking of both orientation angle command profiles and angular rate command profiles in the presence of bounded external disturbances and plant uncertainties. Sliding mode control causes the angular rate and orientation angle tracking error dynamics to be constrained to linear, de-coupled, homogeneous, and vector valued differential equations with desired eigenvalues placement. The dual-time scale sliding mode controller was designed for the X-33 technology demonstration sub-orbital launch vehicle in the launch mode. 6DOF simulation results show that the designed controller provides robust, accurate, de-coupled tracking of the orientation angle command profiles in presence of external disturbances and vehicle inertia uncertainties. It creates possibility to operate the X-33 vehicle in an aircraft-like mode with reduced pre-launch adjustment of the control system.

Shtessel, Yuri↗
NASA NTRS1991

Determination of Rotordynamic Coefficients for Labyrinth Seals and Application to Rotordynamic Design Calculations

In today's rotordynamic calculations, the input parameters for a finite element analysis (FEA) determine very much the reliability of eigenvalue and eigenmode predictions. While modeling of an elastic structure by means of beam elements etc. is relatively straightforward to perform and the input data for journal bearings are usually known exactly enough, the determination of stiffness and damping for labyrinth seals is still the subject of many investigations. Therefore, the rotordynamic influence of labyrinths is often not included in FEA for rotating machinery because of a lack of computer programs to calculate these parameters. This circumstance can give rise to severe vibration problems especially for high performance turbines or compressors, resulting in remarkable economic losses. The forces generated in labyrinths can be described for small motions around the seal center with a linearized force-motion relationship. Several years ago, we started with the development of computer codes for the determination of rotordynamic seal coefficients. Our different approaches to evaluate the dynamic fluid forces generated by turbulent, compressible seal flow are introduced.

Weiser, P.↗
NASA NTRS1999

On Multi-Dimensional Unstructured Mesh Adaption

Anisotropic unstructured mesh adaption is developed for a truly multi-dimensional upwind fluctuation splitting scheme, as applied to scalar advection-diffusion. The adaption is performed locally using edge swapping, point insertion/deletion, and nodal displacements. Comparisons are made versus the current state of the art for aggressive anisotropic unstructured adaption, which is based on a posteriori error estimates. Demonstration of both schemes to model problems, with features representative of compressible gas dynamics, show the present method to be superior to the a posteriori adaption for linear advection. The performance of the two methods is more similar when applied to nonlinear advection, with a difference in the treatment of shocks. The a posteriori adaption can excessively cluster points to a shock, while the present multi-dimensional scheme tends to merely align with a shock, using fewer nodes. As a consequence of this alignment tendency, an implementation of eigenvalue limiting for the suppression of expansion shocks is developed for the multi-dimensional distribution scheme. The differences in the treatment of shocks by the adaption schemes, along with the inherently low levels of artificial dissipation in the fluctuation splitting solver, suggest the present method is a strong candidate for applications to compressible gas dynamics.

Wood, William A.↗
NASA NTRSDate not supplied

Application of an Affine Nonlinear Galerkin Reduced-order Model to Compressible Fluid Flows

Galerkin reduced-order models (ROMs) often struggle to accurately capture multiscale fluid physics in challenging flow regimes such as flows experiencing compressibility effects. This in part stems from the global nature of both the basis construction problem and the spectral formulation itself. In this work, a multi-basis ROM is developed in an affine space based on proper orthogonal decomposition (POD) by projecting the full Navier-Stokes equations expressed in terms of the specific volume, velocity, and pressure primitive variables. The model is applied to high-fidelity numerical simulation datasets obtained for a canonical compressible flow configuration: the flow over a backward facing step at different subsonic Mach numbers. It is observed that application of an eigenvalue reassignment (ER) stabilization method is required to avoid early divergence of the ROM predictions for this configuration in the three Mach numbers tested. The sensitivity of the POD-ROM results to the choice of parameters in the stabilization algorithm is discussed.

reduced-order model↗
NASA NTRSDate not supplied

Application of an Affine Nonlinear Galerkin Reduced-order Model to Compressible Fluid Flows

Galerkin reduced-order models (ROMs) often struggle to accurately capture multiscale fluid physics in challenging flow regimes such as flows experiencing compressibility effects. This in part stems from the global nature of both the basis construction problem and the spectral formulation itself. In this work, a multi-basis ROM is developed in an affine space based on proper orthogonal decomposition (POD) by projecting the full Navier-Stokes equations expressed in terms of the specific volume, velocity, and pressure primitive variables. The model is applied to high-fidelity numerical simulation datasets obtained for a canonical compressible flow configuration: the flow over a backward facing step at different subsonic Mach numbers. It is observed that application of an eigenvalue reassignment (ER) stabilization method is required to avoid early divergence of the ROM predictions for this configuration in the three Mach numbers tested. The sensitivity of the POD-ROM results to the choice of parameters in the stabilization algorithm is discussed.

reduced-order model↗
DOE OSTI2025

Implementation of Perturbation Theory and Sensitivity Capabilities in Griffin

Griffin is a Multiphysics Object-Oriented Simulation Environment (MOOSE) based reactor Multiphysics analysis application, jointly developed by Argonne and Idaho National Laboratories under the DOE-NE NEAMS program. This fiscal year, capabilities for reactivity and sensitivity evaluation using perturbation methods were implemented and verified. The First Order Perturbation Method (FOPT) was employed to compute reactivity worth resulting from small perturbations in input parameters, while the Generalized Perturbation Theory (GPT) was used to evaluate sensitivities of a range of response types, including reaction rate ratio, k-eigenvalue, neutron generation time, and effective delayed neutron fraction. These perturbation methods enable users to quantify how response quantities change due to a perturbation in a input parameter without explicitly performing an additional transport simulation for each perturbed state. In particular, the GPT formulation accounts for indirect effects arising from flux changes by solving generalized inhomogeneous equations, for which a Neumann series-based iterative solution method was developed and implemented in Griffin. The implemented reactivity and sensitivity evaluation capabilities were verified using two test problems: an infinite homogeneous system and a two-dimensional hexagonal core. The results showed excellent agreement with reference solutions obtained by a direct method based on finite difference approximation as well as GPT-based results from the PERSENT code, confirming the accuracy of both reactivity and sensitivity evaluations. Additionally, preliminary uncertainty quantification (UQ) results were obtained by combining the sensitivity values computed using GPT and external covariance data, demonstrating that the implemented sensitivity results can be reliably used for uncertainty calculations. To further demonstrate the generality and practical strength of the implementation, the sensitivity evaluation capability was successfully applied to the Empire microreactor with a geometrically complex design that poses significant modeling challenges. The results confirm that Griffin enables sensitivity evaluations even for irregular and highly heterogeneous reactor configurations, thereby establishing a foundation for UQ applications in advanced reactor designs and analyses.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2015

A spectral analysis of the domain decomposed Monte Carlo method for linear systems

The domain decomposed behavior of the adjoint Neumann-Ulam Monte Carlo method for solving linear systems is analyzed using the spectral properties of the linear oper- ator. Relationships for the average length of the adjoint random walks, a measure of convergence speed and serial performance, are made with respect to the eigenvalues of the linear operator. In addition, relationships for the effective optical thickness of a domain in the decomposition are presented based on the spectral analysis and diffusion theory. Using the effective optical thickness, the Wigner rational approxi- mation and the mean chord approximation are applied to estimate the leakage frac- tion of random walks from a domain in the decomposition as a measure of parallel performance and potential communication costs. The one-speed, two-dimensional neutron diffusion equation is used as a model problem in numerical experiments to test the models for symmetric operators with spectral qualities similar to light water reactor problems. We find, in general, the derived approximations show good agreement with random walk lengths and leakage fractions computed by the numerical experiments.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1989

An O(log sup 2 N) parallel algorithm for computing the eigenvalues of a symmetric tridiagonal matrix

An O(log sup 2 N) parallel algorithm is presented for computing the eigenvalues of a symmetric tridiagonal matrix using a parallel algorithm for computing the zeros of the characteristic polynomial. The method is based on a quadratic recurrence in which the characteristic polynomial is constructed on a binary tree from polynomials whose degree doubles at each level. Intervals that contain exactly one zero are determined by the zeros of polynomials at the previous level which ensures that different processors compute different zeros. The exact behavior of the polynomials at the interval endpoints is used to eliminate the usual problems induced by finite precision arithmetic.

Swarztrauber, Paul N.↗
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 NTRS1987

A Lanczos eigenvalue method on a parallel computer

Eigenvalue analyses of complex structures is a computationally intensive task which can benefit significantly from new and impending parallel computers. This study reports on a parallel computer implementation of the Lanczos method for free vibration analysis. The approach used here subdivides the major Lanczos calculation tasks into subtasks and introduces parallelism down to the subtask levels such as matrix decomposition and forward/backward substitution. The method was implemented on a commercial parallel computer and results were obtained for a long flexible space structure. While parallel computing efficiency is problem and computer dependent, the efficiency for the Lanczos method was good for a moderate number of processors for the test problem. The greatest reduction in time was realized for the decomposition of the stiffness matrix, a calculation which took 70 percent of the time in the sequential program and which took 25 percent of the time on eight processors. For a sample calculation of the twenty lowest frequencies of a 486 degree of freedom problem, the total sequential computing time was reduced by almost a factor of ten using 16 processors.

Bostic, Susan W.↗
DOE OSTI2021

Plutonium Production Reactor Progression Problems: Magnox Neutronics Benchmarks

The goal of this document is to provide a set of comprehensive benchmarking neutronics problems for gas-cooled, graphite-moderated reactors. The problems are designed to be representative problems that increase in complexity to test performance of various codes. For the simulation of the benchmarking problems, the Shift Monte Carlo code and MPACT deterministic code are chosen because of their state-of-the-art capabilities, which are optimized for various reactor designs. Because these codes have been developed primarily for light water reactor applications, their application to graphite-moderated, gas-cooled reactors has not been extensively explored. This report attempts to evaluate benchmarks for a Magnox-style reactor, one that is graphite-moderated and gas-cooled. Parameters that are calculated and presented in this benchmark include the eigenvalue, peaking factors, and isotope concentrations. Results show good agreement between Shift and MPACT, and demonstrate the capability of MPACT to model graphite-moderated systems well.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2022

A Note on the Probability of Initiation Problem

The purpose of this note is to draw attention to Pál for his derivation of the Pál-Bell equation which is used by LLNL and LANL to model Probability of Initiation (POI) problems. Both laboratories credit the equation to Bell and Lee. Although the equation formulated by Bell and Lee and the equation derived by Pál appear to be the same, the equation by Bell and Lee is flawed. Scattering, which was absent in Bell’s original formulation of a POI problem, was later introduced by Bell and Lee by replacing a fission term with a scattering term. Such a replacement, however, leads to an incorrect average number $\overline{v}$ of neutrons that is produced in a fission event. By approaching a POI problem from probabilistic point of view, Pál formulates the problem as a branching process that i) describes the growth of a population of neutrons in a fissile medium, and ii) predicts $\overline{v}$ correctly. There are five reasons for writing this report. The first is to clarify the failing in Bell and Lee’s derivation. The second is to establish the origin of the equation used by the laboratories. The third is to elucidate the fixed point technique formulated by Mokhtar-Kharroubi to solve the Pál-Bell equation. The fourth is to derive the α eigenvalue that is associated with a super-critical situation. The fifth is to describe in the Appendix a second order positivity preserving technique that accelerates the convergence of the first order fixed point method developed by Mokhtar-Kharroubi.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1983

Accelerating an iterative process by explicit annihilation

A slowly convergent stationary iterative process can be accelerated by explicitly annihilating (i.e., eliminating) the dominant eigenvector component of the error. The dominant eigenvalue or complex pair of eigenvalues can be estimated from the solution during the iteration. The corresponding eigenvector or complex pair of eigenvectors can then be annihilated by applying an explicit Richardson process over the basic iterative method. This can be done entirely in real arithmetic by analytically combining the complex conjugate annihilation steps. The technique is applied to an implicit algorithm for the calculation of two dimensional steady transonic flow over a circular cylinder using the equations of compressible inviscid gas dynamics. This demonstrates the use of explicit annihilation on a nonlinear problem.

Jespersen, D. C.↗
NASA NTRS1984

MMIC devices for active phased array antennas

The study of printed circuit discontinuities is necessary in order to design, for example, transitions between rectangular waveguides and printed circuits. New developments with respect to the analytical approaches to this problem are discussed. A summary of the progress in the experimental approach is presented. The accurate solution for the modes in various millimeter-wave waveguides is essential in the analysis of many integrated circuit components, such as filters and impedance transformers. Problems associated with the numerical computation of these modes in two frequently used waveguide forms, namely, the finline and microstrip, are presented. The spectral domain method of formulation, with a moment method solution, is considered. This approach can be readily extended to analyze an arbitrary configuration of dielectric and metallized regions in a shielded enclosure. Galerkin's method is used, where the testing and basic functions are the same. It is shown that the mode functions, or eigenfunctions, are more sensitive to errors than the phase constants, or eigenvalues. The approximate mode functions do not satisfy the orthogonality relationship well, resulting in difficulties when these modal solutions are used to form an approximate Green's function or are used in a mode matching analysis.

Mittra, R.↗
NASA NTRS1985

Accelerating an iterative process by explicit annihilation

A slowly convergent stationary iterative process can be accelerated by explicitly annihilating (i.e., eliminating) the dominant eigenvector component of the error. The dominant eigenvalue or complex pair of eigenvalues can be estimated from the solution during the iteration. The corresponding eigenvector or complex pair of eigenvectors can then be annihilated by applying an explicit Richardson process over the basic iterative method. This can be done entirely in real arithmetic by analytically combining the complex conjugate annihilation steps. The technique is applied to an implicit algorithm for the calculation of two dimensional steady transonic flow over a circular cylinder using the equations of compressible inviscid gas dynamics. This demonstrates the use of explicit annihilation on a nonlinear problem.

Jespersen, D. C.↗
NASA NTRS1986

Extensions to PIFCGT: Multirate output feedback and optimal disturbance suppression

New control synthesis procedures for digital flight control systems were developed. The theoretical developments are the solution to the problem of optimal disturbance suppression in the presence of windshear. Control synthesis is accomplished using a linear quadratic cost function, the command generator tracker for trajectory following and the proportional-integral-filter control structure for practical implementation. Extensions are made to the optimal output feedback algorithm for computing feedback gains so that the multirate and optimal disturbance control designs are computed and compared for the advanced transport operating system (ATOPS). The performance of the designs is demonstrated by closed-loop poles, frequency domain multiinput sigma and eigenvalue plots and detailed nonlinear 6-DOF aircraft simulations in the terminal area in the presence of windshear.

Broussard, J. R.↗
NASA NTRS1988

Attitude determination and parameter estimation using vector observations

Procedures for attitude determination based on Wahba's loss function are generalized to include the estimation of parameters other than the attitude, such as sensor biases. Optimization with respect to the attitude requires either the singular value decomposition of a 3x3 matrix or finding the maximum eigenvalue and corresponding eigenvector of a 4x4 symmetric matrix, but does not require an a priori estimate of the attitude. Optimization with respect to the other parameters employs an iterative approach, which does require an a priori estimate of these parameters. Conventional state estimation methods require a priori estimates of both the parameters and the attitude, while the algorithms presented in this paper always compute the exact optimal attitude for given values of the parameters. The proposed method is shown to give the correct solution of an example problem. An expression for the covariance of the attitude and parameter estimates is derived.

Markley, F. Landis↗
NASA NTRS1996

Multiresolution and Explicit Methods for Vector Field Analysis and Visualization

We first report on our current progress in the area of explicit methods for tangent curve computation. The basic idea of this method is to decompose the domain into a collection of triangles (or tetrahedra) and assume linear variation of the vector field over each cell. With this assumption, the equations which define a tangent curve become a system of linear, constant coefficient ODE's which can be solved explicitly. There are five different representation of the solution depending on the eigenvalues of the Jacobian. The analysis of these five cases is somewhat similar to the phase plane analysis often associate with critical point classification within the context of topological methods, but it is not exactly the same. There are some critical differences. Moving from one cell to the next as a tangent curve is tracked, requires the computation of the exit point which is an intersection of the solution of the constant coefficient ODE and the edge of a triangle. There are two possible approaches to this root computation problem. We can express the tangent curve into parametric form and substitute into an implicit form for the edge or we can express the edge in parametric form and substitute in an implicit form of the tangent curve. Normally the solution of a system of ODE's is given in parametric form and so the first approach is the most accessible and straightforward. The second approach requires the 'implicitization' of these parametric curves. The implicitization of parametric curves can often be rather difficult, but in this case we have been successful and have been able to develop algorithms and subsequent computer programs for both approaches. We will give these details along with some comparisons in a forthcoming research paper on this topic.

Source record↗