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 703 records · Page 39

A computationally-efficient method for flamelet calculations

A new open-source code for the simulation of the diffusion flamelet equations is proposed. Emphasis is placed on using an approximate Jacobian to reduce the computational cost of the matrix operations. Performance of the proposed solvers is tested by performing flamelet calculations with kinetic mechanisms of varying sizes. For the unity Lewis number equations, the present iterative Newton solver using an approximate Jacobian greatly outperforms direct Newton solvers using exact Jacobians. The computation cost scales linearly with the number of species, leading to a reduction in solution times by two orders of magnitude for mechanisms containing thousands of species. The applicability of the Jacobian approximations to the solution of the non-unity Lewis number flamelet equations is assessed. The approximations are generally inadequate to solve the full non-unity Lewis number equations but can be used in some applications depending on the balance of terms in the flamelet equations. As an example, the flamelet solver is applied to the study of sooting tendencies in laminar co-flow diffusion flames where modified non-unity Lewis number flamelet equations, previously shown to accurately reproduce experimentally-measured Yield Sooting Indices (YSI), are solved. Here, the accelerated flamelet solver is well suited for sensitivity analysis and uncertainty quantification with large detailed kinetic mechanisms, tasks for which the computational cost was previously prohibitive.

42 ENGINEERING↗

Experimental Validation of Approximate Dynamic Programming Based Optimization and Convergence on Microgrid Applications

Stochastic optimization can better address uncertainties in power system problems. However, when state space and action space become large, many existing approaches become computationally expensive and even infeasible. Approximate dynamic programming (ADP) attracts researchers’ attention as a powerful tool for solving power system optimization problems with reduced computational cost. In this paper, in light of the existing literature, we investigate how the ADP approach with post-decision value function approximation converges to the nearly optimal solution with improved computational speed and experimentally validate the performance of the approach for a microgrid energy optimization problem. The approximation error versus the number of iteration is studied for convergence analysis of the post-decision ADP. A flowchart is provided to illustrate the proposed ADP algorithm for a microgrid energy optimization problem. The performance of ADP and dynamic programming (DP) is compared in terms of optimization error and computational time. It has found that the post-decision ADP approach can achieve competitive optimality with improved computational speed compared to the traditional DP.

Das, Avijit↗

Maximum Kolmogorov-Sinai Entropy Versus Minimum Mixing Time in Markov Chains

We establish a link between the maximization of Kolmogorov Sinai entropy (KSE) and the minimization of the mixing time for general Markov chains. Since the maximisation of KSE is analytical and easier to compute in general than mixing time, this link provides a new faster method to approximate the minimum mixing time dynamics. It could be interesting in computer sciences and statistical physics, for computations that use random walks on graphs that can be represented as Markov chains.

97 MATHEMATICS AND COMPUTING↗

Enhanced Estimation of Quantum Properties with Common Randomized Measurements

We present a technique for enhancing the estimation of quantum state properties by incorporating approximate prior knowledge about the quantum state. This consists in performing randomized measurements on a quantum processor and comparing the results with those obtained from a classical computer that stores an approximation of the quantum state. We provide unbiased estimators for expectation values of multicopy observables and present performance guarantees in terms of variance bounds that depend on the prior knowledge accuracy. We demonstrate the effectiveness of our approach through experimental and numerical examples detecting mixed-state entanglement, and estimating polynomial approximations of the von Neumann entropy and state fidelities. Published by the American Physical Society 2024

Physics↗

Phononic thermal resistance due to a finite periodic array of nano-scatterers

