Search NASA⌕ Search

SEARCH · Search NASA

Results for “Physics - Plasma physics , Mathematics and Computing”

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 631 records · Page 35

The Improved Simple Corner Balance Method and Efforts to Enhance its Computational Performance

The diamond difference (DD) spatial discretization has long been a work horse of the neutron transport community. For nearly as long as DD has been used in neutron transport, it has been observed that DD produces undamped, non-physical angular fluxes in spatially under resolved problems and can fail in the thick diffusion limit. A long list of alternative spatial discretizations, all with better physics properties: accuracy, robustness, and/or preservation of the thick diffusion limit, have been proposed as alternatives to DD. Unfortunately, these alternative spatial discretizations also require significantly more floating point operations (FLOPs) per unknown compared to DD. Historically, neutron transport problems of interest have been able to be resolved sufficiently that DD is accurate enough and FLOPs have been the computational performance bottleneck controlling time to solution. Thus, in practice DD has been and remains a preferred spatial discretization for neutron transport simulations. Trends in computing architecture are leading to a new paradigm where data movement, not FLOPs will control time to solution. This presents an opportunity to improve neutron transport physics by reconsidering more FLOP intensive spatial discretization than DD without incurring a time to solution penalty. In this work, we consider the improved simple corner balance (ISCB) spatial discretization, a unique alternative to DD that has the same memory footprint as DD, and detail efforts to improve its computational performance. The ISCB spatial discretization is a more FLOP intensive spatial discretization than DD with the same memory footprint as DD. Though designed to maximize FLOP intensity, third party libraries such as LAPACK are not tuned for the unique, frequent, small linear algebra needs of neutron transport problems. While hand coding a sparse Gauss elimination is likely to be faster than a dense matrix solve (CM vs. HGE), were LAPACK suitable for small linear algebra problems, we would not have seen a performance increase with decreased numbers of LAPACK calls for the Schur complement solve (SC4 vs. SC1). Significant effort has reduced the relative compute time of ISCB to DD, but on current computer architectures DD is still faster than ISCB. Future work comparing the overall efficiency of ISCB to DD may reveal that while ISCB is slower than DD on current computers, ISCB is more accurate than DD by a factor greater than the compute time slowdown. As new computer architectures become available, we will test our hypothesis that neutron transport simulations will be bandwidth limited, ideally rendering the additional FLOPs required by ISCB to be 'free' [in terms of time to solution]. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Perspective on Sustainable Computational Chemistry Software Development and Integration

The power of quantum chemistry to predict the ground and excited state properties of complex chemical systems has driven the development of computational quantum chemistry software, integrating advances in theory, applied mathematics, and computer science. The emergence of new computational paradigms associated with exascale technologies also poses significant challenges that require a flexible forward strategy to take full advantage of existing and forthcoming computational resources. In this context, the sustainability and interoperability of computational chemistry software development are among the most pressing issues. In this perspective, we discuss software infrastructure needs and investments with an eye to fully utilize exascale resources and provide unique computational tools for next-generation science problems and scientific discoveries.

36 MATERIALS SCIENCE↗

IBM Open Science Price - SWAP Gate Challenge

On November 30, 2020, IBM announced an open science price competition aimed at improving the fidelity of a SWAP gate on their 7 qubit Quantum system named ”Casablanca”. The details of the SWAP gate problem was outlined in a Jupyter notebook, which utilizes the IBM developed open source package Qiskit. The participants were allowed to work in teams with up to five people and restricted to only use open source software in solving the problem. Their results were due on April 16, 2021. Our approach to solving the SWAP gate challenge is based on the quantum optimal control techniques implemented in our open source packages Juqbox.jl and Quandary. The results from the optimal control approach is only as good as the accuracy in the description of the quantum system dynamics, characterized by a Hamiltonian model that was provided by IBM. Based on the calibrated control pulses IBM provide for the standard gate set, we developed a reverse engineering approach to calibrate our computational model. Techniques were developed to translate between Qiskit’s pulse representation and the B-spline formulation used in Juqbox and Quandary. The fidelity of the optimized pulse sequences were estimated using Qiskit’s randomized bench marking techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Continuous-Estimator Representation for Monte Carlo Criticality Diagnostics [Slides]

