Search NASA⌕ Search

SEARCH · Search NASA

Results for “Eigenvalues”

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 181 records · Page 10

A Multilevel in Space and Energy Solver for 3-D Multigroup Diffusion and Coarse-Mesh Finite Difference Eigenvalue Problems

The Multilevel in Space and Energy Diffusion (MSED) method accelerates the iterative convergence of multigroup diffusion eigenvalue problems by performing work on lower-order equations with only one group and/or coarser spatial grids. It consists of two primary components: (1) a grey (one-group) diffusion eigenvalue problem that is solved via Wielandt-shifted power iteration (PI) and (2) a multigrid-in-space linear solver. In previous work, the efficiency of MSED was verified using Fourier analysis and numerical results from a one-dimensional multigroup diffusion code. Since that work, MSED has been implemented as a solver for the coarse-mesh finite difference (CMFD) system in the three-dimensional Michigan Parallel Characteristics Transport (MPACT) code. In this paper, the results from the implementation of MSED in MPACT are introduced, and the changes needed to make MSED more suitable for MPACT are described. For problems without feedback, the conclusions in this paper show that MSED can reduce the CMFD run time by an order of magnitude and the overall run time by a factor of 2 to 3 compared to the default CMFD solver in MPACT [PI with the generalized minimal residual (GMRES) method]. For problems with feedback, the convergence of the outer Picard iteration scheme is worsened by the well-converged CMFD solutions produced by the standard MSED method. To overcome this unintuitive deficiency, MSED may be run with looser convergence criteria (a modified version of the MSED method called MSED-L) to circumvent the issue until the multiphysics iteration in MPACT is improved. Results show that MSED-L can reduce the CMFD run time in MPACT by an order of magnitude, without negatively impacting the outer Picard iteration scheme.

3-D↗

A Second Moment Method for k -Eigenvalue Acceleration with Continuous Diffusion and Discontinuous Transport Discretizations

The second moment method is a linear acceleration technique that couples the transport equation to a diffusion equation with transport-dependent additive closures. The resulting low-order diffusion equation can be discretized independent of the transport discretization, unlike diffusion synthetic acceleration, and is symmetric positive definite, unlike quasidiffusion. While this method has been shown to be comparable to quasidiffusion in iterative performance for fixed source and time-dependent problems, it is largely unexplored as an eigenvalue problem acceleration scheme due to the belief that the resulting inhomogeneous source makes the problem ill posed. Recently, a preliminary feasibility study was performed on the second moment method for eigenvalue problems. The results suggested comparable performance to quasidiffusion and more robust performance than diffusion synthetic acceleration. This work extends the initial study to more realistic reactor problems using state-of-the-art discretization techniques. Finally, the results in this paper show that the second moment method is more computationally efficient than its alternatives on complex reactor problems with unstructured meshes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Measurement-based quantum phase estimation algorithm for finding eigenvalues of non-unitary matrices

We propose a quantum algorithm for finding eigenvalues of non-unitary matrices. We show how to construct, through interactions in a quantum system and projective measurements, a non-Hermitian or non-unitary matrix and obtain its eigenvalues and eigenvectors. This proposal combines ideas of frequent measurement, measured quantum Fourier transform, and quantum state tomography. It provides a generalization of the conventional phase estimation algorithm, which is limited to Hermitian or unitary matrices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Lowest eigenvalue of the nuclear shell model Hamiltonian

In this paper, we investigate regular patterns of matrix elements of the nuclear shell model Hamiltonian H, by sorting the diagonal matrix elements from the smaller to the larger values. By using simple plots of nonzero matrix elements and lowest eigenvalues of artificially constructed submatrices h of H, we propose a new and simple formula, which predicts the lowest eigenvalue with remarkable precision.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Boundary condition for a D-brane from the Wilson loop, and gravitational interpretation of an eigenvalue in the matrix model in AdS/CFT correspondence

We study the supersymmetric Wilson loops in the four-dimensional N=4 super Yang-Mills theory in the context of AdS/CFT correspondence. In the gauge theory side, it is known that the expectation value of the Wilson loops of circular shape with winding number k, W{sub k}(C), is calculable by using a Gaussian matrix model. In the gravity side, the expectation value of the loop is conjectured to be given by the classical value of the action S{sub D3} for a probe D3-brane with k electric fluxes as <W{sub k}(C)>=e{sup -S{sub D3}}. Given such correspondence, we pursue the interpretation of the matrix model eigenvalue density, or more precisely the resolvent, from the viewpoint of the probe D3-brane. We see that the position of an eigenvalue appears as the gauge field plus the scalar field integrated over the boundary of the probe D3-brane. In the course of our analysis, we also clarify the boundary condition on the D3-brane in terms of the Wilson loop.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Large Deviations of the Maximum Eigenvalue for Wishart and Gaussian Random Matrices

