Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMPUTING PROBLEMS”

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 937 records · Page 52

Spoofing Cross-Entropy Measure in Boson Sampling

Cross-entropy (XE) measure is a widely used benchmark to demonstrate quantum computational advantage from sampling problems, such as random circuit sampling using superconducting qubits and boson sampling (BS). We present a heuristic classical algorithm that attains a better XE than the current BS experiments in a verifiable regime and is likely to attain a better XE score than the near-future BS experiments in a reasonable running time. The key idea behind the algorithm is that there exist distributions that correlate with the ideal BS probability distribution and that can be efficiently computed. The correlation and the computability of the distribution enable us to postselect heavy outcomes of the ideal probability distribution without computing the ideal probability, which essentially leads to a large XE. Our method scores a better XE than the recent Gaussian BS experiments when implemented at intermediate, verifiable system sizes. Much like current state-of-the-art experiments, we cannot verify that our spoofer works for quantum-advantage-size systems. However, we demonstrate that our approach works for much larger system sizes in fermion sampling, where we can efficiently compute output probabilities. Finally, we provide analytic evidence that the classical algorithm is likely to spoof noisy BS efficiently.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

On Bipartite Graphs Trees and Their Partial Vertex Covers.

Graphs can be used to model risk management in various systems. Particularly, Caskurlu et al. in [7] have considered a system, which has threats, vulnerabilities and assets, and which essentially represents a tripartite graph. The goal in this model is to reduce the risk in the system below a predefined risk threshold level. One can either restricting the permissions of the users, or encapsulating the system assets. The pointed out two strategies correspond to deleting minimum number of elements corresponding to vulnerabilities and assets, such that the flow between threats and assets is reduced below the predefined threshold level. It can be shown that the main goal in this risk management system can be formulated as a Partial Vertex Cover problem on bipartite graphs. It is well-known that the Vertex Cover problem is in P on bipartite graphs, however; the computational complexity of the Partial Vertex Cover problem on bipartite graphs has remained open. In this paper, we establish that the Partial Vertex Cover problem is NP-hard on bipartite graphs, which was also recently independently demonstrated [N. Apollonio and B. Simeone, Discrete Appl. Math., 165 (2014), pp. 37–48; G. Joret and A. Vetta, preprint, arXiv:1211.4853v1 [cs.DS], 2012]. We then identify interesting special cases of bipartite graphs, for which the Partial Vertex Cover problem, the closely related Budgeted Maximum Coverage problem, and their weighted extensions can be solved in polynomial time. We also present an 8/9-approximation algorithm for the Budgeted Maximum Coverage problem in the class of bipartite graphs. We show that this matches and resolves the integrality gap of the natural LP relaxation of the problem and improves upon a recent 4/5-approximation.

97 MATHEMATICS AND COMPUTING↗

Improved mesh based photon sampling techniques for neutron activation analysis

The design of fusion power systems requires analysis of neutron activation of large, complex volumes, and the resulting particles emitted from these volumes. Structured mesh-based discretization of these problems allows for improved modeling in these activation analysis problems. Finer discretization of these problems results in large computational costs, which drives the investigation of more efficient methods. Within an ad hoc subroutine of the Monte Carlo transport code MCNP, we implement sampling of voxels and photon energies for volumetric sources using the alias method. The alias method enables efficient sampling of a discrete probability distribution, and operates in 0(1) time, whereas the simpler direct discrete method requires 0(log(n)) time. By using the alias method, voxel sampling becomes a viable alternative to sampling space with the 0(1) approach of uniformly sampling the problem volume. Additionally, with voxel sampling it is straightforward to introduce biasing of volumetric sources, and we implement this biasing of voxels as an additional variance reduction technique that can be applied. We verify our implementation and compare the alias method, with and without biasing, to direct discrete sampling of voxels, and to uniform sampling. We study the behavior of source biasing in a second set of tests and find trends between improvements and source shape, material, and material density. Overall, however, the magnitude of improvements from source biasing appears to be limited. Future work will benefit from the implementation of efficient voxel sampling - particularly with conformal unstructured meshes where the uniform sampling approach cannot be applied. (authors)

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Mixed Dirichlet–Steklov Problem for the Biharmonic Equation in Weighted Spaces

