Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computation time”

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 613 records · Page 34
All sourcesNASA NTRSDOE OSTI
NASA NTRS1981

Numerical solution of compressible viscous flows at high Reynolds numbers

A new numerical method which was used to reduce the computation time required in fluid dynamics to solve the Navier-Stokes equations at flight Reynolds numbers is described. The method is the implicit analogue of the explicit finite different method. It uses this as its first stage, while the second stage removes the restrictive stability condition by recasting the difference equations in an implicit form. The resulting matrix equations to be solved are either upper or lower block bidiagonal equations. The new method makes it possible and practical to calculate many important three dimensional, high Reynolds number flow fields on computers.

Maccormack, R. W.↗
NASA NTRS2007

Modeling and Parameter Estimation of Spacecraft Fuel Slosh with Diaphragms Using Pendulum Analogs

Prediction and control of liquid slosh in moving containers is an important consideration in the design of spacecraft and launch vehicle control systems. Even with modern computing systems, CFD type simulations are not fast enough to allow for large scale Monte Carlo analyses of spacecraft and launch vehicle dynamic behavior with slosh included. It is still desirable to use some type of simplified mechanical analog for the slosh to shorten computation time. Analytic determination of the slosh analog parameters has met with mixed success and is made even more difficult by the introduction of propellant management devices such as elastomeric diaphragms. By subjecting full-sized fuel tanks with actual flight fuel loads to motion similar to that experienced in flight and measuring the forces experienced by the tanks, these parameters can be determined experimentally. Currently, the identification of the model parameters is a laborious trial-and-error process in which the hand-derived equations of motion for the mechanical analog are evaluated and their results compared with the experimental results. This paper will describe efforts by the university component of a team comprised of NASA's Launch Services Program, Embry Riddle Aeronautical University, Southwest Research Institute and Hubert Astronautics to improve the accuracy and efficiency of modeling techniques used to predict these types of motions. Of particular interest is the effect of diaphragms and bladders on the slosh dynamics and how best to model these devices. The previous research was an effort to automate the process of slosh model parameter identification using a MATLAB/SimMechanics-based computer simulation. These results are the first step in applying the same computer estimation to a full-size tank and vehicle propulsion system. The introduction of diaphragms to this experimental set-up will aid in a better and more complete prediction of fuel slosh characteristics and behavior. Automating the parameter identification process will save time and thus allow earlier identification of potential vehicle performance problems.

Chatman, Yadira↗
NASA NTRS1997

On the Use of Statistics in Design and the Implications for Deterministic Computer Experiments

Perhaps the most prevalent use of statistics in engineering design is through Taguchi's parameter and robust design -- using orthogonal arrays to compute signal-to-noise ratios in a process of design improvement. In our view, however, there is an equally exciting use of statistics in design that could become just as prevalent: it is the concept of metamodeling whereby statistical models are built to approximate detailed computer analysis codes. Although computers continue to get faster, analysis codes always seem to keep pace so that their computational time remains non-trivial. Through metamodeling, approximations of these codes are built that are orders of magnitude cheaper to run. These metamodels can then be linked to optimization routines for fast analysis, or they can serve as a bridge for integrating analysis codes across different domains. In this paper we first review metamodeling techniques that encompass design of experiments, response surface methodology, Taguchi methods, neural networks, inductive learning, and kriging. We discuss their existing applications 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 metamodeling techniques in given situations and how common pitfalls can be avoided.

Simpson, Timothy W.↗
NASA NTRS2007

Radiative Heating Methodology for the Huygens Probe

