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 919 records · Page 51

Vibrational Signatures of Electronic Properties in Renewable-Energy Catalysis

The objective of this research program is to discover and develop new approaches for ab initio computational simulations of molecular motion. Specifically, this program aims to decipher the connection between the underlying electronic structure and the accordant molecular vibrations in reactive ions and radicals for renewable-energy purposes. Recent experimental progress in ion sources and optical spectroscopies has unearthed considerable new inner-sphere detail for these complexes, but the connection between these spectral signatures and mechanistic information often remains elusive, to the continued frustration of experimentalists. For this purpose, new anharmonic vibrational frequency methods, along with a publicly deployed software package, will be developed. Working closely with committed experimental collaborators, this conceptual and computational framework will be used to explain the results of new spectroscopy experiments, focusing specifically on the inner-shell mechanisms of renewable-energy catalysis. The oxidation half of catalytic water-splitting chemistry will be a central focus, along with fundamental studies of the manner in which strong ions and radicals activate solvent as a chemical species. The resulting products of the research program will include openly available software and algorithms for the ab initio simulation of challenging vibrational spectra, as well as critical mechanistic insight into energy-focused catalytic processes that are opaque to other existing analytical techniques.

42 ENGINEERING↗

Investigation of CO 2 capture using solid sorbents in a fluidized bed reactor: Cold flow hydrodynamics

Both experimental tests and numerical simulations were conducted to investigate the fluidization behavior of a solid CO 2 sorbent with a mean diameter of 100 μm and density of about 480 kg/m, which belongs to Geldart's Group A powder. A carefully designed fluidized bed facility was used to perform a series of experimental tests to study the flow hydrodynamics. Numerical simulations using the two-fluid model indicated that the grid resolution has a significant impact on the bed expansion and bubbling flow behavior. Due to the limited computational resource, no good grid independent results were achieved using the standard models as far as the bed expansion is concerned. In addition, all simulations tended to under-predict the bubble size substantially. Effects of various model settings including both numerical and physical parameters have been investigated with no significant improvement observed. The latest filtered sub-grid drag model was then tested in the numerical simulations. Compared to the standard drag model, the filtered drag model with two markers not only predicted reasonable bed expansion but also yielded realistic bubbling behavior. As a result, a grid sensitivity study was conducted for the filtered sub-grid model and its applicability and limitation were discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum phase estimation for a class of generalized eigenvalue problems

Quantum phase estimation provides a path to quantum computation of solutions to Hermitian eigenvalue problems Hv = λv , such as those occurring in quantum chemistry. It is natural to ask whether the same technique can be applied to generalized eigenvalue problems Av = λBv , which arise in many areas of science and engineering. Here, we answer this question affirmatively. A restricted class of generalized eigenvalue problems could be solved as efficiently as standard eigenvalue problems. A paradigmatic example is provided by Sturm-Liouville problems. Another example comes from linear ideal magnetohydrodynamics, where phase estimation could be used to determine the stability of magnetically confined plasmas in fusion reactors.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Multi-node and Multi-core Performance Studies of a Monte Carlo code RMC

