Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical algorithm 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 1,729 records · Page 96

Sequential Designs Based on Bayesian Uncertainty Quantification in Sparse Representation Surrogate Modeling

A numerical method, called OBSM, was recently proposed which employs overcomplete basis functions to achieve sparse representations. While the method can handle non-stationary response without the need of inverting large covariance matrices, it lacks the capability to quantify uncertainty in predictions. We address this issue by proposing a Bayesian approach which first imposes a normal prior on the large space of linear coefficients, then applies the MCMC algorithm to generate posterior samples for predictions. From these samples, Bayesian credible intervals can then be obtained to assess prediction uncertainty. A key application for the proposed method is the efficient construction of sequential designs. Several sequential design procedures with different infill criteria are proposed based on the generated posterior samples. As a result, numerical studies show that the proposed schemes are capable of solving problems of positive point identification, optimization, and surrogate fitting.

97 MATHEMATICS AND COMPUTING↗

Simulated Half-Precision Implementation of Blocked QR Factorization and Graph Clustering Applications

We explored half-precision implementation of blocked QR algorithms with the following motivations: 1. New GPUs perform fast half-precision arithmetic (4 to 16 times as fast as doubleprecision). 2. QR factorization is a basic linear algebra tool useful for many physics and data analysis applications. 3. Communication-avoiding, parallelizable QR algorithms already exist for talland- skinny matrices. While the standard QR algorithms are highly unstable in half-precision, our numerical simulations show that the Tall-and-Skinny QR (TSQR) algorithm can improve the backward error of QR factorization. When using subspace iteration for graph clustering applications, half-precision accuracy in forming the eigenspace is sufficient for clustering with high precision and recall for some medium-scale benchmark problems. Note that all half-precision arithmetic were simulated with conversions to single-precision floats. Therefore, the results from this work are somewhat optimistic.

97 MATHEMATICS AND COMPUTING↗

Incentivizing Cooperative Merging Control: Insights from Multi-Agent Deep Reinforcement Learning

Cooperative driving automation enables connected and automated vehicles (CAVs) to devise cooperative merging control, introducing great potentials to alleviate traffic congestion, reduce energy consumption, and enhance safety for highway on-ramp operations. Although numerous CAV cooperative merging algorithms have been developed to improve energy and traffic performance, the agreement-seeking among CAV users and their local benefits have been understudied. This can lead to rejections of cooperative merging plans and jeopardizing CAV performance, as a cooperation may entail certain CAVs to sacrifice their local benefits to achieve a system optimum. To address this issue, the study first leverages multi-agent deep reinforcement learning (MADRL) factoring both local reward and regional reward to demonstrate the discrepancies between CAV users’ local benefits and system optimum. Next, the existence of a correlated equilibrium is proved to characterize the convergence of MADRL training. This further facilitates the incorporation of incentives (computed based on reward discrepancies) to compensate for CAV users’ local benefits and facilitate system-optimal agreements in cooperative merging operations.

Zhou, Anye [ORNL] (ORCID:0000000301455579)↗

Emergent hydrodynamic mode on SU(2) plaquette chains and quantum simulation

We search for emergent hydrodynamic modes in real-time Hamiltonian dynamics of 2+1-dimensional SU(2) lattice gauge theory on a quasi-one-dimensional plaquette chain, by numerically computing symmetric correlation functions of energy densities on lattice sizes of about 20 with the local Hilbert space truncated at 𝑗 max = $\frac{1}{2}$. Because of the Umklapp processes, we only find a mode for energy diffusion. The symmetric correlator exhibits transport peak near zero frequency with a width approximately proportional to momentum squared at small momentum, when the system is fully quantum ergodic, as indicated by the eigenenergy level statistics. This transport peak leads to a power-law 𝑡 −$\frac{1}{2}$ decay of the symmetric correlator at late time, also known as the long-time tail, as well as diffusionlike spreading in position space. We also introduce a quantum algorithm for computing the symmetric correlator on a quantum computer and find it gives results consistent with exact diagonalization when tested on the IBM emulator. Finally we discuss the future prospect of searching for the sound modes.

