Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation algorithm”

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 1,603 records · Page 89

Flux splitting algorithms for two-dimensional viscous flows with finite-rate chemistry

The Roe flux difference splitting method was extended to treat 2-D viscous flows with nonequilibrium chemistry. The derivations have avoided unnecessary assumptions or approximations. For spatial discretization, the second-order Roe upwind differencing is used for the convective terms and central differencing for the viscous terms. An upwind-based TVD scheme is applied to eliminate oscillations and obtain a sharp representation of discontinuities. A two-state Runge-Kutta method is used to time integrate the discretized Navier-Stokes and species transport equations for the asymptotic steady solutions. The present method is then applied to two types of flows: the shock wave/boundary layer interaction problems and the jet in cross flows.

Shuen, Jian-Shun↗

High Resolution Doppler Imager FY 2001,2002,2003 Operations and Algorithm Maintenance

During the performance period of this grant HRDI (High Resolution Doppler Imager) operations remained nominal. The instrument has suffered no loss of scientific capability and operates whenever sufficient power is available. Generally, there are approximately 5-7 days per month when the power level is too low to permit observations. The daily latitude coverage for HRDI measurements in the mesosphere, lower thermosphere (MLT) region are shown.It shows that during the time of this grant, HRDI operations collected data at a rate comparable to that achieved during the UARS (Upper Atmosphere Research Satellite) prime mission (1991 -1995). Data collection emphasized MLT wind to support the validation efforts of the TIDI instrument on TIMED, therefore fulfilling one of the primary objectives of this phase of the UARS mission. Skinner et al., (2003) present a summary of the instrument performance during this period.

Skinner, Wilbert↗

A regional rainfall climatology over Mexico and the southwest United States derived from passive microwave and geosynchronous infrared data

A three-year climatology of satellite-estimated rainfall for the warm season for the southwest United States and Mexico has been derived from data from the Special Sensor Microwave Imager (SSM/I). The microwave data have been stratified by month (June, July, August), year (1988, 1989, 1990), and time of day (morning and evening orbits). A rain algorithm was employed that relates 86-GHz brightness temperatures to rain rate using a coupled cloud-radiative transfer model. Results identify an early evening maximum in rainfall along the western slope of the Sierra Madre Occidental during all three months. A prominent morning rainfall maximum was found off the western Mexican coast near Mazatlan in July and August. Substantial differences between morning and evening estimates were noted. To the extent that three years constitute a climatology, results of interannual variability are presented. Results are compared and contrasted to high-resolution (8 km, hourly) infrared cloud climatologies, which consist of the frequency of occurrence of cloud colder than -38 C and -58 C. This comparison has broad implications for the estimation of rainfall by simple (cloud threshold) techniques. By sampling the infrared data to approximate the time and space resolution of the microwave, we produce ratios (or adjustment factors) by which we can adjust the infrared rain estimation schemes. This produces a combined microwave/infrared rain algorithm for monthly rainfall. Using a limited set of raingage data as ground truth, an improvement (lower bias and root-mean-square error) was demonstrated by this combined technique when compared to either method alone. The diurnal variability of convection during July 1990 was examined using hourly rain estimates from the Geostationary Operational Environmental Satellite (GOES) precipitation index and the convective stratiform technique, revealing a maximum in estimated rainfall from 1800 to 2100 local time. It is in this time period when the SSM/I evening orbit occurs. A high-resolution topographic database was available to aid in interpreting the influence of topography on the rainfall patterns.

Negri, Andrew J.↗

First Assessments of ICESat-2 Performance Using Aircraft Data

