Search NASA⌕ Search

SEARCH · Search NASA

Results for “approximate 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 649 records · Page 36

Extending the radial diffusion model of Falthammar to non-dipole background field

A model for radial diffusion caused by electromagnetic disturbances was published by Falthammar (1965) using a two-parameter model of the disturbance perturbing a background dipole magnetic field. Schulz and Lanzerotti (1974) extended this model by recognizing the two parameter perturbation as the leading (non--dipole) terms of the Mead Williams magnetic field model. They emphasized that the magnetic perturbation in such a model induces an electric ield that can be calculated from the motion of field lines on which the particles are ‘frozen’. Roederer and Zhang (2014) describe how the field lines on which the particles are frozen can be calculated by tracing the unperturbed field lines from the minimum-B location to the ionospheric footpoint, and then tracing the perturbed field (which shares the same ionospheric footpoint due to the frozen -in condition) from the ionospheric footpoint back to a perturbed minimum B location. The instantaneous change n Roederer L*, dL*/dt, can then be computed as the product (dL*/dphi)*(dphi/dt). dL*/Dphi is linearly dependent on the perturbation parameters (to first order) and is obtained by computing the drift across L*-labeled perturbed field lines, while dphi/dt is related to the bounce-averaged gradient-curvature drift velocity. The advantage of assuming a dipole background magnetic field, as in these previous studies, is that the instantaneous dL*/dt can be computed analytically (with some approximations), as can the DLL that results from integrating dL*/dt over time and computing the expected value of (dL*)^2. The approach can also be applied to complex background magnetic field models like T89 or TS04, on top of which the small perturbations are added, but an analytical solution is not possible and so a numerical solution must be implemented. In this talk, I discuss our progress in implementing a numerical solution to the calculation of DL*L* using arbitrary background field models with simple electromagnetic perturbations.

58 GEOSCIENCES↗

Hierarchical fractional-step approximations and parallel kinetic Monte Carlo algorithms

We present a mathematical framework for constructing and analyzing parallel algorithms for lattice kinetic Monte Carlo (KMC) simulations. The resulting algorithms have the capacity to simulate a wide range of spatio-temporal scales in spatially distributed, non-equilibrium physiochemical processes with complex chemistry and transport micro-mechanisms. Rather than focusing on constructing exactly the stochastic trajectories, our approach relies on approximating the evolution of observables, such as density, coverage, correlations and so on. More specifically, we develop a spatial domain decomposition of the Markov operator (generator) that describes the evolution of all observables according to the kinetic Monte Carlo algorithm. This domain decomposition corresponds to a decomposition of the Markov generator into a hierarchy of operators and can be tailored to specific hierarchical parallel architectures such as multi-core processors or clusters of Graphical Processing Units (GPUs). Based on this operator decomposition, we formulate parallel Fractional step kinetic Monte Carlo algorithms by employing the Trotter Theorem and its randomized variants; these schemes, (a) are partially asynchronous on each fractional step time-window, and (b) are characterized by their communication schedule between processors. The proposed mathematical framework allows us to rigorously justify the numerical and statistical consistency of the proposed algorithms, showing the convergence of our approximating schemes to the original serial KMC. The approach also provides a systematic evaluation of different processor communicating schedules. We carry out a detailed benchmarking of the parallel KMC schemes using available exact solutions, for example, in Ising-type systems and we demonstrate the capabilities of the method to simulate complex spatially distributed reactions at very large scales on GPUs. Finally, we discuss work load balancing between processors and propose a re-balancing scheme based on probabilistic mass transport methods.

97 MATHEMATICS AND COMPUTING↗

Quantitative Prediction of Optical Absorption in Molecular Solids from an Optimally Tuned Screened Range-Separated Hybrid Functional

In this work, we show that fundamental gaps and optical spectra of molecular solids can be predicted quantitatively and nonempirically within the framework of time-dependent density functional theory (TDDFT) using the recently developed optimally tuned screened range-separated hybrid (OT-SRSH) functional approach. In this scheme, the electronic structure of the gas-phase molecule is determined by optimal tuning of the range-separation parameter in a range-separated hybrid functional. Screening and polarization in the solid state are taken into account by adding long-range dielectric screening to the functional form, with the modified functional used to perform self-consistent periodic-boundary calculations for the crystalline solid. We provide a comprehensive benchmark for the accuracy of our approach by considering the X23 set of molecular solids and comparing results obtained from TDDFT with those obtained from many-body perturbation theory in the GW-BSE approximation. We additionally compare results obtained from dielectric screening computed within the random-phase approximation to those obtained from the computationally more efficient many-body dispersion approach and find that this influences the fundamental gap but has little effect on the optical spectra. Our approach is therefore robust and can be used for studies of molecular solids that are typically beyond the reach of computationally more intensive methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

