Search NASA⌕ Search

SEARCH · Search NASA

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 271 records · Page 15

Multigrid solvers on parallel computers

Massively parallel computers, as considered in this investigation, are not yet available. However, a large-scale parallel computer cannot usefully be designed before the hypothetical algorithms which will employ it are studied. Most of the studies of parallel partial differential equations (PDE) solvers are based on solution techniques much slower (on sequential machines) than multigrid methods. Multigrid methods are highly parallelizable. Each of their processes can simultaneously be performed at all grid points. The present investigation is concerned with a preliminary exploration of the potential of multigrid, or, more generally, Multi-Level Adaptive Techniques (MLAT) on computers with many processors. Basic processes are considered, taking into account coarse-grid approximation, relaxation, coarse-grid corrections, full multigrid algorithms, nonlinear problems and eigenvalue problems, fine-to-coarse correction, and chains of problems. Details of parallel multigrid processing are also examined.

Brandt, A.↗

Improving stability and strength characteristics of framed structures with nonlinear behavior

In this paper an optimal design procedure is introduced to improve the overall performance of nonlinear framed structures. The design methodology presented here is a multiple-objective optimization procedure whose objective functions involve the buckling eigenvalues and eigenvectors of the structure. A constant volume with bounds on the design variables is used in conjunction with an optimality criterion approach. The method provides a general tool for solving complex design problems and generally leads to structures with better limit strength and stability. Many algorithms have been developed to improve the limit strength of structures. In most applications geometrically linear analysis is employed with the consequence that overall strength of the design is overestimated. Directly optimizing the limit load of the structure would require a full nonlinear analysis at each iteration which would be prohibitively expensive. The objective of this paper is to develop an algorithm that can improve the limit-load of geometrically nonlinear framed structures while avoiding the nonlinear analysis. One of the novelties of the new design methodology is its ability to efficiently model and design structures under multiple loading conditions. These loading conditions can be different factored loads or any kind of loads that can be applied to the structure simultaneously or independently. Attention is focused on optimal design of space framed structures. Three-dimensional design problems are more complicated to carry out, but they yield insight into real behavior of the structure and can help avoiding some of the problems that might appear in planar design procedure such as the need for out-of-plane buckling constraint. Although researchers in the field of structural engineering generally agree that optimum design of three-dimension building frames especially in the seismic regions would be beneficial, methods have been slow to emerge. Most of the research in this area has dealt with the optimization of truss and plane frame structures.

Pezeshk, Shahram↗

Quantum computation of nanosheets in a background magnetic field for external control of nanosystems

We ran quantum simulations on lattices of interacting fermions in a background magnetic field [1]. We created discretized Hamiltonian matrices for each system and pre-processed them so that they could be read by the quantum simulator implemented in IBM's Qiskit package [2]. The simulator uses the variational quantum eigensolver (VQE) algorithm [3] to approximate the ground state energy of the input Hamiltonian, which is then compared to the classically-calculated exact value. This classical evaluation is possible because the systems studied are still within the grasp of classical computers. We also investigated ways to simplify the system before the pre-processing step. We found that in almost all cases these simplifications made our quantum calculations converge to better answers using simpler starting conditions. We are exploring other ways to interface with IBM's quantum computing software so that we no longer need to explicitly define the Hamiltonian matrices for our systems, a problem which will itself soon become intractable.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Calculation of Energy Eigenvalues and Eigenvectors for Three Body Molecules in Jacobi and Hyperspherical Coordinates

