Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “arbitrary choices”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS1983

Scattering from randomly oriented scatterers of arbitrary shape in the low-frequency limit with application to vegetation

A general theory of intensity scattering from small particles of arbitrary shape has been developed based on the radiative transfer theory. Upon permitting the particles to orient in accordance with any prescribed distribution, scattering models can be derived. By making an appropriate choice of the particle size, the scattering model may be used to estimate scattering from media such as snow, vegetation and sea ice. For the purpose of illustration only comparisons with measurements from a vegetated medium are shown. The difference in scattering between elliptic- and circular-shaped leaves is demonstrated. In the low-frequency limit, the major factors on backscattering from vegetation are found to be the depth of the vegetation layer and the orientation distribution of the leaves. The shape of the leaf is of secondary importance.

Karam, M. A.↗
NASA NTRS1986

Non-existence of dynamical perturbations of Schwarzschild with vanishing self-dual part

A recent proposal of Ashtekar (1985) for the canonical quantisation of gravity involves a new choice of a (complex) polarisation on the (real) phase space of general relativity. In order for the 'four dimensional' version of Ashtekar's proposal to be viable, it is necessary that for an arbitrary (real) background solution there exist a sufficient number of (complex) solutions of the linearised Einstein equation with perturbed Weyl spinor having vanishing self-dual part. It is shown that this is not the case by explicitly demonstrating that for the Schwarzschild spacetime, aside from stationary perturbations, there are no such linearised solutions which can be expressed as superpositions of modes of real frequencies. The viability of the '3+1 version' of Ashtekar's proposal is not affected by these considerations.

Wald, R. M.↗
NASA NTRS1990

Panel methods: An introduction

Panel methods are numerical schemes for solving (the Prandtl-Glauert equation) for linear, inviscid, irrotational flow about aircraft flying at subsonic or supersonic speeds. The tools at the panel-method user's disposal are (1) surface panels of source-doublet-vorticity distributions that can represent nearly arbitrary geometry, and (2) extremely versatile boundary condition capabilities that can frequently be used for creative modeling. Panel-method capabilities and limitations, basic concepts common to all panel-method codes, different choices that were made in the implementation of these concepts into working computer programs, and various modeling techniques involving boundary conditions, jump properties, and trailing wakes are discussed. An approach for extending the method to nonlinear transonic flow is also presented. Three appendices supplement the main test. In appendix 1, additional detail is provided on how the basic concepts are implemented into a specific computer program (PANAIR). In appendix 2, it is shown how to evaluate analytically the fundamental surface integral that arises in the expressions for influence-coefficients, and evaluate its jump property. In appendix 3, a simple example is used to illustrate the so-called finite part of the improper integrals.

Erickson, Larry L.↗
NASA NTRS2002

Correlation Techniques as Applied to Pose Estimation in Space Station Docking

The telerobotic assembly of space-station components has become the method of choice for the International Space Station (ISS) because it offers a safe alternative to the more hazardous option of space walks. The disadvantage of telerobotic assembly is that it does not provide for direct arbitrary views of mating interfaces for the teleoperator. Unless cameras are present very close to the interface positions, such views must be generated graphically, based on calculated pose relationships derived from images. To assist in this photogrammetric pose estimation, circular targets, or spots, of high contrast have been affixed on each connecting module at carefully surveyed positions. The appearance of a subset of spots essentially must form a constellation of specific relative positions in the incoming digital image stream in order for the docking to proceed. Spot positions are expressed in terms of their apparent centroids in an image. The precision of centroid estimation is required to be as fine as 1I20th pixel, in some cases. This paper presents an approach to spot centroid estimation using cross correlation between spot images and synthetic spot models of precise centration. Techniques for obtaining sub-pixel accuracy and for shadow, obscuration and lighting irregularity compensation are discussed.

Rollins, J. Michael↗
NASA NTRS2024

Redundancy Parameterization and Inverse Kinematics of 7-DOF Revolute Manipulators

Seven degree-of-freedom (DOF) robot arms have one redundant DOF for obstacle and singularity avoidance. This DOF does not change the end effector motion and must be parameterized to fully specify the joint angles for a given end effector pose. For 7-DOF revolute (7R) manipulators, we introduce the generalized shoulder-elbow-wrist (SEW) angle, a generalization of the widely-used conventional SEW angle but with an arbitrary reference direction function, along with Jacobian expressions and singularity analysis. Other redundancy parameterizations including the conventional SEW angle encounter an algorithmic singularity along a line in the workspace. We introduce a reference direction function choice called the stereographic SEW angle which has a singularity only along a half-line and can be placed out of reach. We prove such a singularity is unavoidable for any parameterization. Finally, using the general SEW angle and the subproblem decomposition method, we provide efficient singularity-robust inverse kinematics solutions for 7R manipulators which are often closed-form but may involve a 1D or (in general) 2D search. Search-based solutions may be converted to finding polynomial roots. Examples are available in a publicly accessible repository.

Kinematics↗
NASA NTRS1988

Effective permittivity of dielectric mixtures

