Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “eigenvalue analysis”

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 55 records · Page 3

Instability Issue of Paralleled Dies in an SiC Power Module in Solid-State Circuit Breaker Applications

Paralleled dies in a power module could have instability issues during high current switching transients. Here, the instability is caused by the differential-mode oscillation among paralleled MOSFETs. Conventional analyses of paralleled MOSFETs’ stability are normally limited to a single operating point, which ignores the influences of the switching trajectory and nonlinear device parameters on stability. This article reveals that the switching trajectory can significantly influence parallel stability. The analysis is improved by solving eigenvalues of state-space modeling system matrices of all operating points that the switching trajectory goes through considering nonlinear device parameters. Higher voltage and current stresses result in greater real parts of complex eigenvalues, which explains why the paralleled MOSFETs are more unstable with higher voltage and current stresses. To improve stability in solid-state circuit breaker applications, we propose a method to manipulate the switching trajectory to avoid the unstable region where the conventional hard switching trajectory normally goes through. Experimental results show that the turn- off current capability can be increased from ~five times of rated current with the gate oscillation using the conventional turn- off trajectory to ~ten times of rated current without the gate oscillation using the optimal turn- off trajectory.

42 ENGINEERING↗

Validation of MPACT BWR capabilities against critical experiments

Over the years, significant validation work for the neutronics code MPACT has been performed against zero-power critical benchmarks and measured data from operating nuclear power plants. As a part of the Modeling and Analysis of Exelon BWRs for Eigenvalue and Thermal Limits Predictability project, new validation efforts relevant to boiling water reactor (BWR) core applications have been performed. This paper presents the results of the critical experiment portion of the BWR validation efforts for MPACT. The Kritz-4 experiments and IPEN/MB-01 BWR-relevant configurations are modeled with MPACT. The Kritz-4 BWR critical experiments were performed at both cold and hot conditions, which is a unique feature among other critical experiment facilities. The MPACT results with linear source (LS) Method of Characteristics (MOC) have very good agreement with the measured criticality. When using the 60-group BWR library with LS and P2 scattering, the maximum k{sub eff} error is 109 pcm, and the average cold-hot bias is only -0.11 pcm/K. The fission rate distributions of MPACT are also verified with Serpent calculations. For the IPEN facility, two configurations are considered: one with a large central void, and one with a cruciform control rod. The MPACT k{sub eff} errors are less than 50 pcm for all IPEN problems. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

BWR Progression Problems

Under the Consortium for the Advanced Simulation of Light Water Reactors (CASL) Program, the Virtual Environment for Reactor Applications (VERA) was developed with the primary focus to model pressurized water reactors (PWRs). Recently, a new project was started to extend the modeling capability in VERA to model boiling water reactors (BWRs). The new project is called “Modeling and Analysis of Exelon BWRs for Eigenvalue and Thermal Limits Predictability,” and it is led by Oak Ridge National Laboratory (ORNL) and Exelon with participation from Global Nuclear Fuel and three universities: North Carolina State University (NCSU), the University of Michigan, and the University of Illinois.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Automated Direct Perturbation Calculations with SCALE TSUNAMI [Abstract]

In nuclear criticality safety analysis, the sensitivity of the eigenvalue keff to uncertainties in nuclear data and its evaluation are crucial. The TSUNAMI sequences within the SCALE code system offer users various options with both multigroup (MG) and continuous-energy (CE) 3D Monte Carlo (MC) transport capabilities for calculating keff sensitivity coefficients and storing them in a sensitivity data file (SDF). Each methodology available in TSUNAMI offers distinct advantages and limitations, and its effectiveness can vary based on the specific problem being solved. As a best practice, practitioners typically use the direct perturbation (DP) method as a confirmatory step alongside their sensitivity calculations to verify the accuracy of the sensitivity data generated. In this process, DP calculations are usually performed on select nuclides, those considered most important for validating their total sensitivities. However, because of code limitations, analysts use a workaround method when conducting DP calculations for a single nuclide: rather than perturbing the nuclide's microscopic cross section, an equivalent number density for this nuclide is calculated to reflect the effect of a change in the macroscopic cross section due to a perturbation in the microscopic cross section. The current approach requires rerunning the CSAS criticality calculation several times with model changes. Although this method can yield results with acceptable accuracy, it is labor-intensive and prone to errors.

