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 289 records · Page 16

On spectral perturbation caused by bounded variation of potential

The harmonic oscillator operator is perturbed by an arbitrary bounded continuous term. This results in the perturbation of the spectrum. The map sending the first of these perturbations into the second is examined. Its approximation by a linear map is studied. Bibliography: 2 titles.

97 MATHEMATICS AND COMPUTING↗

Experimental and computational flow-field results for an all-body hypersonic aircraft

A comprehensive test program is defined which is being implemented in the NASA/Ames 3.5 foot Hypersonic Wind Tunnel for obtaining data on a generic all-body hypersonic vehicle for computational fluid dynamics (CFD) code validation. Computational methods (approximate inviscid methods and an upwind parabolized Navier-Stokes code) currently being applied to the all-body model are outlined. Experimental and computational results on surface pressure distributions and Pitot-pressure surveys for the basic sharp-nose model (without control surfaces) at a free-stream Mach number of 7 are presented.

Cleary, Joseph W.↗

Statistical linearization for multi-input/multi-output nonlinearities

Formulas are derived for the computation of the random input-describing functions for MIMO nonlinearities; these straightforward and rigorous derivations are based on the optimal mean square linear approximation. The computations involve evaluations of multiple integrals. It is shown that, for certain classes of nonlinearities, multiple-integral evaluations are obviated and the computations are significantly simplified.

Lin, Ching-An↗

Synergism of the method of characteristics and CAD technology for neutron transport calculation

The method of characteristics (MOC) is a very popular methodology in neutron transport calculation and numerical simulation in recent decades for its unique advantages. One of the key problems determining whether the MOC can be applied in complicated and highly heterogeneous geometry is how to combine an effective geometry processing method with MOC. Most of the existing MOC codes describe the geometry by lines and arcs with extensive input data, such as circles, ellipses, regular polygons and combination of them. Thus they have difficulty in geometry modeling, background meshing and ray tracing for complicated geometry domains. In this study, a new idea making use of a CAD solid modeler MCAM which is a CAD/Image-based Automatic Modeling Program for Neutronics and Radiation Transport developed by FDS Team in China was introduced for geometry modeling and ray tracing of particle transport to remove these geometrical limitations mentioned above. The diamond-difference scheme was applied to MOC to reduce the spatial discretization error of the flat flux approximation in theory. Based on MCAM and MOC, a new MOC code was developed and integrated into SuperMC system, which is a Super Multi-function Computational system for neutronics and radiation simulation. The numerical testing results demonstrated the feasibility and effectiveness of the new idea for geometry treatment in SuperMC. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Robust Implicit Adaptive Low Rank Time-Stepping Methods for Matrix Differential Equations

In this work, we develop implicit rank-adaptive schemes for time-dependent matrix differential equations. The dynamic low rank approximation (DLRA) is a well-known technique to capture the dynamic low rank structure based on Dirac–Frenkel time-dependent variational principle. In recent years, it has attracted a lot of attention due to its wide applicability. Our schemes are inspired by the three-step procedure used in the rank adaptive version of the unconventional robust integrator (the so called BUG integrator) (Ceruti et al. in BIT Numer Math 62(4):1149–1174, 2022) for DLRA. First, a prediction (basis update) step is made computing the approximate column and row spaces at the next time level. Second, a Galerkin evolution step is invoked using an implicit solves for the small core matrix. Finally, a truncation is made according to a prescribed error threshold. Since the DLRA is evolving the differential equation projected on to the tangent space of the low rank manifold, the error estimate of the BUG integrator contains the tangent projection (modeling) error which cannot be easily controlled by mesh refinement. This can cause convergence issue for equations with cross terms. To address this issue, we propose a simple modification, consisting of merging the row and column spaces from the explicit step truncation method together with the BUG spaces in the prediction step. In addition, we propose an adaptive strategy where the BUG spaces are only computed if the residual for the solution obtained from the prediction space by explicit step truncation method, is too large. Here, we prove stability and estimate the local truncation error of the schemes under assumptions. We benchmark the schemes in several tests, such as anisotropic diffusion, solid body rotation and the combination of the two, to show robust convergence properties.

97 MATHEMATICS AND COMPUTING↗

Estimation of Hydrodynamic Impact Loads and Pressure Distributions on Bodies Approximating Elliptical Cylinders with Special Reference to Water Landings of Helicopters

