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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 505 records · Page 28

All sources NASA NTRS DOE OSTI

DOE OSTI2020

Data-driven modeling and control of dynamical systems using Koopman and Perron-Frobenius operators

This dissertation studies the data-driven modeling and control problem of nonlinear systems by exploiting the linear operator theoretic framework involving Koopman and Perro-Frobenius operator. A systematic linear-operator based controller design procedure has been established, which can be used to solve a variety of nonlinear control problems, including feedback stabilization using control Lyapunov functions, optimal quadratic regulation using Koopman eigenfunctions and convex optimization formulation of optimal control problem using P-F and Koopman operator approximation. As the core of data-driven modeling, we first propose a new algorithm for the finite-dimensional approximation of the linear transfer Koopman and Perron-Frobenius operator from time-series data. We argue that the existing approach for the finite-dimensional approximation of these transfer operators such as Dynamic Mode Decomposition (DMD) and Extended Dynamic Mode Decomposition (EDMD) do not capture two important properties of these operators, namely positivity and Markov property. The algorithm we propose preserves these two properties. We call the proposed algorithm as naturally structured DMD (NSDMD) since it retains the inherent properties of these operators. Naturally structured DMD algorithm leads to a better approximation of the steady-state dynamics of the system regarding computing Koopman and Perron- Frobenius operator eigenfunctions and eigenvalues. However, preserving positivity property is critical for capturing the real transient dynamics of the system. This positivity property of the transfer operators and it's finite-dimensional approximation play an important role for controller and estimator design of nonlinear systems. To solve the feedback stabilization problem for nonlinear control systems, we tried to take advantage of the Koopman operator framework. The Koopman operator approach provides a linear representation for a nonlinear dynamical system and a bilinear representation for a nonlinear control system. The problem of feedback stabilization of a nonlinear control system is then transformed to the stabilization of a bilinear control system. We propose a control Lyapunov function (CLF)-based approach for the design of stabilizing feedback controllers for the bilinear system. The search for finding a CLF for the bilinear control system is formulated as a convex optimization problem. This leads to a schematic procedure for designing CLF-based stabilizing feedback controllers for the bilinear system and hence the original nonlinear system. Another advantage of the proposed controller design approach outlined in this dissertation is that it does not require explicit knowledge of system dynamics. In particular, the bilinear representation of a nonlinear control system in the Koopman eigenfunction space can be obtained from time-series data. Next, we study the optimal quadratic regulation problem for nonlinear systems. The linear operator theoretic framework involving the Koopman operator is used to lift the dynamics of nonlinear control system to an infinite-dimensional bilinear system. The optimal quadratic regulation problem for nonlinear system is formulated in terms of the finite-dimensional approximation of the bilinear system. A convex optimization-based approach is proposed for solving the quadratic regulator problem for bilinear system. We applied a variety of examples and compared the simulation results between our framework and conventional LQR control using linearized model. For more general optimal control problems, we provide a density-function based convex formulation for the optimal control problem of the nonlinear system. The convex formulation relies on the duality result in the stability theory of a dynamical system involving density function and Perron-Frobenius operator. The optimal control problem is formulated as an infinite-dimensional convex optimization program. The finite-dimensional approximation of the optimization problem relies on the recent advances made in the data-driven computation of the Koopman operator, which is dual to the Perron-Frobenius operator. Simulation results are presented to demonstrate the application of the developed framework.

Huang, Bowen↗

DOE OSTI2014

A semi-analytical solver for the Grad-Shafranov equation

In toroidally confined plasmas, the Grad-Shafranov equation, in general, a non-linear partial differential equation, describes the hydromagnetic equilibrium of the system. This equation becomes linear when the kinetic pressure is proportional to the poloidal magnetic flux and the squared poloidal current is a quadratic function of it. In this work, the eigenvalue of the associated homogeneous equation is related with the safety factor on the magnetic axis, the plasma beta, and the Shafranov shift; then, the adjustable parameters of the particular solution are bounded through physical constrains. The poloidal magnetic flux becomes a linear superposition of independent solutions and its parameters are adjusted with a non-linear fitting algorithm. This method is used to find hydromagnetic equilibria with normal and reversed magnetic shear and defined values of the elongation, triangularity, aspect-ratio, and X-point(s). The resultant toroidal and poloidal beta, the safety factor at the 95% flux surface, and the plasma current are in agreement with usual experimental values for high beta discharges and the model can be used locally to describe reversed magnetic shear equilibria.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2021

Extended Applications of Subgrid Representation in the 2D/1D Method

