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 271 records · Page 15

Singularly Perturbed Lie Bracket Approximation

Here, we consider the interconnection of two dynamical systems where one has an input-affine vector field. We show that by employing a singular perturbation analysis and the Lie bracket approximation technique, the stability of the overall system can be analyzed by regarding the stability properties of two reduced, uncoupled systems.

97 MATHEMATICS AND COMPUTING↗

Incomplete Sparse Approximate Inverses for Parallel Preconditioning

In this study, we propose a new preconditioning method that can be seen as a generalization of block-Jacobi methods, or as a simplification of the sparse approximate inverse (SAI) preconditioners. The “Incomplete Sparse Approximate Inverses” (ISAI) is in particular efficient in the solution of sparse triangular linear systems of equations. Those arise, for example, in the context of incomplete factorization preconditioning. ISAI preconditioners can be generated via an algorithm providing fine-grained parallelism, which makes them attractive for hardware with a high concurrency level. Finally, in a study covering a large number of matrices, we identify the ISAI preconditioner as an attractive alternative to exact triangular solves in the context of incomplete factorization preconditioning.

97 MATHEMATICS AND COMPUTING↗

A new method approximating offset curve by Bézier curve using parallel derivative curves

In this paper, we present a new method for the offset approximation of an n-th degree Bézier curve by an n+1-th degree Bézier curve using parallel derivative curves. Our method is based on the Gauss map approximation of the n-th degree Bézier curve by the n+1-th degree Bézier curve whose derivative curve is parallel to that of the n-th degree Bézier curve. Thus, the convolution of the Gauss map approximation curve and n-th Bézier curve is a polynomial of degree n+1, which is our offset approximation of the n-th degree Bézier curve. Our approximation method has two advantages. One is that the offset approximation method yields a non-rational (polynomial) curve which is obtained by the simple sum of two Bézier curves. The other is that the offset approximation curve satisfying the endpoint interpolation of the given offset curve automatically has the same tangent lines as the offset curve at both endpoints. We illustrate our offset approximation method with some numerical examples.

97 MATHEMATICS AND COMPUTING↗

Study of the mapping of Navier-Stokes algorithms onto multiple-instruction/multiple-data-stream computers

Implicit approximate-factored algorithms have certain properties that are suitable for parallel processing. A particular computational fluid dynamics (CFD) code, using this algorithm, is mapped onto a multiple-instruction/multiple-data-stream (MIMD) computer architecture. An explanation of this mapping procedure is presented, as well as some of the difficulties encountered when trying to run the code concurrently. Timing results are given for runs on the Ames Research Center's MIMD test facility which consists of two VAX 11/780's with a common MA780 multi-ported memory. Speedups exceeding 1.9 for characteristic CFD runs were indicated by the timing results.

Eberhardt, D. S.↗

Conditional Point Sampling: A Monte Carlo Method for Radiation Transport in Stochastic Media.

Current methods for stochastic media transport are either computationally expensive or, by nature, approximate. Moreover, none of the well-developed, benchmarked approximate methods can compute the variance caused by the stochastic mixing, a quantity especially important to safety calculations. Therefore, we derive and apply a new conditional probability function (CPF) for use in the recently developed stochastic media transport algorithm Conditional Point Sampling (CoPS), which 1) leverages the full intra-particle memory of CoPS to yield errorless computation of stochastic media outputs in 1D, binary, Markovian-mixed media, and 2) leverages the full inter-particle memory of CoPS and the recently developed Embedded Variance Deconvolution method to yield computation of the variance in transport outputs caused by stochastic material mixing. Numerical results demonstrate errorless stochastic media transport as compared to reference benchmark solutions with the new CPF for this class of stochastic mixing as well as the ability to compute the variance caused by the stochastic mixing via CoPS. Using previously derived, non-errorless CPFs, CoPS is further found to be more accurate than the atomic mix approximation, Chord Length Sampling (CLS), and most of memory-enhanced versions of CLS surveyed. In addition, we study the compounding behavior of CPF error as a function of cohort size (where a cohort is a group of histories that share intra-particle memory) and recommend that small cohorts be used when computing the variance in transport outputs caused by stochastic mixing.

61 RADIATION PROTECTION AND DOSIMETRY↗

Metamodels for Computer-Based Engineering Design: Survey and Recommendations

The use of statistical techniques to build approximations of expensive computer analysis codes pervades much of todays engineering design. These statistical approximations, or metamodels, are used to replace the actual expensive computer analyses, facilitating multidisciplinary, multiobjective optimization and concept exploration. In this paper we review several of these techniques including design of experiments, response surface methodology, Taguchi methods, neural networks, inductive learning, and kriging. We survey their existing application in engineering design and then address the dangers of applying traditional statistical techniques to approximate deterministic computer analysis codes. We conclude with recommendations for the appropriate use of statistical approximation techniques in given situations and how common pitfalls can be avoided.

Simpson, Timothy W.↗

Catalytic ignition model in a monolithic reactor with in-depth reaction

Two transient models have been developed to study the catalytic ignition in a monolithic catalytic reactor. The special feature in these models is the inclusion of thermal and species structures in the porous catalytic layer. There are many time scales involved in the catalytic ignition problem, and these two models are developed with different time scales. In the full transient model, the equations are non-dimensionalized by the shortest time scale (mass diffusion across the catalytic layer). It is therefore accurate but is computationally costly. In the energy-integral model, only the slowest process (solid heat-up) is taken as nonsteady. It is approximate but computationally efficient. In the computations performed, the catalyst is platinum and the reactants are rich mixtures of hydrogen and oxygen. One-step global chemical reaction rates are used for both gas-phase homogeneous reaction and catalytic heterogeneous reaction. The computed results reveal the transient ignition processes in detail, including the structure variation with time in the reactive catalytic layer. An ignition map using reactor length and catalyst loading is constructed. The comparison of computed results between the two transient models verifies the applicability of the energy-integral model when the time is greater than the second largest time scale of the system. It also suggests that a proper combined use of the two models can catch all the transient phenomena while minimizing the computational cost.

