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 343 records · Page 19

A Cliffed Cape Does Not Trap Water Waves in the Sea of Constant Depth

The water wave problem is considered for a class of semi-infinite domains each having its shore shaped as a cliffed cape. In particular, the free surface of a water domain is supposed to be an infinite sector whose vertex angle is greater than π, whereas the water layer lying under the free surface is of constant depth. Under these assumptions it is shown that there are no trapped mode solutions of the problem for all values of a non-dimensional spectral parameter; in other words, no point eigenvalues are embedded in the continuous spectrum of the problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Model Order Reduction Algorithm for Estimating the Absorption Spectrum

The ab initio description of the spectral interior of the absorption spectrum poses both a theoretical and computational challenge for modern electronic structure theory. Due to the often spectrally dense character of this domain in the quantum propagator’s eigenspectrum for medium-to-large sized systems, traditional approaches based on the partial diagonalization of the propagator often encounter oscillatory and stagnating convergence. Electronic structure methods which solve the molecular response problem through the solution of spectrally shifted linear systems, such as the complex polarization propagator, offer an alternative approach which is agnostic to the underlying spectral density or domain location. This generality comes at a seemingly high computational cost associated with solving a large linear system for each spectral shift in some discretization of the spectral domain of interest. In this work, we present a novel, adaptive solution to this high computational overhead based on model order reduction techniques via interpolation. Model order reduction reduces the computational complexity of mathematical models and is ubiquitous in the simulation of dynamical systems and control theory. The efficiency and effectiveness of the proposed algorithm in the ab initio prediction of X-ray absorption spectra is demonstrated using a test set of challenging water clusters which are spectrally dense in the neighborhood of the oxygen K-edge. On the basis of a single, user defined tolerance we automatically determine the order of the reduced models and approximate the absorption spectrum up to the given tolerance. We also illustrate that, for the systems studied, the automatically determined model order increases logarithmically with the problem dimension, compared to a linear increase of the number of eigenvalues within the energy window. Furthermore, we observed that the computational cost of the proposed algorithm only scales quadratically with respect to the problem dimension.

IDREAM, K-Edge, theoretical, computational, electr↗

Laplace Transform–Based Quantum Eigenvalue Transformation via Linear Combination of Hamiltonian Simulation

Eigenvalue transformations, which include solving time-dependent differential equations as a special case, have a wide range of applications in scientific and engineering computation. While quantum algorithms for singular value transformations are well studied, eigenvalue transformations are distinct, especially for nonnormal matrices. Here, we propose an efficient quantum algorithm for performing a class of eigenvalue transformations that can be expressed as a certain type of matrix Laplace transformation. This allows us to significantly extend the recently developed linear combination of Hamiltonian simulation method [D. An, J.-P. Liu, and L. Lin, Phys. Rev. Lett., 131 (2023), 150603; D. An, A. M. Childs, and L. Lin, Commun. Math. Phys. 407, 19 (2026)] to represent a wider class of eigenvalue transformations, such as powers of the matrix inverse, 𝐴 −𝑘 , and the exponential of the matrix inverse, 𝑒 −𝐴 −1 . The latter can be interpreted as the solution of a mass-matrix differential equation of the form form 𝐴⁢𝑢′⁡⁡(𝑡) =−𝑢⁡(𝑡). We demonstrate that our eigenvalue transformation approach can solve this problem without explicitly inverting 𝐴, thereby reducing the computational complexity.

Laplace transform↗

Efficient phase-factor evaluation in quantum signal processing

Quantum signal processing (QSP) is a powerful quantum algorithm to exactly implement matrix polynomials on quantum computers. Asymptotic analysis of quantum algorithms based on QSP has shown that asymptotically optimal results can in principle be obtained for a range of tasks, such as Hamiltonian simulation and the quantum linear system problem. A further benefit of QSP is that it uses a minimal number of ancilla qubits, which facilitates its implementation on near-to-intermediate term quantum architectures. However, there is so far no classically stable algorithm allowing computation of the phase factors that are needed to build QSP circuits. Existing methods require the use of variable precision arithmetic and can only be applied to polynomials of a relatively low degree. We present here an optimization-based method that can accurately compute the phase factors using standard double precision arithmetic operations. We demonstrate the performance of this approach with applications to Hamiltonian simulation, eigenvalue filtering, and quantum linear system problems. Furthermore, our numerical results show that the optimization algorithm can find phase factors to accurately approximate polynomials of a degree larger than 10000 with errors below 10 -12 .

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Accelerated Monte Carlo Fission Source Convergence with Fission Matrix and Kernel Density Estimators

