Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “EIGENVALUE”

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 37 records · Page 2

Time series analysis and Monte Carlo methods for eigenvalue separation in neutron multiplication problems

A time series approach has been applied to the nuclear fission source distribution generated by Monte Carlo (MC) particle transport in order to calculate the non-fundamental mode eigenvalues of the system. The novel aspect is the combination of the general technical principle of projection pursuit for multivariate data with the neutron multiplication eigenvalue problem in the nuclear engineering discipline. Proof is thoroughly provided that the stationary MC process is linear to first order approximation and that it transforms into one-dimensional autoregressive processes of order one (AR(1)) via the automated choice of projection vectors. The autocorrelation coefficient of the resulting AR(1) process corresponds to the ratio of the desired mode eigenvalue to the fundamental mode eigenvalue. All modern MC codes for nuclear criticality calculate the fundamental mode eigenvalue, so the desired mode eigenvalue can be easily determined. This time series approach was tested for a variety of problems including multi-dimensional ones. Numerical results show that the time series approach has strong potential for three dimensional whole reactor core. The eigenvalue ratio can be updated in an on-the-fly manner without storing the nuclear fission source distributions at all previous iteration cycles for the mean subtraction. Lastly, the effects of degenerate eigenvalues are investigated and solutions are provided.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Use of SCALE Continuous-Energy Monte Carlo Tools for Eigenvalue Sensitivity Coefficient Calculations

The TSUNAMI code within the SCALE code system makes use of eigenvalue sensitivity coefficients for an extensive number of criticality safety applications, such as quantifying the data-induced uncertainty in the eigenvalue of critical systems, assessing the neutronic similarity between different critical systems, and guiding nuclear data adjustment studies. The need to model geometrically complex systems with improved fidelity and the desire to extend TSUNAMI analysis to advanced applications has motivated the development of a methodology for calculating sensitivity coefficients in continuous-energy (CE) Monte Carlo applications. The CLUTCH and Iterated Fission Probability (IFP) eigenvalue sensitivity methods were recently implemented in the CE KENO framework to generate the capability for TSUNAMI-3D to perform eigenvalue sensitivity calculations in continuous-energy applications. This work explores the improvements in accuracy that can be gained in eigenvalue and eigenvalue sensitivity calculations through the use of the SCALE CE KENO and CE TSUNAMI continuous-energy Monte Carlo tools as compared to multigroup tools. The CE KENO and CE TSUNAMI tools were used to analyze two difficult models of critical benchmarks, and produced eigenvalue and eigenvalue sensitivity coefficient results that showed a marked improvement in accuracy. The CLUTCH sensitivity method in particular excelled in terms of efficiency and computational memory requirements.

97 MATHEMATICS AND COMPUTING↗

Extension of the PINN diffusion model to k-eigenvalue problems

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)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Preconditioning bandgap eigenvalue problems in three-dimensional photonic crystals simulations

To explore band structures of three-dimensional photonic crystals numerically, we need to solve the eigenvalue problems derived from the governing Maxwell equations. The solutions of these eigenvalue problems cannot be computed effectively unless a suitable combination of eigenvalue solver and preconditioner is chosen. Taking eigenvalue problems due to Yee's scheme as examples, we propose using Krylov-Schur method and Jacobi-Davidson method to solve the resulting eigenvalue problems. For preconditioning, we derive several novel preconditioning schemes based on various preconditioners, including a preconditioner that can be solved by Fast Fourier Transform efficiently. We then conduct intensive numerical experiments for various combinations of eigenvalue solvers and preconditioning schemes. We find that the Krylov-Schur method associated with the Fast Fourier Transform based preconditioner is very efficient. It remarkably outperforms all other eigenvalue solvers with common preconditioners like Jacobi, Symmetric Successive Over Relaxation, and incomplete factorizations. This promising solver can benefit applications like photonic crystal structure optimization.

36 MATERIALS SCIENCE↗