Hamiltonian systems↗

Fixed Depth Hamiltonian Simulation via Cartan Decomposition

Simulating quantum dynamics on classical computers is challenging for large systems due to the significant memory requirements. Simulation on quantum computers is a promising alternative, but fully optimizing quantum circuits to minimize limited quantum resources remains an open problem. In this study, we tackle this problem by presenting a constructive algorithm, based on Cartan decomposition of the Lie algebra generated by the Hamiltonian, which generates quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one-dimensional transverse field $\mathrm{XY}$ model, where $\mathscr{O}$(n 2 )-gate circuits naturally emerge. Compared to product formulas with significantly larger gate counts, our algorithm drastically improves simulation precision. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

WE-AB-202-05: Validation of Lung Stress Maps for CT-Ventilation Imaging

Purpose: To date, lung CT-ventilation imaging has been based on quantification of local breathing-induced changes in Hounsfield Units (HU) or volume. This work investigates the use of a stress map resulting from a biomechanical deformable image registration (DIR) algorithm as a metric of the ventilation function. Method: Eight lung cancer patients presenting different kinds of ventilation defects were retrospectively analyzed. Additionally, to the 4DCT acquired for radiotherapy planning, five of them had PET and three had SPECT imaging following inhalation of Ga-68 and Tc-99m, respectively. For each patient, the inhale phase of the 4DCT was registered to the exhale phase using Morfeus, a biomechanical DIR algorithm based on the determination of boundary conditions on the lung surfaces and vessel tree. To take into account the heterogeneity of the tissue stiffness in the stress map estimation, each tetrahedral element of the finite-element model was assigned a Young’s modulus ranging from 60kPa to 12MPa, as a function of the HU in the inhale CT. The node displacements and element stresses resulting from the numerical simulation were used to generate three CT-ventilation maps based on: (i) volume changes (Jacobian determinant), (ii) changes in HU, (iii) the maximum principal stress. The voxel-wise correlation between each CT-ventilation map and the PET or SPECT V image was computed in a lung mask. Results: For patients with PET, the mean (min-max) Spearman correlation coefficients r were: 0.33 (0.19–0.45), 0.36 (0.16–0.51) and 0.42 (0.21–0.59) considering the Jacobian, changes in HU and maximum principal stress, respectively. For patients with SPECT V, the mean r were: 0.12 (−0.12–0.43), 0.29 (0.22–0.45) and 0.33 (0.25–0.39). Conclusion: The maximum principal stress maps showed a stronger correlation with the ventilation images than the previously proposed Jacobian or change in HU maps. This metric thus appears promising for CT-ventilation imaging. This work was funded in part by NIH P01CA059827.

60 APPLIED LIFE SCIENCES↗

Numerical methods for nonlocal and fractional models

Partial differential equations (PDEs) are used with huge success to model phenomena across all scientific and engineering disciplines. However, across an equally wide swath, there exist situations in which PDEs fail to adequately model observed phenomena, or are not the best available model for that purpose. On the other hand, in many situations, nonlocal models that account for interaction occurring at a distance have been shown to more faithfully and effectively model observed phenomena that involve possible singularities and other anomalies. Here, we consider a generic nonlocal model, beginning with a short review of its definition, the properties of its solution, its mathematical analysis and of specific concrete examples. We then provide extensive discussions about numerical methods, including finite element, finite difference and spectral methods, for determining approximate solutions of the nonlocal models considered. In that discussion, we pay particular attention to a special class of nonlocal models that are the most widely studied in the literature, namely those involving fractional derivatives. The article ends with brief considerations of several modelling and algorithmic extensions, which serve to show the wide applicability of nonlocal modelling.

97 MATHEMATICS AND COMPUTING↗

Orthogonal Polynomials Defined by Self-Similar Measures with Overlaps