AZURE: SAMMY↗

Computational Aspects of Single-Molecule Kinetics for Coupled Catalytic Cycles: A Spectral Analysis

Catalysis from single active sites is analyzed using methods developed from single molecule kinetics. Using a stochastic Markov state description, the observable properties of general catalytic networks of reactions are expressed using an eigenvalue decomposition of the transition matrix for the Markov process. By the use of a sensitivity analysis, the necessary eigenvalues and eigenvectors are related to the energies of controlling barriers and wells located along the reaction routes. A generalization of the energetic span theory allows the eigenvalues to be computed from several activation energies corresponding to distinct barrier-well pairings. The formalism is demonstrated accurately for model problems for a physically realistic mechanism for an alkene hydrogenation reaction on a single atom catalyst.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A greedy algorithm for computing eigenvalues of a symmetric matrix with localized eigenvectors

Here, we present a greedy algorithm for computing selected eigenpairs of a large sparse matrix $H$ that can exploit localization features of the eigenvector. When the eigenvector to be computed is localized, meaning only a small number of its components have large magnitudes, the proposed algorithm identifies the location of these components in a greedy manner, and obtains approximations to the desired eigenpairs of $H$ by computing eigenpairs of a submatrix extracted from the corresponding rows and columns of $H$. Even when the eigenvector is not completely localized, the approximate eigenvectors obtained by the greedy algorithm can be used as good starting guesses to accelerate the convergence of an iterative eigensolver applied to $H$. We discuss a few possibilities for selecting important rows and columns of $H$ and techniques for constructing good initial guesses for an iterative eigensolver using the approximate eigenvectors returned from the greedy algorithm. We demonstrate the effectiveness of this approach with examples from nuclear quantum many-body calculations and many-body localization studies of quantum spin chains.

97 MATHEMATICS AND COMPUTING↗

Code Coverage Status of the ARC Code PERSENT

The Argonne Reactor Code (ARC) software system supports users in their fast reactor design goals by providing neutronic, thermal-hydraulic, and structural analysis capabilities. PERSENT fulfills the role of generating reactivity coefficients for a given time point of a REBUS calculation usable in a point kinetics based safety analysis capability. PERSENT also provides a sensitivity coefficient capability on eigenvalue, reactivity worth, and several other key coefficients that are used in the follow-on safety analysis. Given a co-variance matrix, PERSENT can carry out the uncertainty quantification to indicate the amount of error in the reactivity coefficients derived from the errors in the cross section measurements. With continued improvement of computational resources, many of the geometry modeling capabilities in DIF3D that were primarily used in low order schemes are not really needed anymore. Today, the diffusion and transport capabilities of DIF3D-VARIANT are primarily used in the reactor design process with some scattered usage of DIF3D-FD and DIF3D-Nodal. PERSENT is part of the ARC code system and is built around DIF3D-VARIANT and the flux solution it provides. The purpose of the present work is to identify a set of test problems for PERSENT and assess the code coverage of PERSENT for those test problems. PERSENT treats the DIF3D executable as an external executable and thus the code coverage considerations only need to focus on the PERSENT source code and only a fraction of the connected modules in the existing ARC software library. The goal is to document what parts of the existing PERSENT code are touched by the set of test problems and which are not. Because the verification work done on PERSENT was focused on the most common uses of PERSENT for fast reactor analysis, the code coverage assessment of those capabilities is the highest priority. This will ensure that nothing is being missed by the existing verification test problems that users of PERSENT rely upon. The code coverage analysis of PERSENT was performed with the Code Coverage Tool of the Intel Fortran compiler which requires modifications to the compilation of PERSENT. The detailed coverage tables are given for each submodule of PERSENT. Most of the uncovered parts/files could be easily ignored because they are either for error message and debugging output or not needed by PERSENT today. Only a few uncovered parts of PERSENT deserve extending the verification test suite.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Multilevel-in-Space-and-Energy CMFD in VERA