Calculating Alpha Eigenvalues and Eigenfunctions with a Markov Transition Rate Matrix Monte Carlo Method

For a nuclear system in which the entire α-eigenvalue spectrum is known, eigenfunction expansion yields the time-dependent flux response to any arbitrary source. Applications in which this response is of interest include pulsed-neutron experiments, accelerator-driven subcritical systems, and fast burst reactors, where a steady-state assumption used in neutron transport is invalid for characterizing the time-dependent flux. To obtain the α-eigenvalue spectrum, the transition rate matrix method (TRMM) tallies transition rates describing neutron behavior in a discretized position-direction-energy phase space using Monte Carlo. Interpretation of the resulting Markov process transition rate matrix as the operator in the adjoint α-eigenvalue problem provides an avenue for determining a large finite set of α eigenvalues and eigenfunctions of a nuclear system. Results from the TRMM are verified using analytic solutions, time-dependent Monte Carlo simulations, and modal expansion from diffusion theory. For simplified infinite-medium and one-dimensional geometries, the TRMM accurately calculates eigenvalues, eigenfunctions, and eigenfunction expansion solutions. Applications and comparisons to measurements are made for the small fast burst reactor CALIBAN and the Fort St. Vrain high-temperature gas-cooled reactor. For large three-dimensional geometries, discretization of the large position-energy-direction phase space limits the accuracy of eigenfunction expansion solutions using the TRMM, but it can still generate a fair estimate of the fundamental eigenvalue and eigenfunction. These results show that the TRMM generates an accurate estimate of a large number of α eigenvalues. This is not possible with existing Monte Carlo–based methods.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

nu-TRLan User Guide Version 1.0: A High-Performance Software Package for Large-Scale Harmitian Eigenvalue Problems

The original software package TRLan, [TRLan User Guide], page 24, implements the thick restart Lanczos method, [Wu and Simon 2001], page 24, for computing eigenvalues {lambda} and their corresponding eigenvectors v of a symmetric matrix A: Av = {lambda}v. Its effectiveness in computing the exterior eigenvalues of a large matrix has been demonstrated, [LBNL-42982], page 24. However, its performance strongly depends on the user-specified dimension of a projection subspace. If the dimension is too small, TRLan suffers from slow convergence. If it is too large, the computational and memory costs become expensive. Therefore, to balance the solution convergence and costs, users must select an appropriate subspace dimension for each eigenvalue problem at hand. To free users from this difficult task, nu-TRLan, [LNBL-1059E], page 23, adjusts the subspace dimension at every restart such that optimal performance in solving the eigenvalue problem is automatically obtained. This document provides a user guide to the nu-TRLan software package. The original TRLan software package was implemented in Fortran 90 to solve symmetric eigenvalue problems using static projection subspace dimensions. nu-TRLan was developed in C and extended to solve Hermitian eigenvalue problems. It can be invoked using either a static or an adaptive subspace dimension. In order to simplify its use for TRLan users, nu-TRLan has interfaces and features similar to those of TRLan: (1) Solver parameters are stored in a single data structure called trl-info, Chapter 4 [trl-info structure], page 7. (2) Most of the numerical computations are performed by BLAS, [BLAS], page 23, and LAPACK, [LAPACK], page 23, subroutines, which allow nu-TRLan to achieve optimized performance across a wide range of platforms. (3) To solve eigenvalue problems on distributed memory systems, the message passing interface (MPI), [MPI forum], page 23, is used. The rest of this document is organized as follows. In Chapter 2 [Installation], page 2, we provide an installation guide of the nu-TRLan software package. In Chapter 3 [Example], page 3, we present a simple nu-TRLan example program. In Chapter 4 [trl-info structure], page 7, and Chapter 5 [trlan subroutine], page 14, we describe the solver parameters and interfaces in detail. In Chapter 6 [Solver parameters], page 21, we discuss the selection of the user-specified parameters. In Chapter 7 [Contact information], page 22, we give the acknowledgements and contact information of the authors. In Chapter 8 [References], page 23, we list reference to related works.

