Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 163 records · Page 9

Rethinking the ill-posedness of the spectral function reconstruction — Why is it fundamentally hard and how Artificial Neural Networks can help

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.

97 MATHEMATICS AND COMPUTING↗

On the Design, Development, and Analysis of Optimized Matrix-Vector Multiplication Routines for Coprocessors

The manycore paradigm shift, and the resulting change in modern computer architectures, has made the development of optimal numerical routines extremely challenging. In this work, we target the development of numerical algorithms and implementations for Xeon Phi coprocessor architecture designs. In particular, we examine and optimize the general and symmetric matrix-vector multiplication routines (gemv/symv), which are some of the most heavily used linear algebra kernels in many important engineering and physics applications. We describe a successful approach on how to address the challenges for this problem, starting with our algorithm design, performance analysis and programing model and moving to kernel optimization. Our goal, by targeting low-level and easy to understand fundamental kernels, is to develop new optimization strategies that can be effective elsewhere for use on manycore coprocessors, and to show significant performance improvements compared to existing state-of-the-art implementations. Therefore, in addition to the new optimization strategies, analysis, and optimal performance results, we finally present the significance of using these routines/strategies to accelerate higher-level numerical algorithms for the eigenvalue problem (EVP) and the singular value decomposition (SVD) that by themselves are foundational for many important applications.

Kabir, Khairul↗

The Random Ray Method Versus Multigroup Monte Carlo: The Method of Characteristics in OpenMC and SCONE

The Random Ray Method (TRRM) is a recently developed approach to solving neutral particle transport problems based on the Method of Characteristics. While the method previously has been implemented only in closed-source or limited-functionality codes, this work describes its implementation in two open-source Monte Carlo codes: OpenMC and SCONE. The random ray implementations required small modifications to the existing Multigroup Monte Carlo (MGMC) solvers, offering a rare venue for redundant, fine-grained, "apples-to-apples" speed and accuracy comparisons between transport methods. To this end, TRRM and MGMC solvers are evaluated against each other using each code's native capabilities on reactor eigenvalue problems with different degrees of energy discretization. On the C5G7 benchmark (featuring only seven energy groups), TRRM achieves a maximum pin power error comparable to or lower than that of MGMC for a given run time. On a problem with 69 energy groups, MGMC is found to scale more efficiently, obtaining a lower pin power error for a given run time. However, the defining difference between the two transport methods is found to be their vastly different uncertainty distributions. Specifically, TRRM is found to maintain similar levels of accuracy and uncertainty throughout the simulation domain whereas MGMC can exhibit orders-of-magnitude greater errors in areas of the problem that feature low neutron flux. For instance, TRRM provided an up to 373 times speed advantage compared with MGMC for computing the flux in low-flux regions in the moderator surrounding the C5G7 core.

42 ENGINEERING↗

A new method for multi-bit and qudit transfer based on commensurate waveguide arrays

The faithful state transfer is an important requirement in the construction of classical and quantum computers. While the high-speed transfer is realized by optical-fibre interconnects, its implementation in integrated optical circuits is affected by cross-talk. The cross-talk between densely packed optical waveguides limits the transfer fidelity and distorts the signal in each channel, thus severely impeding the parallel transfer of states such as classical registers, multiple qubits and qudits. Here, we leverage on the suitably engineered cross-talk between waveguides to achieve the parallel transfer on optical chip. Waveguide coupling coefficients are designed to yield commensurate eigenvalues of the array and hence, periodic revivals of the input state. While, in general, polynomially complex, the inverse eigenvalue problem permits analytic solutions for small number of waveguides. We present exact solutions for arrays of up to nine waveguides and use them to design realistic buses for multi-(qu)bit and qudit transfer. Advantages and limitations of the proposed solution are discussed in the context of available fabrication techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A flexible nonlinear diffusion acceleration method for the S N transport equations discretized with discontinuous finite elements