Recent efforts in MPACT have focused on improving the performance of the 2D/1D subplane implementation to help target computational performance goals. Here, we build on previous efforts that targeted the use of subgrid treatments to improve the accuracy of control rod representation, presenting three additional applications of subgrid treatments with the goal of reducing the computational burden of simulations. These subgrid applications include treatment of spacer grids, thermal feedback, and axial reflector material representation. With these approaches, a single method of characteristics (MOC) plane can contain several different materials axially that are represented explicitly via subgrids on the coarse mesh finite difference (CMFD) mesh but are axially homogenized on the MOC mesh. This allows for a substantial reduction in the number of MOC planes needed in the calculation through the introduction of an approximate treatment, particularly with regard to the self-shielded cross sections and MOC-informed radial current coupling coefficients in CMFD. Several test problems ranging from single rod to quarter core are used to assess the solution accuracy and performance of these various subgrid representations. Overall, the accuracy of the approximations seems very reasonable, with extremely small differences in eigenvalue observed and maximum pin power errors in the 0.5% to 1.0% range. Several cases show substantial value in the compromise between accuracy and computational performance. Others highlight the new computational hurdles that future research will aim to resolve.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2024

Adapting CLUTCH methodology to multigroup TSUNAMI-3D for eigenvalue sensitivity calculations

The sensitivity of the eigenvalue to uncertainties in nuclear data and its evaluation are important for nuclear criticality safety. TSUNAMI-3D sequences within the SCALE code system offer several options to the user community for calculating eigenvalue sensitivity coefficients with multigroup (MG) and continuous energy (CE) 3D transport capabilities. TSUNAMI-3D sequences implement the adjoint-based perturbation theory with MG KENO code, the Contributon Linked eigenvalue sensitivity/Uncertainty estimation via Track length importance CHaracterization (CLUTCH) method with CE KENO code, and the Iterated Fission Probability (IFP) method with CE KENO and Shift codes. Each method has benefits and limitations depending on the problem that is run. The work presented here aims to adapt the CLUTCH method, which enables the Contributon method's mesh-free, memory-efficient approach for calculating adjoint-weighted tallies for sensitivity calculations, to the MG TSUNAMI-3D sequence. This application would eliminate the explicit adjoint KENO calculation, as well as the memory-consuming mesh flux moment tallies required by the conventional MG TSUNAMI-3D. Smaller memory footprints in the CLUTCH methodology and relatively shorter runtimes in MG KENO transport can make MG TSUNAMI-3D a viable method for some complex problems. Moreover, this adaptation allows MG sensitivity calculations with Shift, ORNL's next-generation high-performance Monte Carlo transport code, which currently does not offer any sensitivity capabilities with MG particle transport simulations. Initial implementation of the new MG TSUNAMI-3D sequence and its preliminary results with a selected critical benchmark experiment in the Verified, Archived Library of Inputs and Data (VALID) are presented in this study.

KENO↗

DOE OSTI2022

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↗

DOE OSTI2015

Year End Progress Report on Rattlesnake Improvements

Rattlesnake is a MOOSE-based radiation transport application developed at INL to support modern multi-physics simulations. At the beginning of the last year, Rattlesnake was able to perform steady-state, transient and eigenvalue calculations for the multigroup radiation transport equations. Various discretization schemes, including continuous finite element method (FEM) with discrete ordinates method (SN) and spherical harmonics expansion method (PN) for the self-adjoint angular flux (SAAF) formulation, continuous FEM (CFEM) with SN for the least square (LS) formulation, diffusion approximation with CFEM and discontinuous FEM (DFEM), have been implemented. A separate toolkit, YAKXS, for multigroup cross section management was developed to support Rattlesnake calculations with feedback both from changes in the field variables, such as fuel temperature, coolant density, and etc., and in isotope inventory. The framework for doing nonlinear diffusion acceleration (NDA) within Rattlesnake has been set up, and both NDA calculations with SAAF-SN-CFEM scheme and Monte Carlo with OpenMC have been performed. It was also used for coupling BISON and RELAP-7 for the full-core multiphysics simulations. Within the last fiscal year, significant improvements have been made in Rattlesnake. Rattlesnake development was migrated into our internal GITLAB development environment at the end of year 2014. Since then total 369 merge requests has been accepted into Rattlesnake. It is noted that the MOOSE framework that Rattlesnake is based on is under continuous developments. Improvements made in MOOSE can improve the Rattlesnake. It is acknowledged that MOOSE developers spent efforts on patching Rattlesnake for the improvements made on the framework side. This report will not cover the code restructuring for better readability and modularity and documentation improvements, which we have spent tremendous effort on. It only details some of improvements in the following sections.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2018