An alternate means of computing diagnostics for Monte Carlo criticality calculations is proposed. Overlapping spherical regions or estimators are placed covering the fissile material with a minimum center-to-center separation of the 'fission distance', which is defined herein, and a radius that is some multiple thereof. Fission neutron production is recorded based upon a weighted average of proximities to centers for all the spherical estimators. These scores are used to compute the Shannon entropy, and shown to reproduce the value, to within an additive constant, determined from a well-placed mesh by a user. The spherical estimators are also used to assess statistical coverage.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Progress on Institutional Computing Urban EMP project (2012)

The purpose of the Institutional Computing Urban EMP project is to simulate NUDET (nuclear detonation) in an urban environment, and determine what forensic information can be obtained from the resulting EMP (electromagnetic pulse) produced by the detonation. The effect of EMP on telecommunications and power infrastructure is also being studied.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Quantum chaos in one dimension?

In this work we investigate the inverse of the celebrated Bohigas-Giannoni-Schmit conjecture. Using two inversion methods we compute a one-dimensional potential whose lowest N eigenvalues obey random matrix statistics. Our numerical results indicate that in the asymptotic limit N{yields}{infinity} the solution is nowhere differentiable and most probably nowhere continuous. Thus such a counterexample does not exist.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Basic Research Needs in Quantum Computing and Networking

Employing quantum mechanical resources in computing, information processing, and networking opens the door to potential exponential advantages over classical counterparts. However, quantifying and realizing such advantages poses extensive scientific and engineering challenges. Department of Energy (DOE) investments have driven steady progress in addressing such challenges. Recently developed quantum algorithms offer asymptotic exponential advantages in speed or accuracy for fundamental scientific problems. These problems include simulating physical systems, solving systems of linear equations, differential equations, and optimization problems. Empirical demonstrations on nascent quantum hardware suggest better performance on contrived computational tasks than classical analogs. However, the requirements for a quantum computer or network to demonstrate an end-to-end rigorously quantifiable performance improvement over classical analogs remains a grand challenge, especially for problems of practical value. In particular, what will be required for quantum technology to ultimately exhibit scalable, rigorous, and transformative performance advantages for practical applications? In July 2023, DOE’s Advanced Scientific Computing Research program in the Office of Science convened the Workshop on Basic Research Needs in Quantum Computing and Networking, where major opportunities and grand challenges were identified. The following five priority research directions (PRDs) were identified as a result of the workshop.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Self-referenced continuous-variable quantum key distribution

Various technologies for continuous-variable quantum key distribution without transmitting a transmitter's local oscillator are described herein. A receiver on an optical transmission channel uses an oscillator signal generated by a light source at the receiver's location to perform interferometric detection on received signals. An optical reference pulse is sent by the transmitter on the transmission channel and the receiver computes a phase offset of the transmission based on quadrature measurements of the reference pulse. The receiver can then compensate for the phase offset between the transmitter's reference and the receiver's reference when measuring quadratures of received data pulses.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SDA: a symbolic differential algebra package in C++

Truncated Power Series Algebra (TPSA), or Differential Algebra (DA), is a well-established tool in accelerator physics, commonly used for generating high-order maps of dynamic systems, as well as in symplectic tracking, normal form analysis, verified integration, optimization, and fast multipole methods. This package is the first to perform symbolic DA computations, enabling traceability of initial condition contributions and runtime reduction for repeated DA calculations, potentially expanding DA’s applications.

97 MATHEMATICS AND COMPUTING↗

A Scalable O(N) Algorithm for Large-Scale Parallel First-Principles Molecular Dynamics Simulations

Traditional algorithms for first-principles molecular dynamics (FPMD) simulations only gain a modest capability increase from current petascale computers, due to their O(N 3 ) complexity and their heavy use of global communications. To address this issue, we are developing a truly scalable O(N) complexity FPMD algorithm, based on density functional theory (DFT), which avoids global communications. The computational model uses a general nonorthogonal orbital formulation for the DFT energy functional, which requires knowledge of selected elements of the inverse of the associated overlap matrix. We present a scalable algorithm for approximately computing selected entries of the inverse of the overlap matrix, based on an approximate inverse technique, by inverting local blocks corresponding to principal submatrices of the global overlap matrix. The new FPMD algorithm exploits sparsity and uses nearest neighbor communication to provide a computational scheme capable of extreme scalability. Accuracy is controlled by the mesh spacing of the finite difference discretization, the size of the localization regions in which the electronic orbitals are confined, and a cutoff beyond which the entries of the overlap matrix can be omitted when computing selected entries of its inverse. We demonstrate the algorithm's excellent parallel scaling for up to O(100K) atoms on O(100K) processors, with a wall-clock time of O(1) minute per molecular dynamics time step.