The Ice, Cloud, and land Elevation Satellite-2 (ICESat-2) Is a next-generation laser altimeter designed to continue key observations of ice sheet elevation change, sea ice freeboard, vegetation canopy height, earth surface elevation, and sea surface height. Scheduled for launch in early 2016, ICESat-2 will use a high repetition rate (approximately 10 kHz), small footprint (10m diameter) laser, and a single-photon-sensitive detection strategy (photon counting) to measure precise ranges to the earth's surface. Operating in the green (approximately 532nm), the six beams of ICESat-2 will provide improved spatial coverage compared with ICESat while the differences in transmit energy among the beams provide a large dynamic range. In order to evaluate models of predicted ICESat-2 performance, and provide ICESat-2-like data for algorithm development an airborne ICESat-2 simulator was developed and first flown in 2010, this simulator, the Multiple Altimeter Beam Experimental Lidar (MABEL) has now had three deployments in the western US, and will be deployed to the polar regions in spring of 2012. MABEL uses a similar measurement strategy to what will be used on ICESat-2. MABEL collects more spatially-dense data than ICESat-2 (approximately 2-cm along track) with a smaller 2m diameter footprint in 16 green channels and an additional 8 channels in the infrared. The comparison between frequencies allows for analysis of possible penetration of green energy into water or snow. We present MABEL data collected over deserts, forests, ocean water, lakes. snow covered mountains, and saft flats, provide examples of how these data are being used to develop algorithms that derive geophysical products from ICESat 2 and assess expected performances.

Neumann, Tom↗

Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition

This report demonstrates satisfactory data compression of SOLPS-ITER simulation output ranging from 2D fields, 1D profiles, and 0D scalar variables with a novel matrix decomposition approach. The singular value decomposition (SVD) scales poorly for large matrix sizes and is unsuited to the application on high dimensional data common to fusion plasma physics simulation. In this work, we employ the columns-submatrix-rows (CUR) matrix factorization technique in order to compute a low-rank approximation up to two orders of magnitude faster than the SVD, but within a nominal L2-norm relative error of ε = 10 –2 . In addition, the CUR approach maintains the original format of the data, in its extracted columns and rows, allowing for interpretable data storage at the original resolution of the simulation. We utilize an iterative algorithm to compute the CUR decomposition of simulation output by maximizing the volume, or linearly independent information content, of a low-rank submatrix contained within the data. Experiments over $\textit{n} × \textit{n}$ randomized test matrices with embedded rank-deficient features show that this maximum volume implementation of CUR matrix approximation has reduced asymptotic computational complexity on the order of n compared to the SVD, which scales approximately as $n^3$. These results show that the CUR technique can be used to effectively select time step snapshots (columns) of over 140 SOLPS-ITER output variables and the associated discretized coordinate timeseries (rows) allowing for reconstruction of the complete simulation dynamics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Exactly unitary discrete representations of the metaplectic transform for linear-time algorithms

The metaplectic transform (MT), a generalization of the Fourier transform sometimes called the linear canonical transform, is a tool used ubiquitously in modern optics, for example, when calculating the transformations of light beams in paraxial optical systems. The MT is also an essential ingredient of the geometrical-optics modeling of caustics that we recently proposed. In particular, this application relies on the near-identity MT (NIMT); however, the NIMT approximation used so far is not exactly unitary and leads to numerical instability. Here, we develop a discrete MT that is exactly unitary, and approximate it to obtain a discrete NIMT that is also unitary and can be computed in linear time. We prove that the discrete NIMT converges to the discrete MT when iterated, thereby allowing the NIMT to compute MTs that are not necessarily near-identity. Finally, we then demonstrate the new algorithms with a series of examples.

47 OTHER INSTRUMENTATION↗

Development of the Ames Global Hyperspectral Synthetic Dataset

This study develops the surface BRDF (bidirectional reflectance distribution function) product of the Ames Global Hyperspectral Synthetic Dataset (AGHSD), based on the corresponding MODIS products, to support the NASA Surface Biology and Geology mission development. A main challenge in deriving a hyperspectral dataset from the multi-band satellite products is how to identify a succinct yet robust algorithm that allow us to infer BRDF at unobserved wavelengths based on the few observed bands. Using the theories of radiative transfer in vegetation canopies, we arrive at a simple equation that accurately approximates hyperspectral surface BRDF as the weighted sum of components from the soil and the vegetation. Each of the components is modeled by the product of the spectrally-dependent optical properties of a surface element (the spectra of the soil surface reflectance, the leaf single albedo, or the canopy scattering coefficient) and a spectrally-independent bidirectional scattering function. The optical properties of the soil and the vegetation can be obtained from existing spectral libraries or model simulations. The bidirectional scattering functions are represented by the Ross-Thick-Li-Sparse BRDF model, where the linear coefficients are estimated with regression analysis from the multi-band MODIS data. We validate the algorithm with simulations by Monte Carlo Ray Tracing model experiments, and the results are highly consistent with the theoretic derivation. We apply the algorithm to generate the AGHSD BRDF product at 1km and 8-day resolutions for the year of 2019. The results are biogeochemically and physically coherent and consistent, and thus serve the goal to support the science and application development of the SBG community.