An approximate method for computing water loads and pressure distributions on lightly loaded elliptical cylinders during oblique water impacts is presented. The method is of special interest for the case of emergency water landings of helicopters. This method makes use of theory developed and checked for landing impacts of seaplanes having bottom cross sections of V and scalloped contours. An illustrative example is given to show typical results obtained from the use of the proposed method of computation. The accuracy of the approximate method was evaluated through comparison with limited experimental data for two-dimensional drops of a rigid circular cylinder at a trim of 0 degrees and a flight -path angle of 90 degrees. The applicability of the proposed formulas to the design of rigid hulls is indicated by the rough agreement obtained between the computed and experimental results. A detailed computational procedure is included as an appendix.

Schnitzer, Emanuel↗

Scalable Matrix-Free Adaptive Product-Convolution Approximation for Locally Translation-Invariant Operators

We present an adaptive grid matrix-free operator approximation scheme based on a "product-convolution" interpolation of convolution operators. This scheme is appropriate for operators that are locally translation-invariant, even if these operators are high rank or full rank. Such operators arise in Schur complement methods for solving partial differential equations (PDEs), as Hessians in PDE-constrained optimization and inverse problems, as integral operators, as covariance operators, and as Dirichlet-to-Neumann maps. Constructing the approximation requires computing the impulse responses of the operator to point sources centered on nodes in an adaptively refined grid of sample points. A randomized a posteriori error estimator drives the adaptivity. Once constructed, the approximation can be efficiently applied to vectors using the fast Fourier transform. The approximation can be efficiently converted to hierarchical matrix (H-matrix) format, then inverted or factorized using scalable H-matrix arithmetic. The quality of the approximation degrades gracefully as fewer sample points are used, allowing cheap lower quality approximations to be used as preconditioners. Furthermore, this yields an automated method to construct preconditioners for locally translation-invariant Schur complements. We directly address issues related to boundaries and prove that our scheme eliminates boundary artifacts. We test the scheme on a spatially varying blurring kernel, on the nonlocal component of an interface Schur complement for the Poisson operator, and on the data misfit Hessian for an advection dominated advection-diffusion inverse problem. Numerical results show that the scheme outperforms existing methods.

97 MATHEMATICS AND COMPUTING↗

Finite-Difference Methods for Fractional Differential Equations of Order 1/2

In this work, we study approximations of solutions of fractional differential equations of order 1/2. We present a new method of approximation and obtain the order of convergence. The presentation is given within the abstract framework of a semidiscrete approximation scheme, which includes finite-element methods, finite-difference schemes, and projection methods.

97 MATHEMATICS AND COMPUTING↗

Shear viscosity and out of equilibrium dynamics

Using Grad's method, we calculate the entropy production and derive a formula for the second-order shear viscosity coefficient in a one-dimensionally expanding particle system, which can also be considered out of chemical equilibrium. For a one-dimensional expansion of gluon matter with Bjorken boost invariance, the shear tensor and the shear viscosity to entropy density ratio {eta}/s are numerically calculated by an iterative and self-consistent prescription within the second-order Israel-Stewart hydrodynamics and by a microscopic parton cascade transport theory. Compared with {eta}/s obtained using the Navier-Stokes approximation, the present result is about 20% larger at a QCD coupling {alpha}{sub s}{approx}0.3 (with {eta}/s{approx_equal}0.18) and is a factor of 2-3 larger at a small coupling {alpha}{sub s}{approx}0.01. We demonstrate an agreement between the viscous hydrodynamic calculations and the microscopic transport results on {eta}/s, except when employing a small {alpha}{sub s}. On the other hand, we demonstrate that for such small {alpha}{sub s}, the gluon system is far from kinetic and chemical equilibrium, which indicates the break down of second-order hydrodynamics because of the strong nonequilibrium evolution. In addition, for large {alpha}{sub s} (0.3-0.6), the Israel-Stewart hydrodynamics formally breaks down at large momentum p{sub T} > or approx. 3 GeV but is still a reasonably good approximation.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Solution of linear systems by a singular perturbation technique

An approximate solution is obtained for a singularly perturbed system of initial valued, time invariant, linear differential equations with multiple boundary layers. Conditions are stated under which the approximate solution converges uniformly to the exact solution as the perturbation parameter tends to zero. The solution is obtained by the method of matched asymptotic expansions. Use of the results for obtaining approximate solutions of general linear systems is discussed. An example is considered to illustrate the method and it is shown that the formulas derived give a readily computed uniform approximation.

Ardema, M. D.↗

Universal resources for approximate and stochastic measurement-based quantum computation

