Search NASA⌕ Search

SEARCH · Search NASA

Results for “Local Method”

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

An Adaptive Unstructured Grid Method by Grid Subdivision, Local Remeshing, and Grid Movement

An unstructured grid adaptation technique has been developed and successfully applied to several three dimensional inviscid flow test cases. The approach is based on a combination of grid subdivision, local remeshing, and grid movement. For solution adaptive grids, the surface triangulation is locally refined by grid subdivision, and the tetrahedral grid in the field is partially remeshed at locations of dominant flow features. A grid redistribution strategy is employed for geometric adaptation of volume grids to moving or deforming surfaces. The method is automatic and fast and is designed for modular coupling with different solvers. Several steady state test cases with different inviscid flow features were tested for grid/solution adaptation. In all cases, the dominant flow features, such as shocks and vortices, were accurately and efficiently predicted with the present approach. A new and robust method of moving tetrahedral "viscous" grids is also presented and demonstrated on a three-dimensional example.

Pirzadeh, Shahyar Z.↗

Combining global and local approximations

A method based on a linear approximation to a scaling factor, designated the 'global-local approximation' (GLA) method, is presented and shown capable of extending the range of usefulness of derivative-based approximations to a more refined model. The GLA approach refines the conventional scaling factor by means of a linearly varying, rather than constant, scaling factor. The capabilities of the method are demonstrated for a simple beam example with a crude and more refined FEM model.

Haftka, Raphael T.↗

Pilot Program for the Development of Classification and Accuracy Assessment Methods and Improved Accessibility for Landsat and Related GIS Data and Technology Transfer of These Methods to State and Local Governments

This project has a single, comprehensive objective that is manifested in many tangible products and impacts throughout the state and the mid-south region. The primary objective or mission of this project is to expose the broadest possible cross-section of public sector decision makers responsible for developing and maintaining policy at the state, local and national levels, private sector professionals and students to the power, flexibility and utility of sensor based imagery and the mapping and interpretive products that are derived from these digital geodata. In accomplishing this mission this project has worked to provide hands-on exposure and training to primary and secondary teachers; developed and distributed instructional materials to students across the state; created an on-line archive of satellite images and related geographic data; implemented a service that enables users throughout the region and around the world to develop customized mapping products suitable for visualization and/or decision support from the comfort of their classroom or office via an internet connection to our facility; extended the use of sensor based imagery in natural resource management and commercial applications through a range of pilot research initiatives, demonstrations, presentations and professional papers.

Limp, W. Fredrick↗

Random Walk Method for Potential Problems

A local Random Walk Method (RWM) for potential problems governed by Lapalace's and Paragon's equations is developed for two- and three-dimensional problems. The RWM is implemented and demonstrated in a multiprocessor parallel environment on a Beowulf cluster of computers. A speed gain of 16 is achieved as the number of processors is increased from 1 to 23.

Krishnamurthy, T.↗

Solutions to Kuessner's integral equation in unsteady flow using local basis functions

The computational procedure and numerical results are presented for a new method to solve Kuessner's integral equation in the case of subsonic compressible flow about harmonically oscillating planar surfaces with controls. Kuessner's equation is a linear transformation from pressure to normalwash. The unknown pressure is expanded in terms of prescribed basis functions and the unknown basis function coefficients are determined in the usual manner by satisfying the given normalwash distribution either collocationally or in the complex least squares sense. The present method of solution differs from previous ones in that the basis functions are defined in a continuous fashion over a relatively small portion of the aerodynamic surface and are zero elsewhere. This method, termed the local basis function method, combines the smoothness and accuracy of distribution methods with the simplicity and versatility of panel methods. Predictions by the local basis function method for unsteady flow are shown to be in excellent agreement with other methods. Also, potential improvements to the present method and extensions to more general classes of solutions are discussed.

Fromme, J. A.↗

Aerodynamic Optimization of Rocket Control Surface Geometry Using Cartesian Methods and CAD Geometry

Aerodynamic design is an iterative process involving geometry manipulation and complex computational analysis subject to physical constraints and aerodynamic objectives. A design cycle consists of first establishing the performance of a baseline design, which is usually created with low-fidelity engineering tools, and then progressively optimizing the design to maximize its performance. Optimization techniques have evolved from relying exclusively on designer intuition and insight in traditional trial and error methods, to sophisticated local and global search methods. Recent attempts at automating the search through a large design space with formal optimization methods include both database driven and direct evaluation schemes. Databases are being used in conjunction with surrogate and neural network models as a basis on which to run optimization algorithms. Optimization algorithms are also being driven by the direct evaluation of objectives and constraints using high-fidelity simulations. Surrogate methods use data points obtained from simulations, and possibly gradients evaluated at the data points, to create mathematical approximations of a database. Neural network models work in a similar fashion, using a number of high-fidelity database calculations as training iterations to create a database model. Optimal designs are obtained by coupling an optimization algorithm to the database model. Evaluation of the current best design then gives either a new local optima and/or increases the fidelity of the approximation model for the next iteration. Surrogate methods have also been developed that iterate on the selection of data points to decrease the uncertainty of the approximation model prior to searching for an optimal design. The database approximation models for each of these cases, however, become computationally expensive with increase in dimensionality. Thus the method of using optimization algorithms to search a database model becomes problematic as the number of design variables is increased.

