Search NASA⌕ Search

SEARCH · Search NASA

Results for “approximation”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
NASA NTRS2010

L Band Brightness Temperature from Forest: Comparison of Approximate Techniques

In this paper, three approximate physical microwave radiometry models have been used to calculate brightness temperatures from a forest canopy at L-band. These models are (1) tau-omega model (zero order scattering approximation to radiative transfer equations), (2) successive order of scattering model up to first order (first order scattering approximation to the radiative transfer equations), and (3) Peak technique utilizing the active solution obtained from the Distorted Born Approximation (DBA). These models are physically-based and treat vegetation as a layer of discrete scatterers over a rough surface. Vegetation components within the canopy are represented by canonical shapes such as dielectric discs and cylinders. The tau-omega model is based on a zero-order solution to the radiative transfer (RT) equations. The model ignores scattering except for the effect of the scatterers in the attenuation of the emission through the vegetation. Application of the tau-omega model to data acquired during airborne and ground-based campaigns over the years has solidified scientific understanding of microwave interactions with different landscapes. In particular, shrubland, grasslands, agricultural crops, and light to moderate vegetation have been investigated. Its applicability to areas with a significant tree fraction is unknown. The first order scattering model is based on an iterative solution of the RT equation up to the first order. The first order solution is obtained by substituting the zeroth-order solution into the scattering source term and then solving the resulting radiative transfer equations. This formulation adds a new scattering term to the tau-omega model. It represents emission by particles in the layer and emission by the ground that is scattered once by particles in the layer. The resulting model represents an improvement over the standard zero-order solution (the tau-omega model) since it accounts for the scattered vegetation and ground radiation that can have a pronounced effect on the observed brightness temperature. The third model is based on the Peake formulation in conjunction with the DBA. The procedure for calculation of forest emission is accomplished by first calculating the bistatic scattering cross section for each type of scatterer, then by using the DBA to calculate specular albedo of the ground and the diffused albedo of the layer. Once the albedos are determined, Peake s principle relating active and passive problems can be used to determine the effective emissivity of the forest layer.

Kurum, Mehmet↗
NASA NTRS2003

Capacitor-Chain Successive-Approximation ADC

A proposed successive-approximation analog-to-digital converter (ADC) would contain a capacitively terminated chain of identical capacitor cells. Like a conventional successive-approximation ADC containing a bank of binary-scaled capacitors, the proposed ADC would store an input voltage on a sample-and-hold capacitor and would digitize the stored input voltage by finding the closest match between this voltage and a capacitively generated sum of binary fractions of a reference voltage (Vref). However, the proposed capacitor-chain ADC would offer two major advantages over a conventional binary-scaled-capacitor ADC: (1) In a conventional ADC that digitizes to n bits, the largest capacitor (representing the most significant bit) must have 2(exp n-1) times as much capacitance, and hence, approximately 2(exp n-1) times as much area as does the smallest capacitor (representing the least significant bit), so that the total capacitor area must be 2(exp n) times that of the smallest capacitor. In the proposed capacitor-chain ADC, there would be three capacitors per cell, each approximately equal to the smallest capacitor in the conventional ADC, and there would be one cell per bit. Therefore, the total capacitor area would be only about 3(exp n) times that of the smallest capacitor. The net result would be that the proposed ADC could be considerably smaller than the conventional ADC. (2) Because of edge effects, parasitic capacitances, and manufacturing tolerances, it is difficult to make capacitor banks in which the values of capacitance are scaled by powers of 2 to the required precision. In contrast, because all the capacitors in the proposed ADC would be identical, the problem of precise binary scaling would not arise.

Cunningham, Thomas↗
NASA NTRS2011

Basis Function Approximation of Transonic Aerodynamic Influence Coefficient Matrix

A technique for approximating the modal aerodynamic influence coefficients matrices by using basis functions has been developed and validated. An application of the resulting approximated modal aerodynamic influence coefficients matrix for a flutter analysis in transonic speed regime has been demonstrated. This methodology can be applied to the unsteady subsonic, transonic, and supersonic aerodynamics. The method requires the unsteady aerodynamics in frequency-domain. The flutter solution can be found by the classic methods, such as rational function approximation, k, p-k, p, root-locus et cetera. The unsteady aeroelastic analysis for design optimization using unsteady transonic aerodynamic approximation is being demonstrated using the ZAERO flutter solver (ZONA Technology Incorporated, Scottsdale, Arizona). The technique presented has been shown to offer consistent flutter speed prediction on an aerostructures test wing 2 configuration with negligible loss in precision in transonic speed regime. These results may have practical significance in the analysis of aircraft aeroelastic calculation and could lead to a more efficient design optimization cycle.