General mixing formulas are derived for discrete scatterers immersed in a host medium. The inclusion particles are assumed to be ellipsoidal. The electric field inside the scatterers is determined by quasi-static analysis, assuming the diameter of the inclusion particles to be much smaller than one wavelength. The results are applicable to general multiphase mixtures, and the scattering ellipsoids of the different phases can have different sizes and arbitrary ellipticity distribution and axis orientation, i.e., the mixture may be isotropic or anisotropic. The resulting mixing formula is nonlinear and is suitable for iterative solutions. The formula contains a quantity called the apparent permittivity, and with different choices of this quantity, the result leads to the generalized Lorentz-Lorenz formula, the generalized Polder-van Santen formula, and the generalized coherent potential-quasicrystalline approximation formula. The results are applied to calculating the complex effective permittivity of dry and wet snow, and sea ice.

Sihvola, Ari H.↗
NASA NTRS1995

A Unified Air-Sea Visualization System: Survey on Gridding Structures

The goal is to develop a Unified Air-Sea Visualization System (UASVS) to enable the rapid fusion of observational, archival, and model data for verification and analysis. To design and develop UASVS, modelers were polled to determine the gridding structures and visualization systems used, and their needs with respect to visual analysis. A basic UASVS requirement is to allow a modeler to explore multiple data sets within a single environment, or to interpolate multiple datasets onto one unified grid. From this survey, the UASVS should be able to visualize 3D scalar/vector fields; render isosurfaces; visualize arbitrary slices of the 3D data; visualize data defined on spectral element grids with the minimum number of interpolation stages; render contours; produce 3D vector plots and streamlines; provide unified visualization of satellite images, observations and model output overlays; display the visualization on a projection of the users choice; implement functions so the user can derive diagnostic values; animate the data to see the time-evolution; animate ocean and atmosphere at different rates; store the record of cursor movement, smooth the path, and animate a window around the moving path; repeatedly start and stop the visual time-stepping; generate VHS tape animations; work on a variety of workstations; and allow visualization across clusters of workstations and scalable high performance computer systems.

Anand, Harsh↗
NASA NTRS2014

Gradient Calculation Methods on Arbitrary Polyhedral Unstructured Meshes for Cell-Centered CFD Solvers

A survey of gradient reconstruction methods for cell-centered data on unstructured meshes is conducted within the scope of accuracy assessment. Formal order of accuracy, as well as error magnitudes for each of the studied methods, are evaluated on a complex mesh of various cell types through consecutive local scaling of an analytical test function. The tests highlighted several gradient operator choices that can consistently achieve 1st order accuracy regardless of cell type and shape. The tests further offered error comparisons for given cell types, leading to the observation that the "ideal" gradient operator choice is not universal. Practical implications of the results are explored via CFD solutions of a 2D inviscid standing vortex, portraying the discretization error properties. A relatively naive, yet largely unexplored, approach of local curvilinear stencil transformation exhibited surprisingly favorable properties

Meshes↗
NASA NTRS1981

Two-channel Costas loop tracking performance for UQPSK signals with arbitrary data formats

Previous results on the tracking performance of two-channel Costas-type carrier synchronization loops are generalized and corrected, in order that they may be applied to several mixed-format cases. In particular, the mean-square phase jitter performance of these loops with active arm filters, synchronous or asynchronous symbol clocks, and arbitrary data formats on the two channels is examined. It is demonstrated that for each case, selection of the channel gain ratio, as motivated by the MAP estimation theory, does not guarantee optimum loop tracking performance: in some instances, a conventional single-channel Costas loop would outperform the two-channel version with the MAP choice of gain ratio. It is suggested that the gain ratio be chosen to directly minimize the mean-square phase tracking jitter which is equivalent to minimizing the loop's 'squaring loss'. This can, in some cases, improve the performance measure, although in all cases, the two-channel loop will still outperform the single-channel version.

Simon, M. K.↗
NASA NTRS1991

Design of an essentially non-oscillatory reconstruction procedure on finite-element type meshes

An essentially non-oscillatory reconstruction for functions defined on finite-element type meshes was designed. Two related problems are studied: the interpolation of possibly unsmooth multivariate functions on arbitrary meshes and the reconstruction of a function from its average in the control volumes surrounding the nodes of the mesh. Concerning the first problem, we have studied the behavior of the highest coefficients of the Lagrange interpolation function which may admit discontinuities of locally regular curves. This enables us to choose the best stencil for the interpolation. The choice of the smallest possible number of stencils is addressed. Concerning the reconstruction problem, because of the very nature of the mesh, the only method that may work is the so called reconstruction via deconvolution method. Unfortunately, it is well suited only for regular meshes as we show, but we also show how to overcome this difficulty. The global method has the expected order of accuracy but is conservative up to a high order quadrature formula only. Some numerical examples are given which demonstrate the efficiency of the method.

Abgrall, R.↗
NASA NTRS1990

Optimal expression evaluation for data parallel architectures

