Search NASA⌕ Search

SEARCH · Search NASA

Results for “Smoothing 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 235 records · Page 13

Optimum structural design with plate bending elements - A survey

A survey is presented of recently published papers in the field of optimum structural design of plates, largely with respect to the minimum-weight design of plates subject to such constraints as fundamental frequency maximization. It is shown that, due to the availability of powerful computers, the trend in optimum plate design is away from methods tailored to specific geometry and loads and toward methods that can be easily programmed for any kind of plate, such as finite element methods. A corresponding shift is seen in optimization from variational techniques to numerical optimization algorithms. Among the topics covered are fully stressed design and optimality criteria, mathematical programming, smooth and ribbed designs, design against plastic collapse, buckling constraints, and vibration constraints.

Haftka, R. T.↗

Grid generation and surface modeling for CFD

When computing the flow around complex three dimensional configurations, the generation of the mesh is the most time consuming part of any calculation. With some meshing technologies this can take of the order of a man month or more. The requirement for a number of design iterations coupled with ever decreasing time allocated for design leads to the need for a significant acceleration of this process. Of the two competing approaches, block-structured and unstructured, only the unstructured approach will allow fully automatic mesh generation directly from a CAD model. Using this approach coupled with the techniques described in this paper, it is possible to reduce the mesh generation time from man months to a few hours on a workstation. The desire to closely couple a CFD code with a design or optimization algorithm requires that the changes to the geometry be performed quickly and in a smooth manner. This need for smoothness necessitates the use of Bezier polynomials in place of the more usual NURBS or cubic splines. A two dimensional Bezier polynomial based design system is described.

Connell, Stuart D.↗

Higher order Godunov schemes for isothermal hydrodynamics

In this paper we construct higher order Godunov schemes for isothermal flow. Isothermal hydrodynamics serves as a good representation for several systems of astrophysical interest. The schemes designed here have second-order accuracy in space and time and some are third-order accurate for advection. Moreover, several ingredients of these schemes are essential components of even higher order. The methods designed here have excellent ability to represent smooth flow yet capture shocks with high resolution. Several test problems are presented. The algorithms presented here are compared with other algorithms having a comparable formal order of accuracy.

Balsara, Dinshaw S.↗

Automatic Boundary-Layer Adaptation of Structured Grids in VULCAN-CFD

In supersonic and hypersonic flow computations, well-resolved boundary layers are essential for accurate quantification of surface heating and transition prediction, particularly via linear stability analysis. Grid design for hypersonic flows with shocks, boundary-layer separation, and/or complex mean flow features incorporating spanwise/azimuthal inhomogeneities is a difficult issue. In comparison to a manual grid adaptation procedure, an autonomous grid adaptation technique offers significant improvements in computing time and solution quality. The VULCAN-CFD solver already includes a validated procedure for automatic adaption of structured grids to the bow shock. The present focus is on implementing an automatic boundary-layer adaptation capability in VULCAN-CFD that adapts structured, multiblock grids to both the bow shock and the boundary layer at the same time. The boundary-layer adaptation algorithm allows the user to specify the number of cells within the boundary layer, along with the input parameters used for detecting the edge of the boundary layer, namely, the variable used in the edge detection criterion,the edge detection method, the detection direction, and the relaxation factor used during the morphing of the grid. The algorithm automatically distributes grid points along the wall-normal direction to achieve a smooth variation in grid spacing from the edge of the boundary layer to a"junction" location within the outer part of the grid. Illustrative results are presented for three different high-speed configurations: the two-dimensional flow over a cylinder at Mach 17.6 and unit Reynolds number of Re=0.38x10^6 m^-1, the axisymmetric flow over a cone-cylinder-flare model at Mach 6.0 and Re = 10.5×10^6 m^-1, and the three-dimensional flow over a blunt, 7-degree half-angle cone at 5-degree angle of attack in a Mach 9.79 flow with Re = 17.1×10^6 m^-1. The automated boundary-layer adaptation is shown to provide an adequate grid topology that is aligned with the bow shock in the outer part of the grid and also resolves the viscous boundary-layer region close to the surface.

boundary layer transition↗

Uncertainty Quantification of Expected Time-of-Arrival in UAV Flight Trajectory

