Search NASA⌕ Search

SEARCH · Search NASA

Results for “eigenvalue method”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

On the convergence of the fixed point method for solving neutron transport alpha eigenvalue problems

It was shown that the Fixed Point Method (also known as the Rayleigh Quotient Method) is several times faster than the Critical Search Method for solving neutron transport alpha eigenvalue problems. It was also shown that the Fixed Point Method is able to determine the alpha eigenvalues of sub-critical systems that are beyond the reach of the Critical Search Method. Despite these significant advances, the Fixed Point Method remains an unproven algorithm. Here, this report provides a proof.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

A Flexible Power Method for Solving Infinite Dimensional Tensor Eigenvalue Problems

We propose a flexible power method for computing the leftmost, i.e., algebraically smallest, eigenvalue of an infinite dimensional tensor eigenvalue problem, $H x = \lambda x$, where the infinite dimensional symmetric matrix $H$ exhibits a translational invariant structure. We assume the smallest eigenvalue of $H$ is simple and apply a power iteration of $e^{-H}$ with the eigenvector represented in a compact way as a translational invariant infinite Tensor Ring (iTR). Hence, the infinite dimensional eigenvector can be represented by a finite number of iTR cores of finite rank. In order to implement this power iteration, we use a small parameter $t$ so that the infinite matrix-vector operation $e^{-Ht}x$ can efficiently be approximated by the Lie product formula, also known as Suzuki--Trotter splitting, and we employ a low rank approximation through a truncated singular value decomposition on the iTR cores in order to keep the cost of subsequent power iterations bounded. We also use an efficient way for computing the iTR Rayleigh quotient and introduce a finite size iTR residual which is used to monitor the convergence of the Rayleigh quotient and to modify the timestep $t$. In this paper, we discuss 2 different implementations of the flexible power algorithm and illustrate the automatic timestep adaption approach for several numerical examples.

Beeumen, Roel Van↗
DOE OSTI2019

On the All-Fiber Optical Methods of the Generation and Recognition of Soliton States

The state of a soliton is characterized by the eigenvalues of the Zakharov–Shabat problem. The data transfer rate in the fiber-optic communication lines that use eigenvalues for coding signals can be significantly increased only by developing optical eigenvalue control methods. We propose to use optical fibers with a sinusoidally changing dispersion to generate given sets of complex eigenvalues and to detect soliton states. Under the action of a periodic change in dispersion, multisoliton pulses divide into several solitons moving at different group velocities. This effect can be used to prepare fixed sets of eigenvalues. A soliton signal can be recognized by analyzing pulses and their spectra at the exit from a fiber with a periodically changing dispersion. Using the solitons specified by sets of four eigenvalues, we show that the field at the exit from a fiber corresponds to a unique combination of the spectrum and the number of pulses determined by initial eigenvalues.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Sparsity of Radiating Characteristic Modes on Infinite Periodic Structures

Characteristic modes on infinite periodic structures are studied using spectral dyadic Green’s functions. This formulation demonstrates that, in contrast to the modal analysis of finite structures, the number of radiating characteristic modes is limited by unit cell size and incident wave vector (i.e., scan angle or phase shift per unit cell). Here, the reflection tensor is decomposed into modal contributions from radiating modes, indicating that characteristic modes are a predictably sparse basis in which to study reflection phenomena.

42 ENGINEERING↗
DOE OSTI2020

Distributed Conditions for Small-signal Stability of Power Grids and Local Control Design

Operating modern power grids with stability guarantees is markedly important. Typical methods for analyzing and certifying power grid stability are largely centralized relying on the ability of the system operator to gather network-wide information and accurately compute the system's eigenvalues. These methods are oftentimes not privacy-preserving and computationally burdensome. They are therefore, not well-suited to modern power grids where small-signal stability has to be evaluated timely, efficiently and in a privacy-preserving fashion. Herein, we introduce a distributed methodology for certifying small-signal stability of power grids and designing the local controllers. First, we analytically derive distributed conditions for network-wide stability that bus agents can inspect using local information. By leveraging these conditions, we then introduce a distributed control design algorithm (DCDA) that can guide the local control design so that stability of the interconnected system is guaranteed. The agents that adopt the proposed distributed algorithm are responsible for tuning their local controllers, producing their local control commands and ensuring that their local stability condition is met. The system operator is only responsible for verifying network-wide stability upon receiving affirmative responses from all agents and, announcing, that the overall system is stable. The proposed DCDA algorithm is numerically validated via simulations using the IEEE 39-bus system.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Controlled precision QUBO-based algorithm to compute eigenvectors of symmetric matrices

We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix which is based on solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of symmetric matrices; It can compute the eigenvector/eigenvalue pair to essentially any arbitrary precision, and with minor modifications, can also solve the generalized eigenvalue problem. Performance is analyzed on small random matrices and selected larger matrices from practical applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Recent Testing of ENDF/B-VIII.0 at ORNL [Slides]

This presentation provides an overview of comparisons of ENDF/B-VII.1 and ENDF/B-VIII.0 and uses VALID suite to test >600 cases with ENDF/B-VII.1 and ENDF/B-VIII.0 in KENO V.a/KENO-VI, although a limited number of cases have been tested with TSUNAMI. It provides a results summary of KENO V.a/KENO-VI with a pooled results summary. The presentation also discusses changes for LCT experiments, MCT experiments, MST experiments, and PST experiments. A few words about graphite are also provided and the presentation states that graphite performance investigated across ENDF/B-VII.0, ENDF/B-VII.1, and ENDF/B-VIII.0 for MSR and HTGR models. A brief summary of the results is presented to make sure the Validation Committee is aware of the work. Also presented is an Eigenvalue comparison with a graphite moderated system, and comparison between an HTR-10 pebble model ENDF/B-VII.1 vs. ENDF/B-VIII.0, which provides different graphite data. In conclusion, ORNL has recently completed a comparison of ENDF/B-VIII.0 and ENDF/B-VII.1 using the VALID library. Work is also being performed for advanced reactor applications. Other efforts on-going and they are also trying to investigate more intermediate spectrum cases.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

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↗
DOE OSTI2022