The radiative heating environment for the Huygens probe near peak heating conditions for Titan entry is investigated in this paper. The task of calculating the radiation-coupled flowfield, accounting for non-Boltzmann and non-optically thin radiation, is simplified to a rapid yet accurate calculation. This is achieved by using the viscous-shock layer (VSL) technique for the stagnation-line flowfield calculation and a modified smeared rotational band (SRB) model for the radiation calculation. These two methods provide a computationally efficient alternative to a Navier-Stokes flowfield and line-by-line radiation calculation. The results of the VSL technique are shown to provide an excellent comparison with the Navier-Stokes results of previous studies. It is shown that a conventional SRB approach is inadequate for the partially optically-thick conditions present in the Huygens shock-layer around the peak heating trajectory points. A simple modification is proposed to the SRB model that improves its accuracy in these partially optically-thick conditions. This modified approach, labeled herein as SRBC, is compared throughout this study with a detailed line-by-line (LBL) calculation and is shown to compare within 5% in all cases. The SRBC method requires many orders-of-magnitude less computational time than the LBL method, which makes it ideal for coupling to the flowfield. The application of a collisional-radiative (CR) model for determining the population of the CN electronic states, which govern the radiation for Huygens entry, is discussed and applied. The non-local absorption term in the CR model is formulated in terms of an escape factor, which is then curve-fit with temperature. Although the curve-fit is an approximation, it is shown to compare well with the exact escape factor calculation, which requires a computationally intensive iteration procedure.

Johnston, Christopher O.↗
NASA NTRS2011

Flight Management System Execution of Idle-Thrust Descents in Operations

To enable arriving aircraft to fly optimized descents computed by the flight management system (FMS) in congested airspace, ground automation must accurately predict descent trajectories. To support development of the trajectory predictor and its error models, commercial flights executed idle-thrust descents, and the recorded data includes the target speed profile and FMS intent trajectories. The FMS computes the intended descent path assuming idle thrust after top of descent (TOD), and any intervention by the controllers that alters the FMS execution of the descent is recorded so that such flights are discarded from the analysis. The horizontal flight path, cruise and meter fix altitudes, and actual TOD location are extracted from the radar data. Using more than 60 descents in Boeing 777 aircraft, the actual speeds are compared to the intended descent speed profile. In addition, three aspects of the accuracy of the FMS intent trajectory are analyzed: the meter fix crossing time, the TOD location, and the altitude at the meter fix. The actual TOD location is within 5 nmi of the intent location for over 95% of the descents. Roughly 90% of the time, the airspeed is within 0.01 of the target Mach number and within 10 KCAS of the target descent CAS, but the meter fix crossing time is only within 50 sec of the time computed by the FMS. Overall, the aircraft seem to be executing the descents as intended by the designers of the onboard automation.

Stell, Laurel L.↗
NASA NTRS1997

Dynamic Flow Management Problems in Air Transportation

In 1995, over six hundred thousand licensed pilots flew nearly thirty-five million flights into over eighteen thousand U.S. airports, logging more than 519 billion passenger miles. Since demand for air travel has increased by more than 50% in the last decade while capacity has stagnated, congestion is a problem of undeniable practical significance. In this thesis, we will develop optimization techniques that reduce the impact of congestion on the national airspace. We start by determining the optimal release times for flights into the airspace and the optimal speed adjustment while airborne taking into account the capacitated airspace. This is called the Air Traffic Flow Management Problem (TFMP). We address the complexity, showing that it is NP-hard. We build an integer programming formulation that is quite strong as some of the proposed inequalities are facet defining for the convex hull of solutions. For practical problems, the solutions of the LP relaxation of the TFMP are very often integral. In essence, we reduce the problem to efficiently solving large scale linear programming problems. Thus, the computation times are reasonably small for large scale, practical problems involving thousands of flights. Next, we address the problem of determining how to reroute aircraft in the airspace system when faced with dynamically changing weather conditions. This is called the Air Traffic Flow Management Rerouting Problem (TFMRP) We present an integrated mathematical programming approach for the TFMRP, which utilizes several methodologies, in order to minimize delay costs. In order to address the high dimensionality, we present an aggregate model, in which we formulate the TFMRP as a multicommodity, integer, dynamic network flow problem with certain side constraints. Using Lagrangian relaxation, we generate aggregate flows that are decomposed into a collection of flight paths using a randomized rounding heuristic. This collection of paths is used in a packing integer programming formulation, the solution of which generates feasible and near-optimal routes for individual flights. The algorithm, termed the Lagrangian Generation Algorithm, is used to solve practical problems in the southwestern portion of United States in which the solutions are within 1% of the corresponding lower bounds.

