Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “fast 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 91 records · Page 5

Training and Validation of Spectral Gap Filling Algorithm for Cpf-Ceres Intercalibration

The Climate Absolute Radiance and Refractivity Observatory (CLARREO) Pathfinder (CPF) mission is set to launch an SI-traceable reflective solar (RS) spectrometer aboard the International Space Station to measure Earth-reflected solar radiation with a radiometric uncertainty of 0.3% (k=1). The CPF intercalibration team has devised a cutting-edge methodology to accurately transfer the benchmark CPF calibration reference to the shortwave (SW) channel (200-5000 nm) of the Clouds and the Earth’s Radiant Energy System (CERES) instrument. The spectral range of CPF measurements spans from 350-2300 nm, while the CERES SW channel measures the Earth-reflected broadband solar radiances between 200 nm to 5 μm. To conduct precise CPF-CERES intercalibration analysis, the CPF-like spectral radiances outside the CPF spectral range need to be estimated to match the CERES SW spectral range. In response, the team has developed a fast algorithm that leverages spectrally redundant information within the CPF-measured portion through principal component analysis (PCA) and utilizes pre-established spectral correlation relationships among wavelengths to extend the CPF spectrum below 350 nm and above 2300 nm. Our results show that the algorithm achieves excellent accuracy in generating the missing energy in the UV and IR portions. The RMS error in the UV region is less than 4.5x10-3 W/m2/sr/nm, while in the IR region, it is smaller than 8x10-5 W/m2/sr/nm. Our methodology was validated using measured EMIT radiance data, which covers the spectral range from 0.381 μm to 2.493 μm. We employed EMIT radiances within the wavelength range of 0.43 – 2.25 μm to generate radiances for both the shorter wavelength range (0.381 – 0.43 μm) and longer wavelength range (2.25 – 2.493 μm). The generated radiances agree very well with the measured EMIT radiances. The standard deviation in the integrated broadband radiances was about 0.1%, and the bias is less than 0.004% for over 1.5 million EMIT measured samples. These statistics show that the spectral gap filling algorithm is robust and effective in substantially reducing the spectral difference-induced uncertainty in the CPF-CERES intercalibration samples.

Qiguang Yang↗

Relations between Haar and Walsh/Hadamard transforms.

Relations between the Haar and Walsh/Hadamard (W/H) transforms, which are proved, show that for some applications the Haar transform performs as well as, and faster than, the W/H transform. These relations yield a family of orthogonal transforms including the Haar and W/H transforms with a common fast algorithm.

Fino, B. J.↗

Processing electrophysiological signals for the monitoring of alertness

Mathematical techniques are described for processing EEG signals associated with varying states of alertness. Fast algorithms for implementing real-time computations of alertness estimates were developed. A realization of the phase-distortionless digital filter is presented which approaches real-time filtering and a transform for EEG signals. This transform provides information for the alertness estimates and can be performed in real time. A statistical test for stationarity in EEG signals is being developed that will provide a method for determining the duration of the EEG signals necessary for estimating the short-time power or energy spectra for nonstationary analysis of EEG signals.

Lai, D. C.↗

Estimation of tunnel blockage from wall pressure signatures: A review and data correlation

A method is described for estimating low speed wind tunnel blockage, including model volume, bubble separation and viscous wake effects. A tunnel-centerline, source/sink distribution is derived from measured wall pressure signatures using fast algorithms to solve the inverse problem in three dimensions. Blockage may then be computed throughout the test volume. Correlations using scaled models or tests in two tunnels were made in all cases. In many cases model reference area exceeded 10% of the tunnel cross-sectional area. Good correlations were obtained regarding model surface pressures, lift drag and pitching moment. It is shown that blockage-induced velocity variations across the test section are relatively unimportant but axial gradients should be considered when model size is determined.

Hackett, J. E.↗

A general and computationally fast formulation for radiative transfer with scattering

A general formulation of monocromatic radiative transfer with scattering has been developed for plane-parallel geometry. The inhomogeneous and nonisothermal medium absorbs, emits, and anisotropically scatters radiation. Surfaces can emit and scatter radiation in any specified manner. The solution procedure uses the fact that phase incoherent scattering is linear in radiative sources. Certain basic scattering functions are then defined and calculated by an adding computer code using matrix algebra. These scattering functions are weighted by the temperature field and summed (superimposed) to obtain the solution for any specific problem. Numerical results for exiting intensities and one-sided heat fluxes from general media bound by one arbitrary surface are presented. These parametric studies demonstrate the effects of scattering particles and surfaces on radiative transfer from inhomogeneous and nonisothermal media. Application of the formulation to radiative equilibrium is also discussed. The conclusion is that all problems in plane-parallel radiative transfer with scattering can be solved by a common and computationally fast algorithm based on this formulation.

Cogley, A. C.↗

CAS2D: FORTRAN program for nonrotating blade-to-blade, steady, potential transonic cascade flows

An exact, full-potential-equation (FPE) model for the steady, irrotational, homentropic and homoenergetic flow of a compressible, homocompositional, inviscid fluid through two dimensional planar cascades of airfoils was derived, together with its appropriate boundary conditions. A computer program, CAS2D, was developed that numerically solves an artificially time-dependent form of the actual FPE. The governing equation was discretized by using type-dependent, rotated finite differencing and the finite area technique. The flow field was discretized by providing a boundary-fitted, nonuniform computational mesh. The mesh was generated by using a sequence of conforming mapping, nonorthogonal coordinate stretching, and local, isoparametric, bilinear mapping functions. The discretized form of the FPE was solved iteratively by using successive line overrelaxation. The possible isentropic shocks were correctly captured by adding explicitly an artificial viscosity in a conservative form. In addition, a three-level consecutive, mesh refinement feature makes CAS2D a reliable and fast algorithm for the analysis of transonic, two dimensional cascade flows.