Performance of the Initial Implementation of the Shift Monte Carlo Code in SCALE 6.3

The Shift Monte Carlo code will be introduced in SCALE 6.3 as an alternative to the KENO V.a, KENO-VI, and Monaco codes. Calculations were performed to establish the performance of Shift for criticality safety analyses within the criticality safety analyses sequence (CSAS) based on models in the Verified, Archived Library of Inputs and Data (VALID). This test suite contains over 600 critical experiment models covering a broad range of fissile materials and neutron energy spectra. The comparisons presented include calculated k eff values and runtime performance for serial calculations and a selection of parallel calculations. Comparisons are presented for multigroup (MG) and continuous-energy (CE) calculations for KENO V.a and KENO-VI models. Results generated with a beta version of SCALE 6.3 indicate excellent agreement in k eff values between KENO and Shift. The largest differences in the average k eff value calculated for the 15 categories of KENO V.a models are 0.00020 ± 0.00011 Δ k for MG calculations and 0.00011 ± 0.00005 Δ k for CE calculations. Similar comparisons in three categories using KENO-VI result in the largest differences for MG calculations: as 0.00004 ± 0.00003 Δ k , and -0.00002 ± 0.00003 Δ k for CE. The preliminary results also indicate that Shift is faster than KENO on a per particle basis, especially for fast spectrum systems. The uncertainty per history is also higher, however, so the Monte Carlo figure of merit is higher for KENO for thermal and intermediate spectrum systems. As expected, Shift generally has better speedup than KENO for parallel calculations, regardless of neutron energy spectrum.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2019

Quantum eigenvalue estimation via time series analysis

We present an efficient method for estimating the eigenvalues of a Hamiltonian H from the expectation values of the evolution operator for various times. For a given quantum state ρ, our method outputs a list of eigenvalue estimates and approximate probabilities. Each probability depends on the support of ρ in those eigenstates of H associated with eigenvalues within an arbitrarily small range. The complexity of our method is polynomial in the inverse of a given precision parameter ε, which is the gap between eigenvalue estimates. Unlike the well-known quantum phase estimation algorithm that uses the quantum Fourier transform, our method does not require large ancillary systems, large sequences of controlled operations, or preserving coherence between experiments, and is therefore more attractive for near-term applications. The output of our method can be used to estimate spectral properties of H and other expectation values efficiently, within additive error proportional to ε.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

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↗
DOE OSTI2022

A flexible linear diffusion acceleration to k-eigenvalue neutron transport with SN discontinuous finite element method

In this paper, we derive a flexible linear diffusion acceleration (LDA) for k-eigenvalue neutron transport discretized with discontinuous finite element method (DFEM) and discrete ordinates(SN). This LDA is based on our two pieces of previous works: the flexible non linear diffusion acceleration (NDA) for DFEM-SN and LDA for k-eigenvalue neutron transport using pre-conditioned Jacobian-free Newton-Krylov with self-adjoint angular flux (SAAF), continuous finite element method(CFEM), and SN. We point out the differences between LDA and NDA for DFEM-SN and the difference between DFEM-SN and SAAF-CFEM-SN for LDA. Numerical tests are presented to compare the convergence behaviour of NDA and LDA. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2018

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↗
DOE OSTI2019

Green’s Function of the Schrödinger Equation in the Potential Quantization Method

The problem for determining Green’s function G(r, r') for the time-independent Schrödinger equation is considered using the potential quantization method. The expression for G(r, r') is obtained in terms of the eigenfunctions and eigenvalues of this method. The equivalence of the used and traditional methods for solving the given problem has been proven.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Subcritical Multiplication with a Fixed Source

In a subcritical, multiplying medium, the system multiplication describes the expected total number of neutrons created by a single source neutron. Subcriticality plays a large role in criticality safety and thus it is vital for the subcritical multiplication factor be accurate, especially as a system approaches criticality. This work examines the accuracy of calculating the system multiplication using the MCNP6.2 ® k-eigenvalue power iteration (KCODE) method when a fixed-point source is present in a multiplying medium, for near critical systems. This work compares the standard approach for calculating system multiplication, using the fixed-source calculational approach, to a new, single k-eigenvalue power iteration approach that incorporates a fixed-source component and a fission-source component into a single calculation. For the remainder of this paper, some theoretical background and numerical results for an approximate k eigenvalue approach, an accurate fixed-source approach and a new and more accurate k-eigenvalue approach to computing system multiplication are provided.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Multigroup Constant Calculation with Static α-Eigenvalue Monte Carlo for Time-Dependent Neutron Transport Simulations

Herein, multigroup constants for deterministic methods that preserve the time-dependent physics of the neutron transport equations are derived. Alternative multigroup constant weighting spectra are discussed: (1) the fundamental k-eigenfunction, (2) the fundamental α-eigenfunction, and (3) a composite of several α-modes. To generate the fundamental α-eigenfunction for calculating the multigroup constants, a static fundamental α-eigenvalue method is implemented into the open source Monte Carlo code OpenMC. Several static and kinetic problems are devised to verify the implementations and to investigate the relative performance of the alternative multigroup constant weighting spectra. Results emphasize that as a multigroup constant weighting spectrum, the fundamental α-eigenfunction offers physical characteristics that make it advantageous (in producing accurate solutions) over the typically used fundamental k-eigenfunction.

42 ENGINEERING↗