For full-core modeling in the Virtual Environment for Reactor Analysis (VERA), the three-dimensional multigroup eigenvalue neutron transport problem is solved by MPACT. To improve the efficiency of MPACT, advancements have been made in the transport accelerator. Multilevel-in-energy and multilevel-in-space coarse mesh finite difference (CMFD) solvers were developed to improve the efficiency of the CMFD accelerator. In this paper a new multilevel-in-space-and-energy CMFD solver is developed with coarsening in both space and energy on every level. Several different strategies are investigated for coarsening groups in energy. Modified V-cycle and multiple-cycle algorithms are evaluated for solving the multilevel equations. The performance of these solvers is compared for typical full-core reactor physics problems.

42 ENGINEERING↗

Recent Updates in ETOE-2 and MC 2 -3

The MC 2 -3 code is a multigroup cross section generation code for fast reactor applications, developed by Argonne National Laboratory (ANL) under the DOE Nuclear Energy Advanced Modeling and Simulation (NEAMS) program. In this work, first, the cross section libraries for ENDF/B-VII.1 and ENDF/B-VIII.0 data were generated using the updated ETOE-2 code. Preliminary verification and validation tests of the ENDF/B-VII.1 MC 2 -3 library were performed with the selected fast reactor benchmark problems. Processing and verifying the libraries suggested that significant efforts would be required for thoroughly verifying the ENDF/B-VII.1 MC 2 -3 library and successfully processing the ENDF/B-VIII.0 MC 2 -3 library. Secondly, the cross section generation capability of MC 2 -3 was updated with the intermediate group lattice calculation and the equivalent Dancoff-factor cell (EDC) method to significantly improve the performance of a twodimensional assembly calculation using the method of characteristics (MOC). This effort was made useful in implementing and verifying the EDC method in the Griffin cross section API. Finally, we analyzed a SFR problem, for which unusually large deviations in core eigenvalues from Monte Carlo solutions were reported, by generating multigroup cross sections with MC 2 -3, performing core calculations with DIF3D-VARIANT, and analyzing cross section and eigenvalue results against Monte Carlo solutions. The analysis confirmed that the MC 2 -3/DIF3D solutions were in good agreement with Monte Carlo solutions, providing the correct process of accurately generating broad-group cross sections with MC 2 -3

97 MATHEMATICS AND COMPUTING↗

Improved Accuracy for Trotter Simulations Using Chebyshev Interpolation

Quantum metrology allows for measuring properties of a quantum system at the optimal Heisenberg limit. However, when the relevant quantum states are prepared using digital Hamiltonian simulation, the accrued algorithmic errors will cause deviations from this fundamental limit. In this work, we show how algorithmic errors due to Trotterized time evolution can be mitigated through the use of standard polynomial interpolation techniques. Our approach is to extrapolate to zero Trotter step size, akin to zero-noise extrapolation techniques for mitigating hardware errors. We perform a rigorous error analysis of the interpolation approach for estimating eigenvalues and time-evolved expectation values, and show that the Heisenberg limit is achieved up to polylogarithmic factors in the error. Our work suggests that accuracies approaching those of state-of-the-art simulation algorithms may be achieved using Trotter and classical resources alone for a number of relevant algorithmic tasks.

Rendon, Gumaro↗

Mechanism Analysis of Wind Turbine Var Oscillations

Electromagnetic transient simulation of parallel connected 4-MW type-3 wind turbines based on original equipment manufacturer's real-code turbine model shows 1.2-Hz turbine-turbine oscillations in reactive power. This letter reveals why such oscillations occur in the individual var measurement, while being insignificant in the total var measurement, regardless of the varying grid impedance. We adopt two analysis approaches: open-loop single-input single-output analysis and network decomposition. The two approaches differ in their treatment of turbine-network interaction. The open-loop analysis shows that the turbine-turbine oscillation mode is due to an open-loop system pole being attracted to an open-loop system zero. Furthermore, we use network decomposition method to explain why this mode is observable in individual vars while not observable in the total var. The entire system of n -turbines can be viewed as n decoupled circuits. For the two-turbine case, the system has an aggregated mode and a turbine-turbine oscillation mode. Here, the aggregated mode is associated with a circuit associated with the total var, while the turbine-turbine oscillation mode is associated with the var difference and is insensitive to the grid parameters.