Accurate solution of the k-eigenvalue form of the Boltzmann radiation transport equation is required in many application areas, including nuclear reactor analysis and criticality safety. Monte Carlo calculations are free of the discretization errors inherent to deterministic methods and therefore offer the most accurate solutions. However, converging the fission source can be difficult for many problems, resulting in either a substantial computational overhead or potential inaccuracies that negate many of the benefits of using Monte Carlo methods. Difficulty in converging the fission source occurs for two distinct reasons. The first is the existence of a high dominance ratio in the problem (i.e. the largest and second largest eigenvalues have approximately the same magnitude). The second difficulty arises due to undersampling of the fission source because an insufficient number of particle histories are simulated. The first difficulty is shared by deterministic solvers when using power iteration, while the second difficulty is unique to Monte Carlo solvers. In practice, both difficulties may be present in the same problem, compounding the difficulty in achieving a converged distribution. In this paper, we consider a new approach to accelerate the convergence of the fission source based on combining the use of fission matrix methods with kernel density estimators (KDEs). It has been observed that deterministic fission matrix methods show the potential to accelerate the convergence of the fission source in Monte Carlo criticality calculations but may introduce significant additional noise for difficult problems. In this paper, we have demonstrated the use of a KDE approach in combination with the fission matrix acceleration. Although the addition of the KDE initially slows the convergence of the fission matrix acceleration, it decreases the magnitude of the noise while still offering significantly improved convergence relative to analog Monte Carlo. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Open-loop control of noise amplification in a separated boundary layer flow

Linear optimal gains are computed for the subcritical two-dimensional separated boundary-layer flow past a bump. Very large optimal gain values are found, making it possible for small-amplitude noise to be strongly amplified and to destabilize the flow. The optimal forcing is located close to the summit of the bump, while the optimal response is the largest in the shear layer. The largest amplification occurs at frequencies corresponding to eigenvalues which first become unstable at higher Reynolds number. Nonlinear direct numerical simulations show that a low level of noise is indeed sufficient to trigger random flow unsteadiness, characterized here by large-scale vortex shedding. Next, a variational technique is used to compute efficiently the sensitivity of optimal gains to steady control (through source of momentum in the flow, or blowing/suction at the wall). A systematic analysis at several frequencies identifies the bump summit as the most sensitive region for control with wall actuation. Based on these results, a simple open-loop control strategy is designed, with steady wall suction at the bump summit. Linear calculations on controlled base flows confirm that optimal gains can be drastically reduced at all frequencies. Nonlinear direct numerical simulations also show that this control allows the flow to withstand a higher level of stochastic noise without becoming nonlinearly unstable, thereby postponing bypass transition. In the supercritical regime, sensitivity analysis of eigenvalues supports the choice of this control design. Full restabilization of the flow is obtained, as evidenced by direct numerical simulations and linear stability analysis.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A regular version of Smilansky model

We discuss a modification of Smilansky model in which a singular potential “channel” is replaced by a regular, below unbounded potential which shrinks as it becomes deeper. We demonstrate that, similarly to the original model, such a system exhibits a spectral transition with respect to the coupling constant, and determine the critical value above which a new spectral branch opens. The result is generalized to situations with multiple potential “channels.”.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Kinetic theory of phase space plateaux in a non-thermal energetic particle distribution

The transformation of kinetically unstable plasma eigenmodes into hole-clump pairs with temporally evolving carrier frequencies was recently attributed to the emergence of an intermediate stage in the mode evolution cycle, that of an unmodulated plateau in the phase space distribution of fast particles. The role of the plateau as the hole-clump breeding ground is further substantiated in this article via consideration of its linear and nonlinear stability in the presence of fast particle collisions and sources, which are known to affect the production rates and subsequent frequency sweeping of holes and clumps. In particular, collisional relaxation, as mediated by e.g. velocity space diffusion or even simple Krook-type collisions, is found to inhibit hole-clump generation and detachment from the plateau, as it should. On the other hand, slowing down of the fast particles turns out to have an asymmetrically destabilizing/stabilizing effect, which explains the well-known result that collisional drag enhances holes and their sweeping rates but suppresses clumps. It is further demonstrated that relaxation of the plateau edge gradients has only a minor quantitative effect and does not change the plateau stability qualitatively, unless the edge region extends far into the plateau shelf and the corresponding Landau pole needs to be taken into account.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Spectral properties of the Dirichlet operator Σ{sub i=1}{sup d}(−∂{sub i}{sup 2}){sup s} on domains in d-dimensional Euclidean space

In this article, we investigate the distribution of eigenvalues of the Dirichlet pseudo-differential operator Σ{sub i=1}{sup d}(−∂{sub i}{sup 2}){sup s}, s∈(0,1] on an open and bounded subdomain Ω⊂R{sup d} and predict bounds on the sum of the first N eigenvalues, the counting function, the Riesz means, and the trace of the heat kernel. Moreover, utilizing the connection of coherent states to the semi-classical approach of quantum mechanics, we determine the sum for moments of eigenvalues of the associated Schrödinger operator.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On Some Degenerate Elliptic Equations Arising in Geometric Problems