High-order harmonic propagation in gases within the discrete dipole approximation

We present an efficient approach for computing high-order harmonic propagation based on the discrete dipole approximation. In contrast with other approaches, our strategy is based on computing the total field as the superposition of the driving field with the field radiated by the elemental emitters of the sample. In this way we avoid the numerical integration of the wave equation, as Maxwell's equations have an analytical solution for an elementary (pointlike) emitter. The present strategy is valid for low-pressure gases interacting with strong fields near the saturation threshold (i.e., partially ionized), which is a common situation in the experiments of high-order harmonic generation. We use this tool to study the dependence of phase matching of high-order harmonics with the relative position between the beam focus and the gas jet.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exemplifying Quantum Systems in a Finite Element Basis

This paper presents a description of the abstractions required for the expression and solution of the linear single-particle Schroedinger equation in a finite element basis. This paper consists of two disparate themes: First, to layout and establish the foundations of finite element analysis as an approximate numerical solution to extendable quantum mechanical systems; and second, to promote a high-performance open-source computational model for the approximate numerical solution to quantum mechanical systems. The structural foundation of the one-and two-dimensional time-independent Schroedinger equation describing an infinite potential well is explored and a brief overview of the hierarchal design of the computational library written in C++ is given.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Precise and Fast Computation of the Gravitational Field of a General Finite Body and Its Application to the Gravitational Study of Asteroid Eros

In order to obtain the gravitational field of a general finite body inside its Brillouin sphere, we developed a new method to compute the field accurately. First, the body is assumed to consist of some layers in a certain spherical polar coordinate system and the volume mass density of each layer is expanded as a Maclaurin series of the radial coordinate. Second, the line integral with respect to the radial coordinate is analytically evaluated in a closed form. Third, the resulting surface integrals are numerically integrated by the split quadrature method using the double exponential rule. Finally, the associated gravitational acceleration vector is obtained by numerically differentiating the numerically integrated potential. Numerical experiments confirmed that the new method is capable of computing the gravitational field independently of the location of the evaluation point, namely whether inside, on the surface of, or outside the body. It can also provide sufficiently precise field values, say of 14–15 digits for the potential and of 9–10 digits for the acceleration. Furthermore, its computational efficiency is better than that of the polyhedron approximation. This is because the computational error of the new method decreases much faster than that of the polyhedron models when the number of required transcendental function calls increases. As an application, we obtained the gravitational field of 433 Eros from its shape model expressed as the 24 × 24 spherical harmonic expansion by assuming homogeneity of the object.

79 ASTRONOMY AND ASTROPHYSICS↗

A multilevel stochastic collocation method for SPDEs

We present a multilevel stochastic collocation method that, as do multilevel Monte Carlo methods, uses a hierarchy of spatial approximations to reduce the overall computational complexity when solving partial differential equations with random inputs. For approximation in parameter space, a hierarchy of multi-dimensional interpolants of increasing fidelity are used. Rigorous convergence and computational cost estimates for the new multilevel stochastic collocation method are derived and used to demonstrate its advantages compared to standard single-level stochastic collocation approximations as well as multilevel Monte Carlo methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A SECOND-ORDER GODUNOV METHOD FOR MULTI-DIMENSIONAL RELATIVISTIC MAGNETOHYDRODYNAMICS

We describe a new Godunov algorithm for relativistic magnetohydrodynamics (RMHD) that combines a simple, unsplit second-order accurate integrator with the constrained transport (CT) method for enforcing the solenoidal constraint on the magnetic field. A variety of approximate Riemann solvers are implemented to compute the fluxes of the conserved variables. The methods are tested with a comprehensive suite of multi-dimensional problems. These tests have helped us develop a hierarchy of correction steps that are applied when the integration algorithm predicts unphysical states due to errors in the fluxes, or errors in the inversion between conserved and primitive variables. Although used exceedingly rarely, these corrections dramatically improve the stability of the algorithm. We present preliminary results from the application of these algorithms to two problems in RMHD: the propagation of supersonic magnetized jets and the amplification of magnetic field by turbulence driven by the relativistic Kelvin-Helmholtz instability (KHI). Both of these applications reveal important differences between the results computed with Riemann solvers that adopt different approximations for the fluxes. For example, we show that the use of Riemann solvers that include both contact and rotational discontinuities can increase the strength of the magnetic field within the cocoon by a factor of 10 in simulations of RMHD jets and can increase the spectral resolution of three-dimensional RMHD turbulence driven by the KHI by a factor of two. This increase in accuracy far outweighs the associated increase in computational cost. Our RMHD scheme is publicly available as part of the Athena code.