Hyperspectral↗

Linear and nonlinear trending and prediction for AVHRR time series data

The variability of AVHRR calibration coefficient in time was analyzed using algorithms of linear and non-linear time series analysis. Specifically we have used the spline trend modeling, autoregressive process analysis, incremental neural network learning algorithm and redundancy functional testing. The analysis performed on available AVHRR data sets revealed that (1) the calibration data have nonlinear dependencies, (2) the calibration data depend strongly on the target temperature, (3) both calibration coefficients and the temperature time series can be modeled, in the first approximation, as autonomous dynamical systems, (4) the high frequency residuals of the analyzed data sets can be best modeled as an autoregressive process of the 10th degree. We have dealt with a nonlinear identification problem and the problem of noise filtering (data smoothing). The system identification and filtering are significant problems for AVHRR data sets. The algorithms outlined in this study can be used for the future EOS missions. Prediction and smoothing algorithms for time series of calibration data provide a functional characterization of the data. Those algorithms can be particularly useful when calibration data are incomplete or sparse.

Smid, J.↗

Combined Bernstein Polynomial, Optimal Reciprocal Collision Avoidance, Differential Dynamic Programming for Trajectory Replanning and Collision Avoidance for UAM Vehicles

This paper presents an integration of Differential Dynamic Programming (DDP) with the Optimal Reciprocal Collision Avoidance (ORCA) algorithm as the basis for a new algorithm, titled Combined Bernstein Polynomial Optimal Reciprocal Collision Avoidance DDP (COBRA-DDP), for trajectory replanning and collision avoidance for Urban Air Mobility (UAM) vehicles. State-constrained variants of DDP provide the ability to plan trajectories while avoiding obstacles, but these methods require a large increase in computational time per iteration which hinders the overall speed of the algorithm. ORCA utilizes simplified dynamics to recognize potential collisions along a trajectory and provides an optimal velocity for the avoidance of multiple vehicles. These velocity commands, however, may not result in a dynamically feasible trajectory for DDP to plan around. As such, a Bernstein polynomial curve that considers the general dynamic constraints of the vehicle is generated to approximate a trajectory based on the velocity commands. COBRA-DDP optimizes this suggested trajectory via unconstrained DDP to provide a dynamically feasible trajectory that provides collision avoidance. This new trajectory can be applied to the vehicle or used to warm start the state constrained DDP algorithms to decrease computation time. Its benefits and effectiveness of the algorithm are demonstrated on a UAM Vertical Takeoff and Landing (VTOL) vehicle simulation with highly nonlinear dynamics.

Optimal Reciprocal Collision Avoidance↗

Statistical properties of filtered pseudorandom digital sequences formed from the sum of maximum-length sequences

The statistics of filtered pseudorandom digital sequences called hybrid-sum sequences, formed from the modulo-two sum of several maximum-length sequences, are analyzed. The results indicate that a relation exists between the statistics of the filtered sequence and the characteristic polynomials of the component maximum length sequences. An analysis procedure is developed for identifying a large group of sequences with good statistical properties for applications requiring the generation of analog pseudorandom noise. By use of the analysis approach, the filtering process is approximated by the convolution of the sequence with a sum of unit step functions. A parameter reflecting the overall statistical properties of filtered pseudorandom sequences is derived. This parameter is called the statistical quality factor. A computer algorithm to calculate the statistical quality factor for the filtered sequences is presented, and the results for two examples of sequence combinations are included. The analysis reveals that the statistics of the signals generated with the hybrid-sum generator are potentially superior to the statistics of signals generated with maximum-length generators. Furthermore, fewer calculations are required to evaluate the statistics of a large group of hybrid-sum generators than are required to evaluate the statistics of the same size group of approximately equivalent maximum-length sequences.