97 MATHEMATICS AND COMPUTING↗

A numerical study of the temporal eigenvalue spectrum of the Blasius boundary layer

A numerical study is made of the temporal eigenvalue spectrum of the Orr-Sommerfeld equation for the Blasius boundary layer. Unlike channel flows, there is no mathematical proof that this flow has an infinite spectrum of discrete eigenvalues. The Orr-Sommerfeld equation is integrated numerically, and the eigenvalues located by tracing out the contour lines in the complex wave velocity plane on which the real and imaginary parts of the secular determinant are zero. The spectrum of plane Poiseuille flow is used as a guide to study the spectrum of an artificial two-wall flow which consists of two Blasius boundary layers. As the upper boundary of this flow moves to infinity, it is found that the portion of the spectrum with an infinite number of eigenvalues moves towards phase velocity equal to unity and the spacing between eigenvalues goes to zero. The original few eigenvalues found are the only discrete eigenvalues that exist for Blasius flow.

Mack, L. M.↗

On the solution of two-point linear differential eigenvalue problems

A numerical technique is presented for locating the eigenvalues of two point linear differential eigenvalue problems. The technique is designed to search for complex eigenvalues belonging to complex operators. With this method, any domain of the complex eigenvalue plane could be scanned and the eigenvalues within it, if any, located. For an application of the method, the eigenvalues of the Orr-Sommerfeld equation of the plane Poiseuille flow are determined within a specified portion of the c-plane. The eigenvalues for alpha = 1 and R = 10,000 are tabulated and compared for accuracy with existing solutions.

Antar, B. N.↗

Sensitivity of closed-loop eigenvalues and robustness

Analytical results are obtained in a present investigation of the way in which full state feedback controller and estimator eigenvalues in a closed-loop linear control system affect these eigenvalues' sensitivity with respect to uncertain plant parameters. A controller eigenvalue lying near an estimator eigenvalue yields large eigenvalue sensitivity, which should be reduced through the separation of controller eigenvalues from estimator eigenvalues.

Adamian, A.↗

Approximate analysis for repeated eigenvalue problems with applications to controls-structure integrated design

A method for eigenvalue and eigenvector approximate analysis for the case of repeated eigenvalues with distinct first derivatives is presented. The approximate analysis method developed involves a reparameterization of the multivariable structural eigenvalue problem in terms of a single positive-valued parameter. The resulting equations yield first-order approximations to changes in the eigenvalues and the eigenvectors associated with the repeated eigenvalue problem. This work also presents a numerical technique that facilitates the definition of an eigenvector derivative for the case of repeated eigenvalues with repeated eigenvalue derivatives (of all orders). Examples are given which demonstrate the application of such equations for sensitivity and approximate analysis. Emphasis is placed on the application of sensitivity analysis to large-scale structural and controls-structures optimization problems.

Kenny, Sean P.↗

A Shift Selection Strategy for Parallel Shift-invert Spectrum Slicing in Symmetric Self-consistent Eigenvalue Computation

The central importance of large-scale eigenvalue problems in scientific computation necessitates the development of massively parallel algorithms for their solution. Recent advances in dense numerical linear algebra have enabled the routine treatment of eigenvalue problems with dimensions on the order of hundreds of thousands on the world’s largest supercomputers. In cases where dense treatments are not feasible, Krylov subspace methods offer an attractive alternative due to the fact that they do not require storage of the problem matrices. However, demonstration of scalability of either of these classes of eigenvalue algorithms on computing architectures capable of expressing massive parallelism is non-trivial due to communication requirements and serial bottlenecks, respectively. In this work, we introduce the SISLICE method: a parallel shift-invert algorithm for the solution of the symmetric self-consistent field (SCF) eigenvalue problem. The SISLICE method drastically reduces the communication requirement of current parallel shift-invert eigenvalue algorithms through various shift selection and migration techniques based on density of states estimation and k-means clustering, respectively. This work demonstrates the robustness and parallel performance of the SISLICE method on a representative set of SCF eigenvalue problems and outlines research directions that will be explored in future work.

