Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized 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 145 records · Page 8

Multi-harmonic Rutherford island theory

Rutherford island theory, which governs the nonlinear evolution of tearing modes in tokamak plasmas, is generalized to take into account situations in which the conventional one-harmonic approximation is not valid. The analysis incorporates non-inductive currents driven by radio frequency (RF) electromagnetic waves injected into the plasma. A multi-harmonic tearing mode dispersion relation is derived that takes the form of a nonlinear inhomogeneous matrix eigenvalue problem. The dispersion relation is solved in the so-called two-harmonic approximation, in which only the principal Fourier harmonic of the perturbed magnetic flux and its first overtone are included in the calculation. In the absence of RF current drive, the nonlinear behavior of a tearing mode predicted in the two-harmonic approximation does not differ substantially from that predicted in the one-harmonic approximation. On the other hand, RF current drive that is sufficiently localized in the vicinity of the O-points of the mode's magnetic island chain is capable of triggering bifurcations of the O-points (which is impossible in the one-harmonic approximation). However, the current drive is incapable of triggering bifurcations of the island X-points. This finding is significant because Bardóczi and Evans recently observed bifurcations of magnetic island chain O-points in the presence of RF current drive in the DIII-D tokamak but did not observe bifurcations of the X-points. Finally, the changes in the topology of the magnetic island flux-surfaces induced by RF current drive are found to facilitate the stabilization of the tearing mode.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Vibration and Control of Flexible Rotor Supported by Magnetic Bearings

Active vibration control of flexible rotors supported by magnetic bearings is discussed. Using a finite-element method for a mathematical model of the flexible rotor, the eigenvalue problem is formulated taking into account the interaction between a mechanical system of the flexible rotor and an electrical system of the magnetic bearings and the controller. However, for the sake of simplicity, gyroscopic effects are disregarded. It is possible to adapt this formulation to a general flexible rotor-magnetic bearing system. Controllability with and without collocation sensors and actuators located at the same distance along the rotor axis is discussed for the higher order flexible modes of the test rig. In conclusion, it is proposed that it is necessary to add new active control loops for the higher flexible modes even in the case of collocation. Then it is possible to stabilize for the case of uncollocation by means of this method.

Nonami, Kenzou↗

Vibration of prestressed periodic lattice structures

Equations are developed for vibration of general lattice structures that have repetitive geometry. The method of solution is an extension of a previous paper for buckling of similar structures. The theory is based on representing each member of the structure with the exact dynamic stiffness matrix and taking advantage of the repetitive geometry to obtain an eigenvalue problem involving the degrees-of-freedom at a single node in the lattice. Results are given for shell-and beam-like lattice structures and for rings stiffened with tension cables and a central mast. The variation of frequency with external loading and the effect of local member vibration on overall modes is shown.

Anderson, M. S.↗

Stability and bifurcation of quasiparallel Alfven solitons

The inverse scattering transformation (IST) is used to study the one-parameter and two-parameter soliton families of the derivative nonlinear Schroedinger (DNLS) equation. The two-parameter soliton family is determined by the discrete complex eigenvalue spectrum of the Kaup-Newell scattering problem and the one-parameter soliton family corresponds to the discrete real eigenvalue spectrum. The structure of the IST is exploited to discuss the existence of discrete real eigenvalues and to prove their structural stability to perturbations of the initial conditions. Also, though the two-parameter soliton is structurally stable in general, it is shown that a perturbation of the initial conditions may change the two-parameter soliton into a degenerate soliton which, in turn, is structurally unstable. This degenerate, or double pole, soliton may bifurcate due to a perturbation of the initial conditions into a pair of one-parameter solitons. If the initial profile is on compact support, then this pair of one-parameter solitons must be compressive and rarefactive respectively. Finally, the Gelfand-Levitan equations appropriate for the double pole soliton are solved.

Hamilton, R. L.↗

A robust multilevel simultaneous eigenvalue solver