A data parallel machine represents an array or other composite data structure by allocating one processor (at least conceptually) per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of the operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. An efficient algorithm is given to find the minimum-cost way to evaluate an expression, for several different data parallel architectures. This algorithm applies to any architecture in which the metric describing the cost of moving an array is robust. This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes. Remarks are made on several variations of the problem, some of which are solved and some of which remain open.

Gilbert, John R.↗
NASA NTRS1986

Methods for the solution of radiative transfer equation

To obtain an exact solution of the radiative-transfer equation in media where both absorption and scattering are significant, the usual approach is to use a numerical method. Three methods are known in the literature: invariant imbedding, eigenvalue-eigenfunction, and matrix doubling. This paper examines the practical application of these methods to the problem of emission from an inhomogeneous (Rayleigh) layer, the effects of layer parameters on the stability. It is found that invariant imbedding is most suitable for computing emission from an inhomogeneous layer with a temperature profile but tends to be unstable as the optical thickness of the layer increases beyond 0.5. On the other hand, the matrix-doubling method is stable for arbitrary optical thickness but is not suitable for handling multilayers. The eigenvalue-eigenfunction method is more stable than the invariant imbedding as optical thickness increases up to 2.0. It also permits temperature profile in the layer, but the computation is much more complicated. It is less stable than the matrix-doubling method when optical thickness is larger than 2.0. In general, the choice of a method is dependent on the nature of the problem.

Chen, M. F.↗
NASA NTRS1990

Optimal expression evaluation for data parallel architectures

A data parallel machine represents an array or other composite data structure by allocating one processor per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. An efficient algorithm is given to find the minimum cost way to evaluate an expression, for several different data parallel architectures. The algorithm applies to any architecture in which the metric describing the cost of moving an array has a property called robustness. This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes.

Gilbert, J. R.↗
NASA NTRS1991

Optimal expression evaluation for data parallel architectures

A data parallel machine represents an array or other composits data structure by allocating one processor per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. An efficient algorithm is given to find the minimum cost way to evaluate an expression, for several different data parallel architectures. The algorithm applies to any architecture in which the metric describing the cost of moving an array has a property called robustness. This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes.

Gilbert, John R.↗
NASA NTRS1992

Prediction of airfoil stall using Navier-Stokes equations in streamline coordinates

A Navier-Stokes procedure to calculate the flow about an airfoil at incidence was developed. The parabolized equations are solved in the streamline coordinates generated for an arbitrary airfoil shape using conformal mapping. A modified k-epsilon turbulence model is applied in the entire domain, but the eddy viscosity in the laminar region is suppressed artificially to simulate the region correctly. The procedure was applied to airfoils at various angles of attack, and the results are quite satisfactory for both laminar and turbulent flows. It is shown that the present choice of the coordinate system reduces the error due to numerical diffusion, and that the lift is accurately predicted for a wide range of incidence.

Choi, D. H.↗
NASA NTRS1981

N-stream approximations to radiative transfer

Schuster's two-stream approximation (1905) is first derived from Chandrasekhar's radiative transfer equation (1950), and then extended to an arbitrary number of streams. The resulting technique for solving the transfer function similar to the discrete ordinate and spherical harmonic methods, is useful for modeling atmospheres with complicated phase functions and moderate optical depths. The resulting n coupled linear differential equations are simple and consume less computer time than other approximations, yet have the same required accuracy. The approximation is also flexible with respect to the choice of patch functions, and no approximations are made on the form of the phase function, other than its expansion into Legendre polynomials. A four-stream approximation is evaluated for a Henyey-Greenstein phase function with an asymmetry factor equal to 0.5.

Acquista, C.↗
NASA NTRS1977

Performance analysis of grazing incidence imaging systems

An exact expression relating the coordinates of a point on the incident ray, a point of reflection from an arbitrary surface, and a point on the reflected ray is derived. The exact relation is then specialized for the case of grazing incidence, and first order and third order systematic analyses are carried out for a single reflective surface and then for a combination of two surfaces. The third order treatment yields a complete set of primary aberrations for single element and two element systems. The importance of a judicious choice for a coordinate system in showing field curvature to clearly be the predominant aberration for a two element system is discussed. The validity of the theory is verified through comparisons with the exact ray trace results for the case of the telescope.

Winkler, C. E.↗
NASA NTRS1974

Upper bounds on sequential decoding performance parameters

This paper presents the best obtainable random coding and expurgated upper bounds on the probabilities of undetectable error, of t-order failure (advance to depth t into an incorrect subset), and of likelihood rise in the incorrect subset, applicable to sequential decoding when the metric bias G is arbitrary. Upper bounds on the Pareto exponent are also presented. The G-values optimizing each of the parameters of interest are determined, and are shown to lie in intervals that in general have nonzero widths. The G-optimal expurgated bound on undetectable error is shown to agree with that for maximum likelihood decoding of convolutional codes, and that on failure agrees with the block code expurgated bound. Included are curves evaluating the bounds for interesting choices of G and SNR for a binary-input quantized-output Gaussian additive noise channel.

Jelinek, F.↗