Dulikravich, D. S.↗

Fast Generation of body conforming grids for 3-D

A fast algorithm was developed for accurately generating boundary conforming, three dimensional, consecutively refined, computational grids applicable to arbitrary axial turbomachinery geometry. The method is based on using a single analytic function to generate two dimensional grids on a number of coaxial axisymmetric surfaces positioned between the hub and the shroud. These grids are of the "O" type and are characterized by quasi-orthogonality, geometric periodicity, and an adequate resolution throughout the flowfield. Due to the built in additional nonorthogonal coordinate stretching and shearing, the grid lines leaving the trailing of the blade end at downstream infinity, thus simplifying the numerical treatment of the three dimensional trailing vortex sheet.

Dulikravich, O.↗

GRID3O: Computer program for fast generation of multilevel, three-dimensional boundary-conforming O-type computational grids

A fast algorithm was developed for accurately generating boundary-conforming, three-dimensional, consecutively refined computational grids applicable to arbitrary wing-body and axial turbomachinery geometries. The method is based on using an analytic function to generate two-dimensional grids on a number of coaxial axisymmetric surfaces positioned between the centerbody and the outer radial boundary. These grids are of the O-type and are characterized by quasi-orthogonality, geometric periodicity, and an adequate resolution throughout the flow field. Because the built-in nonorthogonal coordinate stretching and shearing cause the grid lines leaving the blade or wing trailing edge to end at downstream infinity, the numerical treatment of the three-dimensional trailing vortex sheets is simplified.

Dulikravich, D. S.↗

Techniques of isophotometry

The expected performance of the Minnesota automated dual-plate scanner (APS) is discussed with regard to photometry, position measurement accuracy, and ability to classify images. In addition, a fast algorithm for calculating image parameters is described.

Ghigo, F. D.↗

The expanded LaGrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrainted optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗

Orthographic terrain views using data derived from digital elevation models

A fast algorithm for producing three-dimensional orthographic terrain views uses digital elevation data and co-registered imagery. These views are created using projective geometry and are designed for display on high-resolution raster graphics devices. The algorithm's effectiveness is achieved by (1) the implementation of two efficient gray-level interpolation routines that offer the user a choice between speed and smoothness, and (2) a unique visible surface determination procedure based on horizon angles derived from the elevation data set.

Dubayah, R. O.↗

The expanded Lagrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrained optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗

IECON '87: Industrial applications of control and simulation; Proceedings of the 1987 International Conference on Industrial Electronics, Control, and Instrumentation, Cambridge, MA, Nov. 3, 4, 1987

Recent advances in control-system design and simulation are discussed in reviews and reports. Among the topics considered are fast algorithms for generating near-optimal binary decision programs, trajectory control of robot manipulators with compensation of load effects via a six-axis force sensor, matrix integrators for real-time simulation, a high-level control language for an autonomous land vehicle, and a practical engineering design method for stable model-reference adaptive systems. Also addressed are the identification and control of flexible-limb robots with unknown loads, adaptive control and robust adaptive control for manipulators with feedforward compensation, adaptive pole-placement controllers with predictive action, variable-structure strategies for motion control, and digital signal-processor-based variable-structure controls.

Hartley, Tom T.↗

An implicit finite element method for high speed flows

A fast algorithm is presented for constructing continuous lines, consisting of element sides, on general unstructured two-dimensional triangular meshes. The lines must pass through each node of the mesh once and only once. The discussion focuses on the use of these lines in a relaxation method for the solution of the equation system arising from an implicit algorithm for the solution of two-dimensional Euler and Navier-Stokes equations on general unstructured grids. It is also shown that the method can be used for solving three-dimensional Navier-Stokes equations on a grid composed of both structured and unstructured regions.

Hassan, O.↗

Efficient Computation Of Manipulator Inertia Matrix

Improved method for computation of manipulator inertia matrix developed, based on concept of spatial inertia of composite rigid body. Required for implementation of advanced dynamic-control schemes as well as dynamic simulation of manipulator motion. Motivated by increasing demand for fast algorithms to provide real-time control and simulation capability and, particularly, need for faster-than-real-time simulation capability, required in many anticipated space teleoperation applications.

Fijany, Amir↗

Exact and approximate solutions to the oblique shock equations for real-time applications

The derivation of exact solutions for determining the characteristics of an oblique shock wave in a supersonic flow is investigated. Specifically, an explicit expression for the oblique shock angle in terms of the free stream Mach number, the centerbody deflection angle, and the ratio of the specific heats, is derived. A simpler approximate solution is obtained and compared to the exact solution. The primary objectives of obtaining these solutions is to provide a fast algorithm that can run in a real time environment.

Hartley, T. T.↗

Decentralized digital adaptive control of robot motion

A decentralized model reference adaptive scheme is developed for digital control of robot manipulators. The adaptation laws are derived using hyperstability theory, which guarantees asymptotic trajectory tracking despite gross robot parameter variations. The control scheme has a decentralized structure in the sense that each local controller receives only its joint angle measurement to produce its joint torque. The independent joint controllers have simple structures and can be programmed using a very simple and computationally fast algorithm. As a result, the scheme is suitable for real-time motion control.

Tarokh, M.↗