Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mathematics and Computing, Physics”

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 505 records · Page 28

MCNP ® Code Version 6.3.0 Verification & Validation Testing

This report describes the verification and validation testing performed on MCNP ® code version 6.3.0. The purpose of this report is to act as a compendium of test suite descriptions and results. Accordingly the document is divided into two parts. Part I (this part) describes each test suite in the following sections. Part II provides the results of testing each suite and comparisons to experimental and/or alternative computational results, as appropriate.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Spherical Kernel Density Estimators For Monte Carlo Radiation Transport Problems

Recently, there has been interest in creating alternatives to histograms (mesh tallies) for estimating spatially-distributed quantities such as scalar flux and reaction rate densities. Kernel Density Estimators (KDEs) are non-parametric estimators that obtain estimates of the underlying distribution at user-defined points without having to specify an underlying mesh, and the uncertainty at those points is independent of the number of tally points used in the simulation. This has led to the investigation of KDEs as an attractive potential alternative to histogram tallies in Monte Carlo radiation transport simulations for reactor physics problems and shielding applications. A KDE was recently created specifically for cylindrical geometries that is capable of producing smooth and accurate estimates of flux and reaction rate densities in reactor physics problems. This work extends the cylindrical KDE and cylindrical Mean Free Path (MFP) KDE to spherical geometries and verifies the spherical KDE on bare and reflected critical benchmark problems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Development of a Test System for Verification and Validation of Nuclear transport Simulations

Verification and validation of nuclear data is critical to the accuracy of both stochastic and deterministic particle transport codes. In order to effectively test a set of nuclear data, the data must be applied to a wide variety of transport problems. Performing this task in a timely, efficient manner is tedious. The nuclear data team at Los Alamos National laboratory in collaboration with the University of Florida has developed a methodology to automate the process of nuclear data verification and validation (V and V). This automated V and V process can efficiently test a number of data libraries using well defined benchmark experiments, such as those in the International Criticality Safety Benchmark Experiment Project (ICSBEP). The process is implemented through an integrated set of Python scripts. Material and geometry data are read from an existing medium or given directly by the user to generate a benchmark experiment template file. The user specifies the choice of benchmark templates, codes, and libraries to form a V and V project. The Python scripts generate input decks for multiple transport codes from the templates, run and monitor individual jobs, and parse the relevant output automatically. The output can then be used to generate reports directly or can be stored into a database for later analysis. This methodology eases the burden on the user by reducing the amount of time and effort required for obtaining and compiling calculation results. The resource savings by using this automated methodology could potentially be an enabling technology for more sophisticated data studies, such as nuclear data uncertainty quantification. Once deployed, this tool will allow the nuclear data community to more thoroughly test data libraries leading to higher fidelity data in the future.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Construction of mutually unbiased bases with cyclic symmetry for qubit systems

For the complete estimation of arbitrary unknown quantum states by measurements, the use of mutually unbiased bases has been well established in theory and experiment for the past 20 years. However, most constructions of these bases make heavy use of abstract algebra and the mathematical theory of finite rings and fields, and no simple and generally accessible construction is available. This is particularly true in the case of a system composed of several qubits, which is arguably the most important case in quantum information science and quantum computation. In this paper, we close this gap by providing a simple and straightforward method for the construction of mutually unbiased bases in the case of a qubit register. We show that our construction is also accessible to experiments, since only Hadamard and controlled-phase gates are needed, which are available in most practical realizations of a quantum computer. Moreover, our scheme possesses the optimal scaling possible, i.e., the number of gates scales only linearly in the number of qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reducing the complexity of finite-temperature auxiliary-field quantum Monte Carlo

The auxiliary-field quantum Monte Carlo (AFMC) method is a powerful and widely used technique for ground-state and finite-temperature simulations of quantum many-body systems. Here we introduce several algorithmic improvements for finite-temperature AFMC calculations of dilute fermionic systems that reduce the computational complexity of most parts of the algorithm. This is principally achieved by reducing the number of single-particle states that contribute at each configuration of the auxiliary fields to a number that is of the order of the number of fermions. Our methods are applicable for both the canonical and grand-canonical ensembles. We demonstrate the reduced computational complexity of the methods for the homogeneous unitary Fermi gas.