17 WIND ENERGY↗

Lattice determination of 𝐼=0 and 2 𝜋⁢𝜋 scattering phase shifts with a physical pion mass

Phase shifts for 𝑠-wave 𝜋⁢𝜋 scattering in both the 𝐼 =0 and 𝐼 =2 channels are determined from a lattice QCD calculation performed on 741 gauge configurations obeying G-parity boundary conditions with a physical pion mass and lattice size of 32 3 ×64. These results support our recent 2021 study of direct 𝐶⁢𝑃 violation in 𝐾 → 𝜋⁢𝜋 decay, improving our earlier 2015 calculation. The phase shifts are determined for both stationary and moving 𝜋⁢𝜋 systems, at three (𝐼 = 0) and four (𝐼 = 2) different total momenta. We implement several 𝜋⁢𝜋 interpolating operators including a scalar bilinear “𝜎” operator and paired single-pion bilinear operators with the constituent pions carrying various relative momenta. Several techniques, including correlated fitting and a bootstrap determination of p-values have been used to refine the results and a comparison with the generalized eigenvalue problem method is given. A detailed systematic error analysis is performed which allows phase shift results to be presented at a fixed energy.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Two-step neutronics calculations with Shift and Griffin for advanced reactor systems

This research develops the initial coupling of the Shift Monte Carlo (MC) code and the Griffin reactor physics code for reactor analysis of non–light-water reactor systems. The novelty of this work is twofold. It is the first application of Shift to produce the multigroup cross sections needed for Griffin as applied to a non–light-water reactor system; and, the first investigation and analysis of characteristics of the Empire microreactor benchmark that should be considered for steady state and transient reactor physics calculations. This application uses the previously developed two-step neutronics analysis workflow to demonstrate this initial coupling. Here, we outline the two-step neutronics analysis workflow in which the Shift MC code is used to generate the multigroup cross sections and fluxes needed by the Griffin deterministic solver. Details on how these multigroup cross sections are generated using MC tallies are given, as well as the practicalities and limitations of the two-step neutronics workflow. The Empire microreactor benchmark was used to investigate and validate this coupling. Results using this benchmark show good agreement between Griffin calculations using Serpent-generated cross sections and Shift-generated cross sections. Analysis of the characteristics of this Empire benchmark show larger eigenvalue differences between heterogeneous and pin–homogenized solutions compared to those of traditional light-water reactor (LWR) designs, thus requiring super homogenization factor corrections for accurate eigenvalue and power distribution predictions.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Bounds on spectral gaps of Hyperbolic spin surfaces

We describe a method for constraining Laplacian and Dirac spectra of two dimensional compact orientable hyperbolic spin manifolds and orbifolds. The key ingredient is an infinite family of identities satisfied by the spectra. These spectral identities follow from the consistency between 1) the spectral decomposition of functions on the spin bundle into irreducible representations of SL(2,R) and 2) associativity of pointwise multiplication of functions. Applying semidefinite programming methods to our identities produces rigorous upper bounds on the Laplacian spectral gap as well as on the Dirac spectral gap conditioned on the former. In several examples, our bounds are nearly sharp; a numerical algorithm based on the Selberg trace formula shows that the [0;3,3,5] orbifold, a particular surface with signature [1;3], and the Bolza surface nearly saturate the bounds at genus 0, 1 and 2 respectively. Under additional assumptions on the number of harmonic spinors carried by the spin-surface, we obtain more restrictive bounds on the Laplacian spectral gap. In particular, these bounds apply to hyperelliptic surfaces. We also determine the set of Laplacian spectral gaps attained by all compact orientable two-dimensional hyperbolic spin orbifolds. We show that this set is upper bounded by 12.13798; this bound is nearly saturated by the [0;3,3,5] orbifold, whose first non-zero Laplacian eigenvalue is λ^(0)_1 ≈ 12.13623.

Spectral theory↗

Stochastic gradient descent for optimization for nuclear systems