We consider some fully nonlinear degenerate elliptic operators and we investigate the validity of certain properties related to the maximum principle. In particular, we establish the equivalence between the sign propagation property and the strict positivity of a suitably defined generalized principal eigenvalue. Furthermore, we show that even in the degenerate case considered in the present paper, the well-known condition introduced by Keller–Osserman on the zero-order term is necessary and sufficient for the existence of entire weak subsolutions.

97 MATHEMATICS AND COMPUTING↗

MC21/CTF and VERA-CS Mutiphysics Solutions to VERA Core Physics Benchmark Problems 6 and 7

The continuous energy Monte Carlo neutron transport code, MC21, was coupled to the CTF subchannel thermal-hydraulics code using a combination of CASL tools and in-house Python scripts. An MC21/CTF solution for VERA Core Physics Benchmark Progression Problem 6 demonstrated excellent agreement with MC21/COBRA-IE and VERA solutions. The MC21/CTF solution for VERA Core Physics Benchmark Progression Problem 7, Watts Bar Unit 1 at beginning of cycle (BOC) hot full power (HFP) equilibrium xenon conditions, is the first published coupled Monte Carlo neutronics / subchannel T-H solution for this problem. MC21/CTF predicted a critical boron concentration of 854.5 ppm, yielding a critical eigenvalue of 0.99994 ± 6.8E-6 (95% CI). Excellent agreement with a VERA solution of Problem 7 was also demonstrated for integral and local power and temperature parameters.

Aviles, Brian↗

Assessment of the Griffin Reactor Multiphysics Application Using the Empire Micro Reactor Design Concept

In late 2019, INL and ANL agreed to jointly develop the reactor physics code named Griffin based on the integration of the two code suites, MAMMOTH/Rattlesnake (INL) and MC2 - 3/PROTEUS (ANL). Griffin is being developed based on the MOOSE framework and MOOSE quality assurance procedures. This decision was made to be able to allow DOE-NE to efficiently invest funding to this area and to provide effective and timely support for existing and potential users; the latter includes industry and government organizations who are developing various types of advanced reactors in the near and long term. Since MAMMOTH/Rattlesnake has been developed based on the MOOSE framework, the INL/ANL Griffin development team agreed to build Griffin beginning with a merger of MAMMOTH and Rattlesnake into a single code and moving forward by implementing capabilities from the PROTEUS suite into Griffin. Moving forward, both ANL and INL efforts are equally invested in the Griffin project, with management support, to provide an advanced reactor multiphysics tool to assist in reactor design, optimization, and safety analysis. Much work remains in moving Griffin forward to migrate PROTEUS capabilities and to optimize performance to meet user needs. The main objective of this work is to assess the current status of Griffin capabilities in terms of performance and accuracy, to determine priorities for PROTEUS migration, and to identify capabilities and features to improve for supporting the code integration effort. For this assessment, the Empire micro reactor problem that was developed in the ARPA-E MEITNER program was selected as an advance reactor concept of interest to the technical community. The Empire reactor problem was expanded from its original incomplete specification to be a small heat-pipe-cooled micro reactor core with ~113 cm radius and 70 cm in height, composed of 18 fuel assemblies, 12 control drums, and beryllium radial and axial reflectors. In the current model, using 5 cm axial reflectors specified in the original Empire assembly model, more than 10% of neutrons leak axially and through the empty center safety hole, as well as through heat pipe channels in fuel assembly elements that extend through the top reflector region. Several calculation models of the core were defined for systematic assessment, including 2-D and 3-D fuel assemblies and whole cores with cylindrical boundaries. Cross sections were generated using Serpent 2, and meshes were produced using the Argonne mesh tool or the INL neutronics meshing tools combined with CUBIT. Cross sections and meshes were converted to the ISOXML and Exodus formats, respectively, so that Griffin and PROTEUS could use consistent data for solving the reactor problems. With the prepared cross sections and meshes, PROTEUS was run first to ensure that all input data were correctly generated and input options in terms of angle, mesh, and energy group were accurately determined. Comparisons against Serpent 2 solutions were made in terms of eigenvalue and pin power. The same calculations and comparisons were then conducted using Griffin. For the fuel assembly and whole core problems, the PROTEUS eigenvalues agreed well with reference Serpent 2 solutions within 100 and 30 pcm, respectively, and pin power differences relative to Serpent 2 were overall less than 2.2% and RMS 0.8% for the whole core models. This indicated that all input data were properly prepared. Using the same data, Griffin was run selecting the SAAF-CFEM SN solver with Legendre-Gaussian quadrature and NDA and DSA for acceleration. It was found that the SAAF-CFEM solver of Griffin required finer meshes to achieve eigenvalue and pin power solutions in good agreement with Serpent 2, consequently requiring more memory requirement and longer computation time. On the other hand, the SPH-Diffusion 2-D core calculations performed using Griffin were able to recover the exact eigenvalue from the reference Serpent 2 solutions, resulting in a pin-power distribution with an RMS of 0.6% and maximum absolute difference of less than 1.4%. The runtimes for SPH-Diffusion for the 2-D core were less than 3 minutes on 40 cores. During this evolution of this evaluation, many updates were made in Griffin by the Griffin development team of INL (focusing on software updates) and ANL (reviewing and supporting software updates) to complete this assessment. Observations from the code assessment are presented in the conclusion section of this report, followed by a discussion of recommendations for future work.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

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↗