Wallace, G. R.↗

An efficient approach to ARMA modeling of biological systems with multiple inputs and delays

This paper presents a new approach to AutoRegressive Moving Average (ARMA or ARX) modeling which automatically seeks the best model order to represent investigated linear, time invariant systems using their input/output data. The algorithm seeks the ARMA parameterization which accounts for variability in the output of the system due to input activity and contains the fewest number of parameters required to do so. The unique characteristics of the proposed system identification algorithm are its simplicity and efficiency in handling systems with delays and multiple inputs. We present results of applying the algorithm to simulated data and experimental biological data In addition, a technique for assessing the error associated with the impulse responses calculated from estimated ARMA parameterizations is presented. The mapping from ARMA coefficients to impulse response estimates is nonlinear, which complicates any effort to construct confidence bounds for the obtained impulse responses. Here a method for obtaining a linearization of this mapping is derived, which leads to a simple procedure to approximate the confidence bounds.

Non-NASA Center↗

Rays for Roots - Integrating Backscatter X-Ray Phenotyping, Modeling and Genetics to Increase Carbon Sequestration and Switchgrass Resource Use (Final Report)

To increase carbon (C) deposition in the soil and enhance crop resource use efficiency, characterizing root form and function is essential. Several root and soil traits have been linked to increased root-to-soil C transfer. Technology that could provide high-resolution characterization of many of these traits in field conditions would revolutionize our ability to study and understand how to increase C sequestration. In this effort, we developed an initial early prototype backscatter X-ray system for non-destructive imaging of root traits. We collected initial backscatter X-ray data in field and lab settings and carried out early analysis of these data. Along with this prototype, we also developed a suite of root phenotyping approaches including advanced minirhizotron image analysis, soil core imaging, and mesocosm imaging. Minirhizotron (MR) tubes are clear tubes inserted into the soil in the field and used to image roots and the surrounding soil. Our team has developed deep learning-based methods that can segment roots from soil that can learn from imprecise image-level labels. The ability to learn or fine-tune our deep learning algorithms from image-level labels allows easier and faster application of these approaches to new locations and new plant species. We have successfully implemented and applied our MR analysis approaches to thousands of switchgrass MR images collected across geographical regions. An advantage of MR imaging is the ability to collect root and soil images over time. Our soil core analysis included collecting hundreds of soil core samples from harvested switchgrass fields and imaging these cores with both X-ray CT and backscatter X-ray imaging. Initial segmentation approaches for the X-ray CT images of these cores have been developed and applied. An advantage of soil core analysis is that it preserves the three-dimensional structures of the roots and soil in the core collected. Our group also developed photogrammetry-based mesocosm root imaging and phenotyping approaches. In this approach, a plant was grown in a large mesocosm with a three-dimensional grid of thin supporting lines inserted throughout the mesocosm. After the plant (and, correspondingly, the root architecture is grown and established) the soil media was removed and the supporting lines approximately preserved the three-dimensional root architecture. Then, we applied photogrammetry techniques to create a three-dimensional digital representation of the root architecture for which we developed analysis algorithms including skeletonization. We carried out our phenotyping development with powerful switchgrass resources and physiological and agroecosystem modeling to deliver novel technology. This project contributes to multiple ARPA-E missions including reduction of foreign imports of energy, reduction of energy-related emissions including greenhouse gases, and ensuring that the United States maintains a technological lead in developing and deploying advanced energy technology. Furthermore, the developed tools could transform public and private plant breeding and could be broadly applicable to other crops and, potentially, other application areas. Our team of engineers, plant and soil scientists, and modelers i) developed an early prototype backscatter X-ray platform that can operate in field conditions; ii) developed a suite of root phenotyping and characterization approaches as described above; iii) developed and carried out plant biology and physiology roots studies and; iv) developed and implemented mechanistic physiological modeling.