The wave property of phonons is employed to explore the thermal transport across a finite periodic array of nano-scatterers such as circular and triangular holes. As thermal phonons are generated in all directions, we study their transmission through a single array for both normal and oblique incidences, using a linear dispersionless time-dependent acoustic frame in a two-dimensional system. Roughness effects can be directly considered within the computations without relying on approximate analytical formulae. Analysis by spatio-temporal Fourier transform allows us to observe the diffraction effects and the conversion of polarization. Frequency-dependent energy transmission coefficients are computed for symmetric and asymmetric objects that are both subject to reciprocity. We demonstrate that the phononic array acts as an efficient thermal barrier by applying the theory of thermal boundary (Kapitza) resistances to arrays of smooth scattering holes in silicon for an exemplifying periodicity of 10 nm in the 5–100 K temperature range. It is observed that the associated thermal conductance has the same temperature dependence as that without phononic filtering.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An adaptive local reduced basis method for solving PDEs with uncertain inputs and evaluating risk

Many physical systems are modeled using partial differential equations (PDEs) with uncertain or random inputs. For such systems, naively propagating a fixed number of samples of the input probability law (or an approximation thereof) through the PDE is often inadequate to accurately quantify the "risk" associated with critical system responses. In this paper, we develop a goal-oriented, adaptive sampling and local reduced basis approximation for PDEs with random inputs. Our method determines a set of samples and an associated (implicit) Voronoi partition of the parameter domain on which we build local reduced basis approximations of the PDE solution. The samples are selected in an adaptive manner using an a posteriori error indicator. A notable advantage of the proposed approach is that the computational cost of the approximation during the adaptive process remains constant. We provide theoretical error bounds for our approximation and numerically demonstrate the performance of our method when compared to widely used adaptive sparse grid techniques. In addition, we tailor our approach to accurately quantify the risk of quantities of interest that depend on the PDE solution. We demonstrate our method on an advection-diffusion example and a Helmholtz example. Keywords: stochastic partial differential equation, adaptive sampling, reduced basis, a posteriori error estimation, coherent risk measure, conditional value-at-risk.

42 ENGINEERING↗

A stochastic Galerkin method for the Euler equations with Roe variable transformation

The Euler equations subject to uncertainty in the initial and boundary conditions are investigated via the stochastic Galerkin approach. We present a new fully intrusive method based on a variable transformation of the continuous equations. Roe variables are employed to get quadratic dependence in the flux function and a well-defined Roe average matrix that can be determined without matrix inversion. In previous formulations based on generalized polynomial chaos expansion of the physical variables, the need to introduce stochastic expansions of inverse quantities, or square roots of stochastic quantities of interest, adds to the number of possible different ways to approximate the original stochastic problem. We present a method where the square roots occur in the choice of variables, resulting in an unambiguous problem formulation. The Roe formulation saves computational cost compared to the formulation based on expansion of conservative variables. Moreover, the Roe formulation is more robust and can handle cases of supersonic flow, for which the conservative variable formulation fails to produce a bounded solution. For certain stochastic basis functions, the proposed method can be made more effective and well-conditioned. This leads to increased robustness for both choices of variables. We use a multi-wavelet basis that can be chosen to include a large number of resolution levels to handle more extreme cases (e.g. strong discontinuities) in a robust way. For smooth cases, the order of the polynomial representation can be increased for increased accuracy.

97 MATHEMATICS AND COMPUTING↗

Collaborative Computing Center (C3)

High Performance Computing (HPC) compliments theory and informs experimental processes in support of NE programs Big Data Analytics capabilities aid in the discovery of science-relevant relationships in data The C520 staff is made up of 19 Staff – Engineering, Basic Sciences, Computer Science, Statistics, Data Science, Technology Computer Computing Hardware Operations include: Falcon is fully utilized with an average 3X over subscription of waiting jobs over the past year Lemhi recently deployed in Feb 2019 Sawtooth procurement underway with Fall 2019 delivery 509 HPC accounts, lab, industry, university users 1.2 PB disk storage, 1.0 PB scratch storage, 0.8 PB disaster recovery storage Collaborative Computing Center nearing completion with approximately 200 staff -- Office space and 200 racks -- Data Center space for computer equipment

99 GENERAL AND MISCELLANEOUS↗

Test-Based Calibration of Safety Factors for Capacity Models