Multilevel (ML) algorithms for eigenvalue problems are often faced with several types of difficulties such as: the mixing of approximated eigenvectors by the solution process, the approximation of incomplete clusters of eigenvectors, the poor representation of solution on coarse levels, and the existence of close or equal eigenvalues. Algorithms that do not treat appropriately these difficulties usually fail, or their performance degrades when facing them. These issues motivated the development of a robust adaptive ML algorithm which treats these difficulties, for the calculation of a few eigenvectors and their corresponding eigenvalues. The main techniques used in the new algorithm include: the adaptive completion and separation of the relevant clusters on different levels, the simultaneous treatment of solutions within each cluster, and the robustness tests which monitor the algorithm's efficiency and convergence. The eigenvectors' separation efficiency is based on a new ML projection technique generalizing the Rayleigh Ritz projection, combined with a technique, the backrotations. These separation techniques, when combined with an FMG formulation, in many cases lead to algorithms of O(qN) complexity, for q eigenvectors of size N on the finest level. Previously developed ML algorithms are less focused on the mentioned difficulties. Moreover, algorithms which employ fine level separation techniques are of O(q(sub 2)N) complexity and usually do not overcome all these difficulties. Computational examples are presented where Schrodinger type eigenvalue problems in 2-D and 3-D, having equal and closely clustered eigenvalues, are solved with the efficiency of the Poisson multigrid solver. A second order approximation is obtained in O(qN) work, where the total computational work is equivalent to only a few fine level relaxations per eigenvector.

Costiner, Sorin↗

A new payload integration method

This paper introduces a new payload integration method. The system equations of motion are derived in terms of interface-restrained booster and payload modes. These system equations are directly integrated, avoiding the solution of an expensive eigenvalue problem. A modified Newmark-Chan-Beta numerical scheme is used to perform this integration. Due to the unique form of the system equations it is possible to achieve significant savings. A similar savings is feasible for the computation of the internal loads. This new approach does not involve approximations. Although completely general, the presented technique is most effective when the number of interface degrees of freedom is relatively small. Both determinate and indeterminate interfaces are allowed.

Engels, R. C.↗

Diagonally Implicit Runge-Kutta Methods for Ordinary Differential Equations. A Review

A review of diagonally implicit Runge-Kutta (DIRK) methods applied to rst-order ordinary di erential equations (ODEs) is undertaken. The goal of this review is to summarize the characteristics, assess the potential, and then design several nearly optimal, general purpose, DIRK-type methods. Over 20 important aspects of DIRKtype methods are reviewed. A design study is then conducted on DIRK-type methods having from two to seven implicit stages. From this, 15 schemes are selected for general purpose application. Testing of the 15 chosen methods is done on three singular perturbation problems. Based on the review of method characteristics, these methods focus on having a stage order of two, sti accuracy, L-stability, high quality embedded and dense-output methods, small magnitudes of the algebraic stability matrix eigenvalues, small values of aii, and small or vanishing values of the internal stability function for large eigenvalues of the Jacobian. Among the 15 new methods, ESDIRK4(3)6L[2]SA is recommended as a good default method for solving sti problems at moderate error tolerances.

Kennedy, Christopher A.↗

A numerical method for systems of conservation laws of mixed type admitting hyperbolic flux splitting

The present treatment of elliptic regions via hyperbolic flux-splitting and high order methods proposes a flux splitting in which the corresponding Jacobians have real and positive/negative eigenvalues. While resembling the flux splitting used in hyperbolic systems, the present generalization of such splitting to elliptic regions allows the handling of mixed-type systems in a unified and heuristically stable fashion. The van der Waals fluid-dynamics equation is used. Convergence with good resolution to weak solutions for various Riemann problems are observed.

Shu, Chi-Wang↗

Convexity property of the one-sided multivariable stability margin

In evaluating the stability robustness of multivariable control systems having one-sided parameter uncertainty, a problem that naturally arises is the minimization over diagonal matrices D of the greatest eigenvalue of (e sup D Ae sup -D + (e sup D Ae sup -D)*)/2. The minimization is proved to be convex, thus guaranteeing that every local minimum is also a global minimum and, in theory, guaranteeing the global convergence of generalized gradient nonlinear programming algorithms for computing the minimizing D.

Tekawy, Jonathan A.↗

Solution of an eigenvalue problem for the Laplace operator on a spherical surface