36 MATERIALS SCIENCE↗

Physics in the Machine: Integrating Physical Knowledge in Autonomous Phase-Mapping

Application of artificial intelligence (AI), and more specifically machine learning, to the physical sciences has expanded significantly over the past decades. In particular, science-informed AI, also known as scientific AI or inductive bias AI, has grown from a focus on data analysis to now controlling experiment design, simulation, execution and analysis in closed-loop autonomous systems. The CAMEO (closed-loop autonomous materials exploration and optimization) algorithm employs scientific AI to address two tasks: learning a material system’s composition-structure relationship and identifying materials compositions with optimal functional properties. By integrating these, accelerated materials screening across compositional phase diagrams was demonstrated, resulting in the discovery of a best-in-class phase change memory material. Key to this success is the ability to guide subsequent measurements to maximize knowledge of the composition-structure relationship, or phase map. In this work we investigate the benefits of incorporating varying levels of prior physical knowledge into CAMEO’s autonomous phase-mapping. This includes the use of ab-initio phase boundary data from the AFLOW repositories, which has been shown to optimize CAMEO’s search when used as a prior.

97 MATHEMATICS AND COMPUTING↗

Addressing Over-Solving in Multiphysics Codes with Nested Solvers

Examples of multiphysics problems in the field of nuclear engineering are numerous. For light water reactors the coupling of neutronics with thermal-hydraulics is the most predominant. Often this coupling is modeled by combining existing codes in a Picard Iteration scheme, that is, by solving one physics then using that answer to solve the other and iterating until both answers stabilize. However, simply solving to a high precision on every Picard (multiphysics) iteration is much less efficient than progressively solving to higher precisions. This unneeded work is known as over-solving. Over-solving in single-physics solvers has been studied previously for the Newton method and Chebyshev iteration. Both of these methods solve an inner linear problem that determines the next update step for the outer loop. If the inner problem is solved to a high precision in every outer iteration, the result will be substantially more computational expense (over-solving) and a higher probability of reaching the 'wrong' solution. Methods for reducing over-solving in partitioned multiphysics codes have only been developed recently. This work introduces further improvements, including an investigation of over-solving methods on both the multiphysics and single-physics levels.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Binary Optimal Control of Single-Flux-Quantum Pulse Sequences

We introduce a binary, relaxed gradient, trust-region method for optimizing pulse sequences for single flux quanta (SFQ) control of a quantum computer. The pulse sequences are optimized with the goal of realizing unitary gate transformations. Each pulse has a fixed amplitude and duration. Here we model this process as an binary optimal control problem, constrained by Schrödinger’s equation, where the binary variables indicate whether each pulse is on or off. We introduce a first-order trust-region method, which takes advantage of a relaxed gradient to determine an optimal pulse sequence that minimizes the gate infidelity, while also suppressing leakage to higher energy levels. The proposed algorithm has a computational complexity of O(p log(p)), where p is the number of pulses in the sequence. We present numerical results for the H and X gates, where the optimized pulse sequences give gate fidelity’s better than 99.9%, in ≈ 25 trust-region iterations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improving deep learning performance for predicting large-scale geological ${{CO}_{2}}$ sequestration modeling through feature coarsening

Physics-based reservoir simulation for fluid flow in porous media is a numerical simulation method to predict the temporal-spatial patterns of state variables (e.g. pressure p) in porous media, and usually requires prohibitively high computational expense due to its non-linearity and the large number of degrees of freedom (DoF). This work describes a deep learning (DL) workflow to predict the pressure evolution as fluid flows in large-scale 3-dimensional(3D) heterogeneous porous media. In particular, we develop an efficient feature coarsening technique to extract the most representative information and perform the training and prediction of DL at the coarse scale, and further recover the resolution at the fine scale by spatial interpolation. We validate the DL approach to predict pressure field against physics-based simulation data for a field-scale 3D geologic CO 2 sequestration reservoir model. We evaluate the impact of feature coarsening on DL performance, and observe that the feature coarsening not only decreases the training time by >74% and reduces the memory consumption by >75%, but also maintains temporal error 0.63% on average. Besides, the DL workflow provides predictive efficiency with 1406 times speedup compared to physics-based numerical simulation. The key findings from this research significantly improve the training and prediction efficiency of deep learning model to deal with large-scale heterogeneous reservoir models, and thus it can also be further applied to accelerate workflows of history matching and reservoir optimization for close-loop reservoir management.