Development of a Library for Conducting Monte Carlo Tallies on Heterogeneous Systems

A library is introduced that enables users to conduct Monte Carlo tallies on heterogeneous computing systems. The library can be built with or linked to a Monte Carlo transport code to provide tally capabilities for the project. The library provides a set of tools and an interface for constructing tallies that can be computed on CPUs or GPUs regardless of where the sample data was generated. The library can be incorporated into existing Monte Carlo transport codes at both the research and production level with minimal intrusion into the transport code. The tally library is capable of computing a variety of tallies including track-length histogram (mesh) tallies, collisionbased kernel density estimators, functional expansion tallies, eigenvalue sensitivity coefficients via iterated fission probability, and sensitivities of reaction rates or adjoint-weighted quantities via differential operator sampling. The parallelization methods are discussed and speedups are shown for 2-D and 3-D problems with comparisons to both the tally library CPU implementations as well as the tally capabilities in the host transport code. Performance results and examples are shown for MCNP, MCATK, and OpenMC.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Analyzing Prospects for Quantum Advantage in Topological Data Analysis

Lloyd [Nat. Commun. , 10138 (2016)] were first to demonstrate the promise of quantum algorithms for computing Betti numbers, a way to characterize topological features of data sets. Here, we propose, analyze, and optimize an improved quantum algorithm for topological data analysis (TDA) with reduced scaling, including a method for preparing Dicke states based on inequality testing, a more efficient amplitude estimation algorithm using Kaiser windows, and an optimal implementation of eigenvalue projectors based on Chebyshev polynomials. We compile our approach to a fault-tolerant gate set and estimate constant factors in the Toffoli complexity. Our analysis reveals that superquadratic quantum speedups are only possible for this problem when targeting a multiplicative error approximation and the Betti number grows asymptotically. Further, we propose a dequantization of the quantum TDA algorithm that shows that having exponentially large dimension and Betti number are necessary, but insufficient conditions, for superpolynomial advantage. We then introduce and analyze specific problem examples which have parameters in the regime where superpolynomial advantages may be achieved, and argue that quantum circuits with tens of billions of Toffoli gates can solve seemingly classically intractable instances. Published by the American Physical Society 2024

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

Better band gaps with asymptotically corrected local exchange potentials

In this study, we formulate a spin-polarized van Leeuwen and Baerends (vLB) correction to the local density approximation (LDA) exchange potential [R. van Leeuwen and E. J. Baerends, Phys. Rev. A 49, 2421 (1994)] that enforces the ionization potential (IP) theorem following T. Stein et al. [Phys. Rev. Lett. 105, 266802 (2010)]. For electronic-structure problems, the vLB correction replicates the behavior of exact-exchange potentials, with improved scaling and well-behaved asymptotics, but with the computational cost of semilocal functionals. The vLB + IP correction produces a large improvement in the eigenvalues over those from the LDA due to correct asymptotic behavior and atomic shell structures, as shown in rare-gas, alkaline-earth, zinc-based oxides, alkali halides, sulfides, and nitrides. In half-Heusler alloys, this asymptotically corrected LDA reproduces the spin-polarized properties correctly, including magnetism and half-metallicity. We also consider finite-sized systems [e.g., ringed boron nitride (B 12 N 12 ) and graphene (C 24 )] to emphasize the wide applicability of the method.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2022

A mixed, unified forward/inverse framework for earthquake problems: fault implementation and coseismic slip estimate

SUMMARY We introduce a new finite-element (FE) based computational framework to solve forward and inverse elastic deformation problems for earthquake faulting via the adjoint method. Based on two advanced computational libraries, FEniCS and hIPPYlib for the forward and inverse problems, respectively, this framework is flexible, transparent and easily extensible. We represent a fault discontinuity through a mixed FE elasticity formulation, which approximates the stress with higher order accuracy and exposes the prescribed slip explicitly in the variational form without using conventional split node and decomposition discrete approaches. This also allows the first order optimality condition, that is the vanishing of the gradient, to be expressed in continuous form, which leads to consistent discretizations of all field variables, including the slip. We show comparisons with the standard, pure displacement formulation and a model containing an in-plane mode II crack, whose slip is prescribed via the split node technique. We demonstrate the potential of this new computational framework by performing a linear coseismic slip inversion through adjoint-based optimization methods, without requiring computation of elastic Green’s functions. Specifically, we consider a penalized least squares formulation, which in a Bayesian setting—under the assumption of Gaussian noise and prior—reflects the negative log of the posterior distribution. The comparison of the inversion results with a standard, linear inverse theory approach based on Okada’s solutions shows analogous results. Preliminary uncertainties are estimated via eigenvalue analysis of the Hessian of the penalized least squares objective function. Our implementation is fully open-source and Jupyter notebooks to reproduce our results are provided. The extension to a fully Bayesian framework for detailed uncertainty quantification and non-linear inversions, including for heterogeneous media earthquake problems, will be analysed in a forthcoming paper.