67.85.Lm↗

Python Group Additivity (pGrAdd) software for estimating species thermochemical properties

ncreasingly complex chemistry models require thermochemical data for many species often estimated from costly first-principles DFT computations. Here we introduce the Python Group Additivity software (pGrAdd) that implements comprehensive group additivity in a simple, modular, lightweight Python package that is extensible and easy to implement. It includes 6 group additivity databases for gas species and Pt(111) adsorbates allowing users to immediately compute thermochemical properties for a wide range of molecules and build new databases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Anti-$\mathscr{PT}$-symmetric qubit: Decoherence and entanglement entropy

We investigate the dynamics of a general two-level based anti-parity-time (anti-$\mathscr{PT}$)-symmetric qubit and study its decoherence as well as entanglement entropy properties. We compare our findings with that of the corresponding parity-time ($\mathscr{PT}$)-symmetric and Hermitian qubits. To begin, we consider the time-dependent Dyson map to find the exact analytical dynamics for a general non-Hermitian qubit system weakly coupled with a thermal bath for pure dephasing, before specializing it to the case of a general anti-$\mathscr{PT}$-symmetric qubit. Basing the comparison under the same coupling strength or increasing the non-Hermiticity, we observe that the decoherence function and entanglement entropy of the anti-$\mathscr{PT}$-symmetric qubit decays and grows more slowly, respectively, compared to the $\mathscr{PT}$-symmetric and Hermitian qubits. Similarly, the corresponding variance and area of Fisher information are much higher compared to the $\mathscr{PT}$-symmetric and Hermitian qubits. These results demonstrate that anti-$\mathscr{PT}$-symmetric qubits may be better suited for quantum computing and quantum information processing applications than conventional Hermitian or even $\mathscr{PT}$-symmetric qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Short-Depth QAOA circuits and Quantum Annealing on Higher-Order Ising Models (Rev.2)

The Quantum Alternating Operator Ansatz (QAOA) and Quantum Annealing (QA) are quantum algorithms that are both based on the adiabatic theorem and both have the goal of sampling the optimal solution(s) of combinatorial optimization problems. Quantum annealing has been physically instantiated on D-Wave devices using superconducting flux qubits, and QAOA can be programmed on digital gate-model quantum computers such as the programmable superconducting transmon qubits devices of the IBMQ series, for instance ibm washington. QAOA and QA address the same types of problems, but it is unclear how they will scale to large problem sizes and to larger and higher-fidelity quantum computers. In this article, we present a direct comparison between QAOA, one and two rounds, run on all 127 qubits of ibm washington and QA run on D-Wave Advantage system4.1 and Advantage system6.1. The problems which allow for this comparison are random Ising model problems whose connectivity matches the heavy hexagonal lattice topology of ibm washington and the Pegasus graph connectivity of the two D-Wave devices. We create two classes of problem instances for this comparison: one with higher order terms (ZZZ variable interactions), linear terms, and quadratic terms, and a separate problem type with only linear and quadratic terms. Our QAOA circuits are novel and extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of ibm washington’s heavy hexagonal lattice and can be applied to future heavy-hex chips. We also test the effectiveness of the error suppression technique digital dynamical decoupling on the QAOA circuits. The QAOA circuits compiled to ibm washington are composed of several thousand circuit instructions, approximately 3, 000 depending on the details of the circuit, making these some the largest quantum circuits ever executed on a digital quantum processor. QAOA and QA are compared against the classical heuristic algorithm of simulated annealing and all problem instances are exactly solved using CPLEX in order to evaluate which samplers, if any, correctly found the ground state solution(s) of the problem instances. We find that (i) QA outperforms QAOA on all problem instances, (ii) QAOA samples the problems better than random sampling, and (iii) QAOA angle computation exhibits clear parameter concentration across the ensemble of Ising models.