We present a Coulomb gas method to calculate analytically the probability of rare events where the maximum eigenvalue of a random matrix is much larger than its typical value. The large deviation function that characterizes this probability is computed explicitly for Wishart and Gaussian ensembles. The method is general and applies to other related problems, e.g., the joint large deviation function for large fluctuations of top eigenvalues. Our results are relevant to widely employed data compression techniques, namely, the principal components analysis. Analytical predictions are verified by extensive numerical simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems

Polynomial filtering can provide a highly effective means of computing all eigenvalues of a real symmetric (or complex Hermitian) matrix that are located in a given interval, anywhere in the spectrum. This paper describes a technique for tackling this problem by combining a thick-restart version of the Lanczos algorithm with deflation ("locking'') and a new type of polynomial filter obtained from a least-squares technique. Furthermore, the resulting algorithm can be utilized in a “spectrum-slicing” approach whereby a very large number of eigenvalues and associated eigenvectors of the matrix are computed by extracting eigenpairs located in different subintervals independently from one another.

97 MATHEMATICS AND COMPUTING↗

Acceleration of k-Eigenvalue / Criticality Calculations using the Jacobian-Free Newton-Krylov Method

We present a new approach for the $k$--eigenvalue problem using a combination of classical power iteration and the Jacobian--free Newton--Krylov method (JFNK). The method poses the $k$--eigenvalue problem as a fully coupled nonlinear system, which is solved by JFNK with an effective block preconditioning consisting of the power iteration and algebraic multigrid. We demonstrate effectiveness and algorithmic scalability of the method on a 1-D, one group problem and two 2-D two group problems and provide comparison to other efforts using silmilar algorithmic approaches.

97 MATHEMATICS AND COMPUTING↗

Design, analysis and numerical experiments for the virtual element p and hp approximations of elliptic eigenvalue problems

We discuss the p- and the hp-versions of the virtual element method for the approximation of the eigenvalues of elliptic operators with a potential term on polygonal meshes. An application of this model is provided by the Schr¨odinger equation with a pseudo-potential term. We present in details the analysis of the p-version of the method, proving the exponential convergence in the case of analytic eigenfunctions. The theoretical results are supplied with a wide set of experiments. We also show numerically that, in the case of eigenfunctions with finite Sobolev regularity, an exponential approximation of the eigenvalues in terms of the cubic root of the number of degrees of freedom can be obtained by employing hp-refinements. Importantly, the geometric flexibility of polygonal meshes is exploited in the construction of the hp-spaces.

97 MATHEMATICS AND COMPUTING↗

Convergence Analysis of a Locally Accelerated Preconditioned Steepest Descent Method for Hermitian-Definite Generalized Eigenvalue Problems

By extending the classical analysis techniques due to Samokish, Faddeev and Faddeeva, and Longsine and McCormick among others, we prove the convergence of preconditioned steepest descent with implicit deflation (PSD-id) method for solving Hermitian-definite generalized eigenvalue problems. Moreover, we derive a nonasymptotic estimate of the rate of convergence of the PSD-id method. We show that with a proper choice of the shift, the indefinite shift-and-invert preconditioner is a locally accelerated preconditioner, and is asymptotically optimal that leads to superlinear convergence. Numerical examples are presented to verify the theoretical results on the convergence behavior of the PSDid method for solving ill-conditioned Hermitian-definite generalized eigenvalue problems arising from electronic structure calculations. While rigorous and full-scale convergence proofs of preconditioned block steepest descent methods in practical use still largely eludes us, we postulate that the theoretical results introduced in this paper sheds light on an improved understanding of the convergence behavior of these block methods.

97 MATHEMATICS AND COMPUTING↗

Uncertainty Analyses for Localized Tallies in Monte Carlo Eigenvalue Calculations

It is well known that statistical estimates obtained from Monte Carlo criticality simulations can be adversely affected by cycle-to-cycle correlations in the fission source. In addition, there are several other more fundamental issues that may lead to errors in Monte Carlo results. These factors can have a significant impact on the calculated eigenvalue, localized tally means and their associated standard deviations. In fact, modern Monte Carlo computational tools may generate standard deviation estimates that are a factor of five or more lower than the true standard deviation for a particular tally due to the inter-cycle correlations in the fission source. The magnitude of this under-prediction can climb as high as one hundred when combined with an ill-converged fission source or poor sampling techniques. Since Monte Carlo methods are widely used in reactor analysis (as a benchmarking tool) and criticality safety applications, an in-depth understanding of the effects of these issues must be developed in order to support the practical use of Monte Carlo software packages. A rigorous statistical analysis of localized tally results in eigenvalue calculations is presented using the SCALE/KENO-VI and MCNP Monte Carlo codes. The purpose of this analysis is to investigate the under-prediction in the uncertainty and its sensitivity to problem characteristics and calculational parameters, and to provide a comparative study between the two codes with respect to this under-prediction. It is shown herein that adequate source convergence along with proper specification of Monte Carlo parameters can reduce the magnitude of under-prediction in the uncertainty to reasonable levels; below a factor of 2 when inter-cycle correlations in the fission source are not a significant factor. In addition, through the use of a modified sampling procedure, the effects of inter-cycle correlations on both the mean value and standard deviation estimates can be isolated.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Development of continuous-energy eigenvalue sensitivity coefficient calculation methods in the shift Monte Carlo Code

Three methods for calculating continuous-energy eigenvalue sensitivity coefficients were developed and implemented into the Shift Monte Carlo code within the SCALE code package. The methods were used for two small-scale test problems and were evaluated in terms of speed, accuracy, efficiency, and memory requirements. A promising new method for calculating eigenvalue sensitivity coefficients, known as the CLUTCH method, was developed and produced accurate sensitivity coefficients with figures of merit that were several orders of magnitude larger than those from existing methods. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Eigenvalue sensitivity studies for the Fort St. Vrain high temperature gas-cooled reactor to account for fabrication and modeling uncertainties

Uncertainties in the composition and fabrication of fuel compacts for the Fort St. Vrain (FSV) high temperature gas reactor have been studied by performing eigenvalue sensitivity studies that represent the key uncertainties for the FSV neutronic analysis. The uncertainties for the TRISO fuel kernels were addressed by developing a suite of models for an 'average' FSV fuel compact that models the fuel as (1) a mixture of two different TRISO fuel particles representing fissile and fertile kernels, (2) a mixture of four different TRISO fuel particles representing small and large fissile kernels and small and large fertile kernels and (3) a stochastic mixture of the four types of fuel particles where every kernel has its diameter sampled from a continuous probability density function. All of the discrete diameter and continuous diameter fuel models were constrained to have the same fuel loadings and packing fractions. For the non-stochastic discrete diameter cases, the MCNP compact model arranged the TRISO fuel particles on a hexagonal honeycomb lattice. This lattice-based fuel compact was compared to a stochastic compact where the locations (and kernel diameters for the continuous diameter cases) of the fuel particles were randomly sampled. Partial core configurations were modeled by stacking compacts into fuel columns containing graphite. The differences in eigenvalues between the lattice-based and stochastic models were small but the runtime of the lattice-based fuel model was roughly 20 times shorter than with the stochastic-based fuel model. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Movable geometry and eigenvalue search capability in the MC21 Monte Carlo code

A description of a robust and flexible movable geometry implementation in the Monte Carlo code MC21 is described along with a search algorithm that can be used in conjunction with the movable geometry capability to perform eigenvalue searches based on the position of some geometric component. The natural use of the combined movement and search capability is searching to critical through variation of control rod (or control drum) position. The movable geometry discussion provides the mathematical framework for moving surfaces in the MC21 combinatorial solid geometry description. A discussion of the interface between the movable geometry system and the user is also described, particularly the ability to create a hierarchy of movable groups. Combined with the hierarchical geometry description in MC21 the movable group framework provides a very powerful system for inline geometry modification. The eigenvalue search algorithm implemented in MC21 is also described. The foundations of this algorithm are a regula falsi search though several considerations are made in an effort to increase the efficiency of the algorithm for use with Monte Carlo. Specifically, criteria are developed to determine after each batch whether the Monte Carlo calculation should be continued, the search iteration can be rejected, or the search iteration has converged. These criteria seek to minimize the amount of time spent per iteration. Results for the regula falsi method are shown, illustrating that the method as implemented is indeed convergent and that the optimizations made ultimately reduce the total computational expense. (authors)

97 MATHEMATICS AND COMPUTING↗

Extending the subspace hybrid method for eigenvalue problems in reactor physics calculation

This paper presents an innovative hybrid Monte-Carlo-Deterministic method denoted by the SUBSPACE method designed for improving the efficiency of hybrid methods for reactor analysis applications. The SUBSPACE method achieves its high computational efficiency by taking advantage of the existing correlations between desired responses. Recently, significant gains in computational efficiency have been demonstrated using this method for source driven problems. Within this work the mathematical theory behind the SUBSPACE method is introduced and extended to address core wide level k-eigenvalue problems. The method's efficiency is demonstrated based on a three-dimensional quarter-core problem, where responses are sought on the pin cell level. The SUBSPACE method is compared to the FW-CADIS method and is found to be more efficient for the utilized test problem because of the reason that the FW-CADIS method solves a forward eigenvalue problem and an adjoint fixed-source problem while the SUBSPACE method only solves an adjoint fixed-source problem. Based on the favorable results obtained here, we are confident that the applicability of Monte Carlo for large scale reactor analysis could be realized in the near future. (authors)

97 MATHEMATICS AND COMPUTING↗

Calculating infinite-medium {alpha}-eigenvalue spectra with a transition rate matrix method

The time-dependent behavior of the energy spectrum in neutron transport was investigated with a formulation, based on continuous-time Markov processes, for computing {alpha}-eigenvalues and eigenvectors in an infinite medium. For this, a research Monte Carlo code called TORTE was created and used to estimate elements of a transition rate matrix. TORTE is capable of using both multigroup and continuous-energy nuclear data, and verification was performed. Eigenvalue spectra for infinite homogeneous mixtures were obtained and an eigenfunction expansion was used to investigate transient behavior of the neutron energy spectrum. (authors)

97 MATHEMATICS AND COMPUTING↗

Predicting Correlation Coefficients for Monte Carlo Eigenvalue Simulations

Monte Carlo methods are most often considered as a reference for neutron transport simulations since very limited approximations are made about nuclear data and system geometry. To report uncertainty of any tally evaluated as generation averages, the sample variance is divided by the number of active generations, which is based on the assumption that the neutron generations are independent. Correlation effects between neutrons in multiplying systems, particularly when performing power iteration to evaluate eigenvalues have been observed in previous work. Neglecting the correlation effect results in an underestimate of uncertainty reported by Monte Carlo calculations. Previous work has also proposed methods to predict the underestimation ratio. Yamamoto et al expanded the fission source distribution with diffusion equation modes, performed numerical simulation of the AR (autoregressive) process of the expansion coefficients and used the correlation of the AR process to predict that of the Monte Carlo eigenvalue simulation. Sutton applied the discretized phase space (DPS) approach to predict the underestimation ratio but the method cannot predict the ratio when one neutron generates offspring in different phase space regions or generates a random number of offspring. This paper presents a method to predict the correlation effect with the model of multi-type branching processes (MBP). The method requires simulations for one generation of neutrons without knowing the source distribution and can predict the underestimation ratio for the cases where the traditional DPS approach does not work. The generation-to-generation correlation determines the convergence rate of active generations, the bias of variance estimator for each generation and the underestimation ratio of variance estimator for tallies averaged over active generations. The generation-to-generation correlation is characterized by the Auto-Correlation Coefficients (ACC) between tallies from different generations. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Variance Estimation in Monte Carlo Eigenvalue Simulations Using Spectral Analysis Method

The Monte Carlo (MC) method is the 'gold standard' for performing nuclear reactor calculations and criticality safety analyses because of its ability to handle complex geometries and physics. Reactor and criticality safety analyses require solving eigenvalue problems in complex nuclear systems. Once a stationary fission source distribution is obtained in MC simulations, the sample mean of many stationary cycles is calculated. The MC simulation sample mean is typically referred to as a tally. Variance, or standard deviation, of the sample mean/tally is needed to indicate the level of statistical uncertainty in the simulation and to understand the convergence of the sample mean. Current MC codes typically use sample variance to estimate the statistical uncertainty of the simulation and assume that the MC stationary cycles are independent. However, it is known that cycles are correlated, and estimators of the variance that ignore these correlations systematically underestimate the variance. In this paper, we propose a novel method in the Fourier frequency domain to estimate the variance of the sample mean in MC eigenvalue calculations. Results indicate that the proposed estimator can be unbiased compared to the real variance. The proposed estimator requires minimal additional computing effort.

42 ENGINEERING↗