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

Fracture-based shape optimization built upon the topological derivative

In Silva et al. (2011) and Alidoost et al. (2020), the authors developed an approximation of the energy release rate field associated with a small edge or surface crack at any boundary location and with any orientation using the topological derivative. The approximation is computationally attractive because it requires only a single analysis on the non-cracked domain in contrast with conventional boundary-element and finite-element-based methods, which require a separate and costlier analysis for each crack length-location-orientation combination. Here, a shape optimization scheme for fracture-resistant structures is developed using the energy release rate approximation. In the gradient-based optimization scheme, the domain and its boundary are defined implicitly using level-set functions. The level-set functions of arbitrary geometries are constructed using Boolean operations from the level-set functions of simple primitives. This geometrical representation has the dual advantage of (i) allowing shapes to intersect and/or separate during the optimization and (ii) simplifying the computation of the shape sensitivities.

42 ENGINEERING↗

Vector tomography for reconstructing electric fields with non-zero divergence in bounded domains

In vector tomography (VT), the aim is to reconstruct an unknown multi-dimensional vector field using line integral data. In the case of a 2-dimensional VT, two types of line integral data are usually required. These data correspond to integration of the parallel and perpendicular projection of the vector field along the integration lines and are called the longitudinal and transverse measurements, respectively. In most cases, however, the transverse measurements cannot be physically acquired. Therefore, the VT methods are typically used to reconstruct divergence-free (or source-free) velocity and flow fields that can be reconstructed solely from the longitudinal measurements. In this paper, we show how vector fields with non-zero divergence in a bounded domain can also be reconstructed from the longitudinal measurements without the need of explicitly evaluating the transverse measurements. To the best of our knowledge, VT has not previously been used for this purpose. In particular, we study low-frequency, time-harmonic electric fields generated by dipole sources in convex bounded domains which arise, for example, in electroencephalography (EEG) source imaging. We explain in detail the theoretical background, the derivation of the electric field inverse problem and the numerical approximation of the line integrals. We show that fields with non-zero divergence can be reconstructed from the longitudinal measurements with the help of two sparsity constraints that are constructed from the transverse measurements and the vector Laplace operator. As a comparison to EEG source imaging, we note that VT does not require mathematical modeling of the sources. By numerical simulations, we show that the pattern of the electric field can be correctly estimated using VT and the location of the source activity can be determined accurately from the reconstructed magnitudes of the field. - Highlights: • Vector tomography is used to reconstruct electric fields generated by dipole sources. • Inverse solutions are based on longitudinal and transverse line integral measurements. • Transverse line integral measurements are used as a sparsity constraint. • Numerical procedure to approximate the line integrals is described in detail. • Patterns of the studied electric fields are correctly estimated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Photon Next-Event Estimator Implementation in MCATK

A photon next-event fluence estimator at a point has been implemented in the Monte Carlo Application Toolkit (MCATK). The next-event estimator provides an expected value estimator for the flux at a point due to all source and collision events. An advantage of the next-event estimator over track-length estimators, which are normally employed in MCATK, is that flux estimates can be made in locations that have no random walk particle tracks. The next-event estimator allows users to calculate radiographs and estimate response for detectors outside of the modeled geometry. The next-event estimator is not yet accessable through the MCATK FlatAPI for C and Fortran. The next-event estimator in MCATK has been tested against MCNP6 using 5 suites of test problems. No issues were found in the MCATK implementation. One issue was found in the exclusion radius approximation in MCNP6. The theory, implementation, and testing are described in this document.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A Fast All-sky Radiation Model for Solar applications with Narrowband Irradiances on Tilted surfaces (FARMS-NIT): Part II. The cloudy-sky model

