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 1,387 records · Page 77

Numerical solutions of 3-dimensional Navier-Stokes equations for closed bluff-bodies

The Navier-Stokes equations are solved numerically. These equations are unsteady, compressible, viscous, and three-dimensional without neglecting any terms. The time dependency of the governing equations allows the solution to progress naturally for an arbitrary initial guess to an asymptotic steady state, if one exists. The equations are transformed from physical coordinates to the computational coordinates, allowing the solution of the governing equations in a rectangular parallelepiped domain. The equations are solved by the MacCormack time-split technique which is vectorized and programmed to run on the CDc VPS 32 computer. The codes are written in 32-bit (half word) FORTRAN, which provides an approximate factor of two decreasing in computational time and doubles the memory size compared to the 54-bit word size.

Abolhassani, J. S.↗

Asteroid orbit determination using Bayesian probabilities

Bayesian a priori and a posteriori probability densities are employed to determine asteroid orbital elements from optical astrometric observations. For near-earth asteroids and Jupiter Trojans, the two-body approximation can yield grossly erroneous uncertainty estimates because of the scattering effect of close planetary encounters or prolonged weak planetary perturbations. For main-belt asteroids, the two-body approximation works efficiently, from which it is inferred that, although the ephemeris must be computed from an integrated orbit, only approximate partial derivatives are needed to attain sufficient accuracy in predicting ephemeris uncertainties. The semimajor and semiminor axes of the 2D 1-sigma sky-plane uncertainty ellipse during the years 1993 to 2005 in the many-body and two-body linear approximations are shown.

Muinonen, Karri↗

A semi-intrusive deterministic approach to uncertainty quantification in non-linear fluid flow problems

This paper deals with the formulation of a semi-intrusive (SI) method allowing the computation of statistics of linear and non linear PDEs solutions. This method shows to be very efficient to deal with probability density function of whatsoever form, long-term integration and discontinuities in stochastic space. Given a stochastic PDE where randomness is defined on Ω, starting from (i) a description of the solution in term of a space variables, (ii) a numerical scheme defined for any event ω∈Ω and (iii) a (family) of random variables that may be correlated, the solution is numerically described by its conditional expectancies of point values or cell averages and its evaluation constructed from the deterministic scheme. One of the tools is a tessellation of the random space as in finite volume methods for the space variables. Then, using these conditional expectancies and the geometrical description of the tessellation, a piecewise polynomial approximation in the random variables is computed using a reconstruction method that is standard for high order finite volume space, except that the measure is no longer the standard Lebesgue measure but the probability measure. This reconstruction is then used to formulate a scheme on the numerical approximation of the solution from the deterministic scheme. This new approach is said semi-intrusive because it requires only a limited amount of modification in a deterministic solver to quantify uncertainty on the state when the solver includes uncertain variables. The effectiveness of this method is illustrated for a modified version of Kraichnan–Orszag three-mode problem where a discontinuous pdf is associated to the stochastic variable, and for a nozzle flow with shocks. The results have been analyzed in terms of accuracy and probability measure flexibility. Finally, the importance of the probabilistic reconstruction in the stochastic space is shown up on an example where the exact solution is computable, the viscous Burgers equation.

97 MATHEMATICS AND COMPUTING↗

Posterior Covariance Matrix Approximations

Here, the Davis equation of state (EOS) is commonly used to model thermodynamic relationships for high explosive (HE) reactants. Typically, the parameters in the EOS are calibrated, with uncertainty, using a Bayesian framework and Markov Chain Monte Carlo (MCMC) methods. However, MCMC methods are computationally expensive, especially for complex models with many parameters. This paper provides a comparison between MCMC and less computationally expensive Variational methods (Variational Bayesian and Hessian Variational Bayesian) for computing the posterior distribution and approximating the posterior covariance matrix based on heterogeneous experimental data. All three methods recover similar posterior distributions and posterior covariance matrices. This study demonstrates that for this EOS parameter calibration application, the assumptions made in the two Variational methods significantly reduce the computational cost but do not substantially change the results compared to MCMC.

97 MATHEMATICS AND COMPUTING↗

Integration of multiple coinflip devices for high-quality random sampling