Patterson, Sarah Stock↗
NASA NTRS2003

Autonomous Telemetry Collection for Single-Processor Small Satellites

For the Space Technology 5 mission, which is being developed under NASA's New Millennium Program, a single spacecraft processor will be required to do on-board real-time computations and operations associated with attitude control, up-link and down-link communications, science data processing, solid-state recorder management, power switching and battery charge management, experiment data collection, health and status data collection, etc. Much of the health and status information is in analog form, and each of the analog signals must be routed to the input of an analog-to-digital converter, converted to digital form, and then stored in memory. If the micro-operations of the analog data collection process are implemented in software, the processor may use up a lot of time either waiting for the analog signal to settle, waiting for the analog-to-digital conversion to complete, or servicing a large number of high frequency interrupts. In order to off-load a very busy processor, the collection and digitization of all analog spacecraft health and status data will be done autonomously by a field-programmable gate array that can configure the analog signal chain, control the analog-to-digital converter, and store the converted data in memory.

Speer, Dave↗
NASA NTRS2012

Combining Ratio Estimation for Low Density Parity Check (LDPC) Coding

The Low Density Parity Check (LDPC) Code decoding algorithm make use of a scaled receive signal derived from maximizing the log-likelihood ratio of the received signal. The scaling factor (often called the combining ratio) in an AWGN channel is a ratio between signal amplitude and noise variance. Accurately estimating this ratio has shown as much as 0.6 dB decoding performance gain. This presentation briefly describes three methods for estimating the combining ratio: a Pilot-Guided estimation method, a Blind estimation method, and a Simulation-Based Look-Up table. The Pilot Guided Estimation method has shown that the maximum likelihood estimates of signal amplitude is the mean inner product of the received sequence and the known sequence, the attached synchronization marker (ASM) , and signal variance is the difference of the mean of the squared received sequence and the square of the signal amplitude. This method has the advantage of simplicity at the expense of latency since several frames worth of ASMs. The Blind estimation method s maximum likelihood estimator is the average of the product of the received signal with the hyperbolic tangent of the product combining ratio and the received signal. The root of this equation can be determined by an iterative binary search between 0 and 1 after normalizing the received sequence. This method has the benefit of requiring one frame of data to estimate the combining ratio which is good for faster changing channels compared to the previous method, however it is computationally expensive. The final method uses a look-up table based on prior simulated results to determine signal amplitude and noise variance. In this method the received mean signal strength is controlled to a constant soft decision value. The magnitude of the deviation is averaged over a predetermined number of samples. This value is referenced in a look up table to determine the combining ratio that prior simulation associated with the average magnitude of the deviation. This method is more complicated than the Pilot-Guided Method due to the gain control circuitry, but does not have the real-time computation complexity of the Blind Estimation method. Each of these methods can be used to provide an accurate estimation of the combining ratio, and the final selection of the estimation method depends on other design constraints.

Mahmoud, Saad↗
NASA NTRS1992

Development of a simplified gravitational model for lifetime studies of lunar satellite orbits

Future lunar missions will involve long stay times in orbit about the moon. The moon's nonspherical gravitational field is the primary perturbation on a low altitude parking orbit. The objective of this study is to determine the orbital lifetime of a nearly circular low altitude parking orbit. In the present analysis, a simplified gravitational model of the moon is introduced which will enable mission designers to easily predict long term changes in lunar parking orbits at the preliminary design level. The development of a simplified gravitational model with sufficient accuracy is necessary to investigate orbital lifetimes for the large number of orbital parameters possible. Utilization of a simplified model will significantly reduce the required computational time needed to perform this analysis. By investigating the effects of the lunar gravity model on the various parking orbits, the parameters which are important in determining lifetime predictions are identified.