Here, we study orthogonal polynomials with respect to self-similar measures, focusing on the class of infinite Bernoulli convolutions, which are defined by iterated function systems with overlaps, especially those defined by the Pisot, Garsia, and Salem numbers. By using an algorithm of Mantica, we obtain graphs of the coefficients of the 3-term recursion relation defining the orthogonal polynomials. We use these graphs to predict whether the singular infinite Bernoulli convolutions belong to the Nevai class. Based on our numerical results, we conjecture that all infinite Bernoulli convolutions with contraction ratios greater than or equal to 1/2 belong to Nevai’s class, regardless of the probability weights assigned to the self-similar measures.

97 MATHEMATICS AND COMPUTING↗

Numerical Validation of an Algorithm for Combined Soiling and Degradation Analysis of Photovoltaic Systems

We describe and demonstrate an open-source algorithm for simultaneously quantifying degradation and soiling of photovoltaic (PV) systems from energy-production time series data. The new analysis is based on year-on-year degradation rate analysis combined with stochastic rate and recovery soiling analysis. The algorithm is designed to fit into the workflow provided by RdTools, a Python module maintained by NREL and collaboratively developed with the community, which provides a framework and functions for degradation and loss-factor analysis of PV field data. We demonstrate the method on numerically simulated PV data sets and show that it reduces the root-mean-square error of the P50 degradation rate estimate when soiling is present.

14 SOLAR ENERGY↗

High-Order Curvilinear Finite Element Methods for Lagrangian Hydrodynamics [High Order Curvilinear Finite Elements for Lagrangian Hydrodynamics]

The numerical approximation of the Euler equations of gas dynamics in a movingLagrangian frame is at the heart of many multiphysics simulation algorithms. Here, we present a general framework for high-order Lagrangian discretization of these compressible shock hydrodynamics equations using curvilinear finite elements. This method is an extension of the approach outlined in [Dobrev et al., Internat. J. Numer. Methods Fluids, 65 (2010), pp. 1295--1310] and can be formulated for any finite dimensional approximation of the kinematic and thermodynamic fields, including generic finite elements on two- and three-dimensional meshes with triangular, quadrilateral, tetrahedral, or hexahedral zones. We discretize the kinematic variables of position and velocity using a continuous high-order basis function expansion of arbitrary polynomial degree which is obtained via a corresponding high-order parametric mapping from a standard reference element. This enables the use of curvilinear zone geometry, higher-order approximations for fields within a zone, and a pointwise definition of mass conservation which we refer to as strong mass conservation. Moreover, we discretize the internal energy using a piecewise discontinuous high-order basis function expansion which is also of arbitrary polynomial degree. This facilitates multimaterial hydrodynamics by treating material properties, such as equations of state and constitutive models, as piecewise discontinuous functions which vary within a zone. To satisfy the Rankine--Hugoniot jump conditions at a shock boundary and generate the appropriate entropy, we introduce a general tensor artificial viscosity which takes advantage of the high-order kinematic and thermodynamic information available in each zone. Finally, we apply a generic high-order time discretization process to the semidiscrete equations to develop the fully discrete numerical algorithm. Our method can be viewed as the high-order generalization of the so-called staggered-grid hydrodynamics (SGH) approach and we show that under specific low-order assumptions, we exactly recover the classical SGH method. We also present numerical results from an extensive series of verification tests that demonstrate several important practical advantages of using high-order finite elements in this context.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical methods for nonlocal and fractional models

Partial differential equations (PDEs) are used, with huge success, to model phenomena arising across all scientific and engineering disciplines. However, across an equally wide swath, there exist situations in which PDE models fail to adequately model observed phenomena or are not the best available model for that purpose. On the other hand, in many situations, nonlocal models that account for interaction occurring at a distance have been shown to more faithfully and effectively model observed phenomena that involve possible singularities and other anomalies. In this article, we consider a generic nonlocal model, beginning with a short review of its definition, the properties of its solution, its mathematical analysis, and specific concrete examples. We then provide extensive discussions about numerical methods, including finite element, finite difference, and spectral methods, for determining approximate solutions of the nonlocal models considered. In that discussion, we pay particular attention to a special class of nonlocal models that are the most widely studied in the literature, namely those involving fractional derivatives. The article ends with brief considerations of several modeling and algorithmic extensions which serve to show the wide applicability of nonlocal modeling.