This paper presents a flexible nonlinear diffusion acceleration (NDA) method that discretizes both the S N transport equation and the diffusion equation using the discontinuous finite element method (DFEM). The method is flexible in that the diffusion equation can be discretized on a coarser mesh with the only restriction that it is nested within the transport mesh and the FEM shape function orders of the two equations can be different. The consistency of the transport and diffusion solutions at convergence is defined by using a projection operator mapping the transport into the diffusion FEM space. The diffusion weak form is based on the modified incomplete interior penalty (MIP) diffusion DFEM discretization that is extended by volumetric drift, interior face, and boundary closure terms. In contrast to commonly used coarse mesh finite difference (CMFD) methods, the presented NDA method uses a full FEM discretized diffusion equation for acceleration. Suitable projection and prolongation operators arise naturally from the FEM framework. Via Fourier analysis and numerical experiments for a one-group, fixed source problem the following properties of the NDA method are established for structured quadrilateral meshes: (1) the presented method is unconditionally stable and effective in the presence of mild material heterogeneities if the same mesh and identical shape functions either of the bilinear or biquadratic type are used, (2) the NDA method remains unconditionally stable in the presence of strong heterogeneities, (3) the NDA method with bilinear elements extends the range of effectiveness and stability by a factor of two when compared to CMFD if a coarser diffusion mesh is selected. In addition, the method is tested for solving the C5G7 multigroup, eigenvalue problem using coarse and fine mesh acceleration. Finally, while NDA does not offer an advantage over CMFD for fine mesh acceleration, it reduces the iteration count required for convergence by almost a factor of two in the case of coarse mesh acceleration.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Excited-state uncertainties in lattice-QCD calculations of multi-hadron systems

Excited-state effects lead to hard-to-quantify systematic uncertainties in lattice quantum chromodynamics (LQCD) spectroscopy calculations when computationally accessible imaginary times are smaller than inverse excitation gaps, as often arises for multi-hadron systems with signal-to-noise problems. Lanczos residual bounds address this by providing two-sided constraints on energies that do not require assumptions beyond Hermiticity, but often give very conservative systematic uncertainty estimates. Here, a more-constraining set of gap bounds is introduced for hadron spectroscopy. These bounds provide tighter constraints whose validity requires an explicit assumption about an energy gap. Exactly solvable lattice field theory correlators are used to test the utility of residual and gap bounds at finite and infinite statistics. Two-sided bounds and other analysis methods are then applied to a high-statistics LQCD calculation of nucleon-nucleon scattering at $m_π\sim 800$ MeV. Generalized eigenvalue problem (GEVP) and Lanczos energy estimators are compatible when applied to the same correlator data, but analyses including different interpolating operators show statistically significant inconsistencies. However, two-sided bounds from all operators are consistent. Under the assumption that the number of energy levels below $NΔ$ and $ΔΔ$ thresholds is the same as for non-interacting nucleons, gap bounds are sufficient to constrain nucleon-nucleon scattering amplitudes at phenomenologically relevant precision. Lanczos methods further reveal that energy-eigenstate estimates from previously studied asymmetric correlators have not converged over accessible imaginary times. Nevertheless, data-driven examples demonstrate why assumptions are required to draw conclusions about the natures of two-nucleon ground states at these masses.

Detmold, William [MIT, Cambridge, CTP]↗

A differential equation for Lerch's transcendent and associated symmetric operators in Hilbert space

The function Ψ(x,y,s)=e{sup iy}Φ(−e{sup iy},s,x), where Φ(z,s,v) is Lerch's transcendent, satisfies the following two-dimensional formally self-adjoint second-order hyperbolic differential equation, where s=1/2+iλ. The corresponding differential expression determines a densely defined symmetric operator (the minimal operator) on the Hilbert space L{sub 2}(Π), where Π=(0,1)×(0,2π). We obtain a description of the domains of definition of some symmetric extensions of the minimal operator. We show that formal solutions of the eigenvalue problem for these symmetric extensions are represented by functional series whose structure resembles that of the Fourier series of Ψ(x,y,s). We discuss sufficient conditions for these formal solutions to be eigenfunctions of the resulting symmetric differential operators. We also demonstrate a close relationship between the spectral properties of these symmetric differential operators and the distribution of the zeros of some special analytic functions analogous to the Riemann zeta function. Bibliography: 15 titles.