Over the past 15 years the architecture of high-performance computing systems has become increasingly heterogeneous with individual computing cores being subdivided into nodes and even auxiliary co-processing units such as graphics processing units or the Intel many integrated core co-processors. In fact, future computer platforms is moving toward a larger number of nodes and cores with lower memory available per node. Today, several production Monte Carlo codes use some types of hybrid parallelism strategy that makes use of shared-memory parallelism within a computing node and message-passing parallelism between nodes, which enables the codes to utilize available computing resources as much as possible, both among and within computing nodes on a cluster. The so-called hybrid parallelization is also possible with Reactor Monte Carlo Code RMC by activating both MPI and OpenMP parallel algorithms together. On HPC' which typically consists of several or several-ten thousand nodes equipping 16-32 computing intra-cores per node, simulation of RMC can be carried out in the hybrid parallelization with the MPI inter-node parallelization and the OpenMP intra-node parallelization. RMC has adopted a hybrid message-passing and shared-memory approach to parallelism, which enables the code to utilize available computing resources, both among and within computing nodes on a cluster. Shared-memory parallelism is especially valuable for large-model simulations because it enables multiple compute cores within a node to share common model information such as the geometry description, material, cross section and tally data, thus reducing the memory usage per processor. The calculation on the Tianhe-2 supercomputer took 6144 cores, resulting in a rate of 173,314,000 neutrons/minute for BEAVRS benchmark. While pin-wise full core H-M benchmark burnup calculations with millions of depletion regions was selected using MPI/OpenMP parallelism, the speed of 6,144 cores reach 1,843,200 burnable regions per minute. Keeping up with the continuing trend for increases in the number of computing resources within modern HPC systems is a significant challenge for teams that develop and maintain high-performance MC radiation transport solvers. order to address this challenge, RMC has adopted a hybrid message-passing and shared-memory approach to parallelism, which enables the code to utilize available computing resources, both among and within computing nodes on a cluster. Shared-memory parallelism is especially valuable for large-model simulations because it enables multiple compute cores within a node to share common model information such as the geometry description, material and composition definitions, and cross section data, thus reducing the memory usage per processor. The parallel performance has been studied by using two complex and representative benchmarks, H-M and BEAVRS benchmark. All simulations were run on Intel Xeon E5-2692 12 core, 2.2 GHz processors at MilkyWay-2 Super Computer with up to 12,288 available computing cores. While employing MPI parallelism, excellent parallel efficiency is achieved even above 12,000 processors and RMC reaches the parallel efficiency of 96% on 12,288 cores for the pin-by-pin computation of the BEAVRS benchmark. While BEAVRS criticality benchmark was selected using MPI/OpenMP parallelism, the speed of 6,144 cores reach 173,314,000 particles per minute. While pin-wise full core H-M benchmark burnup calculations with millions of depletion regions was selected using MPI/OpenMP parallelism, the speed of 6,144 cores reach 1,843,200 burnable regions per minute. Results from these studies demonstrate that RMC, using the hybrid parallel model described in this paper, is able to handle pin-wise full core burnup calculations with millions of depletion regions and scales well through thousands of processors. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Improved Variable-Transformation Algorithm for the Hexagonal Variational Nodal Method

Hexagonal Variational Nodal Method (VNM) has been widely employed in fast reactor core calculation codes. It provides the weak form solution of the second order transport equation. It employs a direct three-dimensional expansion instead of the transverse integration technique, with the singular term caused by transverse integration over the hexagonal nodal avoided. However, as the increasing Pn expansion order in angle, the number of moments increases dramatically, which significantly increases the requirements in both memory and computational time. As a consequence, Yang proposed the Variable-Transformation Algorithm. It firstly used the reverse Cuthill-McKee (RCMK) reordering method to transform the response matrices into block-diagonal. Then, for the unreducible matrices, orthogonal transformation was applied, after which the matrices were sparse enough to be reduced by using the RCMK reordering once more. In this summary, based on a newly developed hexagonal VNM code NECP-VioletHex, the Variable Transformation Algorithm was investigated and improved by adopting more constraints to the basis functions to further take advantage of the symmetric properties of the hexagonal-z nodes. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Repeat-until-success cubic phase gate for universal continuous-variable quantum computation

We report that to achieve universal quantum computation using continuous variables, one needs to jump out of the set of Gaussian operations and have a non-Gaussian element, such as the cubic phase gate. However, such a gate is currently very difficult to implement in practice. Here we introduce an experimentally viable “repeat-until-success” approach to generating the cubic phase gate, which is achieved using sequential photon subtractions and Gaussian operations. Ultimately, we find that our scheme offers benefits in terms of the expected time until success, as well as the fact that we do not require any complex off-line resource state, although we require a primitive quantum memory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Qubit-efficient entanglement spectroscopy using qubit resets