97 MATHEMATICS AND COMPUTING↗

Exponential Runge-Kutta Parareal for non-diffusive equations

Parareal is a well-known parallel-in-time algorithm that combines a coarse and fine propagator within a parallel iteration. It allows for large-scale parallelism that leads to significantly reduced computational time compared to serial time-stepping methods. However, like many parallel-in-time methods it can fail to converge when applied to non-diffusive equations such as hyperbolic systems or dispersive nonlinear wave equations. Here, this paper explores the use of exponential integrators within the Parareal iteration. Exponential integrators are particularly interesting candidates for Parareal because of their ability to resolve fast-moving waves, even at the large stepsizes used by coarse propagators. This work begins with an introduction to exponential Parareal integrators followed by several motivating numerical experiments involving the nonlinear Schrödinger equation. These experiments are then analyzed using linear analysis that approximates the stability and convergence properties of the exponential Parareal iteration on nonlinear problems. The paper concludes with two additional numerical experiments involving the dispersive Kadomtsev-Petviashvili equation and the hyperbolic Vlasov-Poisson equation. These experiments demonstrate that exponential Parareal methods offer improved time-to-solution compared to serial exponential integrators when solving certain non-diffusive equations.

97 MATHEMATICS AND COMPUTING↗

Nonadiabatic Molecular Dynamics Simulations Based on Time-Dependent Density Functional Tight-Binding Method

Nonadiabatic excited-state molecular dynamics underpin many photophysical and photochemical phenomena, such as exciton dynamics, charge separation and transport. In this work, we present an efficient nonadiabatic molecular dynamic (NAMD) simulation method based on time-dependent density functional tight-binding (TDDFTB) theory. Specifically, the adiabatic electronic structure, an essential NAMD input, is described at the TDDFTB level. Here, the nonadiabatic effects originating from the coupled motions of electrons and nuclei are treated by the trajectory surface hopping algorithm. To improve the computational efficiency, nonadiabatic couplings between excited states within the TDDFTB method are derived and implemented using an analytical approach. Further, the time-dependent nonadiabatic coupling scalars are calculated based on the overlap between molecular orbitals rather than the Slater determinants to speed up the simulations. In addition, the electronic decoherence scheme and a state reassigned unavoided crossings algorithm, which has been implemented in the NEXMD software, are used to improve the accuracy of the simulated dynamics and handle trivial unavoided crossings. Finally, the photoinduced nonadiabatic dynamics of a benzene molecule are simulated to demonstrate our implementation. The results for excited state NAMD simulations of benzene molecule based on TDDFTB method compare well that obtained with numerically expensive time-dependent density functional theory. The proposed methodology provides an attractive theoretical simulation tool for predicting the photophysical and photochemical properties of complex materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Dynamic Behavior of Natural Seep Vents: Analysis of Field and Laboratory Observations and Modeling (Final Scientific/Technical Report)

