Search NASA⌕ Search

SEARCH · Search NASA

Results for “reduced eigenvalue problem”

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 109 records · Page 6

Plasma Energetic Particles Simulation Center (PEPSC)

The main effort of the Texas group was to develop theoretical and simplified numerical models to understand chirping phenomena often seen for Alfven and geodesic acoustic waves in experimental plasmas such as D-III-D, NSTX and JET. Its main numerical effort was to modify the AEGIS code, which was originally developed as an eigenvalue solver. To apply to the chirping problem this code has to be able to treat the linear response to the continuum and the response of the plasma to external drive or to an internal drive that comes from the formation of phase space chirping structures. The theoretical underpinning of this investigation still needed to be more fully developed to understand how to best formulate the theoretical problem. Considerable progress was made on this front by B.N. Breizman and his collaborators and a new reduced model was developed by H. L. Berk and his PhD student, G. Wang which can be uses as simplified model to describe chirping in a large aspect ratio tokamak. This final report will concentrate on these two directions that were developed as well as results that were found in the work with the AEGIS code and in the progress in developing a novel quasi-linear formulation for a description of Alfvenic modes destabilized by energetic particles, such as alpha particles in a burning plasma.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

VARIANCE ESTIMATION IN DOMAIN DECOMPOSED MONTE CARLO EIGENVALUE CALCULATIONS

The number of tallies performed in a given Monte Carlo calculation is limited in most modern Monte Carlo codes by the amount of memory that can be allocated on a single processor. By using domain decomposition, the calculation is now limited by the total amount of memory available on all processors, allowing for significantly more tallies to be performed. However, decomposing the problem geometry introduces significant issues with the way tally statistics are conventionally calculated. In order to deal with the issue of calculating tally variances in domain decomposed environments for the Shift hybrid Monte Carlo code, this paper presents an alternative approach for reactor scenarios in which an assumption is made that once a particle leaves a domain, it does not reenter the domain. Particles that reenter the domain are instead treated as separate independent histories. This assumption introduces a bias that inevitably leads to under-prediction of the calculated variances for tallies within a few mean free paths of the domain boundaries. However, through the use of different decomposition strategies, primarily overlapping domains, the negative effects of such an assumption can be significantly reduced to within reasonable levels.

42 ENGINEERING↗

Uncertainty Underprediction 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, which can lead to estimates of statistical uncertainties that are lower than the true uncertainty by a factor of 5 or more. However, several other more fundamental issues such as adequate source sampling over the fissionable regions and source convergence can have a significant impact on the uncertainties for the calculated eigenvalue and localized tally means, and these issues may be mistaken for effects resulting from cycle-to-cycle correlations. In worst-case scenarios, the uncertainty may be underpredicted by a factor of 40 or more. Since Monte Carlo methods are widely used in criticality safety applications and are increasingly being used for benchmarking reactor analyses, 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 eigenvalue and localized tally results in Monte Carlo criticality calculations is presented using the SCALE/KENO-VI (continuous-energy version) and MCNP codes. The purpose of this analysis is to investigate the underprediction of uncertainty and its sensitivity to problem characteristics and calculational parameters using two of the most widely used Monte Carlo criticality codes. For the problems considered here, which are fuel rod and fuel assembly problems with reflecting boundary conditions on all four horizontal sides, we show that adequate source convergence along with proper specification of Monte Carlo parameters can reduce the magnitude of uncertainty underprediction to reasonable levels, below a factor of 2 in most cases.

Mervin, Brenden T↗

Quasisymmetric Optimization of Nonaxisymmetry in Tokamaks

Predictive 3D optimization reveals a novel approach to modify a nonaxisymmetric magnetic perturbation to be entirely harmless for tokamaks, by essentially restoring quasisymmetry in perturbed particle orbits as much as possible. Such a quasisymmetric magnetic perturbation (QSMP) has been designed and successfully tested in the KSTAR and DIII-D tokamaks, demonstrating no performance degradation despite the large overall amplitudes of nonaxisymmetric fields and strong response otherwise expected in the tested plasmas. The results indicate that a quasisymmetric optimization is a robust path of error field correction across the resonant and nonresonant field spectrum in a tokamak, leveraging the prevailing concept of quasisymmetry for general 3D plasma confinement systems such as stellarators. Finally, the optimization becomes, in fact, a simple eigenvalue problem to the so-called torque response matrices if a perturbed equilibrium is calculated consistent with nonaxisymmetric neoclassical transport.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Rotational symmetry relation for efficient response function generation in the coarse mesh transport method COMET