127 Qubits↗

A WENO-solver combined with adaptive momentum discretization for the Wigner transport equation and its application to resonant tunneling diodes

We present a novel numerical scheme for the deterministic solution of the Wigner transport equation, especially suited to deal with situations in which strong quantum effects are present. The unique feature of the algorithm is the expansion of the Wigner function in local basis functions, similar to finite element or finite volume methods. This procedure yields a discretization of the pseudo-differential operator that conserves the particle density on arbitrarily chosen grids. The high flexibility in refining the grid spacing together with the weighted essentially non-oscillatory (WENO) scheme for the advection term allows for an accurate and well-resolved simulation of the phase space dynamics. A resonant tunneling diode is considered as test case and a detailed convergence study is given by comparing the results to a non-equilibrium Green's functions calculation. The impact of the considered domain size and of the grid spacing is analyzed. The obtained convergence of the results towards a quasi-exact agreement of the steady state Wigner and Green's functions computations demonstrates the accuracy of the scheme, as well as the high flexibility to adjust to different physical situations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analytic Modeling of a Deep Shielding Problem

Previous generations of scientists would make tremendous efforts to simplify non-tractable problems and generate simpler models that preserved the fundamental physics. This process involved applying assumptions and simplifications to reduce the complexity of the problem until it reached a solvable form. Each assumption and simplification was chosen and applied with the intent to preserve the essential physics of the problem, since, if the core physics of the problem were eliminated, the simplified model served no purpose. Moreover, if done correctly, solutions to the reduced model would serve as useful approximations to the original problem. In a sense, solving the simple models laid the ground-work for and provided insight into the more complex problem. Today, however, the affordability of high performance computing has essentially replaced the process for analyzing complex problems. Rather than \building up" a problem by understanding smaller, simpler models, a user generally relies on powerful computational tools to directly arrive at solutions to complex problems. As computational resources grow, users continue trying to simulate new, more complex, or more detailed problems, resulting in continual stress on both the code and computational resources. When these resources are limited, the user will have to make concessions by simplifying the problem while trying to preserve important details. In the context of MCNP, simplifications typically come as reductions in geometry, or by using variance reduction techniques. Both approaches can influence the physics of the problem, leading to potentially inaccurate or non-physical results. Errors can also be introduced as a result of faulty input into a computational tool: something as simple as transposing numbers in a tally input can result in incorrect answers.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Modeling the Ex-core Detector Response into a Production Option in MPACT

In the past few years, the Consortium for Advanced Simulation of Light Water Reactors (CASL) has overseen a successful activity to extend the radiation transport capability from the reactor in-core geometry to the ex-core geometry by coupling the deterministic neutronics code MPACT, with the Monte Carlo code Shift. However, transient problems such as RIAs require an efficient prediction of the ex-core detector response to determine the timeframe for a reactor trip. Therefore, in addition to the high-fidelity MPACT-Shift coupled calculation, separate efforts have been made to explore simplified methods for ex-core detector response with MPACT standalone calculation. In a previous milestone L3_RTM.MCH.P17.06, several simplified methods for ex-core detector response were developed in MPACT. In particular, the double kernel method is based on the default MPACT core geometry, so extensive modeling or transport calculation with full reflector and ex-core details are not needed in this method. Since the 1-D diffusion and neutron streaming kernels are used for extended ex-core calculations, the extra computational efforts are very small. The work implemented in the current milestone provides a fully integrated option for MPACT to approximately calculate the ex-core detector response using the double kernel method. To overcome the difficulty of obtaining the consistent diffusion coefficients (these were obtained through separate CMFD calculation and edits), the 1-D diffusion solver is replaced by a 1-D Sn transport solver to compute the neutron flux at the vessel outer surface. The new VERA inputs for ex-core detector are processed in MPACT. The detector signals are linked to the SCRAM logic as an option to trip the core during transient calculation. Two sets of 3-D quarter core problems are run with MPACT standalone and VeraShift to verify the radial and axial effects on detector response by varying the moderator density and control rod position. For the cases with moderator density changes, the detector responses from MPACT are within 2 sigma error of VeraShift. For the cases at different control rod positions, the axial offsets computed from MPACT are within 2% error of VeraShift results.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Multilevel ensemble Kalman filtering

