Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “eigenvalue problems”

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 865 records · Page 48

Advanced Quantum Poisson Solver in the NISQ era

The Poisson equation has many applications across the broad areas of science and engineering. Most quantum algorithms for the Poisson solver presented so far, either suffer from lack of accuracy and/or are limited to very small sizes of the problem, and thus have no practical usage. Here we present an advanced quantum algorithm for solving the Poisson equation with high accuracy and dynamically tunable problem size. After converting the Poisson equation to the linear systems through the finite difference method, we adopt the Harrow-Hassidim-Lloyd (HHL) algorithm as the basic framework. Particularly, in this work we present an advanced circuit that ensures the accuracy of the solution by implementing non-truncated eigenvalues through eigenvalue amplification as well as by increasing the accuracy of the controlled rotation angular coefficients, which are the critical factors in the HHL algorithm. We show that our algorithm not only increases the accuracy of the solutions, but also composes more practical and scalable circuits by dynamically controlling problem size in the NISQ devices. We present both simulated and experimental results, and discuss the sources of errors. Finally, we conclude that overall results on the quantum hardware are dominated by the error in the CNOT gates.

Robson, Walter↗

Recent advances in methods for numerical solution of O.D.E. initial value problems

In the mathematical modeling of physical systems, it is often necessary to solve an initial value problem (IVP), consisting of a system of ordinary differential equations (ODE). A typical program produces approximate solutions at certain mesh points. Almost all existing codes try to control the local truncation error, while the user is really interested in controlling the true or global error. The present investigation provides a review of recent advances regarding the solution of the IVP, giving particular attention to stiff systems. Stiff phenomena are customarily defined in terms of the eigenvalues of the Jacobian. There are, however, some difficulties connected with this approach. It is pointed out that an estimate of the Lipschitz constant proves to be a very practical way to determine the stiffness of a problem.

Bui, T. D.↗

Improvement and Verification of Online Cross Section Generation Capability of Griffin for TRISO-fueled Reactors

Griffin, a MOOSE-based reactor multiphysics code jointly developed by Idaho National Laboratory and Argonne National Laboratory under the DOE Office of Nuclear Energy’s NEAMS program, has pursued the development of an online multigroup cross section generation capability for a few years to enable high-fidelity, problem-dependent neutronics analyses of advanced thermal reactors. Recent advancements in Griffin’s online multigroup cross section generation capability have significantly improved the accuracy, robustness, and efficiency of self-shielding calculations for both prismatic and pebble-bed TRISO-fueled reactor applications. Key developments include a unified fuel self-shielding method applicable to both TRISO and annular compact/spherical shell fuel zone geometries; an advanced Dancoff Category-based Equivalence Theory using a bell function for non-fuel resonance treatment, achieving more than an order-of-magnitude speedup compared to the Tone method; an on-the-fly multigroup equivalence approach to mitigate group condensation errors; and a streaming correction method for pebble-bed homogenization. A proof-of-concept demonstration of on-the-fly group condensation with consistent P0 transport correction was also achieved. The method reproduced direct fine-group solutions with excellent accuracy (eigenvalue errors within 10 pcm and pin-power differences within 0.5%), but due to performance limitations of the current fixed-source solver, improvements to solver efficiency will be addressed in future work. Verification tests were performed on graphite-moderated TRISO-fueled two-dimensional core benchmark problems representing gas-cooled microreactors, heat pipe-cooled microreactors, gas-cooled pebble-bed reactors, and fluoride salt-cooled high-temperature reactors. Across all cases, Griffin showed excellent agreement with Serpent2 continuous energy Monte Carlo solutions: eigenvalue errors within 200 pcm, pin-power root-mean-square errors within 2%, and control rod and drum worth errors less than 2%. It should be noted that, for the benchmark problem, cross section generation contributed less than 3% of the total simulation times. These results demonstrate that Griffin’s online cross section generation capability delivers accurate and efficient reactor physics solutions across a wide spectrum of TRISO-fueled advanced reactor designs. With further improvements to the fine-group fixed-source solver and planned extensions to depletion, transients, and coupled neutron–gamma transport, Griffin will be well-positioned to become a powerful and comprehensive tool for advanced reactor analysis.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

On numerical solutions to the QCD ’t Hooft equation in the limit of large quark mass