In this project, we have analyzed data collected by the U.S. Department of Energy (DOE), National Energy Technology Laboratory (NETL) in a high pressure water tunnel (HPWT) and data from two research cruises to natural seeps in the Gulf of Mexico to adapt and validate a numerical model to predict the dynamics of natural seeps in the deep oceans. The HPWT data include video observations of the shrinkage rate of individual methane and natural gas bubbles under simulated deep-water conditions. Field data were collected during two cruises by the Gulf Integrated Spill Research (GISR) Consortium led by Texas A&M University and funded by the Gulf of Mexico Research Initiative (GoMRI). These data included in situ observations from a remotely operated vehicle (ROV) of gas bubbles at two natural seep sites in the Gulf and acoustic observations of the natural seep bubble flares in the ocean water column. The acoustic data were from multibeam echosounders, one mounted in a forward-looking orientation on the ROV and another mounted down-looking in the haul of the ship. All of these laboratory and field data were focused on the dynamics of natural gas bubbles at temperatures and pressures favorable for clathrate hydrate formation between the gas and water. Our analyses of this data focused on understanding the mechanisms responsible for gas bubble dissolution within the hydrate stability zone (HSZ) of the oceans. Ice-like hydrate shells may form on the bubble-water interface under these conditions, and it was unknown how this might affect the mass transfer of gas into the ocean. We were able to extract bubble shrinkage rates from the HPWT datasets. Using this data we determined that mass transfer coefficients with and without a hydrate shell match empirical values for bubbles in contaminated systems (so-called dirty bubbles contaminated by naturally occurring surfactants). We also showed that free gas, and not gas hydrate, is the dominant dissolving phase when the hydrate sub-cooling is below 11 degree Celsius (temperature difference between hydrate the hydrate formation temperature and ambient temperator) or the pressure is reducing as bubbles rise through the ocean water column. Using this mass transfer model, our numerical model of bubble dissolution matched the over 200 HPWT experiments with an average error of 10% for predicting the bubble size at the end of an experiment. From field data in the literature, we also observed that gas bubbles dissolve faster when they are initially released, following mass transfer coefficients for so-called clean-bubbles (those not yet contaminated by surfactants). Shortly after release within the HSZ, a hydrate shell forms on the bubble-water interface, and the mass transfer reduces to rates matching those of dirty bubbles. We correlated this transition time from clean to dirty bubble behavior with the initial bubble surface area and the hydrate sub-cooling. With this model for hydrate formation time and using the mass transfer coefficients deduced from the HPWT data, we validated our numerical model for predicting the rise heights of natural seep flares in the oceans. Flare heights are commonly observed in haul-mounted acoustic multibeam data. The numerical model predicts bubbles to rise high in the ocean water column owing to the slower mass transfer rates for dirty bubbles that accompany the majority of their rise time. We found that the numerical model predictions matched the observed flare heights within 5% to 10% accuracy when we compared the rise heights of the largest bubbles released from the seafloor with the bubbles acoustically visible in the multibeam data. Bubbles become acoustically transparent as they shrink to sizes of order 1 mm in diameter for the multibeam frequencies used in the field. The forward-looking multibeam on the ROV also provided data on the lateral spreading of bubbles in natural seep flares. Our analysis of this data showed that spreading follows a diffusion process, with the effective diffusivity correlating with the wobbling length scale of these ellipsoidal bubbles. When we apply this diffusivity in a random displacement model of bubble spreading, our numerical simulations match closely the lateral spread observed by the M3 in the ocean water column. Finally, we compared the seep model predictions for the acoustic properties of these natural seep plumes with that observed by the acoustic instruments in the field. The M3 and EM 302 observations were converted to relative values of target strength using a calibration we obtained in the laboratory for the M3 and using an algorithm from the manufacturer for the EM 302. Comparing the numerical seep model to these data, we obtain good agreement over the whole height of rise of these bubble flares. This further validates the numerical model. Overall, our validated seep model captures the key dynamics of gas bubbles released from natural seeps in the oceans and helps to predict the fate of methane in the water column.

03 NATURAL GAS↗

Theoretical Development of Controller Transfer applied to Dynamical Systems

Data-driven control strategies suffer from the necessity of training and its associated computational time and cost. This motivates the continuous increase of popularity of transfer learning based methods. In this paper, we have investigated transfer learning in the context of controller for dynamical systems. First, we have derived conditions under which controller can be transferred between two linear dynamical systems. Furthermore, we have introduced a novel algorithm to design the transferable and non-transferable control components for linear systems. Secondly, we have derived conditions under which a stabilizing controller can be transferred between two different nonlinear dynamical systems. Furthermore, we have used the notion of zero dynamics to transform the nonlinear dynamics into global normal form, to derive the transferability conditions on the controller. Finally, we have numerically evaluated the performance of our transfer learning based methods for two sets of example linear and nonlinear dynamical systems.