We investigate which quantum states can serve as universal resources for approximate and stochastic measurement-based quantum computation in the sense that any quantum state can be generated from a given resource by means of single-qubit (local) operations assisted by classical communication. More precisely, we consider the approximate and stochastic generation of states, resulting, for example, from a restriction to finite measurement settings or from possible imperfections in the resources or local operations. We show that entanglement-based criteria for universality obtained in M. Van den Nest et al. [New J. Phys. 9, 204 (2007)] for the exact, deterministic case can be lifted to the much more general approximate, stochastic case. This allows us to move from the idealized situation (exact, deterministic universality) considered in previous works to the practically relevant context of nonperfect state preparation. We find that any entanglement measure fulfilling some basic requirements needs to reach its maximum value on some element of an approximate, stochastic universal family of resource states, as the resource size grows. This allows us to rule out various families of states as being approximate, stochastic universal. We prove that approximate, stochastic universality is in general a weaker requirement than deterministic, exact universality and provide resources that are efficient approximate universal, but not exact deterministic universal. We also study the robustness of universal resources for measurement-based quantum computation under realistic assumptions about the (imperfect) generation and manipulation of entangled states, giving an explicit expression for the impact that errors made in the preparation of the resource have on the possibility to use it for universal approximate and stochastic state preparation. Finally, we discuss the relation between our entanglement-based criteria and recent results regarding the uselessness of states with a high degree of geometric entanglement as universal resources [D. Gross et al., Phys. Rev. Lett. 102, 190501 (2009); M. J. Bremner et al., Phys. Rev. Lett 102, 190502 (2009)].

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An improved digital algorithm for fast amplitude approximations of quadrature pairs

A computationally fast algorithm for approximating the amplitude (A) of a quadrature pair (I,Q) has been discovered. The piecewise linear formula, the unbiased estimate of A=X+1/8y when X or = 3Y and 7/8X + 1/2Y when X or = 3Y applies where X is congruent to the maximum absolute value of (I,Q) and Y is congruent to the minimum absolute value of (I,Q). This algorithm has been proven to be far more accurate then currently used approximations. An immediate application is the wideband digital spectrum analyzer under development for monitoring radio frequency interference at Deep Space Network stations.

Levitt, B. K.↗

Approximate Synthesis of Distributed Optimal Control for Hyperbolic Equations with Rapidly Oscillating Coefficients

We study the problem of finding approximations to the optimal control with respect to a quadratic-type quality criterion in the form of feedback (synthesis) for a linear-quadratic problem in the from of a hyperbolic equation with rapidly oscillating coefficients and distributed control on the right-hand side. On the basis of the exact formula of synthesis, its approximate version (based on the replacement of the rapidly oscillating variables by averaged quantities) is substantiated.

97 MATHEMATICS AND COMPUTING↗

Two routes to the one-dimensional discrete nonpolynomial Schroedinger equation

The Bose-Einstein condensate (BEC), confined in a combination of the cigar-shaped trap and axial optical lattice, is studied in the framework of two models described by two versions of the one-dimensional (1D) discrete nonpolynomial Schroedinger equation (NPSE). Both models are derived from the three-dimensional Gross-Pitaevskii equation (3D GPE). To produce 'model 1' (which was derived in recent works), the 3D GPE is first reduced to the 1D continual NPSE, which is subsequently discretized. 'Model 2,' which was not considered before, is derived by first discretizing the 3D GPE, which is followed by the reduction in the dimension. The two models seem very different; in particular, model 1 is represented by a single discrete equation for the 1D wave function, while model 2 includes an additional equation for the transverse width. Nevertheless, numerical analyses show similar behaviors of fundamental unstaggered solitons in both systems, as concerns their existence region and stability limits. Both models admit the collapse of the localized modes, reproducing the fundamental property of the self-attractive BEC confined in tight traps. Thus, we conclude that the fundamental properties of discrete solitons predicted for the strongly trapped self-attracting BEC are reliable, as the two distinct models produce them in a nearly identical form. However, a difference between the models is found too, as strongly pinned (very narrow) discrete solitons, which were previously found in model 1, are not generated by model 2--in fact, in agreement with the continual 1D NPSE, which does not have such solutions either. In that respect, the newly derived model provides for a more accurate approximation for the trapped BEC.

97 MATHEMATICS AND COMPUTING↗

Estimates for the widths of weighted Sobolev classes

Estimates for the Kolmogorov widths in the L{sub q,v}-metric of weighted Sobolev classes as well as for the approximation numbers of the corresponding embedding operators are found. Bibliography: 33 titles.

97 MATHEMATICS AND COMPUTING↗