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 685 records · Page 38

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↗

Monte Carlo methods and their analysis for Coulomb collisions in multicomponent plasmas

Highlights: •A general approach to Monte Carlo methods for multicomponent plasmas is proposed. •We show numerical tests for the two-component (electrons and ions) case. •An optimal choice of parameters for speeding up the computations is discussed. •A rigorous estimate of the error of approximation is proved. -- Abstract: A general approach to Monte Carlo methods for Coulomb collisions is proposed. Its key idea is an approximation of Landau–Fokker–Planck equations by Boltzmann equations of quasi-Maxwellian kind. It means that the total collision frequency for the corresponding Boltzmann equation does not depend on the velocities. This allows to make the simulation process very simple since the collision pairs can be chosen arbitrarily, without restriction. It is shown that this approach includes the well-known methods of Takizuka and Abe (1977) [12] and Nanbu (1997) as particular cases, and generalizes the approach of Bobylev and Nanbu (2000). The numerical scheme of this paper is simpler than the schemes by Takizuka and Abe [12] and by Nanbu. We derive it for the general case of multicomponent plasmas and show some numerical tests for the two-component (electrons and ions) case. An optimal choice of parameters for speeding up the computations is also discussed. It is also proved that the order of approximation is not worse than O(√(ε)), where ε is a parameter of approximation being equivalent to the time step Δt in earlier methods. A similar estimate is obtained for the methods of Takizuka and Abe and Nanbu.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

Manual for the Jet Event and Background Simulation Library(JEBSimLib)

Jets are the collimated streams of particles resulting from hard scattering in the initial state of high-energy collisions. In heavy-ion collisions, jets interact with the quark-gluon plasma (QGP) before freezeout, providing a probe into the internal structure and properties of the QGP. In order to study jets, background must be subtracted from the measured event, potentially introducing a bias. We aim to understand and quantify this subtraction bias. PYTHIA, a library to simulate pure jet events, is used to simulate a model for a signature with one pure jet (a photon) and one quenched jet, where all quenched particle momenta are reduced by a user-de ned constant fraction. Background for the event is simulated using multiplicity values generated by the TRENTO initial state model of heavy-ion collisions fed into a thermal model consisting of a 3-dimensional Boltzmann distribution for particle types and momenta. Data from the simulated events is used to train a statistical model, which computes a posterior distribution of the quench factor for a data set. The model was tested rst on pure jet events and then on full events including the background. This model will allow for a quantitative determination of biases induced by various methods of background subtraction.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

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↗

Generalized Bayesian Framework for Evaluation of Integral Benchmark Experiments

A recently published generalized Bayesian optimization framework has provided a way to retract any or all of the three common assumptions underlying the conventional Generalized Linear Least Squares (GLLS) optimization method based on the concepts introduced in reference two. These assumptions are: 1. Perfection: The model used for data evaluation and the prior probability distribution function (PDF) of generalized* data are perfect; 2. Normality: The prior and posterior PDF are normal; and 3. Linearity: The model is linear. In this work we outline how the framework in 1 could be directly adopted for improved evaluation of nuclear criticality integral benchmark experiments (IBEs) by: 1. Removing the first assumption alone by utilizing the concept of imperfections introduced in 1 to enable evaluation in the presence of discrepancies between the data and model or of missing covariance information by a GLLS method that will be seen as a generalization of the conventional GLLS method employed by the TSURFER code, and by 2. Removing the remaining two assumptions by implement- ing a Markov Chain Monte Carlo method for computation of the posterior PDF in the SAMPLER code, where TSURFER and SAMPLER are the uncertainty quantification (UQ) codes for IBEs in the SCALE code system based on the GLLS, and the stochastic method, respectively.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Readout rebalancing for near-term quantum computers

Readout errors are a significant source of noise for near-term intermediate-scale quantum computers. Mismeasuring a qubit as |1) when it should be |0) occurs much less often than mismeasuring a qubit as |0) when it should have been |1). We make the simple observation that one can improve the readout fidelity of quantum computers by applying targeted X gates prior to performing a measurement. These X gates are placed so that the expected number of qubits in the |1) state is minimized. Classical postprocessing can undo the effect of the X gates so that the expectation value of any observable is unchanged. This protocol is designed to have no effect when readout errors are symmetric. We show that the statistical uncertainty following readout error corrections is smaller when using readout rebalancing. The statistical advantage is circuit and computer dependent and is demonstrated for the W state, a Grover search, and for a Gaussian state. The benefit in statistical precision is most pronounced (and nearly a factor of 2 in some cases) when states with many qubits in the excited state have high probability.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Workshop on Field Theoretic Simulations in Particle Physics and Condensed Matter

A two and half day workshop at Boston University, devoted to a discussion of common problems in the theoretical and computational study of particle physics and condensed matter. The phase structure of strongly coupled quantum field theories are of great interest in condensed matter and high energy physics. For example, the study of strongly correlated systems, such as frustrated quantum anti-ferromagnets, have suggested the existence of phases in which the low energy excitations do not have the quantum numbers of electrons but are fractionalized. The field description of such systems are typically topological quantum field theories. The latter have also proved important in constructing supersymmetric lattice gauge theories. Quantum critical systems in condensed matter are described by conformal field theories which have the subject of much recent work in the context of theories of Beyond Standard Model physics. Finally, theoretical holographic techniques originating in string theory may offer a new tool to investigate strongly interacting electrons. In parallel with these theoretical developments there has been rapid progress in computational methods in both fields; from tensor networks and density matrix renormalization group techniques to the rational hybrid Monte Carlo algorithm and techniques to ameliorate the famous sign problem. It is thus a propitious time to bring both communities together to stimulate an exchange of ideas and facilitate possible future collaborations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Duality relations in the auxiliary field method

The eigenenergies {epsilon}{sup (N)}(m;{l_brace}n{sub i}, l{sub i{r_brace}}) of a system of N identical particles with a mass m are functions of the various radial quantum numbers n{sub i} and orbital quantum numbers l{sub i}. Approximations E{sup (N)}(m;Q) of these eigenenergies, depending on a principal quantum number Q({l_brace}n{sub i}, l{sub i{r_brace}}), can be obtained in the framework of the auxiliary field method. We demonstrate the existence of numerous exact duality relations linking quantities E{sup (N)}(m;Q) and E{sup (p)}(m';Q') for various forms of the potentials (independent of m and N) and for both nonrelativistic and semirelativistic kinematics. As the approximations computed with the auxiliary field method can be very close to the exact results, we show with several examples that these duality relations still hold, with sometimes a good accuracy, for the exact eigenenergies {epsilon}{sup (N)}(m;{l_brace}n{sub i}, l{sub i{r_brace}}).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Topological one-way quantum computation on verified logical cluster states

We present a scheme to improve the noise threshold for fault-tolerant topological one-way computation with constant overhead. Certain cluster states of finite size, say star clusters, are constructed with logical qubits through an efficient verification process to achieve high fidelity. Then, the star clusters are connected near-deterministically with verification to form a three-dimensional cluster state to implement topological one-way computation. The necessary postselection for verification is localized within the star clusters, ensuring the scalability of computation. By using the Steane seven-qubit code for the logical qubits, this scheme works with a high error rate of 2% and reasonable resources comparable to or less than those for the other fault-tolerant schemes. A higher noise threshold would be achieved by adopting a larger code.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