We address the uniqueness of weak solutions of the mixed Dirichlet–Steklov problem for the biharmonic equation in the exterior of a compact set in the class of functions having a finite Dirichlet integral with the weight |x|{sup a}. Depending on the parameter a, we establish some uniqueness theorems and obtain precise formulas for the dimension of the space of solutions.

97 MATHEMATICS AND COMPUTING↗

On a Reduction of the Order in a Differential-Algebraic System

The conditions of solvability and the structure of a generalized Green operator of the Cauchy problem for a linear differential-algebraic system are found. The sufficient conditions of reducibility of a differential-algebraic equation to a sequence of systems joining differential and algebraic equations are constructed. An original classification and a single scheme of construction of the solutions of differentialalgebraic equations are proposed.

97 MATHEMATICS AND COMPUTING↗

The role of stiffness in training and generalization of ResNets

Neural ordinary differential equations (NODEs) have recently regained popularity as large-depth limits of a large class of neural networks. In particular, residual neural networks (ResNets) are equivalent to an explicit Euler discretization of an underlying NODE, where the transition from one layer to the next is one time step of the discretization. The relationship between continuous and discrete neural networks has been of particular interest. Notably, analysis from the ordinary differential equation viewpoint can potentially lead to new insights for understanding the behavior of neural networks in general. In this work, we take inspiration from differential equations to define the concept of stiffness for a ResNet via the interpretation of a ResNet as the discretization of a NODE. Here, we then examine the effects of stiffness on the ability of a ResNet to generalize, via computational studies on example problems coming from climate and chemistry models. We find that penalizing stiffness does have a unique regularizing effect, but we see no benefit to penalizing stiffness over L 2 regularization (penalization of network parameter norms) in terms of predictive performance.

97 MATHEMATICS AND COMPUTING↗

Benchmarking of massively parallel phase-field codes for directional solidification

We present a detailed benchmark comparing two state-of-the-art phase-field implementations for simulating alloy solidification under experimentally relevant conditions. The study investigates the directional solidification of Al-3wt%Cu under high-velocity solidification conditions and SCN-0.46wt% camphor under microgravity conditions from National Aeronautics and Space Administration (NASA) DECLIC-DSI-R experiments. Both codes, one employing finite-difference discretization with uniform mesh and GPU-acceleration (GPU-PF) and the other one employing finite-element discretization with adaptive-mesh and CPU-parallelization (PRISMS-PF), solve the same quantitative phase-field formulation that incorporates an anti-trapping current for the solidification of dilute alloys. We evaluate the predictions of each code for dendritic morphology, primary spacing, and tip dynamics in both 2D and 3D, as well as their numerical convergence and computational performance. While existing benchmark problems have primarily focused on simplified or small-scale simulations, they do not reflect the computational and modeling challenges posed by employing experimentally relevant time and length scales. Our results provide a practical framework for assessing phase-field code performance as well as validating and facilitating their application in integrated computational materials engineering (ICME) workflows that require integration with realistic experimental data.

36 MATERIALS SCIENCE↗

Cauchy problem and Green's functions for first order differential operators and algebraic quantization