The Fast All-sky Radiation Model for Solar applications with Narrowband Irradiances on Tilted surfaces (FARMS-NIT) reported in Part I of this report is enhanced to include the requirements for cloudy-sky conditions. Surface radiances in 2002 narrow-wavelength bands from 0.28 to 4.0 um are analytically computed by solving the radiative transfer equation for five independent photon paths accounting for clear-sky absorption, Rayleigh scattering, and cloud absorption and scattering. The Simple Model of the Atmospheric Radiative Transfer of Sunshine (SMARTS) is used to show the optical thickness of the clear-sky atmosphere. Unlike Part I, which approximates the computation of aerosol scattering using the single-scattering phase function, the cloud transmittance and reflectance are efficiently retrieved from a comprehensive look-up table pre-computed by a 32-stream DIScrete Ordinates Radiative Transfer (DISORT) model for possible cloud conditions as well as solar and viewing geometries. A resolution assessment is performed to observe the optimal balance between the computational efficiency and accuracy in the development of the look-up table. Model simulations by DISORT and TMYSPEC are used to evaluate the performance of FARMS-NIT under cloudy-sky conditions. Compared to DISORT, FARMS-NIT yields 2-3% uncertainties on average, but it substantially reduces the computational time because of the independent computation of cloud properties and the implementation of the look-up table. In contrast to TMYSPEC, which uses successive steps to empirically compute plane-of-array (POA) irradiances and spectral irradiances, FARMS-NIT directly solves spectral radiances from the radiative transfer equation, which profoundly increases the accuracy in surface irradiances, especially over inclined photovoltaics (PV) panels.

14 SOLAR ENERGY↗

Global description of $β$ – decay with the axially deformed Skyrme finite-amplitude method: Extension to odd-mass and odd-odd nuclei

Here we use the finite-amplitude method (FAM), an efficient implementation of the quasiparticle random phase approximation, to compute $β$-decay rates with Skyrme energy-density functionals for 3983 nuclei, essentially all the medium-mass and heavy isotopes on the neutron-rich side of stability. We employ an extension of the FAM that treats odd-mass and odd-odd nuclear ground states in the equal filling approximation. Our rates are in reasonable agreement both with experimental data where available and with rates from other global calculations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Galerkin finite element method for time-fractional stochastic diffusion equations

In this paper, Galerkin finite element method for solving the time-fractional stochastic diffusion equations with multiplicative noise is proposed and investigated. The pathwise regularity properties of solutions to the semidiscrete Galerkin approximations are demonstrated and the convergence of optimal rates are derived. And also we construct the fully discrete scheme which is based on the approximations of the Mittag–Leffler function and analyze the error estimates of convergence in L{sub 2}-norm space. Finally, numerical results are conducted to confirm our theoretical findings.

97 MATHEMATICS AND COMPUTING↗

Mathematical methods for optimal polynomial recovery of high-dimensional systems from noisy data

The goal of our Early Career Research Project (ECRP) is to establish a modern mathematical foundation that will enable next-generation computational methods for polynomial approximation of high-dimensional systems, having a certain set of constraints, from a limited amount of noisy data. Such a foundation is critical to realizing the future potential of the DOE user facilities, and will ultimately empower scientists to address a fundamental question, namely, “how many realizations of a nonlinear manifold are required to recover the entire high-dimensional solution map, with optimal approximation guarantees and minimal computational cost?” The central theme of this effort aims to conquer this challenge by pioneering the development of extraordinarily innovative theoretical analysis and transformational non-intrusive computational methodologies. Such approaches will enable the reconstruction of the entire high-dimensional solution map, with accuracy comparable to the best approximation, while utilizing an optimal number of samples. During this reporting period we have made significant progress on four thrusts.

97 MATHEMATICS AND COMPUTING↗

Energy of Motion of Internal and Surface Waves in a Two-Layer Hydrodynamic System

We study the energy of wave motion in a two-layer “layer with solid bottom–layer with free surface” hydrodynamic system. The dependences of the energies of motion of internal and surface waves on the geometric and physical parameters of the system are analyzed. The contribution of the second approximation to the total energy of the system is estimated. The reliability of the obtained results is verified. The results are graphically illustrated.

42 ENGINEERING↗

Asymptotic expansions and approximations for the Caputo derivative

In this paper, we use the asymptotic expansions of the binomial coefficients and the weights of the L1 approximation to obtain approximations of order 2−α and second-order approximations of the Caputo derivative by modifying the weights of the shifted Grünwald–Letnikov difference approximation and the L1 approximation of the Caputo derivative. A modification of the shifted Grünwald–Letnikov approximation is obtained which allows second-order numerical solutions of fractional differential equations with arbitrary values of the solutions and their first derivatives at the initial point.

97 MATHEMATICS AND COMPUTING↗

Conditions of Asymptotic Normality of One-Step M-Estimators