Meyer, Kurt W.↗
NASA NTRS2016

Damage Based Analysis (DBA): Theory, Derivation and Practical Application - Using Both an Acceleration and Pseudo-Velocity Approach

The objective of this presentation is to give a brief overview of the theory behind the (DBA) method, an overview of the derivation and a practical application of the theory using the Python computer language. The Theory and Derivation will use both Acceleration and Pseudo Velocity methods to derive a series of equations for processing by Python. We will take the results and compare both Acceleration and Pseudo Velocity methods and discuss implementation of the Python functions. Also, we will discuss the efficiency of the methods and the amount of computer time required for the solution. In conclusion, (DBA) offers a powerful method to evaluate the amount of energy imparted into a system in the form of both Amplitude and Duration during qualification testing and flight environments. Many forms of steady state and transient vibratory motion can be characterized using this technique. (DBA) provides a more robust alternative to traditional methods such Power Spectral Density (PSD) using a Maximax approach.

Pseudo Velocity↗
NASA NTRS2017

Damage Based Analysis (DBA) - Theory, Derivation and Practical Application Using Both an Acceleration and Pseudo Velocity Approach

The objective of this presentation is to give a brief overview of the theory behind the (DBA) method, an overview of the derivation and a practical application of the theory using the Python computer language. The Theory and Derivation will use both Acceleration and Pseudo Velocity methods to derive a series of equations for processing by Python. We will take the results and compare both Acceleration and Pseudo Velocity methods and discuss implementation of the Python functions. Also, we will discuss the efficiency of the methods and the amount of computer time required for the solution. In conclusion, (DBA) offers a powerful method to evaluate the amount of energy imparted into a system in the form of both Amplitude and Duration during qualification testing and flight environments. Many forms of steady state and transient vibratory motion can be characterized using this technique. (DBA) provides a more robust alternative to traditional methods such Power Spectral Density (PSD) using a maximax approach.

Structural Dynamics↗
NASA NTRS1989

Non linear evolution of a second mode wave in supersonic boundary layers

Presented here are several direct simulations of one 2-D second mode perturbation wave, superimposed upon a prescribed mean flow. Periodicity is assumed in the streamwise direction (Fourier) and the variables are expanded in Chebyshev series in the direction normal to the flat plate. The code is fully explicit and is time advanced with a 3rd order Runge-Kutta scheme. The second mode wave (R delta prime = 8000), interacts with itself to generate higher streamwise harmonics. Physical parameters are chosen to maximize the linear growth rate at the prescribed Reynolds number. Initial results indicate that the nonlinear processes begin in the critical layer region and are the result of the cubic interactions in the momentum equations, rather than due to the higher streamwise harmonics. Analysis of the various terms in the momentum equations combined with numerical experiments in which various modes are artificially suppressed, lead to the conclusion that asymptotic methods will produce the saturated state in one or two order of magnitude less computer time than that required by the direct numerical simulations.

Erlebacher, Gordon↗
NASA NTRS2005

SOFIA'S Challenge: Scheduling Airborne Astronomy Observations