The jacobi coordinates is used to eliminate center of mass motion of three body systems. We write the results in hyperspherical coordinates and expand eigenfunction in a series of orthonormal complete set of Y{sub k{alpha}{sub i}} ({omega}{sub i}) in partition i of jacobi coordinates. The matrix elements of two body interaction potential in hyperspherical harmonic approach are determined exactly using computed analytical form of Raynal-Revai coefficients to change the base set of Y{sub k{alpha}{sub i}} ({omega}{sub i}) to other set such as Y{sub k{alpha}{sub i}} ({omega}{sub j}. The generalized Laguerre functions are used to change the second order coupled differential equations to set of non-differential matrix equation. This is solved to find energy eigenvalues and eigenfunctions of three body molecules. The obtained analytical results are in a very good agreement with used computational method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Darboux transformation for the NLS equation

We analyze a certain class of integral equations associated with Marchenko equations and Gel'fand-Levitan equations. Such integral equations arise through a Fourier transformation on various ordinary differential equations involving a spectral parameter. When the integral operator is perturbed by a finite-rank perturbation, we explicitly evaluate the change in the solution in terms of the unperturbed quantities and the finite-rank perturbation. We show that this result provides a fundamental approach to derive Darboux transformations for various systems of ordinary differential operators. We illustrate our theory by providing the explicit Darboux transformation for the Zakharov-Shabat system and show how the potential and wave function change when a simple discrete eigenvalue is added to the spectrum, and thus we also provide a one-parameter family of Darboux transformations for the nonlinear Schroedinger equation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reanalysis and design in structural dynamics

A unified efficient formulation for the static and dynamic reanalysis of locally modified structures is presented. The reanalysis problem is to find the structural responses when some of the element properties are adjusted as a result of design modifications or when additional structures are appended to the original system. The reanalysis problem is formulated as a problem of much lower order than the original system. This is achieved by utilizing the linearity property of the structure using the pseudoload concept together with the solution of the original system. The modifications to the structure are treated as displacement-dependent pseudoloads of the system. By expressing the modified system response as linear combinations of the response of the original system and a term depending on the pseudoload, a reduced set of response equations can be obtained. In the static and sinusoidal steady state analysis, this leads to a set of linear algebraic equations. For a free vibration analysis, this results in a reduced eigenvalue problem. Using these reduced equations, a design problem can be solved; that is, the magnitude of a specified local modification for given dynamic response characteristics can be calculated. Several examples are presented to illustrate the general formulations.

Wang, B. P.↗

Complex network approach to fractional time series

In order to extract correlation information inherited in stochastic time series, the visibility graph algorithm has been recently proposed, by which a time series can be mapped onto a complex network. We demonstrate that the visibility algorithm is not an appropriate one to study the correlation aspects of a time series. We then employ the horizontal visibility algorithm, as a much simpler one, to map fractional processes onto complex networks. The degree distributions are shown to have parabolic exponential forms with Hurst dependent fitting parameter. Further, we take into account other topological properties such as maximum eigenvalue of the adjacency matrix and the degree assortativity, and show that such topological quantities can also be used to predict the Hurst exponent, with an exception for anti-persistent fractional Gaussian noises. To solve this problem, we take into account the Spearman correlation coefficient between nodes' degrees and their corresponding data values in the original time series.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A study of the response of nonlinear springs

The various phases to developing a methodology for studying the response of a spring-reinforced arch subjected to a point load are discussed. The arch is simply supported at its ends with both the spring and the point load assumed to be at midspan. The spring is present to off-set the typical snap through behavior normally associated with arches, and to provide a structure that responds with constant resistance over a finite displacement. The various phases discussed consist of the following: (1) development of the closed-form solution for the shallow arch case; (2) development of a finite difference analysis to study (shallow) arches; and (3) development of a finite element analysis for studying more general shallow and nonshallow arches. The two numerical analyses rely on a continuation scheme to move the solution past limit points, and to move onto bifurcated paths, both characteristics being common to the arch problem. An eigenvalue method is used for a continuation scheme. The finite difference analysis is based on a mixed formulation (force and displacement variables) of the governing equations. The governing equations for the mixed formulation are in first order form, making the finite difference implementation convenient. However, the mixed formulation is not well-suited for the eigenvalue continuation scheme. This provided the motivation for the displacement based finite element analysis. Both the finite difference and the finite element analyses are compared with the closed form shallow arch solution. Agreement is excellent, except for the potential problems with the finite difference analysis and the continuation scheme. Agreement between the finite element analysis and another investigator's numerical analysis for deep arches is also good.

Hyer, M. W.↗

Numerical Treatment of Singular ODE EVPs Using bvpsuite

We put forward a new method for the solution of eigenvalue problems for (systems of) ordinary differential equations, where our main focus is on eigenvalue problems for singular Schroedinger equations arising, for example, in electronic structure computations. Here, the generation of the starting values for the computation of eigenvalues of higher index is a critical issue. Our approach comprises two stages: First we generate rough approximations by a matrix method. These approximations are used as starting values for an adaptive collocation method which yields approximations of high accuracy together with a reliable error estimate. We successfully apply our method to the solution of the coupled ODE Stark problem for the hydrogen atom.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Wave functions and energy spectra for the hydrogenic atom in R{sup 3}xM

We consider the hydrogenic atom in a space of the form R{sup 3}xM, where M may be a generalized manifold obeying certain properties. We separate the solution to the governing time-independent Schroedinger equation into a component over R{sup 3} and a component over M. Upon obtaining a solution to the relevant eigenvalue problems, we recover both the wave functions and energy spectrum for the hydrogenic atom over R{sup 3}xM. We consider some specific examples of M, including the fairly simple D-dimensional torus T{sup D} and the more complicated Kaehler conifold K in order to illustrate the method. In the examples considered, we see that the corrections to the standard energy spectrum for the hydrogen atom due to the addition of higher dimensions scale as a constant times 1/L{sup 2}, where L denotes the size of the additional dimensions. Thus, under the assumption of small compact extra dimensions, even the first energy corrections to the standard spectrum will be quite large.

97 MATHEMATICS AND COMPUTING↗

Chaotic dynamics and diffusion in a piecewise linear equation

Genetic interactions are often modeled by logical networks in which time is discrete and all gene activity states update simultaneously. However, there is no synchronizing clock in organisms. An alternative model assumes that the logical network is preserved and plays a key role in driving the dynamics in piecewise nonlinear differential equations. We examine dynamics in a particular 4-dimensional equation of this class. In the equation, two of the variables form a negative feedback loop that drives a second negative feedback loop. By modifying the original equations by eliminating exponential decay, we generate a modified system that is amenable to detailed analysis. In the modified system, we can determine in detail the Poincaré (return) map on a cross section to the flow. By analyzing the eigenvalues of the map for the different trajectories, we are able to show that except for a set of measure 0, the flow must necessarily have an eigenvalue greater than 1 and hence there is sensitive dependence on initial conditions. Further, there is an irregular oscillation whose amplitude is described by a diffusive process that is well-modeled by the Irwin-Hall distribution. There is a large class of other piecewise-linear networks that might be analyzed using similar methods. The analysis gives insight into possible origins of chaotic dynamics in periodically forced dynamical systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Nonlinear structural dynamics analysis using a modified modal method

The procedure for predicting the nonlinear dynamic response of structural components subjected to a step loading is presented. The procedure is a modified modal method that involves a change of dependent variables from the unknown nodal degrees of freedom of the finite element model of the structure to a smaller set of generalized coordinates. This change of dependent variables uses a combination of the nonlinear static solution and some selected vibration mode shapes. The vibration mode shapes correspond to the eigenvectors obtained by solving a standard free vibration eigenvalue problem wherein the stiffness matrix is expanded about the nonlinear static solution. A strategy is also presented for determining which and how many vibration mode shapes to include in the transformation. The effect of inaccurate representation of the spatial distribution of the applied load on the nonlinear dynamic response is discussed for two classes of structural behavior. Application of the procedure to structures which exhibit a stiffening behavior and to those with a softening behavior is presented.

Knight, N. F., Jr.↗

First-order quantum phase transition in adiabatic quantum computation

We investigate the connection between local minima in the problem Hamiltonian and first-order quantum phase transitions during adiabatic quantum computation. We demonstrate how some properties of the local minima can lead to an extremely small gap that is exponentially sensitive to the Hamiltonian parameters. Using perturbation expansion, we derive an analytical formula that cannot only predict the behavior of the gap, but also provide insight on how to controllably vary the gap size by changing the parameters. We show agreement with numerical calculations for a weighted maximum independent set problem instance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Symmetry and separability of the neutron diffusion equation

Separation of variables is one of the oldest techniques for solving certain classes of partial differential equations (PDEs). As is the case with many other solution techniques for differential equations, separation of variables may be codified within the broader framework of symmetry analysis. Though the separation of variables technique is frequently used in the nuclear engineering context with various equations describing neutron transport, its connection to the symmetries of those equations has not yet been thoroughly established. It is thus the purpose of this work to establish that connection using neutron diffusion as both an initial step toward analysis of more generally applicable equations, and as a connection to previous results in related problems. Using Lie group analysis, it is found that the traditional space-time separable solution of the neutron diffusion equation (featuring a single α-eigenvalue) corresponds to time translation and flux scaling symmetries. Additional solutions of this equation are also constructed using its broader symmetry set.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Accuracy considerations for Chebyshev rational approximation method (CRAM) in Burnup calculations

The burnup equations can in principle be solved by computing the exponential of the burnup matrix. However, due to the difficult numerical characteristics of burnup matrices, the problem is extremely stiff and the matrix exponential solution has previously been considered infeasible for an entire burnup system containing over a thousand nuclides. It was recently discovered by the author that the eigenvalues of burnup matrices are generally located near the negative real axis, which prompted introducing the Chebyshev rational approximation method (CRAM) for solving the burnup equations. CRAM can be characterized as the best rational approximation on the negative real axis and it has been shown to be capable of simultaneously solving an entire burnup system both accurately and efficiently. In this paper, the accuracy of CRAM is further studied in the context of burnup equations. The approximation error is analyzed based on the eigenvalue decomposition of the burnup matrix. It is deduced that the relative accuracy of CRAM may be compromised if a nuclide concentration diminishes significantly during the considered time step. Numerical results are presented for two test cases, the first one representing a small burnup system with 36 nuclides and the second one a full a decay system with 1531 nuclides. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Change of variables as a method to study general β-models: Bulk universality

We consider β matrix models with real analytic potentials. Assuming that the corresponding equilibrium density ρ has a one-interval support (without loss of generality σ = [−2, 2]), we study the transformation of the correlation functions after the change of variables λ{sub i} → ζ(λ{sub i}) with ζ(λ) chosen from the equation ζ{sup ′}(λ)ρ(ζ(λ)) = ρ{sub sc}(λ), where ρ{sub sc}(λ) is the standard semicircle density. This gives us the “deformed” β-model which has an additional “interaction” term. Standard transformation with the Gaussian integral allows us to show that the “deformed” β-model may be reduced to the standard Gaussian β-model with a small perturbation n{sup −1}h(λ). This reduces most of the problems of local and global regimes for β-models to the corresponding problems for the Gaussian β-model with a small perturbation. In the present paper, we prove the bulk universality of local eigenvalue statistics for both one-cut and multi-cut cases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Application of NEM-based Pin-by-Pin HCMFD Algorithm to 3-D Core Analysis

A pin-wise reactor analysis is expected to provide a more accurate solution than the conventional nodal methods. However, a pin-wise approach is still computationally very costly though the computational performances have been enormously improved for decades. To overcome such limitation of a pin-by-pin core analysis, the HCMFD (Hybrid Course-Mesh Finite Difference) algorithm has been recently introduced. By adopting the HCMFD algorithm, a parallel computing can be applied very effectively. In the HCMFD algorithm, an iterative local-global strategy is adopted with a combination of two CMFD acceleration methods for the pin-wise core analysis. The global eigenvalue problem is solved by one-node CMFD, while the local fixed-source problems are solved by two-node CMFD based on the NEM (nodal expansion method). In the HCMFD computational scheme, a parallel computing can effectively be applied since most of the computational efforts are consumed to solve the local problems, and they can be solved in parallel. Previously, only a 2-D HCMFD algorithm was developed and its numerical efficiency was evaluated. In this paper, a 3D HCMFD scheme is introduced and some 3-D problems were analyzed to verify its applicability to 3D pin-wise core analysis. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Fast reactor 3D core and burnup analysis using VESTA

Burnup analyses using the VESTA code have been performed on a MOX-fuelled fast reactor model as specified by an IAEA computational benchmark. VESTA is a relatively new code that has been used for burnup credit calculations and thermal reactor models, but not typically for fast reactor applications. The detailed input and results of the IAEA benchmark provides an opportunity to gauge the use of VESTA in a fast reactor application. VESTA employs an ultra-fine multi-group binning approach that accelerates Monte Carlo burnup calculations. Using VESTA to compute the end of cycle (EOC) power fractions by enrichment zone showed agreement with the published values within 5%. When comparing the ultra-fine multi-group binning approach to the tally-based approach, EOC isotopic masses also agree within 5%. Using the ultra-fine multi-group binning approach, we obtain a wall-time speedup factor of 35 when compared to the tally-based approach for computing a k{sub eff} eigenvalue with burnup problem. The authors conclude the use of VESTA's ultra-fine multi-group binning approach with Monte Carlo transport performs accurate depletion calculations for this fast reactor benchmark. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