58 GEOSCIENCES↗

DOE OSTI2022

PyAlbany: A Python interface to the C++ multiphysics solver Albany

Albany is a parallel C++ finite element library for solving forward and inverse problems involving partial differential equations (PDEs). In this paper we introduce PyAlbany, a newly developed Python interface to the Albany library. PyAlbany can be used to effectively drive Albany enabling fast and easy analysis and post-processing of applications based on PDEs that are pre-implemented in Albany. PyAlbany relies on the library PyBind11 to bind Python with C++ Albany code. Here we detail the implementation of PyAlbany and showcase its capabilities through a number of examples targeting a heat-diffusion problem. In particular we consider the following: (1) the generation of samples for a Monte Carlo application, (2) a scalability study, (3) a study of parameters on the performance of a linear solver, and finally (4) a tool for performing eigenvalue decompositions of matrix-free operators for a Bayesian inference application.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2013

The Coulomb problem on a 3-sphere and Heun polynomials

The paper studies the quantum mechanical Coulomb problem on a 3-sphere. We present a special parametrization of the ellipto-spheroidal coordinate system suitable for the separation of variables. After quantization we get the explicit form of the spectrum and present an algebraic equation for the eigenvalues of the Runge-Lentz vector. We also present the wave functions expressed via Heun polynomials.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2018

Witnessing eigenstates for quantum simulation of Hamiltonian spectra

The efficient calculation of Hamiltonian spectra, a problem often intractable on classical machines, can find application in many fields, from physics to chemistry. We introduce the concept of an “eigenstate witness” and, through it, provide a new quantum approach that combines variational methods and phase estimation to approximate eigenvalues for both ground and excited states. This protocol is experimentally verified on a programmable silicon quantum photonic chip, a mass-manufacturable platform, which embeds entangled state generation, arbitrary controlled unitary operations, and projective measurements. Both ground and excited states are experimentally found with fidelities >99%, and their eigenvalues are estimated with 32 bits of precision. We also investigate and discuss the scalability of the approach and study its performance through numerical simulations of more complex Hamiltonians. This result shows promising progress toward quantum chemistry on quantum computers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2013

Minimising the error in eigenvalue calculations involving the Boltzmann transport equation using goal-based adaptivity on unstructured meshes

This article presents a method for goal-based anisotropic adaptive methods for the finite element method applied to the Boltzmann transport equation. The neutron multiplication factor, k{sub eff}, is used as the goal of the adaptive procedure. The anisotropic adaptive algorithm requires error measures for k{sub eff} with directional dependence. General error estimators are derived for any given functional of the flux and applied to k{sub eff} to acquire the driving force for the adaptive procedure. The error estimators require the solution of an appropriately formed dual equation. Forward and dual error indicators are calculated by weighting the Hessian of each solution with the dual and forward residual respectively. The Hessian is used as an approximation of the interpolation error in the solution which gives rise to the directional dependence. The two indicators are combined to form a single error metric that is used to adapt the finite element mesh. The residual is approximated using a novel technique arising from the sub-grid scale finite element discretisation. Two adaptive routes are demonstrated: (i) a single mesh is used to solve all energy groups, and (ii) a different mesh is used to solve each energy group. The second method aims to capture the benefit from representing the flux from each energy group on a specifically optimised mesh. The k{sub eff} goal-based adaptive method was applied to three examples which illustrate the superior accuracy in criticality problems that can be obtained.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2018

On semi-convergence and inexact iteration of the GSS iteration method for nonsymmetric singular saddle point problems

In this paper, the generalized shift-splitting (GSS) iteration method is used to solve nonsymmetric singular saddle point systems with the positive real (1, 1)-block sub-matrix. By a careful analysis of the spectral properties of the corresponding iteration matrix, we investigate the semi-convergence property of the GSS iteration method, give the sharper bounds of the eigenvalues for the GSS iteration method and propose the inexact GSS iteration method, also. Numerical experiments are given to show the correctness of the theoretical analysis and the feasibility of the GSS preconditioner with appropriate parameters.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