58 GEOSCIENCES↗

An Analytic Benchmark for the Solution to the Isotopic Fission Spectrum Mixture Problem

In neutron transport calculations, it is common to specify material compositions in terms of constituent isotopes. Material compositions may be described by isotope number densities and associated microscopic cross sections. For general reaction cross sections, the macroscopic cross sections of a composition are simply the summation of the sum of the products of isotope number densities and microscopic cross sections. A notable exception is the mixture of the neutron fission spectrum in fissile material. To demonstrate proper and improper mixture of the neutron fission spectrum, a zero-dimensional test problem is developed. Using the test problem, it is demonstrated that the improper mixing of the fission spectrum results in an eigenvalue error of approximately 65 pcm. Though this may seem small, any error in such a simple calculation is unacceptable. In similar infinite-homogeneous test problems, eigenvalue errors of more than 300 pcm have been observed. It is also shown that the error due to fission spectrum mixing can be exaggerated for computer program verification purposes. It is concluded that the proper mixture of the neutron fission spectrum is essential for accurate neutron transport simulations. The effect of improper neutron fission spectrum mixture is demonstrated and quantified and this test problem may be used for verification purposes in the future.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

IHT: Tools for Computing Insolation Absorption by Particle Laden Flows

This report describes IHT, a toolkit for computing radiative heat exchange between particles. Well suited for insolation absorption computations, it is also has potential applications in combustion (sooting flames), biomass gasification processes and similar processes. The algorithm is based on the 'Photon Monte Carlo' approach and implemented in a library that can be interfaced with a variety of computational fluid dynamics codes to analyze radiative heat transfer in particle-laden flows. The emphasis in this report is on the data structures and organization of IHT for developers seeking to use the IHT toolkit to add Photon Monte Carlo capabilities to their own codes.

09 BIOMASS FUELS↗

"K-Effective of the World" and Other Concerns for Monte Carlo Eigenvalue Calculations

Monte Carlo methods have been used to compute k eff and the fundamental model eigenfunction of critical systems since the 1950s. Despite the sophistication of today's Monte Carlo codes for representing realistic geometry and physics interactions, correct results can be obtained in criticality problems only if users pay attention to source convergence in the Monte Carlo iterations and to running a sufficient number of neutron histories to adequately sample all significant regions of the problem. Recommended best practices for criticality calculations are reviewed and applied to several practical problems for nuclear reactors and criticality safety, including the "K-effective of the World" problem. Numerical results illustrate the concerns about convergence and bias. The general conclusion is that with today's high-performance computers, improved understanding of the theory, new tools for diagnosing convergence (e.g., Shannon entropy of the fission distribution), and clear practical guidance for performing calculations, practitioners will have a greater degree of confidence than ever of obtaining correct results for Monte Carlo criticality calculations.

61 RADIATION PROTECTION AND DOSIMETRY↗

DUNE Data Management: Network Visualization Monitoring Software

Fermilab’s fagship Deep Underground Neutrino Experiment (DUNE) seeks to better understand the nature of neutrinos within the context of Leptogenesis, neutrino oscillations, multi-messenger Astronomy, and other scientifc phenomena. The experiment will send a beam of neutrinos from the Fermilab site in Illinois to the Sanford Underground Neutrino Facility (SURF) in South Dakota, generating petabytes of scientifc data. Given the high volume of data expected when measurements begin at the end of the decade, DUNE computing and the data management group must carefully monitor data transfers across the 15 remote storage sites and, more generally, the 36 global DUNE computing sites. This report will describe both the frontend and backend data monitoring software designed to analyze and visualize these data transfers. Specifc emphasis will be placed on the software’s setup, usage, and methods for future implementations. The full software code can be found under the DUNE/data-mgmt-testing GitHub repository.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