One strategy to fit larger problems on NISQ devices is to exploit a tradeoff between circuit width and circuit depth. Unfortunately, this tradeoff still limits the size of tractable problems since the increased depth is often not realizable before noise dominates. Here, we develop qubit-efficient quantum algorithms for entanglement spectroscopy which avoid this tradeoff. In particular, we develop algorithms for computing the trace of the n -th power of the density operator of a quantum system, T r ( ρ n ) , (related to the Rényi entropy of order n ) that use fewer qubits than any previous efficient algorithm while achieving similar performance in the presence of noise, thus enabling spectroscopy of larger quantum systems on NISQ devices. Our algorithms, which require a number of qubits independent of n , are variants of previous algorithms with width proportional to n , an asymptotic difference. The crucial ingredient in these new algorithms is the ability to measure and reinitialize subsets of qubits in the course of the computation, allowing us to reuse qubits and increase the circuit depth without suffering the usual noisy consequences. We also introduce the notion of effective circuit depth as a generalization of standard circuit depth suitable for circuits with qubit resets. This tool helps explain the noise-resilience of our qubit-efficient algorithms and should aid in designing future algorithms. We perform numerical simulations to compare our algorithms to the original variants and show they perform similarly when subjected to noise. Additionally, we experimentally implement one of our qubit-efficient algorithms on the Honeywell System Model H0, estimating T r ( ρ n ) for larger n than possible with previous algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Predicting Atomistic Transitions with Transformers

Accurate knowledge of the atomistic transition pathways in materials and material surfaces is crucial for many material science problems. However, conventional simulation techniques used to find these transitions are extremely computationally intensive. Even with large-scale, accelerated material simulations, the computational cost constrains the applicable domain in practice. Machine learning models, with the potential to learn the complex emergent behaviors governing atomistic transitions as a fast surrogate model, have great promise to predict transitions with a vastly reduced computational cost. Here, we demonstrate how transformers can be trained to predict atomistic transitions in nano-clusters. We show how we evaluate physical validity of the predictions and how a multitude of additional, different microstates can be generated by slightly varying the data provided to the model.

36 MATERIALS SCIENCE↗

Ab Initio Calculations Of Nuclear Reactions And Exotic Nuclei

Our ultimate goal is to develop a fundamental theory and efficient computational tools to describe dynamic processes between nuclei and to use such tools toward supporting several DOE milestones by: 1) performing predictive calculations of difficult-to-measure landmark reactions for nuclear astrophysics, such as those driving the neutrino signature of our sun; 2) improving our understanding of the structure of nuclei near the neutron drip line, which will be the focus of the DOE’s Facility for Rare Isotope Beams (FRIB) being constructed at Michigan State University; but also 3) helping to reveal the true nature of the nuclear force. Furthermore, these theoretical developments will support plasma diagnostic efforts at facilities dedicated to the development of terrestrial fusion energy.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Intersection-distribution-based remapping between arbitrary meshes for staggered multi-material arbitrary Lagrangian-Eulerian hydrodynamics

In this paper, we present a new intersection-distribution-based remapping method between arbitrary polygonal meshes for indirect staggered multi-material arbitrary Lagrangian-Eulerian hydrodynamics. All cell-centered material quantities are conservatively remapped using intersections between the Lagrangian (old, source) mesh and the rezoned (new, target) mesh. The new nodal masses are obtained by conservative distribution of all material masses in each new cell to the cell's corners and then collecting those corner masses at new nodes. This distribution is done using a local constrained optimization approach for each cell in the new mesh. In order to remap nodal momentum we first define cell-centered momentum for each cell in the old mesh, conservatively remap this to the new mesh and then conservatively distribute the new zonal momentum to each cell's bounding nodes, again using local constrained optimization. Our method also conserves total energy by applying a new nodal kinetic energy correction that relies on a process similar to that used for remapping nodal mass and momentum. Cell-centered kinetic energy is computed, conservatively remapped and then distributed to nodes. The discrepancy between this conservatively remapped and actual nodal kinetic energy is then conservatively distributed to the internal energies of the materials in the cells surrounding each node. Unlike conventional cell-based corrections of this type, this new nodal kinetic energy correction has not been observed to drive material internal energy negative in any of our testing. Unlike flux based remapping, our new intersection-distribution method can be applied to remapping between source and target meshes that are arbitrarily different, which provides superior flexibility in the rezoning strategy. Our method is accurate, essentially conservative and essentially bounds preserving.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient Four-Component Dirac–Coulomb–Gaunt Hartree–Fock in the Pauli Spinor Representation