Methods for obtaining approximate solutions for the fundamental eigenvalue of the Laplace-Beltrami operator (also referred to as the membrane eigenvalue problem for the vibration equation) on the unit spherical surface are developed. Two specific types of spherical surface domains are considered: (1) the interior of a spherical triangle, i.e., the region bounded by arcs of three great circles, and (2) the exterior of a great circle arc extending for less than pi radians on the sphere (a spherical surface with a slit). In both cases, zero boundary conditions are imposed. In order to solve the resulting second-order elliptic partial differential equations in two independent variables, a finite difference approximation is derived. The symmetric (generally five-point) finite difference equations that develop are written in matrix form and then solved by the iterative method of point successive overrelaxation. Upon convergence of this iterative method, the fundamental eigenvalue is approximated by iteration utilizing the power method as applied to the finite Rayleigh quotient.

Walden, H.↗

Additive Runge-Kutta Schemes for Convection-Diffusion-Reaction Equations

Additive Runge-Kutta (ARK) methods are investigated for application to the spatially discretized one- dimensional convection-diffusion-reaction (CDR) equations. Accuracy, stability, conservation, and dense-output are first considered for the general case when N different Runge-Kutta methods are grouped into a single composite method. Then, implicit-explicit, (N = 2), additive Runge-Kutta (ARK(sub 2)) methods from third- to fifth-order are presented that allow for integration of stiff terms by an L-stable, stiffly-accurate explicit, singly diagonally implicit Runge-Kutta (ESDIRK) method while the nonstiff terms are integrated with a traditional explicit Runge-Kutta method (ERK). Coupling error terms of the partitioned method are of equal order to those of the elemental methods. Derived ARK(sub 2) methods have vanishing stability functions for very large values of the stiff scaled eigenvalue, z['] yields -infinity, and retain high stability efficiency in the absence of stiffness, z['] yield 0. Extrapolation-type stage- value predictors are provided based on dense-output formulae. Optimized methods minimize both leading order ARK(sub 2) error terms and Butcher coefficient magnitudes as well as maximize conservation properties. Numerical tests of the new schemes on a CDR problem show negligible stiffness leakage and near classical order convergence rates. However, tests on three simple singular-perturbation problems reveal generally predictable order reduction. Error control is best managed with a PID-controller. While results for the fifth-order method are disappointing, both the new third- and fourth-order methods are at least as efficient as existing ARK(sub 2) methods.

Kennedy, Christopher A.↗

Constrained multibody system dynamics: An automated approach

The governing equations for constrained multibody systems are formulated in a manner suitable for their automated, numerical development and solution. The closed loop problem of multibody chain systems is addressed. The governing equations are developed by modifying dynamical equations obtained from Lagrange's form of d'Alembert's principle. The modifications is based upon a solution of the constraint equations obtained through a zero eigenvalues theorem, is a contraction of the dynamical equations. For a system with n-generalized coordinates and m-constraint equations, the coefficients in the constraint equations may be viewed as constraint vectors in n-dimensional space. In this setting the system itself is free to move in the n-m directions which are orthogonal to the constraint vectors.

Kamman, J. W.↗

Additive Runge-Kutta Schemes for Convection-Diffusion-Reaction Equations

Additive Runge-Kutta (ARK) methods are investigated for application to the spatially discretized one-dimensional convection-diffusion-reaction (CDR) equations. First, accuracy, stability, conservation, and dense output are considered for the general case when N different Runge-Kutta methods are grouped into a single composite method. Then, implicit-explicit, N = 2, additive Runge-Kutta ARK2 methods from third- to fifth-order are presented that allow for integration of stiff terms by an L-stable, stiffly-accurate explicit, singly diagonally implicit Runge-Kutta (ESDIRK) method while the nonstiff terms are integrated with a traditional explicit Runge-Kutta method (ERK). Coupling error terms are of equal order to those of the elemental methods. Derived ARK2 methods have vanishing stability functions for very large values of the stiff scaled eigenvalue, z(exp [I]) goes to infinity, and retain high stability efficiency in the absence of stiffness, z(exp [I]) goes to zero. Extrapolation-type stage-value predictors are provided based on dense-output formulae. Optimized methods minimize both leading order ARK2 error terms and Butcher coefficient magnitudes as well as maximize conservation properties. Numerical tests of the new schemes on a CDR problem show negligible stiffness leakage and near classical order convergence rates. However, tests on three simple singular-perturbation problems reveal generally predictable order reduction. Error control is best managed with a PID-controller. While results for the fifth-order method are disappointing, both the new third- and fourth-order methods are at least as efficient as existing ARK2 methods while offering error control and stage-value predictors.