Nelson, Andrea↗

Enhancement of surface definition and gridding in the Eagle code

A method for locally fairing uniform cubic B-spline curves and surfaces is presented. The algorithm uses an automated technique which detects undesirable geometric characteristics by using a local fairness criterion. The geometric entity is then smoothed using a method based on the repeated removal and insertion of the spline knots in the vicinity of the geometric irregularity.

Source record↗

Average waiting time in FDDI networks with local priorities

A method is introduced to compute the average queuing delay experienced by different priority group messages in an FDDI node. It is assumed that no FDDI MAC layer priorities are used. Instead, a priority structure is introduced to the messages at a higher protocol layer (e.g. network layer) locally. Such a method was planned to be used in Space Station Freedom FDDI network. Conservation of the average waiting time is used as the key concept in computing average queuing delays. It is shown that local priority assignments are feasable specially when the traffic distribution is asymmetric in the FDDI network.

Gercek, Gokhan↗

Alternative methods for the design of jet engine control systems

Various alternatives to linear quadratic design methods for jet engine control systems are discussed. The main alternatives are classified into two broad categories: nonlinear global mathematical programming methods and linear local multivariable frequency domain methods. Specific studies within these categories include model reduction, the eigenvalue locus method, the inverse Nyquist method, polynomial design, dynamic programming, and conjugate gradient approaches.

Sain, M. K.↗

A method for the retrieval of atomic oxygen density and temperature profiles from ground-based measurements of the O(+)(2D-2P) 7320 A twilight airglow

This paper describes a technique for extracting thermospheric profiles of the atomic-oxygen density and temperature, using ground-based measurements of the O(+)(2D-2P) doublet at 7320 and 7330 A in the twilight airglow. In this method, a local photochemical model is used to calculate the 7320-A intensity; the method also utilizes an iterative inversion procedure based on the Levenberg-Marquardt method described by Press et al. (1986). The results demonstrate that, if the measurements are only limited by errors due to Poisson noise, the altitude profiles of neutral temperature and atomic oxygen concentration can be determined accurately using currently available spectrometers.

Fennelly, J. A.↗

Geometrically derived difference formulae for the numerical integration of trajectory problems

An initial value problem for the autonomous system of ordinary differential equations dy/dt = f(y), where y is a vector, is considered. In a number of practical applications the interest lies in obtaining the curve traced by the solution y. These applications include the computation of trajectories in mechanical problems. The term 'trajectory problem' is employed to refer to these cases. Lambert and McLeod (1979) have introduced a method involving local rotation of the axes in the y-plane for the two-dimensional case. The present investigation continues the study of difference schemes specifically derived for trajectory problems. A simple geometrical way of constructing such methods is presented, and the local accuracy of the schemes is investigated. A circularly exact, fixed-step predictor-corrector algorithm is defined, and a variable-step version of a circularly exact algorithm is presented.

Mcleod, R. J. Y.↗

Face-gear drives: Design, analysis, and testing for helicopter transmission applications

The use of face-gears in helicopter transmissions was explored. A light-weight, split-torque transmission design utilizing face-gears is described. Face-gear design and geometry were investigated. Topics included tooth generation, limiting inner and outer radii, tooth contact analysis, contact ratio, gear eccentricity, grinding, and structural stiffness. Design charts were developed to determine minimum and maximum face-gear inner and outer radii. An analytical study showed that the face-gear drive is relatively insensitive to gear misalignment with respect to transmission errors, but the tooth contact is affected by misalignment. A method of localizing the bearing contact to permit operation with misalignment was explored. Two new methods for grinding of the face-gear tooth surfaces were also investigated. The proper choice of shaft stiffness enabled good load sharing in the split-torque transmission design. Face-gear experimental studies were also conducted. These tests demonstrated the feasibility of face-gears in high-speed, high-load applications such as helicopter transmissions.

Litvin, F. L.↗

A New Method for the Accurate Calculation of Derivatives at Structured Multiblock Grid Singularities