Chakraborty, Indrasis↗

Transport in Random Media With Inhomogeneous Mixing Statistics

The Levermore-Pomraning (LP) model has been investigated for use in implicit Monte Carlo (IMC) algorithms to describe thermal photon transport computations in stochastically mixed cells with material energy coupling. For purely absorbing non-emitting materials, the LP-model is known to predict the exact material averaged fluxes when the mixing statistics are Markovian. In the presence of scattering or reemmission, or if the mixing is non-Markovian, the LP-model is approximate and has greatly diminished accuracy for optically thick, highly scattering materials. Nevertheless, the model enables a robust extension of the simple atomic mix approximation to accommodate spatial correlation effects through well characterized parameters such as mean chord lengths. In this work, we construct exact analytical solutions of the LP-equations for piecewise constant spatial variation of the material chord lengths. It is not possible in general to obtain closed form solutions when the chord lengths are continuous functions of space, although we briefly examine special conditions under which this is feasible. However, by allowing an arbitrarily fine spatial segmentation of the medium it is possible to construct highly refined solutions to fit desired spatial chord length profiles. Material volume fractions that are consistent with the chord lengths are first constructed by solving the associated Chapmann-Kolmogorov equations and applied to obtain the material averaged fluxes in two settings: when the materials are purely absorbing, and when scattering is present in rod model geometry. Illustrative numerical results for the volume fractions and material averaged fluxes are obtained by implementing the algorithms in MATLAB for spatially linear and quadratic variations of the chord lengths.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

OpenACC acceleration of an unstructured CFD solver based on a reconstructed discontinuous Galerkin method for compressible flows

Here, an OpenACC directive-based graphics processing unit (GPU) parallel scheme is presented for solving the compressible Navier–Stokes equations on 3D hybrid unstructured grids with a third-order reconstructed discontinuous Galerkin method. The developed scheme requires the minimum code intrusion and algorithm alteration for upgrading a legacy solver with the GPU computing capability at very little extra effort in programming, which leads to a unified and portable code development strategy. A face coloring algorithm is adopted to eliminate the memory contention because of the threading of internal and boundary face integrals. A number of flow problems are presented to verify the implementation of the developed scheme. Timing measurements were obtained by running the resulting GPU code on one Nvidia Tesla K20c GPU card (Nvidia Corporation, Santa Clara, CA, USA) and compared with those obtained by running the equivalent Message Passing Interface (MPI) parallel CPU code on a compute node (consisting of two AMD Opteron 6128 eight-core CPUs (Advanced Micro Devices, Inc., Sunnyvale, CA, USA)). Speedup factors of up to 24× and 1.6× for the GPU code were achieved with respect to one and 16 CPU cores, respectively. The numerical results indicate that this OpenACC-based parallel scheme is an effective and extensible approach to port unstructured high-order CFD solvers to GPU computing.

97 MATHEMATICS AND COMPUTING↗

Haar-Like Wavelets on Hierarchical Trees

Here, discrete wavelet methods, originally formulated in the setting of regularly sampled signals, can be adapted to data defined on a point cloud if some multiresolution structure is imposed on the cloud. A wide variety of hierarchical clustering algorithms can be used for this purpose, and the multiresolution structure obtained can be encoded by a hierarchical tree of subsets of the cloud. Prior work introduced the use of Haar-like bases defined with respect to such trees for approximation and learning tasks on unstructured data. This paper builds on that work in two directions. First, we present an algorithm for constructing Haar-like bases on general discrete hierarchical trees. Second, with an eye towards data compression, we present thresholding techniques for data defined on a point cloud with error controlled in the $L$ $\infty$ norm and in a Hölder-type norm. In a concluding trio of numerical examples, we apply our methods to compress a point cloud dataset, study the tightness of the $L$ $\infty$ error bound, and use thresholding to identify MNIST classifiers with good generalizability.

97 MATHEMATICS AND COMPUTING↗