97 MATHEMATICS AND COMPUTING↗

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↗

Self-similar analogues of Stark ladders: a path to fractal potentials

We treat the eigenvalue problem posed by self-similar potentials, i.e. homogeneous functions under a particular affine transformation, by means of symmetry techniques. We find that the eigenfunctions of such problems are localized, evenwhen the potential does not rise to infinity in every direction. It is shown that the logarithm of the energy displays levels contained in families that are analogous toWannier–Stark ladders. The position of each ladder is proved to be determined by the specific details of the potential and not by its transformation properties. This is done by direct computation of matrix elements. The results are compared with numerical solutions of the Schrödinger equation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Gyrokinetic theory of electrostatic lower-hybrid drift instabilities in a current sheet with guide field

A kinetic electrostatic eigenvalue equation for the lower-hybrid drift instability (LHDI) in a thin Harris current sheet with a guide field is derived based on the gyrokinetic electron and fully kinetic ion(GeFi) description. Three-dimensional nonlocal analyses are carried out to investigate the influence of a guide field on the stabilization of the LHDI by finite parallel wavenumber, k{sub ∥}. Detailed stability properties are first analyzed locally, and then as a nonlocal eigenvalue problem. Our results indicate that at large equilibrium drift velocities, the LHDI is further destabilized by finite k{sub ∥} in the short-wavelength domain. This is demonstrated in a local stability analysis and confirmed by the peak in the eigenfunction amplitude. We find the most unstable modes localized at the current sheet edges, and our results agree well with simulations employing the GeFi code developed by Lin et al. [Plasma Phys. Controlled Fusion 47, 657 (2005); Plasma Phys. Controlled Fusion 53, 054013 (2011)].

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

MPACT Standard Input User s Manual, Version 2.2.0

The MPACT (Michigan PArallel Charactistics based Transport) code is designed to perform high-fidelity light water reactor (LWR) analysis using whole-core pin-resolved neutron transport calculations on modern parallel-computing hardware. The code consists of several libraries which provide the functionality necessary to solve steady-state eigenvalue problems. Several transport capabilities are available within MPACT including both 2-D and 3-D Method of Characteristics (MOC). A three-dimensional whole core solution based on the 2D-1D solution method provides the capability for full core depletion calculations.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

MPACT VERA Input User s Manual, Version 2.2.0

The MPACT (Michigan PArallel Charactistics based Transport) code is designed to perform high-fidelity light water reactor (LWR) analysis using whole-core pin-resolved neutron transport calculations on modern parallel-computing hardware. The code consists of several libraries which provide the functionality necessary to solve steady-state eigenvalue problems. Several transport capabilities are available within MPACT including both 2-D and 3-D Method of Characteristics (MOC). A three-dimensional whole core solution based on the 2D-1D solution method provides the capability for full core depletion calculations.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Massively-parallel electron dynamics calculations in real-time and real-space: Toward applications to nanostructures of more than ten-nanometers in size

A highly efficient program of massively parallel calculations for electron dynamics has been developed in an effort to apply the method to optical response of nanostructures of more than ten-nanometers in size. The approach is based on time-dependent density functional theory calculations in real-time and real-space. The computational code is implemented by using simple algorithms with a finite-difference method in space derivative and Taylor expansion in time-propagation. Since the computational program is free from the algorithms of eigenvalue problems and fast-Fourier-transformation, which are usually implemented in conventional quantum chemistry or band structure calculations, it is highly suitable for massively parallel calculations. Benchmark calculations using the K computer at RIKEN demonstrate that the parallel efficiency of the program is very high on more than 60 000 CPU cores. The method is applied to optical response of arrays of C{sub 60} orderly nanostructures of more than 10 nm in size. The computed absorption spectrum is in good agreement with the experimental observation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SENSMG: First-Order Sensitivities of Neutron Reaction Rates, Reaction-Rate Ratios, Leakage, k eff , and α Using PARTISN