The coarse mesh transport code COMET is a continuous energy hybrid stochastic-deterministic neutronics solver with high fidelity and formidable computation speed in solving reactor core problems. Its method is based on the incident flux expansion theory. In this work, we take advantage of the local geometric symmetry in many reactor cores lattices (e.g., fuel lattices and reflector blocks) to develop relations among the flux response expansion coefficients for symmetric surfaces to further improve the computational efficiency of the COMET response function generation tool (method). This is done by a rigorous derivation of the transformation matrices for the angular and spatial expansion moments resulting from a rotation of a coarse mesh by an arbitrary angle. The relations for the response coefficients for the symmetric surfaces can be then written as the Kronecker product of those transformation matrices. The method is implemented into COMET and tested on two advanced high temperature reactor (AHTR) full-length single assembly benchmark problems. The COMET results using the response function library based on the symmetry relations were compared to those using the library directly generated by continuous energy Monte Carlo for all surfaces. It was found that the eigenvalues and stripe-wise fission densities using the two libraries are in statistical agreement as expected. This indicates that the new method maintains the high fidelity of the original COMET method while improving the computational efficiency in the response function generation by 270% to 400%, depending on the local geometric symmetry. This method also reduces the size of the response function library by the same magnitude (270% to 400%). (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

An Overview of the Monte Carlo Application ToolKit (MCATK)

MCATK is a C++ component-based Monte Carlo neutron-gamma transport software library designed to build specialized applications and designed to provide new functionality in existing general-purpose Monte Carlo codes like MCNP; it was developed with Agile software engineering methodologies under the motivation to reduce costs. The characteristics of MCATK can be summarized as follows: MCATK physics – continuous energy neutron-gamma transport with multi-temperature treatment, static eigenvalue (k and α) algorithms, time-dependent algorithm, fission chain algorithms; MCATK geometry – mesh geometries, solid body geometries. MCATK provides verified, unit-tested Monte Carlo components, flexibility in Monte Carlo applications development, and numerous tools such as geometry and cross section plotters. Recent work has involved deterministic and Monte Carlo analysis of stochastic systems. Static and dynamic analysis is discussed, and the results of a dynamic test problem are given.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Collision of Physics and Software in the Monte Carlo Application Toolkit (MCATK)

The topic is presented in a series of slides organized as follows: MCATK overview, development strategy, available algorithms, problem modeling (sources, geometry, data, tallies), parallelism, miscellaneous tools/features, example MCATK application, recent areas of research, and summary and future work. MCATK is a C++ component-based Monte Carlo neutron-gamma transport software library with continuous energy neutron and photon transport. Designed to build specialized applications and to provide new functionality in existing general-purpose Monte Carlo codes like MCNP, it reads ACE formatted nuclear data generated by NJOY. The motivation behind MCATK was to reduce costs. MCATK physics involves continuous energy neutron & gamma transport with multi-temperature treatment, static eigenvalue (k eff and α) algorithms, time-dependent algorithm, and fission chain algorithms. MCATK geometry includes mesh geometries and solid body geometries. MCATK provides verified, unit-test Monte Carlo components, flexibility in Monte Carlo application development, and numerous tools such as geometry and cross section plotters.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Robust Predictive Control for Modular Solid-State Transformer With Reduced DC Link and Parameter Mismatch

This paper presents the analysis and implementation of a predictive control method for dc-link regulation and voltage balance in a cascaded modular reduced dc-link solid-state transformer (SST). Passive components like bulky dc links limit the power density of power converters, especially medium-voltage (MV) SST. Reduced dc-link or low-inertia converters can dramatically reduce the size, cost, and weight by tolerating larger dc-link ripples and improve the reliability with electrolytic capacitor-less dc link. However, a small dc link leads to tight coupling between the input and the output stages, which is a challenge for control design. In stacked low-inertia converters (SLIC), the low-inertia converter modules are stacked for MV applications, resulting in coupling between the modules and making the control more challenging. A new model predictive control method which can achieve deadbeat regulation on the dc link without weighting factors has been proposed to address this novel problem. This paper focuses on analyzing the condition of the low-inertia dc link up to 80% ripple, the robustness of the control under parameter mismatches, high-order terms, and important implementation issues such as model-based sampling and computation delay compensation. Significantly, the high-order terms are introduced because of the large dc-link ripple. These high-order terms are unique to the SLIC and negligible in conventional high-inertia converters. A discrete-time large-signal model is built to capture the dc-link’s nonlinear dynamics, and the eigenvalues of a small-signal Jacobian matrix are analyzed with Floquet theory to evaluate stability, using the modular soft-switching solid-state transformer (M-S4T) as an example of the SLIC. Simulation and experimental results of an MVDC M-S4T verify the analysis and the predictive control method. Finally, the general application of the predictive control to low-inertia converters is compared against a conventional PI controller using a reduced dc-link active-front-end (AFE) rectifier as an example.

14 SOLAR ENERGY↗

Quantization of the Electromagnetic Field in Three-Dimensional Photonic Structures on the Basis of the Scattering Matrix Formalism (S Quantization)

A technique for quantization of the electromagnetic field in photonic nanostructures with three-dimensional modulation of the dielectric constant is developed on the basis of the scattering matrix formalism (S quantization in the three-dimensional case). Quantization is based on equating the eigenvalues of the scattering matrix to unity, which is equivalent to equating each other the sets of Fourier expansions for the fields of the waves incident on the structure and propagating away from the structure. The spatial distribution of electromagnetic fields of the modes in a photonic nanostructure is calculated on the basis of the R and T matrices describing the reflection and transmission of the Fourier components by the structure. To calculate the reflection and transmission coefficients of individual real-space and Fourier-space components, the structure is divided into parallel layers within which the dielectric constant varies as a function of two-dimensional coordinates. Using the Fourier transform, Maxwell’s equations are written in the form of a matrix connecting the Fourier components of the electric field at the boundaries of neighboring layers. Based on the calculated reflection and transmission vectors for all polarizations and Fourier components, the scattering matrix for the entire structure is formed and quantization is carried out by equating the eigenvalues of the scattering matrix to unity. The developed method makes it possible to obtain the spatial profiles of eigenmodes without solving a system of nonlinear integro-differential equations and significantly reduces the computational resources required for calculating the probability of spontaneous emission in three-dimensional systems.

36 MATERIALS SCIENCE↗

Paradeisos: A perfect hashing algorithm for many-body eigenvalue problems

Here, we describe an essentially perfect hashing algorithm for calculating the position of an element in an ordered list, appropriate for the construction and manipulation of many-body Hamiltonian, sparse matrices. Each element of the list corresponds to an integer value whose binary representation reflects the occupation of single-particle basis states for each element in the many-body Hilbert space. The algorithm replaces conventional methods, such as binary search, for locating the elements of the ordered list, eliminating the need to store the integer representation for each element, without increasing the computational complexity. Combined with the “checkerboard” decomposition of the Hamiltonian matrix for distribution over parallel computing environments, this leads to a substantial savings in aggregate memory. While the algorithm can be applied broadly to many-body, correlated problems, we demonstrate its utility in reducing total memory consumption for a series of fermionic single-band Hubbard model calculations on small clusters with progressively larger Hilbert space dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Rationally extended many-body truncated Calogero–Sutherland model

We construct a rational extension of the truncated Calogero–Sutherland model by Pittman et al. The exact solution of this rationally extended model is obtained analytically and it is shown that while the energy eigenvalues remain unchanged, however the eigenfunctions are completely different and written in terms of exceptional X{sub 1} Laguerre orthogonal polynomials. The rational model is further extended to a more general X{sub m} case by introducing m dependent interaction term. As expected, in the special case of m=0, the extended model reduces to the conventional model of Pittman et al. In the two appropriate limits, we thereby obtain rational extensions of the celebrated Calogero–Sutherland as well as Jain–Khare models. The multi-index extension of the model is also discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A low-rank power iteration scheme for neutron transport criticality problems

Computing effective eigenvalues for neutron transport often requires a fine numerical resolution. Here, the main challenge of such computations is the high memory effort of classical solvers, which limits the accuracy of chosen discretizations. In this work, we derive a method for the computation of effective eigenvalues when the underlying solution has a low-rank structure. This is accomplished by utilizing dynamical low-rank approximation (DLRA), which is an efficient strategy to derive time evolution equations for low-rank solution representations. The main idea is to interpret the iterates of the classical inverse power iteration as pseudo-time steps and apply the DLRA concepts in this framework. In our numerical experiment, we demonstrate that our method significantly reduces memory requirements while achieving the desired accuracy. Analytic investigations show that the proposed iteration scheme inherits the convergence speed of the inverse power iteration, at least for a simplified setting.

97 MATHEMATICS AND COMPUTING↗

Clustering in structure and reactions using configuration interaction techniques

Atomic nuclei are remarkable quantum many-body systems where clustering properties develop naturally from underlying interactions between the constituent nucleons. Clustering degrees of freedom manifest themselves in multiple structure and reaction observables. Our goal is to study nuclear clustering and its emergence in many-nucleon dynamics from nucleon-nucleon interactions. Clustering is a phenomenon that is known to emerge on the boundary between structure and reactions, therefore developing appropriate techniques that bridge the structure-reaction divide and establishing connections to observables is among our principal objectives. Showing consistency and how the new techniques can be reduced to well established other methods is an important part of this work. Here, the configuration-interaction technique based on second quantization is used to treat the quantum many-body problem assuring that fermionic antisymmetry is fully satisfied. The use of the harmonic oscillator single-particle basis allows for the center-of-mass coordinate to be separated and prepared in a desired oscillator state for each cluster. The relative motion reaction basis channels are constructed by coupling clusters in different harmonic oscillator states with respect to their relative motion. Finally, using a resonating group method strategy we solve the generalized eigenvalue problem to obtain scattering channels. Structural clustering characteristics are discussed and the modified harmonic oscillator representation for scattering equations method is used to extract scattering observables. New methods for treating clustering problems have been put forward. We demonstrate broad applicability of the developed techniques. Examples highlight connections with algebraic techniques, and the role of approximations leading to algebraic limits is assessed using realistic examples. Various types of clustering characteristics are used to study alpha clustering in light nuclei that are relevant to currently ongoing experimental efforts. We demonstrate the emergence of strongly clustered bands of states in beryllium, triple alpha channels in 12 C, and molecular type clustering in 21 Ne. Starting from nucleon-nucleon interactions without any additional assumptions scattering phase shifts for alpha-alpha scattering are determined and shown to be consistent with those observed. In this work we put forward a new configuration-interaction-based method that targets the physics of clustering, and further unifies nuclear structure and reactions. We provide detailed discussions and many examples highlighting features and advantages of the approach.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Upscaling of Mixed Finite Element Discretization Problems by the Spectral AMGe Method

Here, we propose two multilevel spectral techniques for constructing coarse discretization spaces for saddle-point problems corresponding to PDEs involving a divergence constraint, with a focus on mixed finite element discretizations of scalar self-adjoint second order elliptic equations on general unstructured grids. We use element agglomeration algebraic multigrid (AMGe), which employs coarse elements that can have nonstandard shape since they are agglomerates of fine-grid elements. The coarse basis associated with each agglomerated coarse element is constructed by solving local eigenvalue problems and local mixed finite element problems. This construction leads to stable upscaled coarse spaces and guarantees the inf-sup compatibility of the upscaled discretization. Also, the approximation properties of these upscaled spaces improve by adding more local eigenfunctions to the coarse spaces. The higher accuracy comes at the cost of additional computational effort, as the sparsity of the resulting upscaled coarse discretization (referred to as operator complexity) deteriorates when we introduce additional functions in the coarse space. We also provide an efficient solver for the coarse (upscaled) saddle-point system by employing hybridization, which leads to a symmetric positive definite (s.p.d.) reduced system for the Lagrange multipliers, and to solve the latter s.p.d. system, we use our previously developed spectral AMGe solver. Numerical experiments, in both two and three dimensions, are provided to illustrate the efficiency of the proposed upscaling technique.

97 MATHEMATICS AND COMPUTING↗

Sampling electronic structure quadratic unconstrained binary optimization problems (QUBOs) with Ocean and Mukai solvers

The most advanced D-Wave Advantage quantum annealer has 5000+ qubits, however, every qubit is connected to a small number of neighbors. As such, implementation of a fully-connected graph results in an order of magnitude reduction in qubit count. To compensate for the reduced number of qubits, one has to rely on special heuristic software such as qbsolv, the purpose of which is to decompose a large quadratic unconstrained binary optimization (QUBO) problem into smaller pieces that fit onto a quantum annealer. In this work, we compare the performance of the open-source qbsolv which is a part of the D-Wave Ocean tools and a new Mukai QUBO solver from Quantum Computing Inc. (QCI). The comparison is done for solving the electronic structure problem and is implemented in a classical mode (Tabu search techniques). The Quantum Annealer Eigensolver is used to map the electronic structure eigenvalue-eigenvector equation to a QUBO problem, solvable on a D-Wave annealer. We find that the Mukai QUBO solver outperforms the Ocean qbsolv with one to two orders of magnitude more accurate energies for all calculations done in the present work, both the ground and excited state calculations. This work stimulates the further development of software to assist in the utilization of modern quantum annealers.

97 MATHEMATICS AND COMPUTING↗

Subspace recursive Fermi-operator expansion strategies for large-scale DFT eigenvalue problems on HPC architectures

Quantum mechanical calculations for material modeling using Kohn–Sham density functional theory (DFT) involve the solution of a nonlinear eigenvalue problem for N smallest eigenvector-eigenvalue pairs, with N proportional to the number of electrons in the material system. Here, these calculations are computationally demanding and have asymptotic cubic scaling complexity with the number of electrons. Large-scale matrix eigenvalue problems arising from the discretization of the Kohn–Sham DFT equations employing a systematically convergent basis traditionally rely on iterative orthogonal projection methods, which are shown to be computationally efficient and scalable on massively parallel computing architectures. However, as the size of the material system increases, these methods are known to incur dominant computational costs through the Rayleigh–Ritz projection step of the discretized Kohn–Sham Hamiltonian matrix and the subsequent subspace diagonalization of the projected matrix. This work explores the potential of polynomial expansion approaches based on recursive Fermi-operator expansion as an alternative to the subspace diagonalization of the projected Hamiltonian matrix to reduce the computational cost. Subsequently, we perform a detailed comparison of various recursive polynomial expansion approaches to the traditional approach of explicit diagonalization on both multi-node central processing unit and graphics processing unit architectures and assess their relative performance in terms of accuracy, computational efficiency, scaling behavior, and energy efficiency.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Data-driven probability concentration and sampling on manifold

A new methodology is proposed for generating realizations of a random vector with values in a finite-dimensional Euclidean space that are statistically consistent with a dataset of observations of this vector. The probability distribution of this random vector, while a priori not known, is presumed to be concentrated on an unknown subset of the Euclidean space. A random matrix is introduced whose columns are independent copies of the random vector and for which the number of columns is the number of data points in the dataset. The approach is based on the use of (i) the multidimensional kernel-density estimation method for estimating the probability distribution of the random matrix, (ii) a MCMC method for generating realizations for the random matrix, (iii) the diffusion-maps approach for discovering and characterizing the geometry and the structure of the dataset, and (iv) a reduced-order representation of the random matrix, which is constructed using the diffusion-maps vectors associated with the first eigenvalues of the transition matrix relative to the given dataset. The convergence aspects of the proposed methodology are analyzed and a numerical validation is explored through three applications of increasing complexity. The proposed method is found to be robust to noise levels and data complexity as well as to the intrinsic dimension of data and the size of experimental datasets. Both the methodology and the underlying mathematical framework presented in this paper contribute new capabilities and perspectives at the interface of uncertainty quantification, statistical data analysis, stochastic modeling and associated statistical inverse problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