Artificial intelligence, scientific computing, and probabilistic computing use random sampling to approximate solutions to various problems, with larger models requiring a substantial quantity of random numbers. To generate the required vast quantity of random numbers at high rates, we explore so-called “coinflip” devices, which are stochastic microelectronic devices ideally capable of independently generating random bits with a tunable weight at a high rate. However, coinflip devices are inherently analog and demonstrate nonidealities, like temperature dependence and drift, that can introduce determinism into the outputs. We present important considerations for building systems of multiple coinflip devices to produce high-quality bitstreams with low error and little dependency on previous bits. Using tunnel diodes as coinflip devices, we implement a control loop to adapt to temperature dependence and generate fair bitstreams with each device. While this can lead to dependencies between bits in a single bitstream, we demonstrate that combining results generated in parallel with individual tunnel diodes can produce fair and unpredictable bitstreams. The suitability of these bitstreams for use in probabilistic computing is then demonstrated through a Monte Carlo approximation of π.

Taylor, Brady Garland [Sandia National Laboratorie↗

Computers boost structural technology

Derived from matrix methods of structural analysis and finite element methods developed over the last three decades, computational structures technology (CST) blends computer science, numerical analysis, and approximation theory into structural analysis and synthesis. Recent significant advances in CST include stochastic-based modeling, strategies for performing large-scale structural calculations on new computing systems, and the integration of CST with other disciplinary modules for multidisciplinary analysis and design. New methodologies have been developed at NASA for integrated fluid-thermal structural analysis and integrated aerodynamic-structure-control design. The need for multiple views of data for different modules also led to the development of a number of sophisticated data-base management systems. For CST to play a role in the future development of structures technology and in the multidisciplinary design of future flight vehicles, major advances and computational tools are needed in a number of key areas.

Noor, Ahmed K.↗

Automatic differentiation of codes in nuclear engineering applications.

We discuss our experience in applying automatic differentiation (AD) to calculations in nuclear reactor applications. The document is intended as a guideline on how to apply AD to Fortran codes with significant legacy components; it is also a part of a larger research effort in uncertainty quantification using sampling methods augmented with derivative information. We provide a brief theoretical description of the concept of AD, explain the necessary changes in the code structure, and remark on possible ways to deal with non-differentiability. Numerical experiments were carried out where the derivative of a functional subset of the SAS4A/SASSYS code was computed in forward mode with several AD tools. The results are in good agreement with both the real and complex finite-difference approximations of the derivative.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

PLANC: Parallel Low-rank Approximation with Nonnegativity Constraints

In this work, we consider the problem of low-rank approximation of massive dense nonnegative tensor data, for example, to discover latent patterns in video and imaging applications. As the size of data sets grows, single workstations are hitting bottlenecks in both computation time and available memory. We propose a distributed-memory parallel computing solution to handle massive data sets, loading the input data across the memories of multiple nodes, and performing efficient and scalable parallel algorithms to compute the low-rank approximation. We present a software package called Parallel Low-rank Approximation with Nonnegativity Constraints, which implements our solution and allows for extension in terms of data (dense or sparse, matrices or tensors of any order), algorithm (e.g., from multiplicative updating techniques to alternating direction method of multipliers), and architecture (we exploit GPUs to accelerate the computation in this work). We describe our parallel distributions and algorithms, which are careful to avoid unnecessary communication and computation, show how to extend the software to include new algorithms and/or constraints, and report efficiency and scalability results for both synthetic and real-world data sets.

97 MATHEMATICS AND COMPUTING↗

First and second order approximations to stage numbers in multicomponent enrichment cascades

This paper describes closed form, Taylor series approximations to the number product stages in a multicomponent enrichment cascade. Such closed form approximations are required when a symbolic, rather than a numeric, algorithm is used to compute the optimal cascade state. Both first and second order approximations were implemented. The first order solution was found to be grossly incorrect, having the wrong functional form over the entire domain. On the other hand, the second order solution shows excellent agreement with the 'true' solution over the domain of interest. An implementation of the symbolic, second order solver is available in the free and open source PyNE library. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Three-dimensional viscous flows with large secondary velocity

A new system of approximation equations is derived for three-dimensional steady viscous compressible flows in which a primary-flow direction is present, but in which both transverse velocity components can be large. Previous approaches which address simplification of the steady Navier-Stokes equations are discussed, and a new approach is proposed. The transverse velocity vector which corrects a given potential flow has been decomposed into potential and rotational components. It is found that the potential-velocity vector may be assumed small, whereas the rotational-velocity vector may be assumed small, whereas the rotational velocity vector and hence the composite secondary flow can be of order unity. This assumption leads to a system of governing equations whose characteristic polynomial has a non-elliptic form for arbitrary Mach numbers. The resulting non-elliptic approximation equations can be solved as an initial/boundary-value problem. Computed results confirm the small scalar-potential approximation.

Briley, W. R.↗

Multiphysics Degradation Modeling of Energy Storage Materials via RKPM with a Neural Network-Enhancement

In energy storage materials, strong electrochemical-mechanical coupling and highly anisotropic material properties contribute to the formation and propagation of micro-cracking during charge/discharge cycling, resulting in reduced performance and service life. A coupled electro-chemo-mechanical reproducing kernel particle method (RKPM) formulation is developed, and a patch-test is formulated to certify optimal convergence of the proposed RKPM method for the coupled physics system. With microstructural images supplied by the National Renewable Energy Laboratory (NREL), pixel-based model construction by RKPM is then used to represent the complex material microstructures for modeling the coupled physics of these systems. Further, a neural network-enhanced reproducing kernel particle method (NN-RKPM) [1, 2] is introduced to effectively model damage and crack propagation in the material microstructures; the location, orientation, and solution transition near a localization are automatically captured by superimposed block-level NN optimizations. This NN enrichment approach allows for effective modeling of localizations via a fixed background discretization, relieving tedious efforts for adaptive refinement in traditional mesh-based methods. Applications to the heterogeneous microstructures of Li-ion battery cathodes will be presented to demonstrate the effectiveness of the proposed methods. Reference: [1] Baek, J., Chen, J. S., Susuki, K., "Neural Network enhanced Reproducing Kernel Particle Method for Modeling Localizations," International Journal for Numerical Methods in Engineering, Vol. 123, pp 4422-4454, https://doi.org/10.1002/nme.7040, 2022. [2] Baek, J., Chen, J. S., "A Neural Network-Based Enrichment of Reproducing Kernel Approximation for Modeling Brittle Fracture", Computer Methods in Applied Mechanics and Engineering Vol. 410, 116590, 2024.

electro-chemo-mechanical coupling↗

Generation and transmission expansion planning for renewable energy integration

In recent years the expansion planning problem has become increasingly complex. As expansion planning (sometimes called composite or integrated resource planning) is a non-linear and non-convex optimization problem, researchers have traditionally focused on approximate models of power flows to solve the problem. The problem has also been split into generation expansion planning (GEP) and transmission network expansion planning (TNEP) to improve computational tractability. Until recently these approximations have produced results that are straight-forward to combine and adapt to the more complex and complete problem. However, the power grid is evolving towards a state where the adaptations are no longer easy (e.g. large amounts of limited control, renewable generation, comparable generation and transmission construction costs) and necessitates new approaches. Recent work on deterministic Discrepancy Bounded Local Search (DBLS) has shown it to be quite effective in addressing the TNEP. In this paper, we propose a generalization of DBLS to handle simultaneous generation and transmission planning.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Linear source approximation in CASMO5

A Linear Source (LS) approximation has been implemented in the two-dimensional Method of Characteristics (MOC) transport solver in a prototype version of CASMO5. The LS approximation, which relies on the computation of trajectory-based spatial moments over source regions to obtain the linear source expansion coefficients, improves the solution accuracy relative to the 'flat' or constant source approximation. In addition, the LS formulation is capable of treating arbitrarily-shaped source regions and is compatible with standard Coarse-Mesh Finite Difference (CMFD) acceleration. Numerical tests presented in this paper for the C5G7 MOX benchmark show that, for comparable accuracy with respect to the reference solution, the LS approximation can reduce the run time by a factor of four and the memory requirements by a factor often relative to the FS scheme. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Low-rank separated representation surrogates of high-dimensional stochastic functions: Application in Bayesian inference

This study introduces a non-intrusive approach in the context of low-rank separated representation to construct a surrogate of high-dimensional stochastic functions, e.g., PDEs/ODEs, in order to decrease the computational cost of Markov Chain Monte Carlo simulations in Bayesian inference. The surrogate model is constructed via a regularized alternative least-square regression with Tikhonov regularization using a roughening matrix computing the gradient of the solution, in conjunction with a perturbation-based error indicator to detect optimal model complexities. The model approximates a vector of a continuous solution at discrete values of a physical variable. The required number of random realizations to achieve a successful approximation linearly depends on the function dimensionality. The computational cost of the model construction is quadratic in the number of random inputs, which potentially tackles the curse of dimensionality in high-dimensional stochastic functions. Furthermore, this vector-valued separated representation-based model, in comparison to the available scalar-valued case, leads to a significant reduction in the cost of approximation by an order of magnitude equal to the vector size. The performance of the method is studied through its application to three numerical examples including a 41-dimensional elliptic PDE and a 21-dimensional cavity flow.

97 MATHEMATICS AND COMPUTING↗

Ionosphere-exosphere coupling through charge exchange and momentum transfer in hydrogen-proton collisions

The implications of a traditional assumption of exospheric physics, that collisions of hydrogen atoms and protons preferentially result in charge exchange with negligible momentum transfer are examined. Initially adopted as a necessary convenience to accommodate limited computer resources in exosphere model calculations, this approximation results in a direct transformation of the proton velocity distribution into a hot component of neutral hydrogen. With expanding computational facilities, the need for the approximation has passed. As the first step toward its replacement with a realistic, quantum mechanical model of the H - H(+) collision process, differential and cumulative cross sections were calculated for quantum elastic scattering of indistinguishable nuclei for a fine grid of encounter energies and scattering angles. These data are used to study the nature of ionosphere-exosphere coupling through H - H(+) collisions, and to demonstrate that the distribution of velocities of scattered H produced in the traditional exospheric charge exchange approximation, as well as that arising from an alternative, fluid dynamic approach, leads to unacceptable abundances of coronal atoms in long-term, highly elliptic trajectories.

Hodges, R. R., Jr.↗

The interaction of RNA helicase DDX3 with HIV-1 Rev-CRM1-RanGTP complex during the HIV replication cycle

Molecular traffic between the nucleus and the cytoplasm is regulated by the nuclear pore complex (NPC), which acts as a highly selective channel perforating the nuclear envelope in eukaryotic cells. The human immunodeficiency virus (HIV) exploits the nucleocytoplasmic pathway to export its RNA transcripts across the NPC to the cytoplasm. Despite extensive study on the HIV life cycle and the many drugs developed to target this cycle, no current drugs have been successful in targeting the critical process of viral nuclear export, even though HIV’s reliance on a single host protein, CRM1, to export its unspliced and partially spliced RNA transcripts makes it a tempting target. Due to recent findings implicating a DEAD-box helicase, DDX3, in HIV replication and a member of the export complex, it has become an appealing target for anti-HIV drug inhibition. In the present research, we have applied a hybrid computational protocol to analyze protein-protein interactions in the HIV mRNA export cycle. This method is based on molecular docking followed by molecular dynamics simulation and accompanied by approximate free energy calculation (MM/GBSA), computational alanine scanning, clustering, and evolutionary analysis. We highlight here some of the most likely binding modes and interfacial residues between DDX3 and CRM1 both in the absence and presence of RanGTP. This work shows that although DDX3 can bind to free CRM1, addition of RanGTP leads to more concentrated distribution of binding modes and stronger binding between CRM1 and RanGTP.

59 BASIC BIOLOGICAL SCIENCES↗

Theoretical, Experimental, and Computational Evaluation of Several Vane-Type Slow-Wave Structures

Several types of periodic vane slow-wave structures were fabricated. The dispersion characteristics were found by theoretical analysis, experimental testing, and computer simulation using the MAFIA code. Computer-generated characteristics agreed to approximately within 2 percent of the experimental characteristics for all structures. The theoretical characteristics, however, deviated increasingly as the width to height ratio became smaller. Interaction impedances were also computed based on the experimental and computer-generated resonance frequency shifts due to the introduction of a perturbing dielectric rod.

Wallett, Thomas M.↗

Computational Modeling of Micro-Crack Induced Attenuation in CFRP Composites

A computational study is performed to determine the contribution to ultrasound attenuation in carbon fiber reinforced polymer composite laminates of linear elastic scattering by matrix micro-cracking. Multiple scattering approximations are benchmarked against exact computational approaches. Results support linear scattering as the source of observed increased attenuation in the presence of micro-cracking.

Roberts, R. A.↗