One of the foremost requirements for accurate in-flight safety monitoring of autonomous unmanned aerial vehicles (UAVs) is tracking of their flight trajectory. Existing UAVs leverage autonomous flight functionalities based on trajectory generation algorithms developed in robotic applications such as polynomial or spline curves in order to facilitate kinematic smoothness, minimum vibrations and fuel efficiency. However in practice, the actual path may be subjected to unexpected local weather conditions, unexpected obstacles along the path or abrupt traffic changes in the low-altitude airspace resulting in large errors of the predicted time-of-arrival at way-points. In this study, an approach to quantify and propagate uncertainty in 4D trajectories is proposed. The paper presents a simple error interval propagation method based on the expected cruise speed of the UAV and its associated uncertainty. The uncertainty is then propagated in time to estimate reasonable confidence intervals on the times-of-arrival of the vehicle at each way-point as well as along the entire flight-path. The uncertainty propagation is demonstrated on a state-of-the-art trajectory generation algorithm based on non-uniform rational B-spline (NURBS) curves. Further, the effect of a stationary wind field is incorporated in the uncertainty propagation approach. The proposed method is implemented on synthetic and real data obtained from flight experiments with a small UAV.

Uncertainty Quantification↗

Algorithm For Solution Of Navier-Stokes Equations

Advantages of two previous algorithms combined. Steady-state Navier-Stokes equations put in implicit finite-difference form solved by approximate Newton iteration. LU-SSOR scheme is new relaxation method combining advantages of LU factorization with Gauss-Seidel relaxation. Vectorizable LU-SSOR scheme, based on central differences, requires scalar diagonal inversions. Application of scheme to approximate Newton iteration of Navier-Stokes equations yields set of equations requiring no implicit smoothing on left side. Only adaptive, total-variation-diminishing, flux-limited dissipation terms added to right side. Algorithm used to predict laminar, turbulent, and hypersonic flows.

Yoon, Seokkwan↗

Terrain profiling from Seasat altimetry

To determine their applicability for terrain profiling, Seasat altimeter measurements were analyzed for the following geographic areas: (1) Andean salars of southern Bolivia; (2) Alaska; (3) south-central Arizona; (4) imperial Valley of California; (5) Yuma Valley of Arizona; and (6) Great Salt Lake Desert. Analysis of the data over all of these geographic areas shows that the satellite altimeter servo did not respond quickly enough to changing terrain features. However, it is demonstrated that retracking of the archived surface return waveforms yields surface elevations over smooth terrain accurate to + or - 1 m when correlated with large scale maps. The retracking algorithm used and its verification over the salars of southern Bolivia are described. Results are presented for each of the six geographic areas.

Brooks, R. L.↗

Updating Landsat-derived land-cover maps using change detection and masking techniques

The California Integrated Remote Sensing System's San Bernardino County Project was devised to study the utilization of a data base at a number of jurisdictional levels. The present paper discusses the implementation of change-detection and masking techniques in the updating of Landsat-derived land-cover maps. A baseline landcover classification was first created from a 1976 image, then the adjusted 1976 image was compared with a 1979 scene by the techniques of (1) multidate image classification, (2) difference image-distribution tails thresholding, (3) difference image classification, and (4) multi-dimensional chi-square analysis of a difference image. The union of the results of methods 1, 3 and 4 was used to create a mask of possible change areas between 1976 and 1979, which served to limit analysis of the update image and reduce comparison errors in unchanged areas. The techniques of spatial smoothing of change-detection products, and of combining results of difference change-detection algorithms are also shown to improve Landsat change-detection accuracies.

Likens, W.↗

Spatially random models, estimation theory, and robot arm dynamics