97 MATHEMATICS AND COMPUTING↗

Calculating Time Eigenvalues of the Neutron Transport Equation with Dynamic Mode Decomposition

A novel method to compute time eigenvalues of neutron transport problems is presented based on solutions to the time-dependent transport equation. Using these solutions, we use the dynamic mode decomposition to form an approximate transport operator. This approximate operator has eigenvalues that are mathematically related to the time eigenvalues of the neutron transport equation. This approach works for systems of any level of criticality and does not require the user to have estimates for the eigenvalues. Numerical results are presented for homogeneous and heterogeneous media. The numerical results indicate that the method finds the eigenvalues that contribute the most to the change in the solution over a given time range, and the eigenvalue with the largest real part is not necessarily important to the system evolution at short and intermediate times.

42 ENGINEERING↗

SCALE Continuous-Energy Eigenvalue Sensitivity Coefficient Calculations

Sensitivity coefficients describe the fractional change in a system response that is induced by changes to system parameters and nuclear data. The Tools for Sensitivity and UNcertainty Analysis Methodology Implementation (TSUNAMI) code within the SCALE code system makes use of eigenvalue sensitivity coefficients for an extensive number of criticality safety applications, including quantifying the data-induced uncertainty in the eigenvalue of critical systems, assessing the neutronic similarity between different critical systems, and guiding nuclear data adjustment studies. The need to model geometrically complex systems with improved fidelity and the desire to extend TSUNAMI analysis to advanced applications has motivated the development of a methodology for calculating sensitivity coefficients in continuous-energy (CE) Monte Carlo applications. The Contributon-Linked eigenvalue sensitivity/Uncertainty estimation via Tracklength importance CHaracterization (CLUTCH) and Iterated Fission Probability (IFP) eigenvalue sensitivity methods were recently implemented in the CE-KENO framework of the SCALE code system to enable TSUNAMI-3D to perform eigenvalue sensitivity calculations using continuous-energy Monte Carlo methods. This work provides a detailed description of the theory behind the CLUTCH method and describes in detail its implementation. This work explores the improvements in eigenvalue sensitivity coefficient accuracy that can be gained through the use of continuous-energy sensitivity methods and also compares several sensitivity methods in terms of computational efficiency and memory requirements.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Monte Carlo Estimates of Eigenvalue Sensitivity to System Dimensions using Kernel Density Estimators

In the last decade there has been an increasing interest in calculating sensitivity coefficients in order to quantify the impact of uncertainty in material properties and system parameters on quantities of interest. Extensive work has been done developing Monte Carlo methods to estimate eigenvalue sensitivity to material properties. While deterministic methods exist for determining the eigenvalue sensitivity to system dimensions, the use of Monte Carlo methods to efficiently calculate eigenvalue sensitivity coefficients to system dimensions is still an open topic. Current Monte Carlo methods for calculating eigenvalue sensitivity coefficients to system dimensions are inefficient. Direct Monte Carlo perturbations require two additional simulations of high statistical precision in order to determine the eigenvalue sensitivity to the location of a single boundary. If the sensitivity to the location of multiple surfaces are desired, two additional simulations must be run for each surface. Kiedrowski and Favorite extended continuous energy Monte Carlo methods for sensitivities of nuclear cross sections to calculate sensitivities to interface boundaries or system dimensions to create the only current alternative to direct Monte Carlo calculations. However this method relies on the simulation of additional random walks launched at each surface crossing event. The present method extends upon Kiedrowski's work and eliminates the inefficient portions of the calculation through the use of Kernel Density Estimators (KDEs). The new method efficiently estimates eigenvalue sensitivities to the uniform expansion or contraction of material interface boundaries or system dimensions, negligibly impacting the runtime performance of the Monte Carlo code. The new estimator is tested on bare and reflected critical configurations in spherical geometry and is compared to estimates obtained from direct Monte Carlo perturbations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Formulation of the density eigenvalue problem in neutron transport for relevant engineering applications