First we give a short informal introduction to the theory behind the ’t Hooft equation. Then we consider numerical solutions to this equation in the limit of large fermion masses. It turns out that the spectrum of eigenvalues coincides with that of the Airy differential equation. Moreover when we take the Fourier transform of eigenfunctions, they look like the corresponding Airy functions with appropriate symmetry. It is known that these functions correspond to solutions of a one dimensional Schrodinger equation for a particle in a triangular potential well. So we find the analogy between this problem and the ’t Hooft equation. We also present a simple intuition behind these results.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Iterated Fission Matrix Method

The fission matrix (FM) method has been successfully demonstrated for different applications. One of the interesting features of this method, which is not possible via standard criticality source Monte Carlo calculations, is the capability to calculate higher forward and adjoint Eigenmodes; however, the accuracy of the estimates for higher eigenvalues strongly depends on the spatial discretization adopted for the fission matrix. A fine mesh ensures accurate results but requires matrices of large size. This is considered a limitation to the applicability of the FM method due to the memory requirements for storage of large full matrices. The adoption of sparse matrix storage (e.g., in MCNP) partially overcomes this problem; nonetheless, the sparse matrix indexing increases the complexity of the implementation of the FM algorithm and introduces the additional task of sparsifying the fission matrix. This summary presents a new method, named the iterated fission matrix (IFM), that allows to estimate higher eigenvalues of multiplying systems on much smaller meshes, but with the same level of accuracy in terms of spatial discretization errors, as compared to the FM method. The following Sections describe this new approach and provide a demonstration using two case studies: a PWR fuel assembly, and a 2D PWR core. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides

The technique that was used to build the EigCG algorithm for sparse symmetric linear systems is extended to the nonsymmetric case using the BiCG algorithm. We show that, similarly to the symmetric case, we can build an algorithm that is capable of computing a few smallest magnitude eigenvalues and their corresponding left and right eigenvectors of a nonsymmetric matrix using only a small window of the BiCG residuals while simultaneously solving a linear system with that matrix. For a system with multiple right-hand sides, we give an algorithm that computes incrementally more eigenvalues while solving the first few systems and then uses the computed eigenvectors to deflate BiCGStab for the remaining systems. Our experiments on various test problems, including Lattice QCD, show the remarkable ability of EigBiCG to compute spectral approximations with accuracy comparable to that of the unrestarted, nonsymmetric Lanczos. Furthermore, our incremental EigBiCG followed by appropriately restarted and deflated BiCGStab provides a competitive method for systems with multiple right-hand sides.

Abdel-Rehim, A M↗

Multilevel Convergence Analysis of Multigrid-Reduction-in-Time

This study presents a multilevel convergence framework for multigrid-reduction-in-time (MGRIT) as a generalization of previous two-grid estimates. The framework provides a priori upper bounds on the convergence of MGRIT V- and F-cycles, with different relaxation schemes, by deriving the respective residual and error propagation operators. The residual and error operators are functions of the time-stepping operator, analyzed directly and bounded in the norm, both numerically and analytically. We present various upper bounds of different computational cost and varying sharpness. These upper bounds are complemented by proposing analytic formulae for the approximate convergence factor of V-cycle algorithms that take the number of fine grid time points, the temporal coarsening factors, and the eigenvalues of the time-stepping operator as parameters. The paper concludes with supporting numerical investigations of parabolic (anisotropic diffusion) and hyperbolic (wave equation) model problems. We assess the sharpness of the bounds and the quality of the approximate convergence factors. Observations from these numerical investigations demonstrate the value of the proposed multilevel convergence framework for estimating MGRIT convergence a priori and for the design of a convergent algorithm. We further highlight that observations in the literature are captured by the theory, including that two-level Parareal and multilevel MGRIT with F-relaxation do not yield scalable algorithms and the benefit of a stronger relaxation scheme. An important observation is that with increasing numbers of levels MGRIT convergence deteriorates for the hyperbolic model problem, while constant convergence factors can be achieved for the diffusion equation. The theory also indicates that L-stable Runge--Kutta schemes are more amendable to multilevel parallel-in-time integration with MGRIT than A-stable Runge--Kutta schemes.

97 MATHEMATICS AND COMPUTING↗

Gas-Cooled High-Temperature Pebble-Bed Reactor Reference Plant Model