Existence and uniqueness of advanced and retarded fundamental solutions (Green's functions) and of global solutions to the Cauchy problem is proved for a general class of first order linear differential operators on vector bundles over globally hyperbolic Lorentzian manifolds. This is a core ingredient to CAR-/CCR-algebraic constructions of quantum field theories on curved spacetimes, particularly for higher spin field equations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Adjoint-Based Inversion of Geodetic Data for Sources of Deformation and Strain

An adjoint-based formulation leads to a particularly efficient approach for inverting geodetic measurements for the source of the deformation. Specifically, the quantities necessary to iteratively improve the fit to the observations can be computed with just three forward calculations, one to obtain the current residuals, another to solve the adjoint problem, and a third to compute the step length. An inversion algorithm utilizing the adjoint-based gradient is applied to a set of Interferometric Synthetic Aperture Radar (InSAR) data gathered between 2016 and 2018 over the Tulare Basin in California's Central Valley. Because the measured deformation is due to groundwater withdrawal, a penalty function is included in the inversion to avoid placing aquifer volume change in locations that are far from any documented wells. The solution of the inverse problem provides estimates of aquifer compaction that provide a match to the observed range changes while honoring the well data. The solution indicates an average aquifer volume loss of 2.17 km 3 /year over the two year period from January 2016 to January 2018, encompassing one drought year (2016) and one wet year (2017). Finally, this magnitude of lost volume is compatible with the 3.1 km 3 /year decrease in water volume for the entire Central Valley, estimated from GRACE satellite gravity data.

58 GEOSCIENCES↗

Reconstructing thermal quantum quench dynamics from pure states

Simulating the nonequilibrium dynamics of thermal states is a fundamental problem across scales from high-energy to condensed-matter physics. Quantum computers may provide a way to solve this problem efficiently. Preparing a thermal state on a quantum computer is challenging, but there exist methods to circumvent this by computing a weighted sum of time-dependent matrix elements in a convenient basis. Further, while the number of basis states can be large, in this paper we show that it can be reduced by simulating only the largest density matrix elements by weight, capturing the density matrix to a specified precision. Leveraging Hamiltonian symmetries enables further reductions. This approach paves the way to more accurate thermal-state dynamics simulations on near-term quantum hardware.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

PETSc/TAO Users Manual (Rev. 3.19)

This manual describes the use of the Portable, Extensible Toolkit for Scientific Computation (PETSc) and the Toolkit for Advanced Optimization (TAO) for the numerical solution of partial differential equations and related problems on high-performance computers. PETSc/TAO is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all distributed memory communication. PETSc/TAO includes a large suite of parallel linear solvers, nonlinear solvers, time integrators, and opti mization that may be used in application codes written in Fortran, C, C++, and Python (via petsc4py; see Getting Started). PETSc provides many of the mechanisms needed within parallel application codes, such as parallel matrix and vector assembly routines. The library is organized hierarchically, enabling users to employ the level of abstraction that is most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users. PETSc is a sophisticated set of software tools; as such, for some users it initially has a much steeper learning curve than packages such as MATLAB or a simple subroutine library. In particular, for individuals without some computer science background, experience programming in C, C++, python, or Fortran and experience using a debugger such as gdb or lldb, it may require a significant amount of time to take full advantage of the features that enable efficient software use. However, the power of the PETSc design and the algorithms it incorporates may make the efficient implementation of many application codes simpler than “rolling them” yourself. For many tasks a package such as MATLAB is often the best tool; PETSc is not intended for the classes of problems for which effective MATLAB code can be written. There are several packages, built on PETSc, that may satisfy your needs without requiring directly using PETSc. We recommend reviewing these packages functionality before starting to code directly with PETSc. PETSc can be used to provide a “MPI parallel linear solver” in an otherwise sequential, or OpenMP parallel code. This approach cannot provide extremely large improvements in the application time by utilizing large numbers of MPI processes but can still improve the performance. Certainly all parts of a previously sequential code need not be parallelized but the matrix generation portion must be parallelized to expect true scalability to large numbers of MPI processes. See PCMPI for details on how to utilize the PETSc MPI linear solver server. Since PETSc is under continued development, small changes in usage and calling sequences of routines will occur. PETSc has been supported for twenty-five years; see mailing list information on our website for information on contacting support.

97 MATHEMATICS AND COMPUTING↗

Visualizing and improving the robustness of phase retrieval algorithms

Coherent x-ray diffractive imaging is a novel imaging technique that utilizes phase retrieval and nonlinear optimization methods to image matter at nanometer scales. We explore how the convergence properties of a popular phase retrieval algorithm, Fienup's HIO, behave by introducing a reduced dimensionality problem allowing us to visualize and quantify convergence to local minima and the globally optimal solution. We then introduce generalizations of HIO that improve upon the original algorithm's ability to converge to the globally optimal solution.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

FLEXO: A Portably Performant Code for Pulsed Power Target Physics

FLEXO (Flux-Limited Extended-MHD Ohm's Law) is a production-line multiphysics code developed at Sandia to enable more predictive modeling of target physics on pulsed-power devices. FLEXO uses an extended magnetohydrodynamics (XMHD) model which includes a generalized Ohm's law (GOL), an electron inertia term, and Hall physics. This report describes the code's numerical methods, its computational performance, and test problems of interest.

42 ENGINEERING↗

Probabilistic Models of the Conservation and Balance Laws in Switching Regimes

A probabilistic representation is constructed for classical solution to the Cauchy problem for system of semilinear parabolic equations such that the second order terms with different coefficients enter in diagonal way, while the lower order terms enter in nondiagonal way. The systems of this kind arise as mathematical models of the parabolic conservation and balance laws and as mathematical models of dynamical systems with switching regimes.

97 MATHEMATICS AND COMPUTING↗

Simulating long-time evolution of driven many-body systems with next generation quantum computers (Final Report)

This project is focused on performing the best science possible on current generation quantum computers. As such, we have focused on developing techniques that involve robust algorithms that are either insensitive to noise, or are extremely low depth. We also have worked on determining topological properties and employing the robustness of topology to noise to allow for robust quantum computation. The ultimate goal is to be able to do new science on quantum computers that cannot be achieved on classical computers. The main effort of the work we have completed is on time-evolution of quantum systems and robust calculation of properties of systems enabled by being able to perform time evolution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Verification and Validation of the FLAG Hydrocode for Impact Cratering Simulations

Verification and validation (V&V) are necessary processes to ensure accuracy of the computational methods used to solve problems key to vast numbers of applications and industries. Simulations are essential for addressing impact cratering problems, because these problems often exceed experimental capabilities. We show that the free Lagrange (FLAG) hydrocode, developed at Los Alamos National Laboratory (Los Alamos, NM), can be used for impact cratering simulations by verifying FLAG against two analytical models of aluminum-on-aluminum impacts at different impact velocities and validating FLAG against a glass-into-water laboratory impact experiment. Our verification results show good agreement with the theoretical maximum pressures, with relative errors as low in magnitude as 1.00%. Our validation results demonstrate FLAG's ability to model various stages of impact cratering, with crater radius relative errors as low as 3.48% and crater depth relative errors as low as 0.79%. Our mesh resolution study shows that FLAG converges at resolutions low enough to reduce the required computation time from about 28 h to about 25 min. We anticipate that FLAG can be used to model larger impact cratering problems with increased accuracy and decreased computational cost on current systems relative to other hydrocodes tested by Pierazzo et al. (2008, “Validation of Numerical Codes for Impact and Explosion Cratering: Impacts on Strengthless and Metal Targets,” MAPS, 43(12), pp. 1917–1938).

97 MATHEMATICS AND COMPUTING↗

Regularity of a Boundary Point for the p(x)-Laplacian

We study the behavior of solutions to the Dirichlet problem for the p(x)-Laplacian with a continuous boundary function. We prove the existence of a weak solution under the assumption that p is separated from 1 and ∞. We present a necessary and sufficient Wiener type condition for regularity of a boundary point provided that the exponent p has the logarithmic modulus of continuity at this point.

97 MATHEMATICS AND COMPUTING↗

Coarse-Grained-Particle Method for Simulation of Liquid–Solids Reacting Flows

A coarse-grained-particle method (CGPM) that tracks fewer particles and their collisions by lumping several real particles into computational parcels is developed. We demonstrate that the accuracy of CGPM can be improved by properly selecting interpolation schemes used to compute flow variables at particle and computational grid locations. The computational speed of CGPM was shown to be similar to that of a widely used and less accurate particle in cell method (PIC). Finally, a chemical reaction mechanism based on rare earth elements (REE) leaching from coal byproducts was implemented with CGPM to study the effects of several flow and design parameters on the leaching process. A counter-current reactor was studied and optimized to maximize the mass fraction of REE in the liquid solution. As a result, the CGPM can now be employed to cheaply and accurately solve industrial-scale problems containing millions of computational parcels.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