The Stratospheric Observatory for Infrared Astronomy (SOFIA) is NASA's next generation airborne astronomical observatory, and will commence operations in 2005. The facility consists of a 747-SP modified to accommodate a 2.5 meter telescope. SOFIA is expected to fly an average of 140 science flights per year over its 20 year lifetime. Depending on the nature of the instrument used during flight, 5-15 observations per flight are expected. The SOFIA telescope is mounted aft of the wings on the port side of the aircraft and is articulated through a range of 20deg to 60deg of elevation. The telescope has minimal lateral flexibility; thus, the aircraft must turn constantly to maintain the telescope's focus on an object during observations. A significant problem in future SOFIA operations is that of scheduling flights in support of observations. Investigators are expected to propose small numbers of observations, and many observations must be grouped together to make up single flights. Flight planning for the previous generation airborne observatory, the Kuiper Airborne Observatory (KAO), was done by hand; planners had to choose takeoff time, observations to perform, and decide on setup-actions (called "dead-legs") to position the aircraft prior to observing. This task frequently required between 6-8 hours to plan one flight The scope of the flight planning problem for supporting GI observations with the anticipated flight rate for SOFIA makes the manual approach for flight planning daunting. In response, we have designed an Automated Flight Planner (AFP) that accepts as input a set of requested observations, designated flight days, weather predictions and fuel limitations, and searches automatically for high-quality flight plans that satisfy all relevant aircraft and astronomer specified constraints. The AFP can generate one candidate flight plan in 5-10 minutes, of computation time, a feat beyond the capabilities of human flight planners. The rate at which the AFP can generate flights enables humans to assess and analyze complex tradeoffs between fuel consumption, estimated science quality and the percentage of scheduled observations. Due to the changing nature of SOFIA scheduling problems, this functionality will play a crucial role in optimizing science and minimizing costs during operations. In the full paper, we will summarize the technical challenges that have been met in order to build this system. These include: design of the search algorithm, design of appropriate heuristics and approximations, and reduction in the size of the search space. We will also describe technical challenges that are currently being addressed, including the extension of the existing approach to handle new solution criteria. Finally, we will describe a variety of cultural challenges that the astronomical community must address in order to successfully use SOFIA, and describe how the AFT can be used to address some of these challenges. Specifically, many of the intended science users are accustomed to using ground-based or space-based observatories; we will identify some differences that arise due to the nature of airborne observatories, and how the AFT can be extended to provide useful services to ease these cultural differences.

Frank, Jeremy↗
NASA NTRS2023

Development of a Computational Fluid Dynamics Model for a High-Speed Centrifugal Compressor

Computational fluid dynamics (CFD) has become widely used in the design and analysis of turbomachinery components such as centrifugal compressors. However, CFD is only a limited representation of experimental cases and struggles to model complex flows or can lack small model details to increase computation speed. To make advancements in compressor technology, designers need tools like CFD that can help them predict flow behavior in new designs. The High Efficiency Centrifugal Compressor (HECC) was designed by United Technologies Research Center (UTRC) for NASA to investigate the difficulties behind improving centrifugal compressor technology and to provide an open case to the turbomachinery research community. CFD analysis was completed by UTRC to aid in the design process. The pre-test study significantly overpredicted the compressor’s performance, and while post-test analysis was more representative, its results have yet to be publicly available. CFD technology has also since improved in recent years. In this study, a high-fidelity computational model for the vaneless configuration of HECC operating at its design point was developed and compared to an equivalent experimental case. This model incorporated GPU versions of mesh generation and solver codes from AeroDynamic Solutions, Inc. The development of such a model is significant since there has yet to be a published numerical simulation of HECC’s vaneless configuration. Additionally, the use of GPU codes decreases computation times for the model, which has allowed for the inclusion of impeller blade fillets. Initial results showed a general overprediction of compressor performance by the model. Predictions were more accurate for the impeller compared to predictions for the full compressor stage. Spanwise analyses showed that the model tended to follow flow behavior patterns exhibited in the experiment. Beyond this study, this model will be iterated upon and experimentally validated to further examine HECC performance.

centrifugal compressor↗
NASA NTRS1983

Efficient solution of the Euler and Navier-Stokes equations with a vectorized multiple-grid algorithm

A multiple-grid algorithm for use in efficiently obtaining steady solutions to the Euler and Navier-Stokes equations is presented. The convergence of the explicit MacCormack algorithm on a fine grid is accelerated by propagating transients from the domain using a sequence of successively coarser grids. Both the fine and coarse grid schemes are readily vectorizable. The combination of multiple-gridding and vectorization results in substantially reduced computational times for the numerical solution of a wide range of flow problems. Results are presented for subsonic, transonic, and supersonic inviscid flows and for subsonic attached and separated laminar viscous flows. Work reduction factors over a scalar, single-grid algorithm range as high as 76.8.