79 ASTRONOMY AND ASTROPHYSICS↗

Large Scale Computing and Storage Requirements for Basic Energy Sciences Research

The National Energy Research Scientific Computing Center (NERSC) is the leading scientific computing facility supporting research within the Department of Energy's Office of Science. NERSC provides high-performance computing (HPC) resources to approximately 4,000 researchers working on about 400 projects. In addition to hosting large-scale computing facilities, NERSC provides the support and expertise scientists need to effectively and efficiently use HPC systems. In February 2010, NERSC, DOE's Office of Advanced Scientific Computing Research (ASCR) and DOE's Office of Basic Energy Sciences (BES) held a workshop to characterize HPC requirements for BES research through 2013. The workshop was part of NERSC's legacy of anticipating users future needs and deploying the necessary resources to meet these demands. Workshop participants reached a consensus on several key findings, in addition to achieving the workshop's goal of collecting and characterizing computing requirements. The key requirements for scientists conducting research in BES are: (1) Larger allocations of computational resources; (2) Continued support for standard application software packages; (3) Adequate job turnaround time and throughput; and (4) Guidance and support for using future computer architectures. This report expands upon these key points and presents others. Several 'case studies' are included as significant representative samples of the needs of science teams within BES. Research teams scientific goals, computational methods of solution, current and 2013 computing requirements, and special software and support needs are summarized in these case studies. Also included are researchers strategies for computing in the highly parallel, 'multi-core' environment that is expected to dominate HPC architectures over the next few years. NERSC has strategic plans and initiatives already underway that address key workshop findings. This report includes a brief summary of those relevant to issues raised by researchers at the workshop.

36 MATERIALS SCIENCE↗

Approximate inference on planar graphs using loop calculus and belief progagation

We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to express the exact partition function Z of a graphical model as a finite sum of terms that can be evaluated once the belief propagation (BP) solution is known. In general, full summation over all correction terms is intractable. We develop an algorithm for the approach presented in Chertkov et al. (2008) which represents an efficient truncation scheme on planar graphs and a new representation of the series in terms of Pfaffians of matrices. We analyze in detail both the loop series and the Pfaffian series for models with binary variables and pairwise interactions, and show that the first term of the Pfaffian series can provide very accurate approximations. The algorithm outperforms previous truncation schemes of the loop series and is competitive with other state-of-the-art methods for approximate inference.

97 MATHEMATICS AND COMPUTING↗

Computation of the Thermal Expansion Coefficient of Graphene with Gaussian Approximation Potentials

Direct experimental measurement of thermal expansion coefficient without substrate effects is a challenging task for two-dimensional (2D) materials, and its accurate estimation with large-scale ab initio molecular dynamics is computationally very expensive. Machine learning-based interatomic potentials trained with ab initio data have been successfully used in molecular dynamics simulations to decrease the computational cost without compromising the accuracy. In this work, we investigated using Gaussian approximation potentials to reproduce the density functional theory-level accuracy for graphene within both lattice dynamical and molecular dynamical methods, and to extend their applicability to larger length and time scales. Two such potentials are considered, GAP17 and GAP20. GAP17, which was trained with pristine graphene structures, is found to give closer results to density functional theory calculations at different scales. Further vibrational and structural analyses verify that the same conclusions can be deduced with density functional theory level in terms of the reasoning of the thermal expansion behavior, and the negative thermal expansion behavior is associated with long-range out-of-plane phonon vibrations. Thus, it is argued that the enabled larger system sizes by machine learning potentials may even enhance the accuracy compared to small-size-limited ab initio molecular dynamics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A two-grid penalty method for American options

In this paper we consider the pricing of American options, governed by a partial differential complementarity problem. The differential problem is first approximated by a semi-linear PDE using two distinct penalty approaches which are well known in computational finance. We then initiate the two-grid algorithm by solving the nonlinear problem on a coarse grid and further the linearized in the interpolated coarse-grid solution problem on a fine grid. By means of the maximum principle the algorithm is shown to be of fourth order convergence rate in space. Numerical experiments verify the presented two-grid approach where we draw some interesting conclusions.