In this paper, a simple procedure to calibrate the safety factor of capacity models is presented. The calibration can be carried out based on any available database of experimental tests, even of limited size. The procedure aims to assess the model capability of predicting the test results and to calibrate the safety factor so that the capacity equation meets the target reliability level required by the code or sought by the calibrator. After predicting each test of the database with the capacity equation under consideration, the test-prediction pairs are checked for the property of linearity, and the relative error for the properties of homoscedasticity and normality. Once these properties are fulfilled—which may require a nonlinear transformation of the test values and/or the predictions—the closed-form equation proposed in this paper is employed to compute a target design value. The model safety factor is finally obtained by comparing such target design value with the design value obtained from the code. The paper also proposes two approximate analytical equations to compute the tolerance factor, used to attain any given fractile, as a function of the (even small) number of tests, with any assigned confidence level. A fundamental outcome of the procedure is that it yields an objective indicator of the model accuracy, measured by the standard deviation of its error, which may be regarded as a parameter useful for selecting the most reliable model among different competing ones. In the long run, the application of the proposed procedure will allow achieving a uniform reliability level throughout all capacity models used in codes and guidelines. A further advantage is that the partial safety factors so derived can be straightforwardly updated when more experiments become available. Finally, as an example, the proposed procedure is herein applied to the ACI 318 shear design capacity equation for concrete members unreinforced in shear.

42 ENGINEERING↗

Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions

Computational models are an essential tool for the design, characterization, and discovery of novel materials. Hard computational tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming much of their simulation, analysis, and data resources. Quantum computing, on the other hand, is an emerging technology with the potential to accelerate many of the computational tasks needed for materials science. In order to do that, the quantum technology must interact with conventional high-performance computing in several ways: approximate results validation, identification of hard problems, and synergies in quantum-centric supercomputing. In this paper, we provide a perspective on how quantum-centric supercomputing can help address critical computational problems in materials science, the challenges to face in order to solve representative use cases, and new suggested directions.

36 MATERIALS SCIENCE↗

Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions

Computational models are an essential tool for the design, characterization, and discovery of novel materials. Hard computational tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming much of their simulation, analysis, and data resources. Quantum computing, on the other hand, is an emerging technology with the potential to accelerate many of the computational tasks needed for materials science. In order to do that, the quantum technology must interact with conventional high-performance computing in several ways: approximate results validation, identification of hard problems, and synergies in quantum-centric supercomputing. In this paper, we provide a perspective on how quantum-centric supercomputing can help address critical computational problems in materials science, the challenges to face in order to solve representative use cases, and new suggested directions.

Alexeev, Yuri↗

A Monte Carlo model for determination of binary diffusion coefficients in gases

A Monte Carlo method has been developed for the calculation of binary diffusion coefficients in gas mixtures. The method is based on the stochastic solution of the linear Boltzmann equation obtained for the transport of one component in a thermal bath of the second one. Anisotropic scattering is included by calculating the classical deflection angle in binary collisions under isotropic potential. Model results are compared to accurate solutions of the Chapman-Enskog equation in the first and higher orders. We have selected two different cases, H{sub 2} in H{sub 2} and O in O{sub 2}, assuming rigid spheres or using a model phenomenological potential. Diffusion coefficients, calculated in the proposed approach, are found in close agreement with Chapman-Enskog results in all the cases considered, the deviations being reduced using higher order approximations.

97 MATHEMATICS AND COMPUTING↗

High-order gradients with the shifted boundary method: An embedded enriched mixed formulation for elliptic PDEs