42 ENGINEERING↗

Empirical correction for earth sensor horizon radiance variation

A major limitation on the use of infrared horizon sensors for attitude determination is the variability of the height of the infrared Earth horizon. This variation includes a climatological component and a stochastic component of approximately equal importance. The climatological component shows regular variation with season and latitude. Models based on historical measurements have been used to compensate for these systematic changes. The stochastic component is analogous to tropospheric weather. It can cause extreme, localized changes that for a period of days, overwhelm the climatological variation. An algorithm has been developed to compensate partially for the climatological variation of horizon height and at least to mitigate the stochastic variation. This method uses attitude and horizon sensor data from spacecraft to update a horizon height history as a function of latitude. For spacecraft that depend on horizon sensors for their attitudes (such as the Total Ozone Mapping Spectrometer-Earth Probe-TOMS-EP) a batch least squares attitude determination system is used. It is assumed that minimizing the average sensor residual throughout a full orbit of data results in attitudes that are nearly independent of local horizon height variations. The method depends on the additional assumption that the mean horizon height over all latitudes is approximately independent of season. Using these assumptions, the method yields the latitude dependent portion of local horizon height variations. This paper describes the algorithm used to generate an empirical horizon height. Ideally, an international horizon height database could be established that would rapidly merge data from various spacecraft to provide timely corrections that could be used by all.

Hashmall, Joseph A.↗

Inexact Newton-CG algorithms with complexity guarantees

Abstract We consider variants of a recently developed Newton-CG algorithm for nonconvex problems (Royer, C. W. & Wright, S. J. (2018) Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim., 28, 1448–1477) in which inexact estimates of the gradient and the Hessian information are used for various steps. Under certain conditions on the inexactness measures, we derive iteration complexity bounds for achieving $\epsilon $-approximate second-order optimality that match best-known lower bounds. Our inexactness condition on the gradient is adaptive, allowing for crude accuracy in regions with large gradients. We describe two variants of our approach, one in which the step size along the computed search direction is chosen adaptively, and another in which the step size is pre-defined. To obtain second-order optimality, our algorithms will make use of a negative curvature direction on some steps. These directions can be obtained, with high probability, using the randomized Lanczos algorithm. In this sense, all of our results hold with high probability over the run of the algorithm. We evaluate the performance of our proposed algorithms empirically on several machine learning models. Our approach is a first attempt to introduce inexact Hessian and/or gradient information into the Newton-CG algorithm of Royer & Wright (2018, Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim., 28, 1448–1477).

Mathematics↗

SeaWiFS technical report series. Volume 32: Level-3 SeaWiFS data products. Spatial and temporal binning algorithms

The level-3 data products from the Sea-viewing Wide Field-of-view Sensor (SeaWiFS) are statistical data sets derived from level-2 data. Each data set will be based on a fixed global grid of equal-area bins that are approximately 9 x 9 sq km. Statistics available for each bin include the sum and sum of squares of the natural logarithm of derived level-2 geophysical variables where sums are accumulated over a binning period. Operationally, products with binning periods of 1 day, 8 days, 1 month, and 1 year will be produced and archived. From these accumulated values and for each bin, estimates of the mean, standard deviation, median, and mode may be derived for each geophysical variable. This report contains two major parts: the first (Section 2) is intended as a users' guide for level-3 SeaWiFS data products. It contains an overview of level-0 to level-3 data processing, a discussion of important statistical considerations when using level-3 data, and details of how to use the level-3 data. The second part (Section 3) presents a comparative statistical study of several binning algorithms based on CZCS and moored fluorometer data. The operational binning algorithms were selected based on the results of this study.

Hooker, Stanford B.↗

Impact of including second and later cancers in cause-specific survival estimates using population-based registry data