Navier Stokes simulation↗
NASA NTRSDate not supplied

Adding GPU Support to the Markov Chain Monte Carlo Code Catmip

In geophysics, we are confronted with many under-determined inverse problems. For example, all of our observations of earthquakes are made at the Earth’s surface. So, when we try to infer how slip during an earthquake evolves in space and time, we find that there are many potential slip histories that are consistent with our limited observations and our understanding of earthquake physics. One way to approach these problems is with Bayesian analysis which allows us to infer the ensemble of all potential slip models that satisfy the observations and our prior knowledge of earthquake physics. In Bayesian analysis, our prior knowledge is known as the prior probability density function or prior PDF, the fit to the data is known as the data likelihood, and the target PDF that satisfies both the prior PDF and data likelihood is known as the posterior PDF. However, simulating the posterior PDF typically requires using Markov Chain Monte Carlo (MCMC) to draw tens of billions of random realizations of earthquake slip models, which may not be computationally feasible. To make this and similar geophysical inversions computationally tractable, we developed the Cascading Adaptive Transitional Metropolis In Parallel (CATMIP) algorithm. CATMIP is an efficient parallel Markov Chain Monte Carlo (MCMC) sampler that is used for model fitting and uncertainty quantification in geophysics. Example use cases are earthquake rupture modeling, determining mineral composition on Mars, reconstructing the history of ocean salinity, and historical earthquake relocation. CATMIP employs many parallel instances of the Metropolis algorithm for sampling in a transitioning framework. Transitioning is a process in which a set of random samples at equilibrium with a known probability density function (PDF) are used as seeds for the Markov chains to sample successive target PDFs that incrementally move the distribution from the starting seeds to the final desired PDF that describes the relative plausibility of potential values for the model parameters. The algorithm is implemented as a Master-Worker model employing MPI for communication. The worker processes are loosely coupled with global parameters periodically optimized by the master process. This provides a very high amount of parallelism with little communication between updates. During the presentation we will discuss the history of the algorithm and elaborate the earthquake rupture modeling use case for the CATMIP package. Our first step toward GPU optimization was to optimize the code for the CPU. CPU profiling revealed that most of the compute time is spent in calls to level 2 BLAS routines and calls to GSL random number generators. We revised the algorithm to employ level 3 BLAS routines instead. In our presentation we will describe how this was accomplished. Adding GPU support to CATMIP consisted mostly of replacing the calls to GSL with calls to GPU vendor-provided library routines. A small number of loops were directly implemented in CUDA. In the presentation will provide implementation details. Finally, we will discuss methods for profiling and opportunities for further optimizing GPU execution. By creating a code with the flexibility to run on either a CPU or GPU architecture, CATMIP can be used on systems ranging from large CPU-based HPC environments to single servers with GPU acceleration and everything in between.

HECC↗
NASA NTRS1985

Turbine Vane External Heat Transfer. Volume 2. Numerical Solutions of the Navier-stokes Equations for Two- and Three-dimensional Turbine Cascades with Heat Transfer

The application of the time-dependent ensemble-averaged Navier-Stokes equations to transonic turbine cascade flow fields was examined. In particular, efforts focused on an assessment of the procedure in conjunction with a suitable turbulence model to calculate steady turbine flow fields using an O-type coordinate system. Three cascade configurations were considered. Comparisons were made between the predicted and measured surface pressures and heat transfer distributions wherever available. In general, the pressure predictions were in good agreement with the data. Heat transfer calculations also showed good agreement when an empirical transition model was used. However, further work in the development of laminar-turbulent transitional models is indicated. The calculations showed most of the known features associated with turbine cascade flow fields. These results indicate the ability of the Navier-Stokes analysis to predict, in reasonable amounts of computation time, the surface pressure distribution, heat transfer rates, and viscous flow development for turbine cascades operating at realistic conditions.