The new Structured Mapping At Reduced dimension Topology elements (SMART) method for the accurate calculation of derivatives at multiblock structured grid block interfaces is presented. In the SMART method, a ’local’ curvilinear mapping is defined at each interface point, giving a consistent multidimensional definition of the derivatives. The resulting system of equations is overdetermined, and a least squares method is used to determine the value of the derivatives in the local coordinate system. In the special case of a nonsingular interface point, the SMART method automatically recovers the spatial differencing stencils used at the interior points in the neighboring grid blocks.

Computational Aeroacoustics↗

A Local Coordinate Approach in the MLPG Method for Beam Problems

System matrices for Euler-Bernoulli beam problems for the meshless local Petrov-Galerkin (MLPG) method deteriorate as the number of nodes in the beam models are consistently increased. The reason for this behavior is explained. To overcome this difficulty and improve the accuracy of the solutions, a local coordinate approach for the evaluation of the generalized moving least squares shape functions and their derivatives is proposed. The proposed approach retains the accuracy of the MLPG methods.

Raju, Ivatury S.↗

Recovering Photospheric Velocities from Vector Magnetograms by using a Three-Dimensional, Fully Magnetohydrodynamic (MHD) Model

We introduce a numerical simulation method for recovering the photospheric velocity field from the vector magnetograms. The traditional method is local correlation tracking (LCT) which is based on measuring the relative displacements of features in blocks of pixels between successive white-light images or magnetograms. Within this method, there are a variety of implementations. One of recently developed implementations is induction local correlation tracking (ILCT) as described by Welsch et al. (2004). They employ the normal component of magnetic induction equation as a constraint to assure consistent solutions. Our numerical method uses the fully three-dimensional MHD equations to recover the photospheric velocity field with individual vector magnetograms. We compare our method to the ILCT method using NOAA AR8210 as an example. The differences and similarities are discussed in detail.

Wang, A. H.↗

Improved local linearization algorithm for solving the quaternion equations

The objective of this paper is to develop a new and more accurate local linearization algorithm for numerically solving sets of linear time-varying differential equations. Of special interest is the application of this algorithm to the quaternion rate equations. The results are compared, both analytically and experimentally, with previous results using local linearization methods. The new algorithm requires approximately one-third more calculations per step than the previously developed local linearization algorithm; however, this disadvantage could be reduced by using parallel implementation. For some cases the new algorithm yields significant improvement in accuracy, even with an enlarged sampling interval. The reverse is true in other cases. The errors depend on the values of angular velocity, angular acceleration, and integration step size. One important result is that for the worst case the new algorithm can guarantee eigenvalues nearer the region of stability than can the previously developed algorithm.

Yen, K.↗

Stable Inversion for Nonlinear Nonminimum-Phase Time Varying Systems

In this paper, we extend stable inversion to nonlinear time-varying systems and study computational issues; the technique is applicable to minimum-phase as well as nonminimum-phase systems. The inversion technique is new, even in the linear time-varying case, and relies on partitioning (the dichotomic split of) the linearized system dynamics into time-varying, stable, and unstable, submanifolds. This dichotomic split is used to build time-varying filters which are, in turn, the basis of a contraction used to find a bounded inverse input-state trajectory. Finding the inverse input-state trajectory allows the development or exact-output tracking controllers. The method is local to the time-varying trajectory and requires that the internal dynamics vary slowly; however, the method represents a significant advance relative to presently available tracking controllers. Present techniques are restricted to time-invariant nonlinear systems and, in the general case, track only asymptotically.

Devasia, S.↗

Kalman Filtering and RTS Smoothing for Arc-Jet Sample Edge Tracking

Accurate and temporally consistent measurements of test-article recession are required to characterize material response during arc-jet ablation experiments. However, image-based boundary measurements are often affected by segmentation noise, brightness variations, and frame-to-frame variability. This work extends arcjetCV [1] with filtering methods for tracking the evolving boundaries of hemispherical and ISO-Q test articles. Two boundary-tracking approaches based on Kalman filtering [2] were implemented. The first applies a point-wise Kalman filter followed by a Rauch–Tung–Striebel smoother [3] to individual boundary-point locations. The second applies the same filtering and smoothing framework to a reduced set of geometry-dependent shape parameters. The point-wise method reduces local frame-to-frame fluctuations while preserving spatial details along the detected boundary. The shape-parameter method provides a compact and geometrically constrained estimate of the sample contour. Figure 1 illustrates the two approaches for a hemispherical test article. Both methods improve temporal consistency and support more robust estimation of surface recession from arc-jet imagery. The two filtering approaches provide complementary representations of boundary evolution and improve the reliability of image-based recession measurements during arc-jet experiments.

recession measurement↗