Here, we propose an extension of the embedded boundary method known as “shifted boundary method” to elliptic diffusion equations in mixed form (e.g., Darcy flow, heat diffusion problems with rough coefficients, etc.). Our aim is to obtain an improved formulation that, for linear finite elements, is at least second-order accurate for both flux and primary variable, when either Dirichlet or Neumann boundary conditions are applied. Following previous work of Nishikawa and Mazaheri in the context of residual distribution methods, we consider the mixed form of the diffusion equation (i.e., with Darcy-type operators), and introduce an enrichment of the primary variable. This enrichment is obtained exploiting the relation between the primary variable and the flux variable, which is explicitly available at nodes in the mixed formulation. The proposed enrichment mimics a formally quadratic pressure approximation, although only nodal unknowns are stored, similar to a linear finite element approximation. We consider both continuous and discontinuous finite element approximations and present two approaches: a non-symmetric enrichment, which, as in the original references, only improves the consistency of the overall method; and a symmetric enrichment, which enables a full error analysis in the classical finite element context. Combined with the shifted boundary method, these two approaches are extended to high-order embedded computations, and enable the approximation of both primary and flux (gradient) variables with second-order accuracy, independently on the type of boundary conditions applied. We also show that the primary variable is third-order accurate, when pure Dirichlet boundary conditions are embedded.

97 MATHEMATICS AND COMPUTING↗

A nonlinearly preconditioned conjugate gradient algorithm for rank‐ R canonical tensor approximation

Summary Alternating least squares (ALS) is often considered the workhorse algorithm for computing the rank‐ R canonical tensor approximation, but for certain problems, its convergence can be very slow. The nonlinear conjugate gradient (NCG) method was recently proposed as an alternative to ALS, but the results indicated that NCG is usually not faster than ALS. To improve the convergence speed of NCG, we consider a nonlinearly preconditioned NCG (PNCG) algorithm for computing the rank‐ R canonical tensor decomposition. Our approach uses ALS as a nonlinear preconditioner in the NCG algorithm. Alternatively, NCG can be viewed as an acceleration process for ALS. We demonstrate numerically that the convergence acceleration mechanism in PNCG often leads to important pay‐offs for difficult tensor decomposition problems, with convergence that is significantly faster and more robust than for the stand‐alone NCG or ALS algorithms. We consider several approaches for incorporating the nonlinear preconditioner into the NCG algorithm that have been described in the literature previously and have met with success in certain application areas. However, it appears that the nonlinearly PNCG approach has received relatively little attention in the broader community and remains underexplored both theoretically and experimentally. Thus, this paper serves several additional functions, by providing in one place a concise overview of several PNCG variants and their properties that have only been described in a few places scattered throughout the literature, by systematically comparing the performance of these PNCG variants for the tensor decomposition problem, and by drawing further attention to the usefulness of nonlinearly PNCG as a general tool. In addition, we briefly discuss the convergence of the PNCG algorithm. In particular, we obtain a new convergence result for one of the PNCG variants under suitable conditions, building on known convergence results for non‐preconditioned NCG. Copyright © 2014 John Wiley & Sons, Ltd.

Sterck, Hans De↗

Quantum-centric supercomputing for materials science: A perspective on challenges and future directions

Computational models are an essential tool for the design, characterization, and discovery of novel materials. Computationally hard tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming much of their resources for simulation, analysis, and data processing. Quantum computing, on the other hand, is an emerging technology with the potential to accelerate many of the computational tasks needed for materials science. In order to do that, the quantum technology must interact with conventional high-performance computing in several ways: approximate results validation, identification of hard problems, and synergies in quantum-centric supercomputing. Here in this paper, we provide a perspective on how quantum-centric supercomputing can help address critical computational problems in materials science, the challenges to face in order to solve representative use cases, and new suggested directions.

36 MATERIALS SCIENCE↗

Liquid and liquid–gas flows at all speeds