This report details a fully coupled neutronics thermal hydraulics reference plant model for a gas-cooled high-temperature pebble-bed reactor. The multiphysics model is developed on the Nuclear Regulatory Commission's Comprehensive Reactor Analysis Bundle (BlueCRAB) available on the Idaho National Laboratory high performance computer, which natively and seamlessly couples Griffin, Pronghorn, and the BISON MOOSE-based applications. Griffin provides the reactor physics capabilities including depletion to the equilibrium core, k-eigenvalue, adjoint, and transient solutions. Pronghorn solves the porous medium equations for the fluid regions and conduction in the solid regions. BISON solves thermal conduction problems for the average pebble and TRISO in the pebble-bed core thus providing the fuel and moderator spatial fields for each pebble burnup group. The neutronics feedback relies primarily on fuel and moderator temperatures. We present results for the coupled steady state equilibrium core and a protected loss of flow event. Although this model is to be considered prototypical with regard to the capabilities in BlueCRAB, its results are consistent with published work by the Institute of Nuclear and New Energy Technology (INET) in China and other research entities.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Minimization of the Vibration Energy of Thin-Plate Structures and the Application to the Reduction of Gearbox Vibration

While the vibration analysis of gear systems has been developed, a systematic approach to the reduction of gearbox vibration has been lacking. The technique of reducing vibration by shifting natural frequencies is proposed here for gearboxes and other thin-plate structures using the theories of finite elements, modal analysis, and optimization. A triangular shell element with 18 degrees of freedom is developed for structural and dynamic analysis. To optimize, the overall vibration energy is adopted as the objective function to be minimized at the excitation frequency by varying the design variable (element thickness) under the constraint of overall constant weight. Modal analysis is used to determine the sensitivity of the vibration energy as a function of the eigenvalues and eigenvectors. The optimum design is found by the gradient projection method and a unidimensional search procedure. By applying the computer code to design problems for beams and plates, it was verified that the proposed method is effective in reducing vibration energy. The computer code is also applied to redesign the NASA Lewis gear noise rig test gearbox housing. As one example, only the shape of the top plate is varied, and the vibration energy levels of all the surfaces are reduced, yielding an overall reduction of 1/5 compared to the initial design. As a second example, the shapes of the top and two side plates are varied to yield an overall reduction in vibration energy of 1/30.

Inoue, Katsumi↗

Classical Trajectories and Quantum Spectra

A classical model of the Schrodinger's wave packet is considered. The problem of finding the energy levels corresponds to a classical manipulation game. It leads to an approximate but non-perturbative method of finding the eigenvalues, exploring the bifurcations of classical trajectories. The role of squeezing turns out decisive in the generation of the discrete spectra.

Mielnik, Bogdan↗

Fast Multilevel Solvers for a Class of Discrete Fourth Order Parabolic Problems

In this paper, we study fast iterative solvers for the solution of fourth order parabolic equations discretized by mixed finite element methods. We propose to use consistent mass matrix in the discretization and use lumped mass matrix to construct efficient preconditioners. We provide eigenvalue analysis for the preconditioned system and estimate the convergence rate of the preconditioned GMRes method. Furthermore, we show that these preconditioners only need to be solved inexactly by optimal multigrid algorithms. Our numerical examples indicate that the proposed preconditioners are very efficient and robust with respect to both discretization parameters and diffusion coefficients. We also investigate the performance of multigrid algorithms with either collective smoothers or distributive smoothers when solving the preconditioner systems.

97 MATHEMATICS AND COMPUTING↗

Augmenting the one-shot framework by additional constraints

The (multistep) one-shot method for design optimization problems has been successfully implemented for various applications. To this end, a slowly convergent primal fixed-point iteration of the state equation is augmented by an adjoint iteration and a corresponding preconditioned design update. In this paper we present a modification of the method that allows for additional equality constraints besides the usual state equation. Finally, a retardation analysis and the local convergence of the method in terms of necessary and sufficient conditions are given, which depend on key characteristics of the underlying problem and the quality of the utilized preconditioner.

97 MATHEMATICS AND COMPUTING↗

On the nonlinear stability of a quasi-two-dimensional drift kinetic model for ion temperature gradient turbulence

