Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mathematics & 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 829 records · Page 46

Resources required for topological quantum factoring

We consider a hypothetical topological quantum computer composed of either Ising or Fibonacci anyons. For each case, we calculate the time and number of qubits (space) necessary to execute the most computationally expensive step of Shor's algorithm, modular exponentiation. For Ising anyons, we apply Bravyi's distillation method [S. Bravyi, Phys. Rev. A 73, 042313 (2006)] which combines topological and nontopological operations to allow for universal quantum computation. With reasonable restrictions on the physical parameters we find that factoring a 128-bit number requires approximately 10{sup 3} Fibonacci anyons versus at least 3x10{sup 9} Ising anyons. Other distillation algorithms could reduce the resources for Ising anyons substantially.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Distillation by repeated measurements: Continuous spectrum case

Repeated measurements on one part of a bipartite system strongly affect the other part that is not measured, the dynamics of which is regulated by an effective contracted evolution operator. When the spectrum of this operator is discrete, the nonmeasured system is driven into a pure state, irrespective of the initial state, provided that the spectrum satisfies certain conditions. We show here that, even in the case of continuous spectrum, an effective distillation can occur under rather general conditions. We confirm it by applying our formalism to a simple model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Postulates for measures of genuine multipartite correlations

A lot of research has been done on multipartite correlations, but the problem of satisfactorily defining genuine multipartite correlations--those not trivially reducible to lower partite correlations--remains unsolved. In this paper we propose three reasonable postulates which each measure or indicator of genuine multipartite correlations (or genuine multipartite entanglement) should satisfy. We also introduce the concept of degree of correlations, which gives partial characterization of multipartite correlations. Then, we show that covariance does not satisfy two postulates and hence it cannot be used as an indicator of genuine multipartite correlations. Finally, we propose a candidate for a measure of genuine multipartite correlations based on the work that can be drawn from a local heat bath by means of a multipartite state.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multipartite entanglement in quantum algorithms

We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyze the multipartite entanglement properties in the Deutsch-Jozsa, Grover, and Simon algorithms. Our results show that for these algorithms most instances involve multipartite entanglement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Compact baby Skyrmions

For the baby Skyrme model with a specific potential, compacton solutions, i.e., configurations with a compact support and parabolic approach to the vacuum, are derived. Specifically, in the nontopological sector, we find spinning Q-balls and Q-shells, as well as peakons. Moreover, we obtain compact baby skyrmions with nontrivial topological charge. All these solutions may form stable multisoliton configurations provided they are sufficiently separated.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Detecting hidden layers from spreading dynamics on complex networks

When dealing with spreading processes on networks it can be of the utmost importance to test the reliability of data and identify potential unobserved spreading paths. In this paper we address these problems and propose methods for hidden layer identification and reconstruction. We also explore the interplay between difficulty of the task and the structure of the multilayer network describing the whole system where the spreading process occurs. Our methods stem from an exact expression for the likelihood of a cascade in the susceptible-infected model on an arbitrary graph. We then show that by imploring statistical properties of unimodal distributions and simple heuristics describing joint likelihood of a series of cascades one can obtain an estimate of both existence of a hidden layer and its content with success rates far exceeding those of a null model. Furthermore, we conduct our analyses on both synthetic and real-world networks providing evidence for the viability of the approach presented.

97 MATHEMATICS AND COMPUTING↗

Theory of minimum spanning trees. II. Exact graphical methods and perturbation expansion at the percolation threshold

Continuing the program begun by the authors in a previous paper, we develop an exact low-density expansion for the random minimum spanning tree (MST) on a finite graph and use it to develop a continuum perturbation expansion for the MST on critical percolation clusters in space dimension d. The perturbation expansion is proved to be renormalizable in d=6 dimensions. We consider the fractal dimension D{sub p} of paths on the latter MST; our previous results lead us to predict that D{sub p}=2 for d>d{sub c}=6. Using a renormalization-group approach, we confirm the result for d>6 and calculate D{sub p} to first order in epsilon=6-d for d<6 using the connection with critical percolation, with the result D{sub p}=2-epsilon/7+O(epsilon{sup 2}).