97 MATHEMATICS AND COMPUTING↗

Scalable Volume Visualization for Big Scientific Data Modeled by Functional Approximation

Considering the challenges posed by the space and time complexities in handling extensive scientific volumetric data, various data representations have been developed for the analysis of large-scale scientific data. Multivariate functional approximation (MFA) is an innovative data model designed to tackle substantial challenges in scientific data analysis. It computes values and derivatives with high-order accuracy throughout the spatial domain, mitigating artifacts associated with zero- or first-order interpolation. However, the slow query time through MFA makes it less suitable for interactively visualizing a large MFA model. In this work, we develop the first scalable interactive volume visualization pipeline, MFA-DVV, for the MFA model encoded from large-scale datasets. Our method achieves low input latency through distributed architecture, and its performance can be further enhanced by utilizing a compressed MFA model while still maintaining a high-quality rendering result for scientific datasets. We conduct comprehensive experiments to show that MFA-DVV can decrease the input latency and achieve superior visualization results for big scientific data compared with existing approaches.

big scientific dataset↗

A continuous analogue of the tensor-train decomposition

We develop new approximation algorithms and data structures for representing and computing with multivariate functions using the functional tensor-train (FT), a continuous extension of the tensor-train (TT) decomposition. The FT represents functions using a tensor-train ansatz by replacing the three-dimensional TT cores with univariate matrix-valued functions. The main contribution of this paper is a framework to compute the FT that employs adaptive approximations of univariate fibers, and that is not connected to any tensorized discretization. The algorithm can be coupled with any univariate linear or nonlinear approximation procedure. We demonstrate that this approach can generate multivariate function approximations that are several orders of magnitude more accurate, for the same cost, than those based on the conventional approach of compressing the coefficient tensor of a tensor-product basis. Our approach is in the spirit of other continuous computation packages such as Chebfun, and yields an algorithm which requires the computation of “continuous” matrix factorizations such as the LU and QR decompositions of vector-valued functions. To support these developments, we describe continuous versions of an approximate maximum-volume cross approximation algorithm and of a rounding algorithm that re-approximates an FT by one of lower ranks. We demonstrate that our technique improves accuracy and robustness, compared to TT and quantics-TT approaches with fixed parameterizations, of high-dimensional integration, differentiation, and approximation of functions with local features such as discontinuities and other nonlinearities.

42 ENGINEERING↗

Enhancing adaptive sparse grid approximations and improving refinement strategies using adjoint-based a posteriori error estimates

In this paper we present an algorithm for adaptive sparse grid approximations of quantities of interest computed from discretized partial differential equations. We use adjoint-based a posteriori error estimates of the physical discretization error and the interpolation error in the sparse grid to enhance the sparse grid approximation and to drive adaptivity of the sparse grid. Utilizing these error estimates provides significantly more accurate functional values for random samples of the sparse grid approximation. We also demonstrate that alternative refinement strategies based upon a posteriori error estimates can lead to further increases in accuracy in the approximation over traditional hierarchical surplus based strategies. Throughout this paper we also provide and test a framework for balancing the physical discretization error with the stochastic interpolation error of the enhanced sparse grid approximation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Goal-Oriented Optimal Approximations of Bayesian Linear Inverse Problems

We propose optimal dimensionality reduction techniques for the solution of goal-oriented linear-Gaussian inverse problems, where the quantity of interest (QoI) is a function of the inversion parameters. These approximations are suitable for large-scale applications. In particular, we study the approximation of the posterior covariance of the QoI as a low-rank negative update of its prior covariance and prove optimality of this update with respect to the natural geodesic distance on the manifold of symmetric positive definite matrices. Assuming exact knowledge of the posterior mean of the QoI, the optimality results extend to optimality in distribution with respect to the Kullback--Leibler divergence and the Hellinger distance between the associated distributions. We also propose the approximation of the posterior mean of the QoI as a low-rank linear function of the data and prove optimality of this approximation with respect to a weighted Bayes risk. Both of these optimal approximations avoid the explicit computation of the full posterior distribution of the parameters and instead focus on directions that are well informed by the data and relevant to the QoI. These directions stem from a balance among all the components of the goal-oriented inverse problem: prior information, forward model, measurement noise, and ultimate goals. We illustrate the theory using a high-dimensional inverse problem in heat transfer.

97 MATHEMATICS AND COMPUTING↗