A new formulation of the density eigenvalue problem for the neutron transport equation is presented. This new eigenvalue, named ζ eigenvalue can be introduced freely in the transport model, acting on a selected portion of the phase space. Despite its broader applications and its connection with the nature of the transport operator, the ζ eigenvalue has been presented here mainly as a design-oriented technique for the efficient evaluation of the critical concentration for a specific nuclide (or mixture of nuclides). This new eigenvalue is particularly adequate to study the definition of the material composition in the criticality design process of a multiplying system. The method is then applied for the study of classical problems such as the critical moderation ratio and the poison concentration to control the reactor. Some results are presented in one dimensional configuration using the multi- group spherical harmonics approach. This eigenvalue formulation proves to be a convenient and useful way to attain criticality, also for complex, realistic systems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

State space parameterization of explosive eigenvalues during autoignition

Explosive modes such as ignition and extinction are characterized by an eigenvalue of the chemical Jacobian matrix with positive real part, representing the transient instability of chain-branching chemistry and thermal feedback. Formation and eigen-decomposition of the Jacobian matrix are expensive operations whose cost increases cubically with chemical mechanism size. As an alternative to directly computing the eigenvalues of the Jacobian, we explore principal component analysis (PCA) along with nonlinear regression as a methodology to parameterize the eigenvalues by state variables (or linear combinations thereof). We evaluate this modeling strategy using homogeneous autoignition data on two different applications: pseudotransient continuation (Ψtc)-based ODE solvers and chemical explosive mode analysis (CEMA). Results indicate that the PCA-based parameterization of the eigenvalues appears feasible for Ψtc solvers in autoignition calculations over a range of temperatures and pressures. Our results also show that eigenvalue models are capable of tracking sharp discontinuities (such as ignition or extinction) in the eigenvalue for computational flame diagnostics such as CEMA.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Solving generalized eigenvalue problems by ordinary differential equations on a quantum computer

Many eigenvalue problems arising in practice are often of the generalized form A x = λ B x . One particularly important case is symmetric, namely A , B are Hermitian and B is positive definite. The standard algorithm for solving this class of eigenvalue problems is to reduce them to Hermitian eigenvalue problems. For a quantum computer, quantum phase estimation is a useful technique to solve Hermitian eigenvalue problems. In this work, we propose a new quantum algorithm for symmetric generalized eigenvalue problems using ordinary differential equations. The algorithm has lower complexity than the standard one based on quantum phase estimation. Moreover, it works for a wider case than symmetric: B is invertible, B - 1 A is diagonalizable and all the eigenvalues are real.

Science & Technology - Other Topics↗

A Shift Selection Strategy for Parallel Shift-Invert Spectrum Slicing in Symmetric Self-Consistent Eigenvalue Computation

The central importance of large scale eigenvalue problems in scientific computation necessitates the development massively parallel algorithms for their solution. Recent advances in dense numerical linear algebra have enabled the routine treatment of eigenvalue problems with dimensions on the order of hundreds of thousands on the world's largest supercomputers. In cases where dense treatments are not feasible, Krylov subspace methods offer an attractive alternative due to the fact that they do not require storage of the problem matrices. However, demonstration of scalability of either of these classes of eigenvalue algorithms on computing architectures capable of expressing excessive parallelism is non-trivial due to communication requirements and serial bottlenecks, respectively. In this work, we introduce the SISLICE method: a parallel shift-invert algorithm for the solution of the symmetric self-consistent field (SCF) eigenvalue problem. The SISLICE method drastically reduces the communication requirement of current parallel shift-invert eigenvalue algorithms through various shift selection and migration techniques based on density of states estimation and k-means clustering, respectively. This work demonstrates the robustness and parallel performance of the SISLICE method on a representative set of SCF eigenvalue problems and outlines research directions which will be explored in future work.

97 MATHEMATICS AND COMPUTING↗