97 MATHEMATICS AND COMPUTING↗

Asynchronous and Distributed Tracking of Time-Varying Fixed Points

NREL researcher Andrey Bernstein discusses asynchronous and distributed tracking of time-varying fixed points as part of the Innovative Optimization and Control Methods for Highly Distributed Autonomous Systems workshop. NREL hosted the workshop to exchange ideas on state-of-the-art control and optimization strategies as well as get feedback on work being done at NREL.

97 MATHEMATICS AND COMPUTING↗

HYPPO: A Surrogate-Based Multi-Level Parallelism Tool for Hyperparameter Optimization

We present a new software, HYPPO, that enables the automatic tuning of hyperparameters of various deep learning (DL) models. Unlike other hyperparameter optimization (HPO) methods, HYPPO uses adaptive surrogate models and directly accounts for uncertainty in model predictions to find accurate and reliable models that make robust predictions. Using asynchronous nested parallelism, we are able to significantly alleviate the computational burden of training complex architectures and quantifying the uncertainty. HYPPO is implemented in Python and can be used with both TensorFlow and PyTorch libraries. We demonstrate various software features on time-series prediction and image classification problems as well as a scientific application in computed tomography image reconstruction. Finally, we show that (1) we can reduce by an order of magnitude the number of evaluations necessary to find the most optimal region in the hyperparameter space and (2) we can reduce by two orders of magnitude the throughput for such HPO process to complete.

adaptation models↗

Numerical Solution of the Steady-State Network Flow Equations for a Non-Ideal Gas

Herein we formulate a steady-state network flow problem for non-ideal gas that relates injection rates and nodal pressures in the network to flows in pipes. For this problem, we present and prove a theorem on uniqueness of generalized solution for a broad class of non-ideal pressure-density relations that satisfy a monotonicity property. Further, we develop a Newton-Raphson algorithm for numerical solution of the steady-state problem, which is made possible by a systematic non-dimensionalization of the equations. The developed algorithm has been extensively tested on benchmark instances and shown to converge robustly to a generalized solution. Previous results [1]-[4], indicate that the steady-state network flow equations for an ideal gas are difficult to solve by the Newton-Raphson method because of its extreme sensitivity to the initial guess. In contrast, we find that non-dimensionalization of the steady-state problem is key to robust convergence of the Newton-Raphson method. We identify criteria based on the uniqueness of solutions under which the existence of a non-physical generalized solution found by a non-linear solver implies non-existence of a physical solution, i.e., infeasibility of the problem. Finally, we compare pressure and flow solutions based on ideal and non-ideal equations of state to demonstrate the need to apply the latter in practice. The solver developed in this article is open-source and is made available for both the academic and research communities as well as the industry.

97 MATHEMATICS AND COMPUTING↗

Generalization of the nonstandard approach in the dynamic theory of diffraction for deformed crystals

The nonstandard theory of X-ray scattering in a deformed crystal has been generalized. The vector of atomic-plane displacement is introduced into the crystal polarizability model like in the generalized Takagi dynamic theory. The solution to the wave equation is sought for using the procedure of expanding the field amplitude and vector operators in the Fourier components of polarizability χ{sub H} in a series according to the multiscale method. It is shown that considering lattice strain generally calls for introducing various characteristic spatial regions for the diffraction equation, which is in complete agreement with the main concept of the multiscale method. A particular case of a strain field depending on one scale is considered. If a relative change in strain occurs at a length on the order of the extinction length, one can obtain equations generalizing the Takagi equations to the case of arbitrary diffraction geometries.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Strict parabolicity of the multifractal spectrum at the Anderson transition