Four-component Dirac Hartree--Fock is an accurate mean-field method for treating molecular systems where relativistic effects are important. However, the computational cost and complexity of the two-electron interaction makes this method less common, even though we can consider the Dirac Hartree--Fock Hamiltonian the ``ground truth" of electronic structure, barring explicit quantum-electrodynamical effects. Being able to calculate these effects is then vital to the design of lower scaling methods for accurate predictions in computational spectroscopy and properties of heavy element complexes that must include relativistic effects for even qualitative accuracy. In this work, we present a Pauli quaternion formalism of maximal component- and spin-separation for computing the Dirac-Coulomb-Gaunt Hartree-Fock ground state, with a minimal floating-point-operation count algorithm. Furthermore, this approach also allows one to explicitly separate different spin physics from the two-body interactions, such as spin-free, spin-orbit, and the spin-spin contributions. Additionally, we use this formalism to examine relativistic trends in the periodic table, and analyze the basis set dependence of atomic gold and gold dimer systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Biased degenerate ground-state sampling of small Ising models with converged quantum approximate optimization algorithm

The quantum alternating operator ansatz, a generalization of the quantum approximate optimization algorithm (QAOA), is a quantum algorithm used for approximately solving combinatorial optimization problems. QAOA typically uses the transverse field mixer as the driving Hamiltonian. One of the interesting properties of the transverse field driving Hamiltonian is that it results in nonuniform sampling of degenerate ground states of optimization problems. In this study, we numerically examine the fair sampling properties of the transverse field mixer QAOA, and Grover mixer QAOA (GM-QAOA), which provides theoretical guarantees of fair sampling of degenerate optimal solutions, up to a large enough p such that the mean expectation value converges to an optimal approximation ratio of 1. This comparison is performed with high-quality heuristically computed, but not necessarily optimal, QAOA angles, which give strictly monotonically improving solution quality as p increases. These angles are computed using the Julia based numerical simulation software JuliQAOA. Fair sampling of degenerate ground states is quantified using the Shannon entropy of the ground-state amplitudes distribution. The fair sampling properties are reported on several quantum signature Hamiltonians from previous quantum annealing fair sampling studies. Small random fully connected spin glasses are shown, which exhibit exponential suppression of some degenerate ground states with transverse field mixer QAOA. The transverse field mixer QAOA simulations show that some problem instances clearly saturate the Shannon entropy of 0 with a maximally biased distribution that occurs when the learning converges to an approximation ratio of 1 while other problem instances never deviate from a maximum Shannon entropy (uniform distribution) at any p step. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A diffusive information preservation method for small Knudsen number flows

The direct simulation Monte Carlo (DSMC) method is a powerful particle-based method for modeling gas flows. It works well for relatively large Knudsen (Kn) numbers, typically larger than 0.01, but quickly becomes computationally intensive as Kn decreases due to its time step and cell size limitations. An alternative approach was proposed to relax or remove these limitations, based on replacing pairwise collisions with a stochastic model corresponding to the Fokker–Planck equation [J. Comput. Phys., 229, 1077 (2010); J. Fluid Mech., 680, 574 (2011)]. Similar to the DSMC method, the downside of that approach suffers from computationally statistical noise. To solve the problem, a diffusion-based information preservation (D-IP) method has been developed. The main idea is to track the motion of a simulated molecule from the diffusive standpoint, and obtain the flow velocity and temperature through sampling and averaging the IP quantities. To validate the idea and the corresponding model, several benchmark problems with Kn ∼ 10{sup −3}–10{sup −4} have been investigated. It is shown that the IP calculations are not only accurate, but also efficient because they make possible using a time step and cell size over an order of magnitude larger than the mean collision time and mean free path, respectively.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Comparisons of time explicit hybrid kinetic-fluid code Architect for Plasma Wakefield Acceleration with a full PIC code

Architect, a time explicit hybrid code designed to perform quick simulations for electron driven plasma wakefield acceleration, is described. In order to obtain beam quality acceptable for applications, control of the beam-plasma-dynamics is necessary. Particle in Cell (PIC) codes represent the state-of-the-art technique to investigate the underlying physics and possible experimental scenarios; however PIC codes demand the necessity of heavy computational resources. Architect code substantially reduces the need for computational resources by using a hybrid approach: relativistic electron bunches are treated kinetically as in a PIC code and the background plasma as a fluid. Cylindrical symmetry is assumed for the solution of the electromagnetic fields and fluid equations. In this paper both the underlying algorithms as well as a comparison with a fully three dimensional particle in cell code are reported. The comparison highlights the good agreement between the two models up to the weakly non-linear regimes. In highly non-linear regimes the two models only disagree in a localized region, where the plasma electrons expelled by the bunch close up at the end of the first plasma oscillation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