Li, Wesley W.↗
NASA NTRS2011

On the Accuracy of Double Scattering Approximation for Atmospheric Polarization Computations

Interpretation of multi-angle spectro-polarimetric data in remote sensing of atmospheric aerosols require fast and accurate methods of solving the vector radiative transfer equation (VRTE). The single and double scattering approximations could provide an analytical framework for the inversion algorithms and are relatively fast, however accuracy assessments of these approximations for the aerosol atmospheres in the atmospheric window channels have been missing. This paper provides such analysis for a vertically homogeneous aerosol atmosphere with weak and strong asymmetry of scattering. In both cases, the double scattering approximation gives a high accuracy result (relative error approximately 0.2%) only for the low optical path - 10(sup -2) As the error rapidly grows with optical thickness, a full VRTE solution is required for the practical remote sensing analysis. It is shown that the scattering anisotropy is not important at low optical thicknesses neither for reflected nor for transmitted polarization components of radiation.

Korkin, Sergey V.↗
NASA NTRS2013

The Radial Distribution of Star Formation in Galaxies at Z approximately 1 from the 3D-HST Survey

The assembly of galaxies can be described by the distribution of their star formation as a function of cosmic time. Thanks to the WFC3 grism on the Hubble Space Telescope (HST) it is now possible to measure this beyond the local Universe. Here we present the spatial distribution of H emission for a sample of 54 strongly star-forming galaxies at z 1 in the 3D-HST Treasury survey. By stacking the H emission, we find that star formation occurred in approximately exponential distributions at z approximately 1, with a median Sersic index of n = 1.0 +/- 0.2. The stacks are elongated with median axis ratios of b/a = 0.58 +/- 0.09 in H consistent with (possibly thick) disks at random orientation angles. Keck spectra obtained for a subset of eight of the galaxies show clear evidence for rotation, with inclination corrected velocities of 90.330 km s(exp 1-). The most straightforward interpretation of our results is that star formation in strongly star-forming galaxies at z approximately 1 generally occurred in disks. The disks appear to be scaled-up versions of nearby spiral galaxies: they have EW(H alpha) at approximately 100 A out to the solar orbit and they have star formation surface densities above the threshold for driving galactic scale winds.

Nelson, Erica June↗
NASA NTRS2017

Spitzer Photometry of Approximately 1 Million Stars in M31 and 15 Other Galaxies

We present Spitzer IRAC 3.6-8 micrometer and Multiband Imaging Photometer 24 micrometer point-source catalogs for M31 and 15 other mostly large, star-forming galaxies at distances approximately 3.5-14 Mpc, including M51, M83, M101, and NGC 6946. These catalogs contain approximately 1 million sources including approximately 859,000 in M31 and approximately 116,000 in the other galaxies. They were created following the procedures described in Khan et al. through a combination of pointspread function (PSF) fitting and aperture photometry. These data products constitute a resource to improve our understanding of the IR-bright (3.6-24 micrometer) point-source populations in crowded extragalactic stellar fields and to plan observations with the James Webb Space Telescope.

Photometry↗
NASA NTRS2016

Polarized Radiative Transfer of a Cirrus Cloud Consisting of Randomly Oriented Hexagonal Ice Crystals: The 3 x 3 Approximation for Non-Spherical Particles

The reflection and transmission of polarized light for a cirrus cloud consisting of randomly oriented hexagonal columns were calculated by two very different vector radiative transfer models. The forward peak of the phase function for the ensemble-averaged ice crystals has a value of order 6 x 10(exp 3) so a truncation procedure was used to help produce numerically efficient yet accurate results. One of these models, the Vectorized Line-by-Line Equivalent model (VLBLE), is based on the doubling- adding principle, while the other is based on a vector discrete ordinates method (VDISORT). A comparison shows that the two models provide very close although not entirely identical results, which can be explained by differences in treatment of single scattering and the representation of the scattering phase matrix. The relative differences in the reflected I and Q Stokes parameters are within 0.5 for I and within 1.5 for Q for all viewing angles. In 1971 Hansen showed that for scattering by spherical particles the 3 x 3 approximation is sufficient to produce accurate results for the reflected radiance I and the degree of polarization (DOP), and he conjectured that these results would hold also for non-spherical particles. Simulations were conducted to test Hansen's conjecture for the cirrus cloud particles considered in this study. It was found that the 3 x 3 approximation also gives accurate results for the transmitted light, and for Q and U in addition to I and DOP. For these non-spherical ice particles the 3 x 3 approximation leads to an absolute error 2 x 10(exp -6) for the reflected and transmitted I, Q and U Stokes parameters. Hence, it appears to be an excellent approximation, which significantly reduces the computational complexity and burden required for multiple scattering calculations.