Spatially random models provide an alternative to the more traditional deterministic models used to describe robot arm dynamics. These alternative models can be used to establish a relationship between the methodologies of estimation theory and robot dynamics. A new class of algorithms for many of the fundamental robotics problems of inverse and forward dynamics, inverse kinematics, etc. can be developed that use computations typical in estimation theory. The algorithms make extensive use of the difference equations of Kalman filtering and Bryson-Frazier smoothing to conduct spatial recursions. The spatially random models are very easy to describe and are based on the assumption that all of the inertial (D'Alembert) forces in the system are represented by a spatially distributed white-noise model. The models can also be used to generate numerically the composite multibody system inertia matrix. This is done without resorting to the more common methods of deterministic modeling involving Lagrangian dynamics, Newton-Euler equations, etc. These methods make substantial use of human knowledge in derivation and minipulation of equations of motion for complex mechanical systems.

Rodriguez, G.↗

Gradient methods for identification of distributed parameter systems

Parameter-dependence properties are developed in the context of a linear abstract Cauchy problem governed by a parameter-dependent operator. Of particular interest are problems in which the parameter induces an unbounded perturbation of the evolution operator. Conditions are stated under which the derivative of the state with respect to the parameter possesses certain smoothness properties. These properties lead to local convergence results for a gradient-based estimation algorithm based on quasi-linearization. Numerical results concerning a delay-differential equation indicate the effect of a forcing function on parameter sensitivity.

Brewer, Dennis W.↗

A Method for Obtaining Surface Flow Vectors and Its Implementation in Interferometric Skin Friction Measurement

A new method was developed to extract surface flow vectors from an oilflow visualization image that has oil streaklines. The method is analogous to the PIV processing where the image is divided into interrogation windows. A representative flow direction is obtained for each interrogation window using image processing with a line-detection algorithm. Repeating the process for the entire image, one can find the surface vector field. The Hough transformation, Radon transformation and Machine Learning were used as line-detection algorithms. The obtained vector field is then postprocessed to filter spurious vectors and to apply smoothing. The method was tested on 2D and 3D models with different flow complexities. The method was able to predict surface flow vectors for all cases tested. The predicted surface flow vectors were used in obtaining the surface skin friction. The successful implementation of the surface flow vectors enables interferometric skin friction measurements on surfaces beneath 3D complex flows. In addition, the surface flow vectors can be superimposed on the oilflow visualization images to better explain the surface flow topology.

Surface flow vectors↗

A Method for Obtaining Surface Flow Vectors and Its Implementation in Interferometric Skin Friction Measurement

A new method was developed to extract surface flow vectors from an oilflow visualization image that has oil streaklines. The method is analogous to the PIV processing where the image is divided into interrogation windows. A representative flow direction is obtained for each interrogation window using image processing with a line-detection algorithm. Repeating the process for the entire image, one can find the surface vector field. The Hough transformation, Radon transformation and Machine Learning were used as line-detection algorithms. The obtained vector field is then postprocessed to filter spurious vectors and to apply smoothing. The method was tested on 2D and 3D models with different flow complexities. The method was able to predict surface flow vectors for all cases tested. The predicted surface flow vectors were used in obtaining the surface skin friction. The successful implementation of the surface flow vectors enables interferometric skin friction measurements on surfaces beneath 3D complex flows. In addition, the surface flow vectors can be superimposed on the oilflow visualization images to better explain the surface flow topology.

Surface flow vectors↗

An automatic editing algorithm for GPS data

An algorithm has been developed to edit automatically Global Positioning System data such that outlier deletion, cycle slip identification, and correction are independent of clock instability, selective availability, receiver-satellite kinematics, and tropospheric conditions. This algorithm, called TurboEdit, operates on undifferenced, dual frequency carrier phase data, and requires the use of P code pseudorange data and a smoothly varying ionospheric electron content. TurboEdit was tested on the large data set from the CASA Uno experiment, which contained over 2500 cycle slips.Analyst intervention was required on 1 percent of the station-satellite passes, almost all of these problems being due to difficulties in extrapolating variations in the ionospheric delay. The algorithm is presently being adapted for real time data editing in the Rogue receiver for continuous monitoring applications.

Blewitt, Geoffrey↗

SAGE: The Self-Adaptive Grid Code

The multi-dimensional self-adaptive grid code, SAGE, is an important tool in the field of computational fluid dynamics (CFD). It provides an efficient method to improve the accuracy of flow solutions while simultaneously reducing computer processing time. Briefly, SAGE enhances an initial computational grid by redistributing the mesh points into more appropriate locations. The movement of these points is driven by an equal-error-distribution algorithm that utilizes the relationship between high flow gradients and excessive solution errors. The method also provides a balance between clustering points in the high gradient regions and maintaining the smoothness and continuity of the adapted grid, The latest version, Version 3, includes the ability to change the boundaries of a given grid to more efficiently enclose flow structures and provides alternative redistribution algorithms.

Davies, Carol B.↗

Navigation Algorithms for the SeaWiFS Mission

The navigation algorithms for the Sea-viewing Wide Field-of-view Sensor (SeaWiFS) were designed to meet the requirement of 1-pixel accuracy-a standard deviation (sigma) of 2. The objective has been to extract the best possible accuracy from the spacecraft telemetry and avoid the need for costly manual renavigation or geometric rectification. The requirement is addressed by postprocessing of both the Global Positioning System (GPS) receiver and Attitude Control System (ACS) data in the spacecraft telemetry stream. The navigation algorithms described are separated into four areas: orbit processing, attitude sensor processing, attitude determination, and final navigation processing. There has been substantial modification during the mission of the attitude determination and attitude sensor processing algorithms. For the former, the basic approach was completely changed during the first year of the mission, from a single-frame deterministic method to a Kalman smoother. This was done for several reasons: a) to improve the overall accuracy of the attitude determination, particularly near the sub-solar point; b) to reduce discontinuities; c) to support the single-ACS-string spacecraft operation that was started after the first mission year, which causes gaps in attitude sensor coverage; and d) to handle data quality problems (which became evident after launch) in the direct-broadcast data. The changes to the attitude sensor processing algorithms primarily involved the development of a model for the Earth horizon height, also needed for single-string operation; the incorporation of improved sensor calibration data; and improved data quality checking and smoothing to handle the data quality issues. The attitude sensor alignments have also been revised multiple times, generally in conjunction with the other changes. The orbit and final navigation processing algorithms have remained largely unchanged during the mission, aside from refinements to data quality checking. Although further improvements are certainly possible, future evolution of the algorithms is expected to be limited to refinements of the methods presented here, and no substantial changes are anticipated.