Yang, R. J.↗
NASA NTRS2020

The AERONET Version 3 Aerosol Retrieval Algorithm, Associated Uncertainties and Comparisons to Version 2

The Aerosol Robotic Network (AERONET) Version 3 (V3) aerosol retrieval algorithm is described, which is based on the Version 2 (V2) algorithm with numerous updates. Comparisons of V3 aerosol retrievals to those of V2 are presented, along with a new approach to estimate uncertainties in many of the retrieved aerosol parameters. Changes in the V3 aerosol retrieval algorithm include (1) a new polarized radiative transfer code (RTC), which replaced the scalar RTC of V2, (2) detailed characterization of gas absorption by adding NO2 and H2O to specify total gas absorption in the atmospheric column, specification of vertical profiles of all the atmospheric species, (3) new bidirectional reflectance distribution function (BRDF) parameters for land sites adopted from the MODIS BRDF/Albedo product, (4) a new version of the extraterrestrial solar flux spectrum, and (5) a new temperature correction procedure of both direct Sun and sky radiance measurements. The potential effect of each change in V3 on single scattering albedo (SSA) retrievals was analyzed. The operational almucantar retrievals of V2 versus V3 were compared for four AERONET sites: GSFC, Mezaira, Mongu, and Kanpur. Analysis showed very good agreement in retrieved parameters of the size distributions. Comparisons of SSA retrievals for dust aerosols (Mezaira) showed a good agreement in 440 nm SSA, while for longer wavelengths V3 SSAs are systematically higher than those of V2, with the largest mean difference at 675 nm due to cumulative effects of both extraterrestrial solar flux and BRDF changes. For non-dust aerosols, the largest SSA deviation is at 675 nm due to differences in extraterrestrial solar flux spectrums used in each version. Further, the SSA 675 nm mean differences are very different for weakly (GSFC) and strongly (Mongu) absorbing aerosols, which is explained by the lower sensitivity to a bias in aerosol scattering optical depth by less absorbing aerosols. A new hybrid (HYB) sky radiance measurement scan is introduced and discussed. The HYB combines features of scans in two different planes to maximize the range of scattering angles and achieve scan symmetry, thereby allowing for cloud screening and spatial averaging, which is an advantage over the principal plane scan that lacks robust symmetry. We show that due to an extended range of scattering angles, HYB SSA retrievals for dust aerosols exhibit smaller variability with solar zenith angles (SZAs) than those of almucantar (ALM), which allows extension of HYB SSA retrievals to SZAs less than 50∘ to as small as 25∘. The comparison of SSA retrievals from closely time-matched HYB and ALM scans in the 50 to 75∘ SZA range showed good agreement with the differences below ∼0.005. We also present an approach to estimate retrieval uncertainties which utilizes the variability in retrieved parameters generated by perturbing both measurements and auxiliary input parameters as a proxy for retrieval uncertainty. The perturbations in measurements and auxiliary inputs are assumed as estimated biases in aerosol optical depth (AOD), radiometric calibration of sky radiances combined with solar spectral irradiance, and surface reflectance. For each set of Level 2 Sun/sky radiometer observations, 27 inputs corresponding to 27 combinations of biases were produced and separately inverted to generate the following statistics of the inversion results: average, standard deviation, minimum and maximum values. From these statistics, standard deviation (labeled U27) is used as a proxy for estimated uncertainty, and a lookup table (LUT) approach was implemented to reduce the computational time. The U27 climatological LUT was generated from the entire AERONET almucantar (1993–2018) and hybrid (2014–2018) scan databases by binning U27s in AOD (440 nm), Angström exponent (AE, 440–870 nm), and SSA (440, 675, 870, 1020 nm). Using this LUT approach, the uncertainty estimates U27 for each individual V3 Level 2 retrieval can be obtained by interpolation using the corresponding measured and inverted combination of AOD, AE, and SSA.

Aliaksandr Siniuk↗