Tien, Ta-Ching↗

On a Certain First-Order Differential Equation with Delay

We consider the Cauchy problem for a first-order quasilinear differential equation with delayed argument of neutral type, and obtain sufficient conditions of existence and uniqueness of its solutions. Proofs of the solvability of nonlinear problems, estimates of solutions, and constructions of approximate methods are based on Chaplygin-type theorems on differential inequalities.

97 MATHEMATICS AND COMPUTING↗

Meso-Scale Approximations of Fields Around Clusters of Defects

We present a review of recent results on asymptotic approximations of solutions to boundary value problems in domains with large clusters of small defects. There are no assumptions which require periodicity within the cluster. The asymptotic approximations we discuss are uniform and include the boundary layers occurring in neighborhoods of singularly perturbed boundaries of the domains concerned. The term “meso-scale” is used to describe these approximations since they go beyond the conventional constraints of the homogenization theory.

97 MATHEMATICS AND COMPUTING↗

Construction of integrable model Kohn-Sham potentials by analysis of the structure of functional derivatives

A directly approximated exchange-correlation potential should, by construction, be a functional derivative of some density functional in order to avoid unphysical results. Using generalized gradient approximations (GGAs) as an example, we show that functional derivatives of explicit density functionals have a very rigid inner structure, the knowledge of which allows one to build the entire functional derivative from a small part. Based on this analysis, we develop a method for direct construction of integrable Kohn-Sham potentials. As an illustration, we transform the model potential of van Leeuwen and Baerends (which is not a functional derivative) into a semilocal exchange potential that has a parent GGA, yields accurate energies, and is free from the artifacts inherent in existing semilocal potential approximations.

74 ATOMIC AND MOLECULAR PHYSICS↗

Aerodynamic Sensitivity of a Novel Data-Driven Airfoil Shape Representation Framework

We explore the aerodynamic implications of a novel data-driven separable shape tensor framework used to represent discrete airfoil shapes. In this study, we construct a data-driven parameter space defined by separable shape tensors and informed by tens of thousands of distinct airfoils. We use this design space to generate new airfoil designs to study parametric sensitivities with respect to various aerodynamic responses. We use a HAM2D RANS solver to approximate the lift, drag, and moment coefficients for the generated airfoils at two different angles-of-attack. We analyze the robustness and sensitivities of using the separable shape tensor design space by examining the coverage of the aerodynamic response space, uncovering low-dimensional polynomial ridge approximations, and computing various sensitivity metrics. The results show that the data-driven design space produce significant variation in target aerodynamic quantities and facilitate highly accurate approximations (R^2 > 0.96) of one- and two-dimensional structures in each aerodynamic response. This further reduces the effective dimension to enable simplified design and optimization tasks.

aerodynamics↗

An improved phase shift reconstruction algorithm of fringe scanning technique for X-ray microscopy

The X-ray phase imaging method has been applied to observe soft biological tissues, and it is possible to image the soft tissues by using the benefit of the so-called “Talbot effect” by an X-ray grating. One type of the X-ray phase imaging method was reported by combining an X-ray imaging microscope equipped by a Fresnel zone plate with a phase grating. Using the fringe scanning technique, a high-precision phase shift image could be obtained by displacing the grating step by step and measuring dozens of sample images. The number of the images was selected to reduce the error caused by the non-sinusoidal component of the Talbot self-image at the imaging plane. A larger number suppressed the error more but increased radiation exposure and required higher mechanical stability of equipment. In this paper, we analyze the approximation error of fringe scanning technique for the X-ray microscopy which uses just one grating and proposes an improved algorithm. We compute the approximation error by iteration and substitute that into the process of reconstruction of phase shift. This procedure will suppress the error even with few sample images. The results of simulation experiments show that the precision of phase shift image reconstructed by the proposed algorithm with 4 sample images is almost the same as that reconstructed by the conventional algorithm with 40 sample images. We also have succeeded in the experiment with real data.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Towards replacing physical testing of granular materials with a Topology-based Model

In the study of packed granular materials, the performance of a sample (e.g., the detonation of a high-energy explosive) often correlates to measurements of a fluid flowing through it. The “effective surface area,” the surface area accessible to the airflow, is typically measured using a permeametry apparatus that relates the flow conductance to the permeable surface area via the Carman-Kozeny equation. This equation allows calculating the flow rate of a fluid flowing through the granules packed in the sample for a given pressure drop. However, Carman-Kozeny makes inherent assumptions about tunnel shapes and flow paths that may not accurately hold in situations where the particles possess a wide distribution in shapes, sizes, and aspect ratios, as is true with many powdered systems of technological and commercial interest. To address this challenge, we replicate these measurements virtually on micro-CT images of the powdered material, introducing a new Pore Network Model based on the skeleton of the Morse-Smale complex. Pores are identified as basins of the complex, their incidence encodes adjacency, and the conductivity of the capillary between them is computed from the cross-section at their interface. We build and solve a resistive network to compute an approximate laminar fluid flow through the pore structure. Here, we provide two means of estimating flow-permeable surface area: (i) by direct computation of conductivity, and (ii) by identifying dead-ends in the flow coupled with isosurface extraction and the application of the Carman-Kozeny equation, with the aim of establishing consistency over a range of particle shapes, sizes, porosity levels, and void distribution patterns.

36 MATERIALS SCIENCE↗