Polarization↗
DOE OSTI2024

Symmetry-Based Structured Matrices for Efficient Approximately Equivariant Networks

There has been much recent interest in designing symmetry-aware neural networks (NNs) exhibiting relaxed equivariance. Such NNs aim to interpolate between being exactly equivariant and being fully flexible, affording consistent performance benefits. In a separate line of work, certain structured parameter matrices -- those with displacement structure, characterized by low displacement rank (LDR) -- have been used to design small-footprint NNs. Displacement structure enables fast function and gradient evaluation, but permits accurate approximations via compression primarily to classical convolutional neural networks (CNNs). In this work, we propose a general framework -- based on a novel construction of symmetry-based structured matrices -- to build approximately equivariant NNs with significantly reduced parameter counts. Our framework integrates the two aforementioned lines of work via the use of so-called Group Matrices (GMs), a forgotten precursor to the modern notion of regular representations of finite groups. GMs allow the design of structured matrices -- resembling LDR matrices -- which generalize the linear operations of a classical CNN from cyclic groups to general finite groups and their homogeneous spaces. We show that GMs can be employed to extend all the elementary operations of CNNs to general discrete groups. Further, the theory of structured matrices based on GMs provides a generalization of LDR theory focussed on matrices with cyclic structure, providing a tool for implementing approximate equivariance for discrete groups. We test GM-based architectures on a variety of tasks in the presence of relaxed symmetry. We report that our framework consistently performs competitively compared to approximately equivariant NNs, and other structured matrix-based compression frameworks, sometimes with a one or two orders of magnitude lower parameter count.

Samudre, Ashwin↗
DOE OSTI2025

Simplifying activations with linear approximations in neural networks

A key step in Neural Networks is activation. Among the different types of activation functions, sigmoid, tanh, and others involve the usage of exponents for calculation. From a hardware perspective, exponential implementation implies the usage of Taylor series or repeated methods involving many addition, multiplication, and division steps, and as a result are power-hungry and consume many clock cycles. We implement a piecewise linear approximation of the sigmoid function as a replacement for standard sigmoid activation libraries. This approach provides a practical alternative by leveraging piecewise segmentation, which simplifies hardware implementation and improves computational efficiency. In this paper, we detail piecewise functions that can be implemented using linear approximations and their implications for overall model accuracy and performance gain. Our results show that for the DenseNet, ResNet, and GoogLeNet architectures, the piecewise linear approximation of the sigmoid function provides faster execution times compared to the standard TensorFlow sigmoid implementation while maintaining comparable accuracy. Specifically, for MNIST with DenseNet, accuracy reaches 99.91% (Piecewise) vs. 99.97% (Base) with up to 1.31x speedup in execution time. For CIFAR-10 with DenseNet, accuracy improves to 98.97% (Piecewise) vs. 99.40% (Base) while achieving 1.24x faster execution. Similarly, for CIFAR-100 with DenseNet, the accuracy is 97.93% (Piecewise) vs. 98.39% (Base), with a 1.18x execution time reduction. These results confirm the proposed method’s capability to efficiently process large-scale datasets and computationally demanding tasks, offering a practical means to accelerate deep learning models, including LSTMs, without compromising accuracy.

Activation function↗
DOE OSTI2024

Adiabatic approximation and Aharonov-Casher bands in twisted homobilayer transition metal dichalcogenides

Topological flat moiré bands with nearly ideal quantum geometry have been identified in homobilayer transition metal dichalcogenide moiré superlattices, and are thought to be crucial for understanding the fractional Chern insulating states recently observed therein. Previous study proposed viewing the system using an adiabatic approximation that replaces the position dependence of the layer spinor with a nonuniform periodic effective magnetic field. When the local zero-point kinetic energy of this magnetic field cancels identically against that of an effective Zeeman energy, a Bloch-band version of Aharonov-Casher zero-energy modes, which we refer to as Aharonov-Casher band, emerges leading to ideal quantum geometry. Here, we critically examine the validity of the adiabatic approximation and identify the parameter regimes under which Aharonov-Casher bands emerge. We show that the adiabatic approximation is accurate for a wide range of parameters including those realized in experiments. Furthermore, we show that while the cancellation leading to the emergence of Aharonov-Casher bands is generally not possible beyond the leading Fourier harmonic, the leading harmonic is the dominant term in the Fourier expansions of the zero-point kinetic energy and Zeeman energy. Finally, the leading harmonic expansion accurately captures the trend of the bandwidth and quantum geometry, although it may fail to quantitatively reproduce more detailed information about the bands such as the Berry curvature distribution.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Deep Neural Networks are Adaptive to Function Regularity and Data Distribution in Approximation and Estimation