SENSMG is a tool for computing first-order sensitivities of neutron reaction rates, reaction-rate ratios, leakage, k eff , and α using the PARTISN multigroup discrete-ordinates code. SENSMG computes sensitivities to all of the transport cross sections and data (total, fission, nu, chi, and all scattering moments), two edit cross sections (absorption and capture), and the density for every isotope and energy group. It also computes sensitivities to the mass density for every material and derivatives with respect to all interface locations. The tool can be used for one-dimensional spherical (r) and two-dimensional cylindrical (r-z) geometries. The tool can be used for fixed-source and eigenvalue problems. The tool implements Generalized Perturbation Theory (GPT) as discussed by Williams and Stacey. Section II of this report describes the theory behind adjoint-based sensitivities, gives the equations that SENSMG solves, and defines the sensitivities that are output. Section III describes the user interface, including the input file and command line options. Section IV describes the output. Section V gives some notes about the coding that may be of interest. Section VI discusses verification, which is ongoing. Section VII lists needs and ideas for future work. Appendix A lists all of the input files whose results are presented in Sec. VI.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Wiggle instability of galactic spiral shocks: Effects of magnetic fields

It has been suggested that the wiggle instability (WI) of spiral shocks in a galactic disk is responsible for the formation of gaseous feathers observed in grand-design spiral galaxies. We perform both a linear stability analysis and numerical simulations to investigate the effect of magnetic fields on the WI. The disk is assumed to be infinitesimally thin, isothermal, and non-self-gravitating. We control the strengths of magnetic fields and spiral-arm forcing using the dimensionless parameters β and F, respectively. By solving the perturbation equations as a boundary-eigenvalue problem, we obtain dispersion relations of the WI for various values of β=1−∞ and F=5% and 10%. We find that the WI arising from the accumulation of potential vorticity at disturbed shocks is suppressed, albeit not completely, by magnetic fields. The stabilizing effect of magnetic fields is not from the perturbed fields but from the unperturbed fields that reduce the density compression factor in the background shocks. When F=5% and β≲10 or F=10% and β ∼ 5–10, the most unstable mode has a wavelength of ∼0.1–0.2 times the arm-to-arm separation, which appears consistent with a mean spacing of observed feathers.

79 ASTRONOMY AND ASTROPHYSICS↗

Planetary normal mode computation: Parallel algorithms, performance and reproducibility

This report is an extension of work entitled “Computing planetary interior normal modes with a highly parallel polynomial filtering eigensolver.” by Shi et al., [1] originally presented at the SC18 conference. A highly parallel polynomial filtered eigensolver was developed and exploited to calculate the planetary normal modes. The proposed method is ideally suited for computing interior eigenpairs for large-scale eigenvalue problems as it greatly enhances memory and computational efficiency. In this article, the second-order finite element method is used to further improve the accuracy as only the first-order finite element method was deployed in the previous work. The parallel algorithm, its parallel performance up to 20k processors, and the great computational accuracy are illustrated. The reproducibility of the previous work was successfully performed on the Student Cluster Competition at the SC19 conference by several participant teams using a completely different Mars-model dataset on different clusters. Both weak and strong scaling performances of the reproducibility by the participant teams were impressive and encouraging. The analysis and reflection of their results are demonstrated and future direction is discussed.

97 MATHEMATICS AND COMPUTING↗

Hybrid eigensolvers for nuclear configuration interaction calculations

We examine and compare several iterative methods for solving large-scale eigenvalue problems arising from nuclear structure calculations. In particular, we discuss the possibility of using block Lanczos method, a Chebyshev filtering based subspace iterations and the residual minimization method accelerated by direct inversion of iterative subspace (RMM-DIIS) and describe how these algorithms compare with the standard Lanczos algorithm and the locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm. Although the RMM-DIIS method does not exhibit rapid convergence when the initial approximations to the desired eigenvectors are not sufficiently accurate, it can be effectively combined with either the block Lanczos or the LOBPCG method to yield a hybrid eigensolver that has several desirable properties. We will describe a few practical issues that need to be addressed to make the hybrid solver efficient and robust.

97 MATHEMATICS AND COMPUTING↗