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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 181 records · Page 10

All sources NASA NTRS DOE OSTI

NASA NTRS2011

Enhanced Fuel-Optimal Trajectory-Generation Algorithm for Planetary Pinpoint Landing

An enhanced algorithm is developed that builds on a previous innovation of fuel-optimal powered-descent guidance (PDG) for planetary pinpoint landing. The PDG problem is to compute constrained, fuel-optimal trajectories to land a craft at a prescribed target on a planetary surface, starting from a parachute cut-off point and using a throttleable descent engine. The previous innovation showed the minimal-fuel PDG problem can be posed as a convex optimization problem, in particular, as a Second-Order Cone Program, which can be solved to global optimality with deterministic convergence properties, and hence is a candidate for onboard implementation. To increase the speed and robustness of this convex PDG algorithm for possible onboard implementation, the following enhancements are incorporated: 1) Fast detection of infeasibility (i.e., control authority is not sufficient for soft-landing) for subsequent fault response. 2) The use of a piecewise-linear control parameterization, providing smooth solution trajectories and increasing computational efficiency. 3) An enhanced line-search algorithm for optimal time-of-flight, providing quicker convergence and bounding the number of path-planning iterations needed. 4) An additional constraint that analytically guarantees inter-sample satisfaction of glide-slope and non-sub-surface flight constraints, allowing larger discretizations and, hence, faster optimization. 5) Explicit incorporation of Mars rotation rate into the trajectory computation for improved targeting accuracy. These enhancements allow faster convergence to the fuel-optimal solution and, more importantly, remove the need for a "human-in-the-loop," as constraints will be satisfied over the entire path-planning interval independent of step-size (as opposed to just at the discrete time points) and infeasible initial conditions are immediately detected. Finally, while the PDG stage is typically only a few minutes, ignoring the rotation rate of Mars can introduce 10s of meters of error. By incorporating it, the enhanced PDG algorithm becomes capable of pinpoint targeting.

Acikmese, Behcet↗

NASA NTRS1991

Learning classification trees

Algorithms for learning classification trees have had successes in artificial intelligence and statistics over many years. How a tree learning algorithm can be derived from Bayesian decision theory is outlined. This introduces Bayesian techniques for splitting, smoothing, and tree averaging. The splitting rule turns out to be similar to Quinlan's information gain splitting rule, while smoothing and averaging replace pruning. Comparative experiments with reimplementations of a minimum encoding approach, Quinlan's C4 and Breiman et al. Cart show the full Bayesian algorithm is consistently as good, or more accurate than these other approaches though at a computational price.

Buntine, Wray↗

NASA NTRS1992

A multiresolution wavelet representation in two or more dimensions

In the multiresolution approximation, a signal is examined on a hierarchy of resolution scales by projection onto sets of smoothing functions. Wavelets are used to carry the detail information connecting adjacent sets in the resolution hierarchy. An algorithm has been implemented to perform a multiresolution decomposition in n greater than or equal to 2 dimensions based on wavelets generated from products of 1-D wavelets and smoothing functions. The functions are chosen so that an n-D wavelet may be associated with a single resolution scale and orientation. The algorithm enables complete reconstruction of a high resolution signal from decomposition coefficients. The signal may be oversampled to accommodate non-orthogonal wavelet systems, or to provide approximate translational invariance in the decomposition arrays.

Bromley, B. C.↗

NASA NTRS1982

The computation of Laplacian smoothing splines with examples

Laplacian smoothing splines (LSS) are presented as generalizations of graduation, cubic and thin plate splines. The method of generalized cross validation (GCV) to choose the smoothing parameter is described. The GCV is used in the algorithm for the computation of LSS's. An outline of a computer program which implements this algorithm is presented along with a description of the use of the program. Examples in one, two and three dimensions demonstrate how to obtain estimates of function values with confidence intervals and estimates of first and second derivatives. Probability plots are used as a diagnostic tool to check for model inadequacy.

Wendelberger, J. G.↗

NASA NTRS1989

Parameter identification for an abstract Cauchy problem by quasilinearization

A parameter identification problem is considered in the context of a linear abstract Cauchy problem with a parameter-dependent evolution operator. Conditions are investigated under which the gradient of the state with respect to a parameter possesses smoothness properties which lead to local convergence of an estimation algorithm based on quasi-linearization. Numerical results are presented concerning estimation of unknown parameters in delay-differential equations.

Brewer, Dennis W.↗

NASA NTRS1990

Processing of DMSP magnetic data: Handbook of programs, tapes, and datasets