In the case of independent identically distributed observations, we study the asymptotic properties of one-step M-estimators served as explicit approximations of consistent M-estimators. We find rather general conditions for the asymptotic normality of one-step M-estimators. We consider Fisher’s approximations of consistent maximum likelihood estimators and find general conditions guaranteeing the asymptotic normality of the Fisher estimators even in the case where maximum likelihood estimators do not necessarily exist or are not necessarily consistent.

97 MATHEMATICS AND COMPUTING↗

Modified Steklov Functions and Numerical Differentiation Formulas

We consider an approximation method based on Steklov functions of the first and second order. We obtain estimates for the norms in the space C of continuous periodic functions and clarify how they connect with numerical differentiation formulas.

97 MATHEMATICS AND COMPUTING↗

Geometric Hitting Set for Segments of Few Orientations

In this paper, we study several natural instances of the geometric hitting set problem for input consisting of sets of line segments (and rays, lines) having a small number of distinct slopes. These problems model path monitoring (e.g., on road networks) using the fewest sensors (the “hitting points”). We give approximation algorithms for cases including (i) lines of 3 slopes in the plane, (ii) vertical lines and horizontal segments, (iii) pairs of horizontal/vertical segments. We give hardness and hardness of approximation results for these problems. Finally, we prove that the hitting set problem for vertical lines and horizontal rays is polynomially solvable.

97 MATHEMATICS AND COMPUTING↗

Discrete Approximations of Dynamical Quantum Zeno Effect

In this paper, we discuss approximations of the dynamical quantum Zeno effect by a fixed number of nonselective quantum measurements. A wide class of measurements whose efficiency is close to optimal in the case of two-level systems is found.

97 MATHEMATICS AND COMPUTING↗

Numerical multi-scaling method to solve the linear stochastic partial differential equations

In this paper, we propose a multi-scaling method to solve a class of the stochastic partial differential equations (SPDEs) of Itô-type. By this method, we approximate the solution of the SPDEs with strongly elliptic operator on a finite domain. The method is based on B-spline wavelet approximations; some of these functions are reshaped to satisfy on boundary conditions exactly. We prove the consistency and stability of the method. Illustrative examples are included to demonstrate the validity and applicability of our proposed technique.

97 MATHEMATICS AND COMPUTING↗

On Coarse Grid Correction Methods in Krylov Subspaces

Two approaches using coarse grid correction in the course of a certain Krylov iterative process are presented. The aim of the correction is to accelerate the iterations. These approaches are based on an approximation of the function sought for by simple basis functions having finite supports. Additional acceleration can be achieved if the iterative process is restarted and the approximate solution is refined. In this case, the resulting process turns out to be a two-level preconditioned method. The influence of different parameters of the iterative process on its convergence is demonstrated by numerical results.

97 MATHEMATICS AND COMPUTING↗

A reaction–diffusion model for phenotypic evolution

We present a reaction–diffusion mathematical model for the evolutionary dynamics of phenotypic evolution. A detailed deduction of the equations is presented for the one-dimensional version, from which a more general model is proposed. Particular cases are studied using analytical approximations and numerical simulations. Results indicate that the approach proposed produces results that are coherent with mainstream models in evolutionary dynamics, suggesting that the reaction–diffusion model could be an alternative tool in the analysis of evolutionary dynamics.

97 MATHEMATICS AND COMPUTING↗

Trigonometric polynomial approximation, K-functionals and generalized moduli of smoothness

Best approximation and approximation by families of linear polynomial operators (FLPO) in the spaces L{sub p}, 0<p⩽+∞, are investigated for periodic functions of an arbitrary number of variables in terms of the generalized modulus of smoothness generated by a periodic generator which, near the origin, is assumed to be close in a certain sense to some homogeneous function of positive order. Direct and inverse theorems (Jackson- and Bernstein-type estimates) are proved; conditions on the generators are obtained under which the approximation error by an FLPO is equivalent to an appropriate modulus of smoothness. These problems are solved by going over from the modulus to an equivalent K-functional. The general results obtained are applied to classical objects in the theory of approximation and smoothness. In particular, they are applied to the methods of approximation generated by Fejér, Riesz and Bochner-Riesz kernels, and also to the moduli of smoothness and K-functionals corresponding to the conventional, Weyl and Riesz derivatives and to the Laplace operator. Bibliography: 24 titles. (paper)

97 MATHEMATICS AND COMPUTING↗