MPACT Subgroup Self-Shielding Efficiency Improvements

Recent developments to improve the efficiency of the MOC solvers in MPACT have yielded effective kernels that loop over several energy groups at once, rather that looping over one group at a time. These kernels have produced roughly a 2x speedup on the MOC sweeping time during eigenvalue calculation. However, the self-shielding subgroup calculation had not been reevaluated to take advantage of these new kernels, which typically requires substantial solve time. The improvements covered in this report start by integrating the multigroup kernel concepts into the subgroup calculation, which are then used as the basis for further extensions. The next improvement that is covered is what is currently being termed as “Lumped Parameter MOC”. Because the subgroup calculation is a purely fixed source problem and multiple sweeps are performed only to update the boundary angular fluxes, the sweep procedure can be condensed to allow for the instantaneous propagation of the flux across a spatial domain, without the need to sweep along all segments in a ray. Once the boundary angular fluxes are considered to be converged, an additional sweep that will tally the scalar flux is completed. The last improvement that is investigated is the possible reduction of the number of azimuthal angles per octant in the shielding sweep. Typically 16 azimuthal angles per octant are used for self-shielding and eigenvalue calculations, but it is possible that the self-shielding sweeps are less sensitive to the number of angles than the full eigenvalue calculation.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2016

Lieb-Liniger-like model of quantum solvation in CO-{sup 4}He{sub N} clusters

Small {sup 4}He clusters doped with various molecules allow for the study of “quantum solvation” as a function of cluster size. A peculiarity of quantum solvation is that, as the number of {sup 4}He atoms is increased from N = 1, the solvent appears to decouple from the molecule which, in turn, appears to undergo free rotation. This is generally taken to signify the onset of “microscopic superfluidity.” Currently, little is known about the quantum mechanics of the decoupling mechanism, mainly because the system is a quantum (N + 1)-body problem in three dimensions which makes computations difficult. Here, a one-dimensional model is studied in which the {sup 4}He atoms are confined to revolve on a ring and encircle a rotating CO molecule. The Lanczos algorithm is used to investigate the eigenvalue spectrum as the number of {sup 4}He atoms is varied. Substantial solvent decoupling is observed for as few as N = 5 {sup 4}He atoms. Examination of the Hamiltonian matrix, which has an almost block diagonal structure, reveals increasingly weak inter-block (solvent-molecule) coupling as the number of {sup 4}He atoms is increased. In the absence of a dopant molecule the system is similar to a Lieb-Liniger (LL) gas and we find a relatively rapid transition to the LL limit as N is increased. In essence, the molecule initially—for very small N—provides a central, if relatively weak, attraction to organize the cluster; as more {sup 4}He atoms are added, the repulsive interactions between the identical bosons start to dominate as the solvation ring (shell) becomes more crowded which causes the molecule to start to decouple. For low N, the molecule pins the atoms in place relative to itself; as N increases the atom-atom repulsion starts to dominate the Hamiltonian and the molecule decouples. We conclude that, while the notion of superfluidity is a useful and correct description of the decoupling process, a molecular viewpoint provides complementary insights into the quantum mechanism of the transition from a molecular cluster to a quantum solvated molecule.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2019

Adaptive Reweighted Variance Estimation for Monte Carlo Eigenvalue Simulations

Monte Carlo (MC) simulation is used to solve the eigenvalue form of the Boltzmann transport equation to estimate various parameters such as fuel pin flux distributions that are crucial for the safe and efficient operation of nuclear systems (e.g., a nuclear reactor). Monte Carlo eigenvalue simulation uses a sample mean over many stationary cycles (iterations) to estimate various parameters important to nuclear systems. A variance estimate of the sample mean is often used for calculating the confidence intervals. However, MC eigenvalue simulation variance estimators that ignore the intercycle correlation underestimate the true variance of the estimated quantity. This paper presents novel data-adaptive approaches based on a simple autoregressive (AR) model and sigmoid functions to improve MC variance estimation. The standard MC sample-based variance estimator (or naïve estimator) and the spectral density–based MC variance estimator are enhanced by adding data-adaptive components that reduce their bias and improve performance. By investigating the frequency pattern of the AR(1) (order 1) model, two adaptive spectral estimators and one adaptive naïve estimator are proposed. The proposed estimators manifest superior performance when applied to three test problems compared to the standard spectral density–based estimator previously introduced by the authors. In conclusion, these new estimators are straightforward, as they use online algorithms and do not require storage of tallies from all active cycles.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