Deep learning has exhibited remarkable results across diverse areas. To understand its success, substantial research has been directed towards its theoretical foundations. Nev- ertheless, the majority of these studies examine how well deep neural networks can model functions with uniform regularities. In this paper, we explore a different angle: how deep neural networks can adapt to varying degrees of smoothness in functions and nonuni- form data distributions across different locations and scales. More precisely, we focus on a broad class of functions defined by nonlinear tree-based approximation methods. This class encompasses a range of function types, such as functions with uniform regularities and discontinuous functions. We develop nonparametric approximation and estimation theories for this class using deep ReLU networks. Our results show that deep neural networks are adaptive to the nonuniform smoothness of functions and nonuniform data distributions at different locations and scales. We apply our results to several function classes, and derive the corresponding approximation and generalization errors. The validity of our results is demonstrated through numerical experiments.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2001

The 'Brick Wall' radio loss approximation and the performance of strong channel codes for deep space applications at high data rates

In order to evaluate performance of strong channel codes in presence of imperfect carrier phase tracking for residual carrier BPSK modulation in this paper an approximate 'brick wall' model is developed which is independent of the channel code type for high data rates. It is shown that this approximation is reasonably accurate (less than 0.7dB for low FERs for (1784,1/6) code and less than 0.35dB for low FERs for (5920,1/6) code). Based on the approximation's accuracy, it is concluded that the effects of imperfect carrier tracking are more or less independent of the channel code type for strong channel codes. Therefore, the advantage that one strong channel code has over another with perfect carrier tracking translates to nearly the same advantage under imperfect carrier tracking conditions. This will allow the link designers to incorporate projected channel code performance of strong channel codes into their design tables without worrying about their behavior in the face of imperfect carrier phase tracking.

turbo codes↗
NASA NTRS2016

Optics of Water Microdroplets with Soot Inclusions: Exact Versus Approximate Results

We use the recently generalized version of the multi-sphere superposition T-matrix method (STMM) to compute the scattering and absorption properties of microscopic water droplets contaminated by black carbon. The soot material is assumed to be randomly distributed throughout the droplet interior in the form of numerous small spherical inclusions. Our numerically-exact STMM results are compared with approximate ones obtained using the Maxwell-Garnett effective-medium approximation (MGA) and the Monte Carlo ray-tracing approximation (MCRTA). We show that the popular MGA can be used to calculate the droplet optical cross sections, single-scattering albedo, and asymmetry parameter provided that the soot inclusions are quasi-uniformly distributed throughout the droplet interior, but can fail in computations of the elements of the scattering matrix depending on the volume fraction of soot inclusions. The integral radiative characteristics computed with the MCRTA can deviate more significantly from their exact STMM counterparts, while accurate MCRTA computations of the phase function require droplet size parameters substantially exceeding 60.

cloud droplets↗
NASA NTRS2022

Alternative regularizations for Outer-Approximation algorithms for convex MINLP

In this work, we extend the regularization framework from Kronqvist et al. (Math Program 180(1):285–310, 2020) by incorporating several new regularization functions and develop a regularized single-tree search method for solving convex mixed-integer nonlinear programming (MINLP) problems. We propose a set of regularization functions based on distance metrics and Lagrangean approximations, used in the projection problem for finding new integer combinations to be used within the Outer-Approximation (OA) method. The new approach, called Regularized Outer-Approximation (ROA), has been implemented as part of the open-source Mixed-integer nonlinear decomposition toolbox for Pyomo—MindtPy. We compare the OA method with seven regularization function alternatives for ROA. Moreover, we extend the LP/NLP Branch and Bound method proposed by Quesada and Grossmann (Comput Chem Eng 16(10–11):937–947, 1992) to include regularization in an algorithm denoted RLP/NLP. We provide convergence guarantees for both ROA and RLP/NLP. Finally, we perform an extensive computational experiment considering all convex MINLP problems in the benchmark library MINLPLib. The computational results show clear advantages of using regularization combined with the OA method.

Convex Mixed-integer nonlinear programming↗
NASA NTRS2024