Hooker, Stanford B.↗

Near minimum-time maneuvers of large space structures using parameter optimization

Near minimum-time attitude maneuvers for large, inherently-flexible space structures with finite fuel supplies are investigated. The open loop maneuver is determined with the Sequential Quadratic Programming (SQP) algorithm, which optimizes a bang-off-bang control parameter set for the given maneuver. Torque smoothing is used to prevent discontinuities in the control which would excite the flexible structure. Additional system dynamics such as thruster inefficiency, spring forces and pressure leaks are identified from preliminary experiments on the ASTREX test article.

Carter, M. T.↗

Software Performs Complex Design Analysis

Designers use computational fluid dynamics (CFD) to gain greater understanding of the fluid flow phenomena involved in components being designed. They also use finite element analysis (FEA) as a tool to help gain greater understanding of the structural response of components to loads, stresses and strains, and the prediction of failure modes. Automated CFD and FEA engineering design has centered on shape optimization, which has been hindered by two major problems: 1) inadequate shape parameterization algorithms, and 2) inadequate algorithms for CFD and FEA grid modification. Working with software engineers at Stennis Space Center, a NASA commercial partner, Optimal Solutions Software LLC, was able to utilize its revolutionary, one-of-a-kind arbitrary shape deformation (ASD) capability-a major advancement in solving these two aforementioned problems-to optimize the shapes of complex pipe components that transport highly sensitive fluids. The ASD technology solves the problem of inadequate shape parameterization algorithms by allowing the CFD designers to freely create their own shape parameters, therefore eliminating the restriction of only being able to use the computer-aided design (CAD) parameters. The problem of inadequate algorithms for CFD grid modification is solved by the fact that the new software performs a smooth volumetric deformation. This eliminates the extremely costly process of having to remesh the grid for every shape change desired. The program can perform a design change in a markedly reduced amount of time, a process that would traditionally involve the designer returning to the CAD model to reshape and then remesh the shapes, something that has been known to take hours, days-even weeks or months-depending upon the size of the model.

Source record↗

Internship Abstract - Aerosciences and Flight Mechanics Intern

Mars is a hard place to land on, but my internship with NASA's Aerosciences & Flight Mechanics branch has shown me the ways in which men and women will one day land safely. I work on Mars Aerocapture, an aeroassist maneuver that reduces the fuel necessary to "capture" into Martian orbit before a descent. The spacecraft flies through the Martian atmosphere to lose energy through heating before it exits back into space, this time at a slower velocity and in orbit around Mars. Spacecraft will need to maneuver through the Martian atmosphere to accurately hit their orbit, and they will need to survive the generated heat. Engineering teams need simulation data to continue their designs, and the guidance algorithm that ensures a proper orbit insertion needs to be refined - two jobs that fell to me at the summer's start. Engineers within my branch have developed two concept aerocapture vehicles, and I run simulations on their behavior during the maneuver. I also test and refine the guidance algorithm. I spent the first few weeks familiarizing myself with the simulation software, troubleshooting various guidance bugs and writing code. Everything runs smoothly now, and I recently sent my first set of trajectory data to a Thermal Protection System group so they can incorporate it into their heat-bearing material designs. I hope to generate plenty of data in the next few weeks for various engineering groups before my internship ends mid-August. My major accomplishment so far is improving the guidance algorithm. It is a relatively new algorithm that promises higher accuracy and fuel efficiency, but it hasn't undergone extensive testing yet. I've had the opportunity to work with the principal developer - a professor at Iowa State University - to find and fix several issues. I was also assigned the task of expanding the branch's aerodynamic heating simulation software. I am excited to do this because engineers in the future will use my work to generate meaningful data and make design decisions. My internship has taught me to how to teach myself. There are no tutors, study sessions or professor office hours. When I am given an assignment I am expected to figure out how to accomplish it, and I have grown in my problem solving abilities. My summer experience has reinforced my drive to work at NASA, and I can definitely see myself working full time on the aerocapture project, or something similar.

Rangel, John↗