All speed flows and in particular low Mach number flow algorithms are addressed for the numerical approximation of the Kapila et al. [1] multiphase flow model. This model is valid for fluid mixtures evolving in mechanical equilibrium but out of temperature equilibrium and is efficient for material interfaces computation separating miscible and non-miscible fluids. In this context, the interface is considered as a numerically diffused zone, captured as well as all present waves (shocks, expansion waves). The same flow model can be used to solve cavitating and boiling flows [2]. Many applications occurring with liquid–gas interfaces and cavitating flows involve a very wide range of Mach number, from 10{sup −3} to supersonic (and even hypersonic) conditions with respect to the mixture sound speed. It is thus important to address numerical methods free of restrictions regarding the Mach number. To do this, a preconditioned Riemann solver is built and embedded into the Godunov explicit scheme. It is shown that this method converges to exact solutions but needs too small time steps to be efficient. An implicit version is then derived, first in one dimension and second in the frame of 2D unstructured meshes. Two-phase flow preconditioning is then addressed in the frame of the Saurel et al. [3] algorithm. Modifications of the preconditioned Riemann solver are needed and detailed. Convergence of both single phase and two-phase numerical solutions are demonstrated with the help of single phase and two-phase steady nozzle flow solutions. Last, the method is illustrated by the computation of real cavitating flows in Venturi nozzles. Vapour pocket size and instability frequencies are reproduced by the model and method without using any adjustable parameter.

42 ENGINEERING↗

A TWO-MOMENT RADIATION HYDRODYNAMICS MODULE IN ATHENA USING A TIME-EXPLICIT GODUNOV METHOD

We describe a module for the Athena code that solves the gray equations of radiation hydrodynamics (RHD), based on the first two moments of the radiative transfer equation. We use a combination of explicit Godunov methods to advance the gas and radiation variables including the non-stiff source terms, and a local implicit method to integrate the stiff source terms. We adopt the M{sub 1} closure relation and include all leading source terms to O({beta}{tau}). We employ the reduced speed of light approximation (RSLA) with subcycling of the radiation variables in order to reduce computational costs. Our code is dimensionally unsplit in one, two, and three space dimensions and is parallelized using MPI. The streaming and diffusion limits are well described by the M{sub 1} closure model, and our implementation shows excellent behavior for a problem with a concentrated radiation source containing both regimes simultaneously. Our operator-split method is ideally suited for problems with a slowly varying radiation field and dynamical gas flows, in which the effect of the RSLA is minimal. We present an analysis of the dispersion relation of RHD linear waves highlighting the conditions of applicability for the RSLA. To demonstrate the accuracy of our method, we utilize a suite of radiation and RHD tests covering a broad range of regimes, including RHD waves, shocks, and equilibria, which show second-order convergence in most cases. As an application, we investigate radiation-driven ejection of a dusty, optically thick shell in the ISM. Finally, we compare the timing of our method with other well-known iterative schemes for the RHD equations. Our code implementation, Hyperion, is suitable for a wide variety of astrophysical applications and will be made freely available on the Web.

79 ASTRONOMY AND ASTROPHYSICS↗

Space–Time Least-Squares Petrov–Galerkin Projection for Nonlinear Model Reduction

This work proposes a space--time least-squares Petrov--Galerkin (ST-LSPG) projection method for model reduction of nonlinear dynamical systems. In contrast to typical nonlinear model-reduction methods that first apply (Petrov--)Galerkin projection in the spatial dimension and subsequently apply time integration to numerically resolve the resulting low-dimensional dynamical system, the proposed method applies projection in space and time simultaneously. To accomplish this, the method first introduces a low-dimensional space--time trial subspace, which can be obtained by computing tensor decompositions of state-snapshot data. The method then computes discrete-optimal approximations in this space--time trial subspace by minimizing the residual arising after time discretization over all space and time in a weighted $\ell^2$-norm. This norm can be defined to enable complexity reduction (i.e., hyper-reduction) in time, which leads to space--time collocation and space--time Gauss--Newton with Approximated Tensors (GNAT) variants of the ST-LSPG method. Advantages of the approach relative to typical spatial-projection-based nonlinear model reduction methods such as Galerkin projection and least-squares Petrov--Galerkin projection include a reduction of both the spatial and temporal dimensions of the dynamical system, and a priori error bounds that bound the solution error by the best space--time approximation error and whose stability constants exhibit slower growth in time. Numerical examples performed on model problems in fluid dynamics demonstrate the ability of the method to generate orders-of-magnitude computational savings relative to spatial-projection-based reduced-order models without sacrificing accuracy for a fixed spatio-temporal discretization.

97 MATHEMATICS AND COMPUTING↗