Survey of Dynamic Mode Decomposition Methods

Dynamic mode decomposition (DMD) is a data-driven reduced order modeling (ROM) technique used for dynamic systems. The widely adopted algorithm was first introduced and demonstrated on fluid flow data by Schmid. In recent years, various other fields, such as nuclear engineering, have begun to adopt this method. For example, DMD has been used for estimating α-eigenvalues, as an ROM for pulsed neutron problems, for predicting isotopic composition in burnup calculations, as acceleration techniques for iterative methods, and in capturing dynamic behaviors in molten salt reactor transients. This report seeks to demonstrate the capabilities and limits of the standard DMD algorithm, and identify problem spaces where variants may be better suited. The primary variant this report considers is Multi-Resolution DMD (mrDMD). Because this serves as a survey, synthetically produced data is used in lieu of simulation results. The remainder of this report will go into detail on the DMD theory, outline the standard DMD and mrDMD algorithms, present test cases highlighting the applicability of each, and finally present a discussion on how to determine the best suited algorithm for a given problem. All calculations performed in this report are carried out using the open source DMD library, PyDMD.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Learning in Modal Space: Solving Time-Dependent Stochastic PDEs Using Physics-Informed Neural Networks

One of the open problems in scientific computing is the long-time integration of nonlinear stochastic partial differential equations (SPDEs), especially with arbitrary initial data. We address this problem by taking advantage of recent advances in scientific machine learning and the spectral dynamically orthogonal (DO) and borthogonal (BO) methods for representing stochastic processes. The recently introduced DO/BO methods reduce the SPDE to solving a system of deterministic PDEs and a system of stochastic ordinary differential equations. Specifically, we propose two new physics-informed neural networks (PINNs) for solving time-dependent SPDEs, namely the neural network (NN)-DO/BO methods. The proposed methods incorporate the DO/BO constraints into the loss function (along with the modal decomposition of the SPDE) with an implicit form instead of generating explicit expressions for the temporal derivatives of the DO/BO modes. Hence, the NN-DO/BO methods can overcome some of the drawbacks of the original DO/BO methods. For example, we do not need the assumption that the covariance matrix of the random coefficients is invertible as in the original DO method, and we can remove the assumption of no eigenvalue crossing as in the original BO method. Moreover, the NN-DO/BO methods can be used to solve time-dependent stochastic inverse problems with the same formulation and same computational complexity as for forward problems. Furthermore, we demonstrate the capability of the proposed methods via several numerical examples, namely: (1) A linear stochastic advection equation with deterministic initial condition: we obtain good results with the proposed methods, while the original DO/BO methods cannot be applied directly in this case. (2) Long-time integration of the stochastic Burgers' equation: we show the good performance of NN-DO/BO methods, especially the effectiveness of the NN-BO approach for such problems with many eigenvalue crossings during the whole time evolution, while the original BO method fails. (3) Nonlinear reaction diffusion equation: we consider both the forward problem and the inverse problems, including very noisy initial point values, to investigate the flexibility of the NN-DO/BO methods in handling inverse and mixed type problems. Taken together, these simulation results demonstrate that the NN-DO/BO methods can be employed to effectively quantify uncertainty propagation in a wide range of physical problems, but future work should address the efficiency issue of PINNs for forward problems.

97 MATHEMATICS AND COMPUTING↗

Development of a S{sub n} transport code based on discontinuous finite element method and coarse mesh finite difference formulation

The methods and performance of a three-dimensional S{sub n} transport code employing the Discontinuous Finite Element Method (DFEM) and the Coarse Mesh Finite Difference (CMFD) formulation are presented. The mesh generator GMSH and a post processing visualization tool Visit are combined with the code for flexible geometry processing and versatile visualization. The CMFD method for DFEM Sn applications is formulated and the performance of the CMFD acceleration of eigenvalue calculations is demonstrated for a simple set of neutron transport problems. (authors)

97 MATHEMATICS AND COMPUTING↗