We study a quasi-two-dimensional electrostatic drift kinetic system as a model for near-marginal ion temperature gradient driven turbulence. A proof is given for the nonlinear stability of this system under conditions of linear stability. This proof is achieved using a transformation that diagonalizes the linear dynamics and also commutes with nonlinear E × B advection. For the case when linear instability is present, a corollary is found that forbids nonlinear energy transfer between appropriately defined sets of stable and unstable modes. It is speculated that this may explain the preservation of linear eigenmodes in nonlinear gyrokinetic simulations. Based on this property, a dimensionally reduced (∞×∞→1) system is derived that may be useful for understanding dynamics around the critical gradient of Dimits.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

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↗

A numerical approach for detecting switch-like bistability in mass action chemical reaction networks with conservation laws

Theoretical analysis of signaling pathways can provide a substantial amount of insight into their function. One particular area of research considers signaling pathways capable of assuming two or more stable states given the same amount of signaling ligand. This phenomenon of bistability can give rise to switch-like behavior, a mechanism that governs cellular decision making. Investigation of whether or not a signaling pathway can confer bistability and switch-like behavior, without knowledge of specific kinetic rate constant values, is a mathematically challenging problem. Recently a technique based on optimization has been introduced, which is capable of finding example parameter values that confer switch-like behavior for a given pathway. Although this approach has made it possible to analyze moderately sized pathways, it is limited to reaction networks that presume a uniterminal structure. It is this limited structure we address by developing a general technique that applies to any mass action reaction network with conservation laws. In this paper we developed a generalized method for detecting switch-like bistable behavior in any mass action reaction network with conservation laws. The method involves (1) construction of a constrained optimization problem using the determinant of the Jacobian of the underlying rate equations, (2) minimization of the objective function to search for conditions resulting in a zero eigenvalue, (3) computation of a confidence level that describes if the global minimum has been found and (4) evaluation of optimization values, using either numerical continuation or directly simulating the ODE system, to verify that a bistability region exists. The generalized method has been tested on three motifs known to be capable of bistability. We have developed a variation of an optimization-based method for the discovery of bistability, which is not limited to uniterminal chemical reaction networks. Successful completion of the method provides an S-shaped bifurcation diagram, which indicates that the network acts as a bistable switch for the given optimization parameters.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Symmetry and stability in Taylor-Couette flow

The flow of a fluid between concentric rotating cylinders (the Taylor problem) is studied by exploiting the symmetries of the system. The Navier-Stokes equations, linearized about Couette flow, possess two zero and four purely imaginary eigenvalues at a suitable value of the speed of rotation of the outer cylinder. There is thus a reduced bifurcation equation on a six-dimensonal space which can be shown to commute with an action of the symmetry group 0(2) x S0(2). The group structure is used to analyze this bifurcation equation in the simplest (nondegenerate) case, and to compute the stabilities of solutions. In particular, when the outer cylinder is counterrotated, transitions which seem to agree with recent experiments of Andereck, Liu, and Swinney (1984) are obtained. It is also possible to obtain the 'main sequence' in this model. This sequence is normally observed in experiments when the outer cylinder is held fixed.

Golubitsky, M.↗

Viscous and inviscid instabilities of a trailing vortex

The linear stability of the trailing line vortex model of Batchelor (1964) is studied using a spectral collocation and matrix eigenvalue method. The entire unstable region in the swirl/axial wavenumber parameter space is mapped out for various azimuthal wavenumbers for both the inviscid and viscous stability problem. The results of the study provide a direct numerical validation of the large-azimuthal-wavenumber asymptotic analysis of Leibovich and Stewartson (1983). It is shown that accurate results are obtained up to azimuthal wavenumbers of 10,000 and greater, and the agreement with the asymptotic theory is excellent.

Mayer, Ernst W.↗

A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix

We present an iterative algorithm for computing an invariant subspace associated with the algebraically smallest eigenvalues of a large sparse or structured Hermitian matrix A. We are interested in the case in which the dimension of the invariant subspace is large (e.g., over several hundreds or thousands) even though it may still be small relative to the dimension of A. These problems arise from, for example, density functional theory (DFT) based electronic structure calculations for complex materials. The key feature of our algorithm is that it performs fewer Rayleigh–Ritz calculations compared to existing algorithms such as the locally optimal block preconditioned conjugate gradient or the Davidson algorithm. It is a block algorithm, and hence can take advantage of efficient BLAS3 operations and be implemented with multiple levels of concurrency. We discuss a number of practical issues that must be addressed in order to implement the algorithm efficiently on a high performance computer.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