The DMSP F-7 satellite was an operational Air Force meteorological satellite which carried a magnetometer for geophysical measurements. The magnetometer was located within the body of the spacecraft in the presence of large spacecraft fields. In addition to stray magnetic fields, the data have inherent position and time inaccuracies. Algorithms were developed to identify and remove time varying magnetic field noise from the data. These algorithms are embodied in an automated procedure which fits a smooth curve through the data and then identifies outliers and which filters the predominant Fourier component of noise from the data. Techniques developed for Magsat were then modified and used to attempt determination of the spacecraft fields, of any rotation between the magnetometer axes and the spacecraft axes, and of any scale changes within the magnetometer itself. Software setup and usage are documented and program listings are included in the Appendix. The initial and resulting data are archived on magnetic cartridge and the formats are documented.

Langel, R. A.↗

NASA NTRS1989

Analysis of three-dimensional viscous flow in a supersonic throughflow fan

A 3-D Navier-Stokes code was developed for analysis of turbomachinery blade rows and other internal flows. The Navier-Stokes equations are written in a Cartesian coordinate system rotating about the x-axis, and then mapped to a general body-fitted coordinate system. Streamwise viscous terms are neglected using the thin layer assumption, and turbulence effects are modelled using the Baldwin-Lomax turbulence model. The equations are discretized using finite differences on stacked C-type grids and are solved using a multistage Runge-Kutta algorithm with a spatially varying time step and implicit residual smoothing. Calculations were made of the flow around a supersonic throughflow fan blade. The fan was designed as a key component in a supersonic cruise engine. The 3-D calculations were done on a 129x29x33 grid and took 50 minutes of cpu time. Comparisons with the quasi-3-D results show minor differences in loading due to 3-D effects. Particle traces show nearly 2-D flows near the pressure surface, but large secondary flows within the suction surface boundary layer. The horseshoe vortex ahead of the leading edge is clearly seen.

Chima, Rodrick V.↗

NASA NTRS1991

Inverse problems in diffraction

A two-dimensional problem of diffraction of a plane electromagnetic wave on a smooth 2 pi-periodic surface is considered. A numerical algorithm solving this problem is developed. An inverse problem of determination of the shape of 2 pi-periodic surface using the performance data of reverse scattering is considered. The inverse problem was solved by means of minimization of the residual functional with the help of the gradient descent method. The initial data were calculated with the help of the numerical method. On each step of the iterative method of minimization, the residual functional was calculated approximately with the help of the small slope method. The examples of the shape determination are considered.

Mikheev, Andrew G.↗

NASA NTRS1991

Integrated trajectory and control analysis for generic hypersonic vehicles

A tool which supports integrated assessment of air-breathing hypersonic vehicle trajectory management and control strategy has been developed by Hattis and Malchow (1991). Using a two-point boundary value problem solution technique, the tool can construct an entire near-minimum-fuel trajectory and desired control strategy from takeoff to orbit, while satisfying physically derived inequality constraints and while achieving efficient propulsive mode phasing. A strategy is also formulated to construct preliminary trajectory and control history representations with less computational burden than required for the overall flight profile assessment. A tabulated example hypersonic vehicle model has been used to demonstrate the integrated analysis methodology. To assure good numerical behavior when the algorithm uses tabulated model data, a multidimensional cubic spline curve smoothing routine has been developed. A dynamic-pressure-constrained, near-fuel-optimal trajectory was computed to provide examples of information that the methodology can provide. Previously unspecified propulsive discontinuities were located, flight regimes demanding rapid attitude changes were identified, available and closed-loop controller authority was ascertained, and inadequacies in vehicle and specific subsystem model representations were determined.

Hattis, Philip D.↗

NASA NTRS1993

Parameter identification for an abstract Cauchy problem by quasilinearization

Brewer, Dennis W.↗

NASA NTRS1994

Cold dark matter. 1: The formation of dark halos

We use numerical simulations of critically closed cold dark matter (CDM) models to study the effects of numerical resolution on observable quantities. We study simulations with up to 256(exp 3) particles using the particle-mesh (PM) method and with up to 144(exp 3) particles using the adaptive particle-particle-mesh (P3M) method. Comparisons of galaxy halo distributions are made among the various simulations. We also compare distributions with observations, and we explore methods for identifying halos, including a new algorithm that finds all particles within closed contours of the smoothed density field surrounding a peak. The simulated halos show more substructure than predicted by the Press-Schechter theory. We are able to rule out all omega = 1 CDM models for linear amplitude sigma(sub 8) greater than or approximately = 0.5 because the simulations produce too many massive halos compared with the observations. The simulations also produce too many low-mass halos. The distribution of halos characterized by their circular velocities for the P3M simulations is in reasonable agreement with the observations for 150 km/s less than or = V(sub circ) less than or = 350 km/s.