Using the well-known “algebra of multifractality,” we derive the functional equation for anomalous dimensions Δ{sub q}, whose solution Δ = χq(q–1) corresponds to strict parabolicity of the multifractal spectrum. This result demonstrates clearly that a correspondence of the nonlinear σ-models with the initial disordered systems is not exact.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

2HOT: an improved parallel hashed oct-tree n-body algorithm for cosmological simulation

We report on improvements made over the past two decades to our adaptive treecode N-body method (HOT). A mathematical and computational approach to the cosmological N-body problem is described, with performance and scalability measured up to 256k (2 18 ) processors. We present error analysis and scientific application results from a series of more than ten 69 billion (4096 3 ) particle cosmological simulations, accounting for 4 × 10 20 floating point operations. These results include the first simulations using the new constraints on the standard model of cosmology from the Planck satellite. Our simulations set a new standard for accuracy and scientific throughput, while meeting or exceeding the computational efficiency of the latest generation of hybrid TreePM N-body methods.

Computer Science↗

hIPPYlib-MUQ: A Bayesian Inference Software Framework for Integration of Data with Complex Predictive Models under Uncertainty

Bayesian inference provides a systematic framework for integration of data with mathematical models to quantify the uncertainty in the solution of the inverse problem. However, the solution of Bayesian inverse problems governed by complex forward models described by partial differential equations (PDEs) remains prohibitive with black-box Markov chain Monte Carlo (MCMC) methods. We present hIPPYlib-MUQ, an extensible and scalable software framework that contains implementations of state-of-the art algorithms aimed to overcome the challenges of high-dimensional, PDE-constrained Bayesian inverse problems. These algorithms accelerate MCMC sampling by exploiting the geometry and intrinsic low-dimensionality of parameter space via derivative information and low rank approximation. The software integrates two complementary open-source software packages, hIPPYlib and MUQ. hIPPYlib solves PDE-constrained inverse problems using automatically-generated adjoint-based derivatives, but it lacks full Bayesian capabilities. MUQ provides a spectrum of powerful Bayesian inversion models and algorithms, but expects forward models to come equipped with gradients and Hessians to permit large-scale solution. By combining these two complementary libraries, we created a robust, scalable, and efficient software framework that realizes the benefits of each and allows us to tackle complex large-scale Bayesian inverse problems across a broad spectrum of scientific and engineering disciplines. To illustrate the capabilities of hIPPYlib-MUQ, we present a comparison of a number of MCMC methods available in the integrated software on several high-dimensional Bayesian inverse problems. These include problems characterized by both linear and nonlinear PDEs, various noise models, and different parameter dimensions. The results demonstrate that large (~ 50×) speedups over conventional black box and gradient-based MCMC algorithms can be obtained by exploiting Hessian information (from the log-posterior), underscoring the power of the integrated hIPPYlib-MUQ framework.

97 MATHEMATICS AND COMPUTING↗

A Simple, Scalable Large Deformation Solid Mechanics Implementation in the MOOSE Framework

This article describes a large deformation solid mechanics solver implemented as part of the freely available and open source MOOSE finite element simulation framework. The article documents the choices made in developing the solid mechanics framework and describes novel formulations for the gradient operator and constitutive modeling framework made to simplify implementations of different coordinate systems, stabilized gradient operators, and different constitutive model inputs and outputs. In the process, the article describes a new formulation that casts objective integration of the Cauchy stress as a linear transformation of the small stress rate. Finally, the article presents key implementation details and examines the parallel efficiency of the solid mechanics solver implemented in MOOSE. The implementation retains a good weak scaling efficiency beyond 1,000 parallel processes. The article includes a discussion of the factors limiting the parallel efficiency of implicit, large deformation solid mechanics codes on current high-performance computers, with the main current limitation being the scalability of the algebraic multigrid methods used to solve the linearized equilibrium equations.

Applied computing → Computer-aided design↗