Background. Second or later primary cancers account for approximately 20% of incident cases in the United States. Currently, cause-specific survival (CSS) analyses exclude these cancers because the cause of death (COD) classification algorithm was available only for first cancers. The authors added rules for later cancers to the Surveillance, Epidemiology, and End Results cause-specific death classification algorithm and evaluated CSS to include individuals with prior tumors. Methods. The authors constructed 2 cohorts: 1) the first ever primary cohort, including patients whose first cancer was diagnosed during 2000 through 2016) and 2) the earliest matching primary cohort, including patients with any cancer who matched the selection criteria irrespective of whether it was the first or a later cancer diagnosed during 2000 through 2016. The cohorts' CSS estimates were compared using follow-up through December 31, 2017. The new rules were used in the second cohort for patients whose first cancers during 2000 through 2016 were their second or later cancers. Results. Overall, there were no statistically significant differences in CSS estimates between the 2 cohorts. Estimates were similar by age, stage, race, and time since diagnosis, except for patients with leukemia and those aged 65 to 74 years (3.4 percentage point absolute difference). Conclusions. The absolute difference in CSS estimates for the first cancer ever cohort versus earliest of any cancers cohort in the study period was small for most cancer types. As the number of newly diagnosed patients with prior cancers increases, the algorithm will make CSS more inclusive and enable estimating survival for a group of patients with cancer for whom life tables are not available or life tables are available but do not capture other-cause mortality appropriately.

Survival Analysis↗

Dendrite-resolved, full-melt-pool phase-field simulations to reveal non-steady-state effects and to test an approximate model

In this report we study the epitaxial, columnar growth of (multiply oriented) dendrites/cells for a spot melt in a polycrystalline Al–Cu substrate using two-dimensional, phase-field, direct numerical simulations (DNS) at the full-melt-pool scale. Our main objective is to compare the expensive DNS model to a much cheaper but approximate “line” model in which a single-crystal phase-field simulation is confined to a narrow rectangular geometry. To perform this comparison, we develop algorithms that automatically extract quantities of interest (QoIs) from both DNS and line models. These QoIs allow us to quantitatively assess the assumptions in the line model and help us analyze its discrepancy with the DNS model. We consider four sets of heat source parameters, mimicking welding and additive manufacturing conditions, that create a combination shallow and deep melt pools. Our largest DNS simulation used 16K x 14K grid points in space. Our main findings can be summarized as follows. Under AM conditions, the QoIs of line models are in excellent agreement with the full DNS results for both shallow and deep melt pools. Under welding conditions, the primary spacing of the DNS model is smaller than the prediction of line model. We identify a geometric crowding effect that accounts for the discrepancies between the DNS and line models. We propose two potential mechanisms that determine the response of the microstructure to geometric crowding.

36 MATERIALS SCIENCE↗

Adaptive Activation Functions Accelerate Convergence in Deep and Physics-informed Neural Networks

We employ adaptive activation functions for regression in deep and physics-informed neural networks (PINNs) to approximate smooth and discontinuous functions as well as solutions of linear and nonlinear partial differential equations. In particular, we solve the nonlinear Klein-Gordon equation, which has smooth solutions, the nonlinear Burgers equation, which can admit high gradient solutions, and the Helmholtz equation. We introduce a scalable hyper-parameter in the activation function, which can be optimized to achieve best performance of the network as it changes dynamically the topology of the loss function involved in the optimization process. The adaptive activation function has better learning capabilities than the traditional one (fixed activation) as it improves greatly the convergence rate, especially at early training, as well as the solution accuracy. To better understand the learning process, we plot the neural network solution in the frequency domain to examine how the network captures successively different frequency bands present in the solution. We consider both forward problems, where the approximate solutions are obtained, as well as inverse problems, where parameters involved in the governing equation are identified. Our simulation results show that the proposed method is a very simple and effective approach to increase the efficiency, robustness and accuracy of the neural network approximation of nonlinear functions as well as solutions of partial differential equations, especially for forward problems. We theoretically prove that in the proposed method, gradient descent algorithms are not attracted to suboptimal critical points or local minima.

machine leaning, Bad minima, Inverse problems, Phy↗