SEARCH · Engineering Papers
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.
The linear aeroelastic equations for one curved blade of a vertical axis wind turbine in state vector form are presented. The method is based on a simple integrating matrix scheme together with the transfer matrix idea. The method is proposed as a convenient way of solving the associated eigenvalue problem for general support conditions.
Explore the source record for details and available documents.
The elastic instability of an internally-pressurized cylindrical tank with a torispherical head is investigated using a triangular, doubly curved, thin-shell finite element. The formulation of the finite element, which is based upon cubic displacement functions and a modified principle of potential energy, is first described. Then, the element is verified by comparing numerical results for the linear, stable analysis to alternative solutions for the same problem. The subsequent instability investigation includes the solution of the linearized problem of equilibrium bifurcation, that is, of the classical eigenvalue problem, and a general nonlinear analysis, based on tracing the nonlinear load-displacement path. The critical pressure, obtained with use of the general nonlinear analysis, agrees closely with an experimental result as well as with a numerical solution stemming from an axisymmetric formulation.
In this paper, analytic expressions are obtained for the design derivatives of eigenvalues and eigenfunctions of self-adjoint linear distributed parameter systems. Explicit treatment of boundary conditions is avoided by casting the eigenvalue equation into integral form. Results are expressed in terms of the linear operators defining the eigenvalue problem, and are therefore quite general. Sufficiency conditions appropriate to structural optimization of eigenvalues are obtained.
A class of singular differential equations that often occurs in problems in magnetohydrodynamics, plasma physics, and astrophysics is studied; first by means of the specific and fairly straightforward example of motions in a stratified magnetofluid, and secondly in terms of the nature of the eigenvalue spectrum for the more general class of problems. It is shown that in the absence of discontinuities in the basic profiles, the eigenvalue spectrum is real and continuous, and no discrete spectrum exists. Bounds are obtained on the location of the continuous spectrum.
We extend the l0-norm "subspectral" algorithms for sparse-LDA [5] and sparse-PCA [6] to general quadratic costs such as MSE in linear (kernel) regression. The resulting "Sparse Least Squares" (SLS) problem is also NP-hard, by way of its equivalence to a rank-1 sparse eigenvalue problem (e.g., binary sparse-LDA [7]). Specifically, for a general quadratic cost we use a highly-efficient technique for direct eigenvalue computation using partitioned matrix inverses which leads to dramatic x103 speed-ups over standard eigenvalue decomposition. This increased efficiency mitigates the O(n4) scaling behaviour that up to now has limited the previous algorithms' utility for high-dimensional learning problems. Moreover, the new computation prioritizes the role of the less-myopic backward elimination stage which becomes more efficient than forward selection. Similarly, branch-and-bound search for Exact Sparse Least Squares (ESLS) also benefits from partitioned matrix inverse techniques. Our Greedy Sparse Least Squares (GSLS) generalizes Natarajan's algorithm [9] also known as Order-Recursive Matching Pursuit (ORMP). Specifically, the forward half of GSLS is exactly equivalent to ORMP but more efficient. By including the backward pass, which only doubles the computation, we can achieve lower MSE than ORMP. Experimental comparisons to the state-of-the-art LARS algorithm [3] show forward-GSLS is faster, more accurate and more flexible in terms of choice of regularization
The conventional approaches to the inverse density functional theory problem typically assume nondegeneracy of the Kohn–Sham (KS) eigenvalues, greatly hindering their use in open-shell systems. Here, we present a generalization of the inverse density functional theory problem that can seamlessly admit degenerate KS eigenvalues. Additionally, we allow for fractional occupancy of the Kohn–Sham orbitals to also handle noninteracting ensemble-v-representable densities, as opposed to just noninteracting pure-v-representable densities. We present the exact exchange-correlation (XC) potentials for six open-shell systems–four atoms (Li, C, N, and O) and two molecules (CN and CH 2 )–using accurate ground-state densities from configuration interaction calculations. We compare these exact XC potentials with model XC potentials obtained using nonlocal (B3LYP, SCAN0) and local/semilocal (SCAN, PBE, PW92) XC functionals. Although the relative errors in the densities obtained from these DFT functionals are of $O$(10 –3 to 10 –2 ), the relative errors in the model XC potentials remain substantially large–$O$(10 –1 to 10 0 ).
Large-scale eigenvalue problems arise in various fields of science and engineering and demand computationally efficient solutions. In this study, we investigate the subspace approximation for parametric linear eigenvalue problems, aiming to mitigate the computational burden associated with high-fidelity systems. Furthermore, we provide general error estimates under non-simple eigenvalue conditions, establishing some theoretical foundations for understanding the convergence behavior of subspace approximations. Numerical examples, including problems with one-dimensional to three-dimensional spatial domain and one-dimensional to two-dimensional parameter domain, are presented to demonstrate the efficacy of reduced basis method in handling parametric variations in boundary conditions and coefficient fields to achieve significant computational savings while maintaining high accuracy, making them promising tools for practical applications in large-scale eigenvalue computations.
SENSMG is a tool for computing first-order sensitivities of neutron reaction rates, reaction-rate ratios, leakage, k eff , α, and subcritical multiplication using the PARTISN multigroup discrete-ordinates code. SENSMG computes sensitivities to all of the transport cross sections and data (total, fission, a nu, chi, and all scattering moments), two edit cross sections (absorption and capture), and the density for every nuclide and energy group. It also computes sensitivities to the mass density for every material and derivatives with respect to all interface locations and outer boundaries. It computes sensitivities to user specified reactions whose cross sections are available in a user-supplied NJOY output file. The tool can be used for one-dimensional spherical and slab (r) and two-dimensional cylindrical (r-z) geometries. The tool can be used for fixed-source and eigenvalue problems. For most responses, the tool implements Generalized Perturbation Theory (GPT) as discussed by Williams and Stacey. The tool is thus limited to computing sensitivities only for GPT-allowable responses. For subcritical multiplication, the tool implements sensitivities derived by O’Brien and Clark. SENSMG has a similar role as the old SWANLAKE (Ref. 8), FORSS (Ref. 9), and SENSIT (Ref. 10) codes. It has capabilities similar to those of SUSD3D (Refs. 11 and 12), which also uses PARTISN. Section II of this report describes the theory behind adjoint-based sensitivities, gives the equations that SENSMG solves, and defines the sensitivities that are output. Section III describes the user interface, including the input file and command line options. Section IV describes the output. Section V gives some notes about the coding that may be of interest. Section VI presents some sample problems and discusses verification, which is ongoing. Section VII lists needs and ideas for future work. Appendix A lists most of the input files whose results are presented in Sec. VI. Appendix B provides some useful details on one of the cross-section libraries that SENSMG supports.
The main thrust of this paper is to study eigensensitivity analysis techniques and their applications to design optimization of space structures. It is found that in general, space structures show four types of eigenvalue problems most of which are related to repeated eigenvalues. This paper first gives a detailed derivation of eigensensitivity equations. Later, numerical examples are provided to verify the derived sensitivity equations as well as to demonstrate the applicability of those sensitivity equations in an iterative design environment.
Subspace iteration has been a major advance in solving large eigen problems when only a subset of eigen-pairs is required. The essence of this method is a transformation from displacement coordinates of an n-th order eigensystem to generalized coordinates of a smaller q-th order. The eigenvalue problem is then solved in the reduced space. The method was first developed by Clint and Jennings for real symmetric systems and was then called 'simultaneous iteration'. The success of the method prompted further research along this line and there have been many improved algorithms developed. This approach has been widely used by structural engineers for extracting the most useful natural frequencies and mode shapes of large-scale dynamic systems. This paper exploits into a new direction which is in the form of iterative process for simultaneously calculating eigenvector derivatives of many eigenvectors with respect to multi-variables. The method fully uses all the available information from preceding eigenvalue solution and, thus, effectively economizes computational efforts. It iterates through two equations derived from the first variation of the two fundamental equations used in subspace iteration method. There is no expensive large matrix decomposition required and the process converges to acceptable solution in a finite number of iterations. Therefore, the procedure increases its efficiency superiority over the others as the system size or the number of interested eigenvectors become larger and larger.
A survey of methods for sensitivity analysis of the algebraic eigenvalue problem for non-Hermitian matrices is presented. In addition, a modification of one method based on a better normalizing condition is proposed. Methods are classified as Direct or Adjoint and are evaluated for efficiency. Operation counts are presented in terms of matrix size, number of design variables and number of eigenvalues and eigenvectors of interest. The effect of the sparsity of the matrix and its derivatives is also considered, and typical solution times are given. General guidelines are established for the selection of the most efficient method.
This paper extends our recent work on the Physics-Informed Neural Networks (PINN) approach for the fixed source diffusion models and applies it to the diffusion theory based k-eigenvalue problems. To make the PINN equitable for the eigenvalue problems, we introduce a novel integral regularization term to the loss function in the framework, and allow the direct inference of the principal eigenvalue and the associated eigenfunction. The regularization term enforces a pre-defined value on the integration of the model predictions, and this value can be directly related to a physical property of the system. We also introduce an additional learnable parameter to approximate the principal eigenvalue. As a proof of principle, we solve the one-group two-dimensional k-eigenvalue neutron diffusion equation in this work. We then provide two numerical examples to demonstrate the applicability of the PINN approach. In each example, we solve the k-eigenvalue diffusion equation in a multi-region configuration constrained with a set of Robin boundary conditions for generality. We use a FEM solution based on the power-iteration method to verify the results of the PINN solution. The results showed relative percentage error in the predicted eigenvalue of about 0.77% and about 1.2% for example 1 and example 2, respectively. The mean absolute error in the predicted flux for example 1 is ∼ 0.002 and for example 2 is ∼ 0.0024. These results indicate some preliminary successes of the PINN application to k-eigenvalue problems. (authors)
The Mercier criterion is a well-known stability criterion for tokamaks. It is derived from a 2 × 2 matrix eigenvalue problem arising from the expansion of resonant solutions about a singular surface where m−nq=0, with m and n being the poloidal and toroidal mode numbers, respectively, and q being the safety factor. The stability criterion is that the eigenvalues must be real, otherwise, the solution oscillates, violating the Newcomb crossing criterion. Because of the non-axisymmetry of stellarators, different toroidal as well as poloidal harmonics couple to each other. It follows that each singular surface can have multiple resonant harmonics, with multiplicity M≥1. The corresponding matrix eigenvalue problem involves a 2M×2M matrix, resulting in M pairs of positive and negative eigenvalues. The generalized stability criterion is that all eigenvalues must be real. While the original Mercier criterion can be expressed in terms of quadratures of equilibrium quantities over the singular surface, which can be evaluated anywhere, the generalized Mercier criterion can only be evaluated on rational q surfaces with a given set of resonant harmonics.
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.
A survey of methods for sensitivity analysis of the algebraic eigenvalue problem for non-Hermitian matrices is presented. In addition, a modification of one method based on a better normalizing condition is proposed. Methods are classified as Direct or Adjoint and are evaluated for efficiency. Operation counts are presented in terms of matrix size, number of design variables and number of eigenvalues and eigenvectors of interest. The effect of the sparsity of the matrix and its derivatives is also considered, and typical solution times are given. General guidelines are established for the selection of the most efficient method.
We have developed a new global eigenvalue code, Multiscale Analysis for plasma Stabilities (MAS), for studying plasma problems with wave toroidal mode number (n) and frequency (ω) in a broad range of interest in general tokamak geometry, based on a five-field Landau-fluid description of thermal plasmas. Beyond keeping the necessary plasma fluid response, we further retain the important kinetic effects including diamagnetic drift, ion finite Larmor radius, finite parallel electric field (E||), ion and electron Landau resonances in a self-consistent and non-perturbative manner without sacrificing the attractive efficiency in computation. The physical capabilities of the code are evaluated and examined in the aspects of both theory and simulation. In theory, the comprehensive Landau-fluid model implemented in MAS can be reduced to the well-known ideal MHD model, electrostatic ion-fluid model, and drift-kinetic model in various limits, which clearly delineates the physics validity regime. In simulation, MAS has been well benchmarked with theory and other gyrokinetic and kinetic-MHD hybrid codes in a manner of adopting the unified physical and numerical framework, which covers the kinetic Alfv\'en wave (KAW), ion sound wave (ISW), low-n kink, high-n ion temperature gradient mode (ITG) and kinetic ballooning mode (KBM). Moreover, MAS is successfully applied to model the Alfv\'en eigenmode (AE) activities in DIII-D discharge #159243, which faithfully captures the frequency sweeping of reversed shear Alfv\'en eigenmode (RSAE), the tunneling damping of toroidal Alfv\'en eigenmode (TAE), as well as the polarization characteristics of kinetic beta-induced Alfv\'en eigenmode (KBAE) and beta-induced Alfv\'en-acoustic eigenmode (BAAE) being consistent with former gyrokinetic theory and simulation. With respect to the key progress contributed to the community, MAS has the advantage of combining rich physics ingredients, realistic global geometry and high computation efficiency together for plasma stability analysis in linear regime.
Flutter analysis of a two degree of freedom airfoil in compressible flow is performed using a state-space representation of the unsteady aerodynamic behavior. Indicial response functions are used to represent the normal force and moment response of the airfoil. The structural equations of motion of the airfoil with bending and torsional degrees of freedom are coupled to the unsteady air loads and the aeroelastic system so modelled is solved as an eigenvalue problem to determine the stability. The aeroelastic equations are also directly integrated with respect to time and the time-domain results compared with the results from the eigenanalysis. A good agreement is obtained. The derivatives of the flutter speed obtained from the eigenanalysis are calculated with respect to the mass and stiffness parameters by both analytical and finite-difference methods for various transonic Mach numbers. The experience gained from the two degree of freedom model is applied to study the sensitivity of the flutter response of a wing with respect to various shape parameters. The parameters being considered are as follows: (1) aspect ratio; (2) surface area of the wing; (3) taper ratio; and (4) sweep. The wing deflections are represented by Chebyshev polynomials. The compressible aerodynamic state-space model used for the airfoil section is extended to represent the unsteady aerodynamic forces on a generally laminated tapered skewed wing. The aeroelastic equations are solved as an eigenvalue problem to determine the flutter speed of the wing. The derivatives of the flutter speed with respect to the shape parameters are calculated by both analytical and finite difference methods.