This study embeds a multilevel Monte Carlo sampling strategy into the Monte Carlo step of the ensemble Kalman filter (EnKF) in the setting of finite dimensional signal evolution and noisy discrete-time observations. The signal dynamics is assumed to be governed by a stochastic differential equation (SDE), and a hierarchy of time grids is introduced for multilevel numerical integration of that SDE. Finally, the resulting multilevel EnKF is proved to asymptotically outperform EnKF in terms of computational cost versus approximation accuracy. The theoretical results are illustrated numerically.

ltering↗

Space-time least-squares Petrov-Galerkin projection in nonlinear model reduction.

Our work proposes a space-time least-squares Petrov-Galerkin (ST-LSPG) projection method for model reduction of nonlinear dynamical systems. In contrast to typical nonlinear model-reduction methods that first apply Petrov-Galerkin projection in the spatial dimension and subsequently apply time integration to numerically resolve the resulting low-dimensional dynamical system, the proposed method applies projection in space and time simultaneously. To accomplish this, the method first introduces a low-dimensional space-time trial subspace, which can be obtained by computing tensor decompositions of state-snapshot data. The method then computes discrete-optimal approximations in this space-time trial subspace by minimizing the residual arising after time discretization over all space and time in a weighted ℓ 2 -norm. This norm can be de ned to enable complexity reduction (i.e., hyper-reduction) in time, which leads to space-time collocation and space-time GNAT variants of the ST-LSPG method. Advantages of the approach relative to typical spatial-projection-based nonlinear model reduction methods such as Galerkin projection and least-squares Petrov-Galerkin projection include: (1) a reduction of both the spatial and temporal dimensions of the dynamical system, (2) the removal of spurious temporal modes (e.g., unstable growth) from the state space, and (3) error bounds that exhibit slower growth in time. Numerical examples performed on model problems in fluid dynamics demonstrate the ability of the method to generate orders-of-magnitude computational savings relative to spatial-projection-based reduced-order models without sacrificing accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Verification assessment of piston boundary conditions for Lagrangian simulation of compressible flow similarity solutions

This work is concerned with the use of similarity solutions of the compressible flow equations as benchmarks or verification test problems for finite-volume compressible flow simulation software. In practice, this effort can be complicated by the infinite spatial/temporal extent of many candidate solutions or “test problems.” Methods can be devised with the intention of ameliorating this inconsistency with the finite nature of computational simulation; the exact strategy will depend on the code and problem archetypes under investigation. For example, self-similar shock wave propagation can be represented in Lagrangian compressible flow simulations as rigid boundary-driven flow, even if no such “piston” is present in the counterpart mathematical similarity solution. The purpose of this work is to investigate in detail the methodology of representing self-similar shock wave propagation as a piston-driven flow in the context of various test problems featuring simple closed-form solutions of infinite spatial/temporal extent. The closed-form solutions allow for the derivation of similarly closed-form piston boundary conditions (BCs) for use in Lagrangian compressible flow solvers. Finally, the consequences of utilizing these BCs (as opposed to directly initializing the self-similar solution in a computational spatial grid) are investigated in terms of common code verification analysis metrics (e.g., shock strength/position errors and global convergence rates).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

(U) Calculating First-Order Sensitivities to Material Density and Composition in Fixed-Source Problems Using the MCNP6 Perturbation Capability

The Taylor series (differential operator) perturbation method, as implemented in the PERT capability in MCNP6 (Ref. 1), can be used for first-order sensitivity analyses in fixed-source problems.2 Sensitivities of a response with respect to material and nuclide densities can be used for efficient first-order uncertainty quantification. This report discusses how to compute sensitivities of material densities and compositions in order to propagate uncertainties using the standard uncertainty propagation formula.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