The use of gradient descent methods for optimizing k-eigenvalue nuclear systems has been shown to be useful in the past, but the use of k-eigenvalue gradients have proved computationally challenging due to their stochastic nature. ADAM is a gradient descent method that accounts for gradients with a stochastic nature. This analysis uses challenge problems constructed to verify if ADAM is a suitable tool to optimize k-eigenvalue nuclear systems. ADAM is able to successfully optimize nuclear systems using the gradients of k-eigenvalue problems despite their stochastic nature and uncertainty. Furthermore, it is clearly demonstrated that low-compute time, high-variance estimates of the gradient lead to better performance in the optimization challenge problems tested here.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Anderson acceleration stability in NDA-accelerated k-eigenvalue problems

Anderson acceleration (AA) has been used to improve the stability and convergence rate of multiphysics iterative methods for reactor analysis. Most applications studied assume a tightly converged solution for the different physics problems, and AA is usually applied to state variables like temperature, density, and heat generation rate. In this paper, we study the theoretical performance of AA in NDA-accelerated k-eigenvalue problems. The problems and algorithms studied are simplified from the coupled iteration scheme adopted by MPACT and many other high-fidelity whole-core reactor codes. Compared to previous analyses of AA for these iteration schemes, we study the case with a partially converged neutronics solution and possibly partially converged nonlinear diffusion acceleration (NDA)/coarse mesh finite difference (CMFD) solutions. We observe that the performance of the iteration scheme with AA is very sensitive to the initial guess and is affected by the partially converged CMFD solutions. When the NDA solution is fully converged, using AA cannot achieve the optimal convergence rate in large-sized problems. Conversely, if the NDA solution is partially converged, the iteration scheme with AA can diverge or converge extremely slowly. It is found that the loss of robustness for AA is due to the fact that it is applied to the iterative subspace of state variables rather than the fundamental unknowns of the governing equations. To improve the robustness, the scalar flux should also be considered in the implementation of AA. After considering the residuals of flux, we observe that the stability is regardless of the partial convergence of NDA solutions. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Analysis and Mitigation of Cascading Failures Using a Stochastic Interaction Graph with Eigen-analysis

In studies on complex network systems using graph theory, eigen-analysis is typically performed on an undirected graph model of the network. However, when analyzing cascading failures in a power system, the interactions among failures suggest the need for a directed graph beyond the topology of the power system to model directions of failure propagation. To accurately quantify failure interactions for effective mitigation strategies, this paper proposes a stochastic interaction graph model and associated eigen-analysis. Different types of modes on failure propagations are defined and characterized by the eigenvalues of a stochastic interaction matrix, whose absolute values are unity, zero, or in between. Finding and interpreting these modes helps identify the probable patterns of failure propagation, either local or widespread, and the participating components based on eigenvectors. Then, by lowering the failure probabilities of critical components highly participating in a mode of widespread failures, cascading can be mitigated. Here, the validity of the proposed stochastic interaction graph model, eigen-analysis and the resulting mitigation strategies is demonstrated using simulated cascading failure data on an NPCC 140-bus system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Block Lanczos algorithm for lattice QCD spectroscopy and matrix elements

Recent work introduced a new framework for analyzing correlation functions with improved convergence and signal-to-noise properties, as well as rigorous quantification of excited-state effects, based on the Lanczos algorithm and spurious eigenvalue filtering with the Cullum-Willoughby test. Here, we extend this framework to the analysis of correlation-function matrices built from multiple interpolating operators in lattice quantum chromodynamics (QCD) by constructing an oblique generalization of the block Lanczos algorithm, as well as a new physically motivated reformulation of the Cullum-Willoughby test that generalizes to block Lanczos straightforwardly. The resulting block Lanczos method directly extends generalized eigenvalue problem (GEVP) methods, which can be viewed as applying a single iteration of block Lanczos. Block Lanczos provides qualitative and quantitative advantages over GEVP methods analogous to the benefits of Lanczos over the standard effective mass, including faster convergence to ground- and excited-state energies, explicitly computable two-sided error bounds, straightforward extraction of matrix elements of external currents, and asymptotically constant signal-to-noise. No fits or statistical inference are required. Proof-of-principle calculations are performed for noiseless mock-data examples as well as two-by-two proton correlation-function matrices in lattice QCD.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