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 163 records · Page 9

Elastic scattering of low-energy electrons by nitromethane

In this work, we present integral, differential, and momentum transfer cross sections for elastic scattering of low-energy electrons by nitromethane, for energies up to 10 eV. We calculated the cross sections using the Schwinger multichannel method with pseudopotentials, in the static-exchange and in the static-exchange plus polarization approximations. The computed integral cross sections show a {pi}* shape resonance at 0.70 eV in the static-exchange-polarization approximation, which is in reasonable agreement with experimental data. We also found a {sigma}* shape resonance at 4.8 eV in the static-exchange-polarization approximation, which has not been previously characterized by the experiment. We also discuss how these resonances may play a role in the dissociation process of this molecule.

74 ATOMIC AND MOLECULAR PHYSICS↗

Thorium and Rare Earth Monoxides and Related Phases

Thorium was a part of energy infrastructure in the 19th century due to the refractory and electronic properties of its dioxide. It will be a part of future energy infrastructure as the most abundant energy reserve based on nuclear fission. This paper discusses the solid-state chemistry of the monoxides and related rocksalt phases of thorium and the rare earths, both at atmospheric and at high pressure. The existence of solid thorium monoxide was first suggested more than 100 years ago; however, it was never obtained in bulk and has been studied mostly theoretically. Monoxides of lanthanides from Eu to Ho are ferromagnetic semiconductors sought for spintronics and were studied in thin films. La to Sm metallic monoxides were synthesized in bulk at pressures below 5 GPa. Recently, ThO formation in thin films has been reported and the stability of bulk ThO at high pressure was theoretically predicted based on first principles computations at 0 K. New ab initio computations were performed accounting for temperature effects up to 1000 K using lattice dynamics in the quasi-harmonic approximation. New computational results confirm the stabilization of pure ThO above 30 GPa and suggest the possibility of high-pressure synthesis of (Th,Nd)O at 1000 K and 5 GPa.

36 MATERIALS SCIENCE↗

Regularity of Solutions to Quasilinear Parabolic Systems with Time-Nonsmooth Principal Matrix and the Neumann Boundary Condition

We consider a quasilinear parabolic system of equations with nondiagonal principal matrix in a model parabolic cylinder with the Neumann condition on the plane part Γ of the lateral surface of the cylinder. We prove the partial regularity (the Hölder continuity) of the weak solution in a neighborhood of Γ by the method of A(t)-caloric approximations adapted to the problem with the Neumann boundary condition.

97 MATHEMATICS AND COMPUTING↗

On the orthogonality of the MacDonald s functions

A proof of an orthogonality relation for the MacDonald's functions with identical arguments but unequal complex lower indices is presented. The orthogonality is derived first via a heuristic approach based on the Mehler-Fock integral transform of the MacDonald's functions, and then proved rigorously using a polynomial approximation procedure.

97 MATHEMATICS AND COMPUTING↗

Polynomial solutions of the Monge-Ampère equation

The question of the existence of polynomial solutions to the Monge-Ampère equation z{sub xx}z{sub yy}−z{sub xy}{sup 2}=f(x,y) is considered in the case when f(x,y) is a polynomial. It is proved that if f is a polynomial of the second degree, which is positive for all values of its arguments and has a positive squared part, then no polynomial solution exists. On the other hand, a solution which is not polynomial but is analytic in the whole of the x, y-plane is produced. Necessary and sufficient conditions for the existence of polynomial solutions of degree up to 4 are found and methods for the construction of such solutions are indicated. An approximation theorem is proved. Bibliography: 10 titles.

97 MATHEMATICS AND COMPUTING↗

Final Report - Summer Visit 2010

During my visit to LLNL during the summer of 2010, I worked on algebraic multilevel solvers for large sparse systems of linear equations arising from discretizations of partial differential equations. The particular solver of interest is based on ILU decomposition. The setup phase for this AMG solve is just the single ILU decomposition, and its corresponding error matrix. Because the ILU uses a minimum degree or similar sparse matrix ordering, most of the fill-in, and hence most of the error, is concentrated in the lower right corner of the factored matrix. All of the major multigrid components - the smoother, the coarse level correction matrices, and the fine-to-coarse and coarse-to-fine rectangular transfer matrices, are defined in terms of various blocks of the ILU factorization. Although such a strategy is not likely to be optimal in terms of convergence properties, it has a relatively low setup cost, and therefore is useful in situations where setup costs for more traditional AMG approaches cannot be amortized over the solution of many linear systems using the same matrix. Such a situation arises in adaptive methods, where often just one linear system is solved at each step of an adaptive feedback loop, or in solving nonlinear equations by approximate Newton methods, where the approximate Jacobian might change substantially from iteration to iteration. In general terms, coarse levels are defined in terms of successively smaller lower right blocks of the matrix, typically decreasing geometrically in order. The most difficult issue was the coarse grid correction matrix. The preconditioner/smoother for a given level is just the corresponding lower right blocks of the ILU factorization. The coarse level matrix itself is just the Schur complement; this matrix is not known exactly using just the ILU decomposition in the setup phase. Thus we approximate this matrix using various combinations of the preconditioning matrix and the error matrix. During my visit, several approximations of this type were implemented and tested. While some improved the convergence rate of the overall method, these gains had to be balanced against the additional costs involved in creating and applying these matrices. By this more stringent criterion, none of the improved approximations could be characterized as an unqualified success.

97 MATHEMATICS AND COMPUTING↗

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↗

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↗

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 ↗