No Core CI calculations for light nuclei with chiral 2- and 3-body forces

The atomic nucleus is a self-bound system of strongly interacting nucleons. In No-Core Configuration Interaction calculations, the nuclear wavefunction is expanded in Slater determinants of single-nucleon wavefunctions (Configurations), and the many-body Schrödinger equation becomes a large sparse matrix problem. The challenge is to reach numerical convergence to within quantified numerical uncertainties for physical observables using finite truncations of the infinite-dimensional basis space. We discuss strategies for constructing and solving the resulting large sparse matrices for a set of low-lying eigenvalues and eigenvectors on current multicore computer architectures. Several of these strategies have been implemented in the code MFDn, a hybrid MPI/OpenMP Fortran code for ab initio nuclear structure calculations that scales well to over 200,000 cores. We discuss how the similarity renormalization group can be used to improve the numerical convergence. We present results for excitation energies and other selected observables for 8 Be and 12 C using realistic 2- and 3-body forces obtained from chiral perturbation theory. Finally, we demonstrate that collective phenomena such as rotational band structures can emerge from these microscopic calculations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Off-diagonal Jacobian support for Nodal BCs

In this brief note, we describe the implementation of o-diagonal Jacobian computations for nodal boundary conditions in the Multiphysics Object Oriented Simulation Environment (MOOSE) framework. There are presently a number of applications based on the MOOSE framework that solve complicated physical systems of partial dierential equations whose boundary conditions are often highly nonlinear. Accurately computing the on- and o-diagonal Jacobian and preconditioner entries associated to these constraints is crucial for enabling ecient numerical solvers in these applications. Two key ingredients are required for properly specifying the Jacobian contributions of nonlinear nodal boundary conditions in MOOSE and nite element codes in general: 1. The ability to zero out entire Jacobian matrix rows after \normal" assembly has taken place, and eciently replace the contents of those rows with the contributions associ- ated to the nodal boundary conditions. 2. An interface for allowing users to specify both the residual and Jacobian contributions associated to their nonlinear boundary condition.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multi-moment advection scheme in three dimension for Vlasov simulations of magnetized plasma

We present an extension of the multi-moment advection scheme [T. Minoshima, Y. Matsumoto, T. Amano, Multi-moment advection scheme for Vlasov simulations, Journal of Computational Physics 230 (2011) 6800–6823] to the three-dimensional case, for full electromagnetic Vlasov simulations of magnetized plasma. The scheme treats not only point values of a profile but also its zeroth to second order piecewise moments as dependent variables, and advances them on the basis of their governing equations. Similar to the two-dimensional scheme, the three-dimensional scheme can accurately solve the solid body rotation problem of a gaussian profile with little numerical dispersion or diffusion. This is a very important property for Vlasov simulations of magnetized plasma. We apply the scheme to electromagnetic Vlasov simulations. Propagation of linear waves and nonlinear evolution of the electron temperature anisotropy instability are successfully simulated with a good accuracy of the energy conservation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

M + (M=Ca, Ba) Cations Bound to Molecular Cavities: A New Strategy for Incorporating Molecular Quantum States into Quantum Information

This project pursued a novel strategy for incorporating multiple qubits per ion into ion-trap based quantum computing (ITQC) involving Ca + and Ba + . By forming molecular complexes of these cations with molecular-scale cages, we hypothesized that molecular energy levels could be incorporated into quantum computing while retaining key properties of the atomic ions intact. We experimented with a variety of molecular cages and found that Na + , K + , Rb + , Ca 2+ , Sr 2+ , and Ba 2+ could be captured and brought into the gas phase efficiently by imbedding them inside [2.2.2]-benzocryptand. IR and UV spectra of these cage complexes are sensitive to the size and charge state of the ion, reporting on the structures and binding properties of the cage complexes. UV photofragmentation of the Ba 2+ -Acetate -1 -BzCrypt complex produces Ba + -BzCrypt, the complex targeted for exploration in the original hypothesis. Follow-on funding is needed to pursue the spectroscopy of this complex as a target for ITQC.

74 ATOMIC AND MOLECULAR PHYSICS↗