Variable Dynamic Mode Decomposition for Estimating Time Eigenvalues in Nuclear Systems
Not provided.
SEARCH · Search NASA
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.
Not provided.
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)
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.
A computer-based method for contingency analysis of oscillatory stability in an electrical power transmission system is provided. The method uses at least one processor. The method includes receiving, by the at least one processor, a plurality of component inputs from a plurality of system components within the electrical power transmission system. The method also includes generating a nominal matrix for the electrical power transmission system. The nominal matrix includes a set of equations at least partially modeling the electrical power transmission system. The method further includes calculating eigenvalues and eigenvectors of the nominal matrix. The method also includes identifying a contingency representing a postulated disturbance of the electrical power transmission system. The method further includes estimating a contingency eigenvalue for the contingency using the eigenvalues and eigenvectors of the nominal matrix.
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.
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.
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.
This work presents a hybrid data-driven and physics-based framework for high-impedance fault detection in power systems. An innovative method based on eigenvalue analysis is expanded and validated. Phasor Measurement Unit data is used to estimate eigenvalues corresponding to the powerlines being monitored. The projection and drift of these eigenvalues is then tracked and evaluated. Faults are detected as they drive eigenvalues outside of their normal zones. Eigenvectors are leveraged to support and validate the decisions made by the main algorithm. This technique holds several advantages over contemporary techniques in that it utilizes technology that is already deployed in the field, it offers a significant degree of generality, and so far it has displayed a very high-level of sensitivity without sacrificing accuracy. Validation takes place in the form of simulations in the IEEE 13 Node System considering a popular high-impedance non-linear fault model. Test results are encouraging indicating potential for real-life applications.
We revisit neutrino oscillations in constant matter density for a number of different scenarios: three flavors with the standard Wolfenstein matter potential, four flavors with standard matter potential and three flavors with non-standard matter potentials. To calculate the oscillation probabilities for these scenarios one must determine the eigenvalues and eigenvectors of the Hamiltonians. We use a method for calculating the eigenvalues that is well known, determination of the zeros of determinant of matrix (λI - H), where H is the Hamiltonian, I the identity matrix and λ is a scalar. To calculate the associated eigenvectors we use a method that is little known in the particle physics community, the calculation of the adjugate (transpose of the cofactor matrix) of the same matrix, (λI - H). This method can be applied to any Hamiltonian, but provides a very simple way to determine the eigenvectors for neutrino oscillation in matter, independent of the complexity of the matter potential. This method can be trivially automated using the Faddeev–LeVerrier algorithm for numerical calculations. For the above scenarios we derive a number of quantities that are invariant of the matter potential, many are new such as the generalization of the Naumov–Harrison–Scott identity for four or more flavors of neutrinos. We also show how these matter potential independent quantities become matter potential dependent when off-diagonal non-standard matter effects are included.
Eigenvector continuation is a computational method for parametric eigenvalue problems that uses subspace projection with a basis derived from eigenvector snapshots from different parameter sets. It is part of a broader class of subspace-projection techniques called reduced-basis methods. In this Colloquium, the development, theory, and applications of eigenvector continuation and projection-based emulators are presented. In conclusion, the basic concepts are introduced, the underlying theory and convergence properties are discussed, and recent applications for quantum systems and future prospects are presented.
Not Available
Not Available
Error fields are predominantly attributed to inevitable coil imperfections. Controlling error fields during coil fabrication and assembly is crucial for stellarators. Excessively tight coil tolerance increases time and cost, and, in part, led to the cancellation of the National Compact Stellarator Experiment and delay of W7-X. In this paper, we improve the recently proposed Hessian matrix method to rapidly identify important coil deviations. Two of the most common figures of merit, magnetic island size and quasi-symmetry, are analytically differentiated over coil parameters. By extracting the eigenvectors of the Hessian matrix, we can directly identify sensitive coil deviations in the order of the eigenvalues. The new method is applied to the upcoming Chinese First Quasi-axisymmetric Stellarator configuration. Important perturbations that enlarge n/m = 4/11 islands and deteriorate quasi-axisymmetry of the magnetic field are successfully determined. The results suggest each modular coil should have separate tolerance and some certain perturbation combinations will produce significant error fields. By relaxing unnecessary coil tolerance, this method will hopefully lead to a substantial reduction in time and cost.
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.
Reconstructing hadron spectral functions through Euclidean correlation functions are of the important missions in lattice QCD calculations. However, in a Källen–Lehmann (KL) spectral representation, the reconstruction is observed to be ill-posed in practice. It is usually ascribed to the fewer observation points compared to the number of points in the spectral function. In this paper, by solving the eigenvalue problem of continuous KL convolution, we show analytically that the ill-posedness of the inversion is fundamental and it exists even for continuous correlation functions. We discussed how to introduce regulators to alleviate the predicament, in which include the Artificial Neural Networks (ANNs) representations recently proposed by the Authors in another study. The uniqueness of solutions using ANNs representations is manifested analytically and validated numerically. Reconstructed spectral functions using different regularization schemes are also demonstrated, together with their eigen-mode decomposition. We observe that components with large eigenvalues can be reliably reconstructed by all methods, whereas those with low eigenvalues need to be constrained by regulators.
This paper aims to investigate the impact of magnetic drift on the linear micro-tearing mode by using a kinetic approach to derive a reduced two-field eigen system in real space. Here, since the magnetic drift in real space has derivatives, it is more efficient to solve the mode equations in a Fourier-ballooning representation using the two-dimensional (2D) ballooning transform. The lowest-order eigen system in the Fourier-ballooning representation consists of two integral equations, which are numerically solved using the finite difference method for both eigenvalues and wave functions. The main results will be presented through graphical eigenvalue scans for each parameter. Furthermore, we present a graphical comparison between the predictions of the ballooning theory and GENE gyrokinetic code simulation in the pedestal region.
Polynomial preconditioning can improve the convergence of the Arnoldi method for computing eigenvalues. Such preconditioning significantly reduces the cost of orthogonalization; for difficult problems, it can also reduce the number of matrix-vector products. Parallel computations can particularly benefit from the reduction of communication-intensive operations. Additoinally, the GMRES algorithm provides a simple and effective way of generating the preconditioning polynomial. For some problems high degree polynomials are especially effective, but they can lead to stability problems that must be mitigated. A two-level “double polynomial preconditioning” strategy provides an effective way to generate high-degree preconditioners.
In this work, a synchronous model for grid-connected and islanded microgrids is presented. The grid-connected model is based on the premise that the reference frame is synchronized with the AC bus. The quadrature component of the AC bus voltage can be cancelled, which allows to express output power as a linear equation for nominal values in the AC bus amplitude voltage. The model for the islanded microgrid is developed by integrating all the inverter dynamics using a state-space model for the load currents. This model is presented in a comprehensive way such that it could be scalable to any number of inverter-based generators using inductor–capacitor–inductor (LCL) output filters. The use of these models allows designers to assess microgrid stability and robustness using modern control methods such as eigenvalue analysis and singular value diagrams. Both models were tested and validated in an experimental setup to demonstrate their accuracy in describing microgrid dynamics. In addition, three scenarios are presented: non-controlled model, Linear-Quadratic Integrator (LQI) power control, and Power-Voltage (PQ/Vdq) droop–boost controller. Experimental results demonstrate the effectiveness of the control strategies and the accuracy of the models to describe microgrid dynamics.