Kennedy, Christopher A.↗

Vibration and buckling of general periodic lattice structures

A method is presented for vibration and buckling analysis of arbitrary lattice structures having repetitive geometry in any combination of coordinate directions. The approach is based on exact member theory for representing the stiffness of an individual member subject to axial load, and in the case of vibration, undergoing harmonic oscillation. The method is an extension of previous work that was limited to specific geometries. The resulting eigenvalue problem is of the size associated with the repeating element of the structure. A computer program has been developed incorporating the theory and results are given for vibration of rectangular platforms and a large antenna structure having rotational symmetry. Buckling and vibration results for cable-stiffened rings are also given.

Anderson, M. S.↗

Development and applications of two computational procedures for determining the vibration modes of structural systems

Two computational procedures for analyzing complex structural systems for their natural modes and frequencies of vibration are presented. Both procedures are based on a substructures methodology and both employ the finite-element stiffness method to model the constituent substructures. The first procedure is a direct method based on solving the eigenvalue problem associated with a finite-element representation of the complete structure. The second procedure is a component-mode synthesis scheme in which the vibration modes of the complete structure are synthesized from modes of substructures into which the structure is divided. The analytical basis of the methods contains a combination of features which enhance the generality of the procedures. The computational procedures exhibit a unique utilitarian character with respect to the versatility, computational convenience, and ease of computer implementation. The computational procedures were implemented in two special-purpose computer programs. The results of the application of these programs to several structural configurations are shown and comparisons are made with experiment.

Kvaternik, R. G.↗

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↗

Recent developments in structural sensitivity analysis

Recent developments are reviewed in two major areas of structural sensitivity analysis: sensitivity of static and transient response; and sensitivity of vibration and buckling eigenproblems. Recent developments from the standpoint of computational cost, accuracy, and ease of implementation are presented. In the area of static response, current interest is focused on sensitivity to shape variation and sensitivity of nonlinear response. Two general approaches are used for computing sensitivities: differentiation of the continuum equations followed by discretization, and the reverse approach of discretization followed by differentiation. It is shown that the choice of methods has important accuracy and implementation implications. In the area of eigenproblem sensitivity, there is a great deal of interest and significant progress in sensitivity of problems with repeated eigenvalues. In addition to reviewing recent contributions in this area, the paper raises the issue of differentiability and continuity associated with the occurrence of repeated eigenvalues.

Haftka, Raphael T.↗

Integrating subsystem embedding subalgebras and coupled cluster Green’s function: a theoretical foundation for quantum embedding in excitation manifold

Here, in this study, we introduce a novel approach to coupled-cluster Green's function (CCGF) embedding by seamlessly integrating conventional CCGF theory with the state-of-the-art sub-system embedding sub-algebras coupled cluster (SES-CC) formalism. This integration focuses primarily on delineating the characteristics of the sub-system and the corresponding segments of the Green's function, defined explicitly by active orbitals. Crucially, our work involves the adaptation of the SES-CC paradigm, addressing the left eigenvalue problem through a distinct form of Hamiltonian similarity transformation. This advancement not only facilitates a comprehensive representation of the interaction between the embedded sub-system and its surrounding environment but also paves the way for the quantum mechanical description of multiple embedded domains, particularly by employing the emergent quantum flow algorithms. Our theoretical underpinnings further set the stage for a generalization to multiple embedded sub-systems. This expansion holds significant promise for the exploration and application of non-equilibrium quantum systems, enhancing the understanding of system–environment interactions. In doing so, the research underscores the potential of SES-CC embedding within the realm of quantum computations and multi-scale simulations, promising a good balance between accuracy and computational efficiency.

97 MATHEMATICS AND COMPUTING↗