A Convexification-Based Outer-Approximation Method for Convex and Nonconvex MINLP

The advancement of domain reduction techniques has significantly enhanced the performance of solvers in mathematical programming. This paper delves into the impact of integrating convexification and domain reduction techniques within the Outer-Approximation method. We propose a refined convexification-based Outer-Approximation method alongside a Branch-and-Bound method for both convex and nonconvex Mixed-Integer Nonlinear Programming problems. These methods have been developed and incorporated into the open-source Mixed-Integer Nonlinear Decomposition Toolbox for Pyomo-MindtPy. Comprehensive benchmark tests were conducted, validating the effectiveness and reliability of our proposed algorithms. These tests highlight the improvements achieved by incorporating convexification and domain reduction techniques into the Outer-Approximation and Branch-and-Bound methods.

Optimization↗
DOE OSTI2024

Approximation of ice phenology of Maine lakes using Aqua MODIS surface temperature data

Studies of lake ice phenology have historically relied on limited in situ data. Relatively few observations exist for ice out and fewer still for ice in, both of which are necessary to determine the temporal extent of ice cover. Satellite data provide an opportunity to better document patterns of ice phenology across landscapes and relate them to the climatological drivers behind changing ice phenology. We developed a model, the Cumulative Sum Method (CSM), that uses daytime and nighttime surface temperature observations from the Moderate Resolution Imaging Spectroradiometer (MODIS) sensor on board the Earth-observing Aqua satellite to approximate ice in (the onset of ice cover) and ice out from training datasets of 13 and 58 Maine lakes, respectively, during the 2002/2003 through 2017/2018 ice seasons. Ice in was signaled by reaching a threshold of cumulative negative degrees following the first day of the season below 0°C. Ice out was signaled by reaching a threshold of cumulative positive degrees following the first day of the year above 0°C. The comparison of observed and remotely sensed ice-in dates showed relative agreement with a correlation coefficient of 0.71 and a mean absolute error (MAE) of 9.8 days. Ice-out approximations had a correlation coefficient of 0.67 and an MAE of 8.8 days. Lakes smaller in surface area and nearer the Atlantic coast had the greatest error in approximation. Application of the CSM to 20 additional lakes in Maine produced a comparable ice-out MAE of 8.9 days. Ice-out model performance was weaker for the warmest years; there was a larger MAE of 12.0 days when the model was applied to the years 2019–2023 for the original 58 lakes. The development of this model, which utilizes daily satellite data, demonstrates the promise of remote sensing for quantifying ice phenology over short, temporal scales, and wider geographic regions than can be observed in situ, and allows exploration of the influence of surface temperature patterns on the process and timing of ice in and ice out.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Performance evaluations of signed and unsigned noisy approximate quantum Fourier arithmetic

The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route toward a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor’s algorithm, weighted-sum optimization problems in data processing and machine learning, and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM’s superconducting-qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands’ superposed integer states. We analyze performance and identify the most effective approximation depths for unsigned quantum addition and quantum multiplication within the given context. We then perform a similar analysis of signed addition and compare to the unsigned results. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges—relevant to signed, unsigned, modular and non-modular versions—that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. Here, we analyze the performance trends in our results and speculate on possible future developments within this computational paradigm.

Computational models↗
DOE OSTI2025

Backpropagation-based learning with local derivative approximation and memory replay in biologically plausible neural systems

When learning, the brain modifies individual synaptic connections to reach a desired behavior. Animal and human brains have been shown to be incredibly capable of learning complex and varied functions across a wide variety of tasks. In recent years, artificial neural networks, inspired by human and animal brains, have shown great capabilities in learning a wide variety of difficult tasks. However, artificial neural networks primarily teach themselves through the use of backpropagation, a learning method which has no clear analogue within the brain. Additionally, Artificial Neural Networks primarily use continuous activation functions, which differ significantly from the spiking neuronal behavior present in the brain. In this paper, we discuss and demonstrate a biologically plausible learning method that approximates backpropagation through two techniques on Spiking Neural Networks. First, we show that the local temporal derivatives that are necessary for backpropagation can be approximately recovered through reconstruction using spike timings. Second, we show that through learning during a sleep phase, inspired by neuroscience research into memory replay, the localized parallel feedback path can learn to approximate the derivative through the forward path weight matrix, thus solving the weight transport problem. Lastly, we demonstrate that the combination of these two methods can approach or exceed the accuracy of backpropagation-based methods for a variety of neuromorphic vision tasks while maintaining biological plausibility.

42 ENGINEERING↗