Gelb, James M.↗

NASA NTRS1994

Control of mechanical systems with rolling constraints: Application to dynamic control of mobile robots

There are many examples of mechanical systems that require rolling contacts between two or more rigid bodies. Rolling contacts engender nonholonomic constraints in an otherwise holonomic system. In this article, we develop a unified approach to the control of mechanical systems subject to both holonomic and nonholonomic constraints. We first present a state space realization of a constrained system. We then discuss the input-output linearization and zero dynamics of the system. This approach is applied to the dynamic control of mobile robots. Two types of control algorithms for mobile robots are investigated: trajectory tracking and path following. In each case, a smooth nonlinear feedback is obtained to achieve asymptotic input-output stability and Lagrange stability of the overall system. Simulation results are presented to demonstrate the effectiveness of the control algorithms and to compare the performane of trajectory-tracking and path-following algorithms.

Sarkar, Nilanjan↗

NASA NTRS1995

Rapid Numerical Simulation of Viscous Axisymmetric Flow Fields

A two-dimensional Navier-Stokes code has been developed for rapid numerical simulation of axisymmetric flow fields, including flow fields with an azimuthal velocity component. The azimuthal-invariant Navier-Stokes equations in a cylindrical coordinate system are mapped to a general body-fitted coordinate system, with the streamwise viscous terms then neglected by applying the thin-layer approximation. Turbulence effects are modeled using an algebraic model, typically the Baldwin-Lomax turbulence model, although a modified Cebeci-Smith model can also be used. The equations are discretized using central finite differences and solved using a multistage Runge-Kutta algorithm with a spatially varying time step and implicit residual smoothing. Results are presented for calculations of supersonic flow over a waisted body-of-revolution, transonic flow through a normal shock wave in a straight circular duct of constant cross sectional area, swirling supersonic (inviscid) flow through a strong shock in a straight radial duct, and swirling subsonic flow in an annular-to-circular diffuser duct. Comparisons between computed and experimental results are in fair to good agreement, demonstrating that the viscous code can be a useful tool for practical engineering design and analysis work.

Tweedt, Daniel L.↗

NASA NTRS2002

The Estimation Theory Framework of Data Assimilation

Lecture 1. The Estimation Theory Framework of Data Assimilation: 1. The basic framework: dynamical and observation models; 2. Assumptions and approximations; 3. The filtering, smoothing, and prediction problems; 4. Discrete Kalman filter and smoother algorithms; and 5. Example: A retrospective data assimilation system

Cohn, S.↗

NASA NTRS2011

Technique for Calculating Solution Derivatives With Respect to Geometry Parameters in a CFD Code

A solution has been developed to the challenges of computation of derivatives with respect to geometry, which is not straightforward because these are not typically direct inputs to the computational fluid dynamics (CFD) solver. To overcome these issues, a procedure has been devised that can be used without having access to the mesh generator, while still being applicable to all types of meshes. The basic approach is inspired by the mesh motion algorithms used to deform the interior mesh nodes in a smooth manner when the surface nodes, for example, are in a fluid structure interaction problem. The general idea is to model the mesh edges and nodes as constituting a spring-mass system. Changes to boundary node locations are propagated to interior nodes by allowing them to assume their new equilibrium positions, for instance, one where the forces on each node are in balance. The main advantage of the technique is that it is independent of the volumetric mesh generator, and can be applied to structured, unstructured, single- and multi-block meshes. It essentially reduces the problem down to defining the surface mesh node derivatives with respect to the geometry parameters of interest. For analytical geometries, this is quite straightforward. In the more general case, one would need to be able to interrogate the underlying parametric CAD (computer aided design) model and to evaluate the derivatives either analytically, or by a finite difference technique. Because the technique is based on a partial differential equation (PDE), it is applicable not only to forward mode problems (where derivatives of all the output quantities are computed with respect to a single input), but it could also be extended to the adjoint problem, either by using an analytical adjoint of the PDE or a discrete analog.

Mathur, Sanjay↗

NASA NTRS1986

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.↗

NASA NTRS1988

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.↗

NASA NTRS1992

Two Algorithms For Hypersonic Computations

Two new algorithms developed containing several desirable features for computation of viscous, hypersonic flows about three-dimensional geometries. Employ upwind-differencing methods, having unsurpassed abiltiy to capture flow-field discontinuities without need for any user-specified smoothing terms. Particularly important in hypersonic computations where many complicated wave structures exist. Both algorithms based on finite-volume formulation to ensure schemes, including boundary conditions, fully conservative.

Molvik, G. A.↗