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 595 records · Page 33

Robust Group Subspace Recovery: A New Approach for Multi-Modality Data Fusion

Robust Subspace Recovery (RoSuRe) algorithm was recently introduced as a principled and numerically efficient algorithm that unfolds underlying Unions of Subspaces (UoS) structure, present in the data. The union of Subspaces (UoS) is capable of identifying more complex trends in data sets than simple linear models. In this work, we build on and extend RoSuRe to prospect the structure of different data modalities individually. We propose a novel multi-modal data fusion approach based on group sparsity which we refer to as Robust Group Subspace Recovery (RoGSuRe). Relying on a bi-sparsity pursuit paradigm and non-smooth optimization techniques, the introduced framework learns a new joint representation of the time series from different data modalities, respecting an underlying UoS model. We subsequently integrate the obtained structures to form a unified subspace structure. The proposed approach exploits the structural dependencies between the different modalities data to cluster the associated target objects. The resulting fusion of the unlabeled sensors’ data from experiments on audio and magnetic data has shown that our method is competitive with other state of the art subspace clustering methods. The resulting UoS structure is employed to classify newly observed data points, highlighting the abstraction capacity of the proposed method.

47 OTHER INSTRUMENTATION↗

Dynamics Explorer guest investigator

Four objectives were accomplished during this reporting period. The visible auroral image conversion algorithms were compated with algorithms developed by Dr. M. H. Rees for data at different wavelengths. In the study 630 and 557 nm images were used to deduce the auroral energy flux and characteristic energy of the precipitating auroral electrons. The data for Southward IMF, B sub y negative conditions were collected and put into global format. A total of 55 sets of auroral images were obtained, and then converted to energy flux and characteristic energy data sets. The shortcoming of representing the high latitude convection pattern as a smooth function was written up and submitted to the Journal of Geophysical Research. A series of midlatitude corotational model runs were performed to quantitatively show how the F region varied as a function of electric field, topside number flux, and a topside heat source.

Sojka, J. J.↗

Mars Relay Lander and Orbiter Overflight Profile Estimation

This software allows science and mission operations to view graphs of geometric overflights of satellites and landers within the Mars (or other planetary) networks. It improves on the MaROS Web interface within any modern Web browser, in that it adds new capabilities to the MaROS suite. The profile for an overflight is an important element for selecting communication/ overflight opportunities between the landers and orbiters within the Mars network. Unfortunately, determining these estimates is very computationally expensive and difficult to compute by hand. This software allows the user to select different overflights (via the existing MaROS Web interface) and specify the smoothness of the estimation. Estimates for the geometric relationship between a lander and an orbiter are determined based upon the orbital conditions of the orbiter at the moment the orbiter rises above the horizon from the perspective of the lander. It utilizes 2-body orbital equations to propagate the trajectory through the duration of the view period, and returns profiles that represent the range between the two vehicles, and the elevation and azimuth angles of the orbiter as measured from the lander s position. The algorithms assume a 2-body relationship with an ideal, spherical planetary body, so therefore can see errors less than 2% at polar landing sites on Mars. These algorithms are being implemented to provide rough estimates rapidly for the geometry of a geometric view period where more complete data is unavailable, such as for planning purposes. While other software for this task exists, each at the time of this reporting has been contained within a much more complicated package. This tool allows science and mission operations to view the estimates with a few clicks of the mouse.

Wallick, Michael N.↗

Phenological Parameters Estimation Tool

The Phenological Parameters Estimation Tool (PPET) is a set of algorithms implemented in MATLAB that estimates key vegetative phenological parameters. For a given year, the PPET software package takes in temporally processed vegetation index data (3D spatio-temporal arrays) generated by the time series product tool (TSPT) and outputs spatial grids (2D arrays) of vegetation phenological parameters. As a precursor to PPET, the TSPT uses quality information for each pixel of each date to remove bad or suspect data, and then interpolates and digitally fills data voids in the time series to produce a continuous, smoothed vegetation index product. During processing, the TSPT displays NDVI (Normalized Difference Vegetation Index) time series plots and images from the temporally processed pixels. Both the TSPT and PPET currently use moderate resolution imaging spectroradiometer (MODIS) satellite multispectral data as a default, but each software package is modifiable and could be used with any high-temporal-rate remote sensing data collection system that is capable of producing vegetation indices. Raw MODIS data from the Aqua and Terra satellites is processed using the TSPT to generate a filtered time series data product. The PPET then uses the TSPT output to generate phenological parameters for desired locations. PPET output data tiles are mosaicked into a Conterminous United States (CONUS) data layer using ERDAS IMAGINE, or equivalent software package. Mosaics of the vegetation phenology data products are then reprojected to the desired map projection using ERDAS IMAGINE

McKellip, Rodney D.↗

A new approach to the solution of large, full matrix equations: A two-dimensional potential flow feasibility study

An approach to the solution of matrix problems resulting from integral equations of mathematical physics is presented. Based on the inherent smoothness in such equations, the problem is reformulated using a set of orthogonal basis vectors, leading to an equivalent coefficient problem which can be of lower order without significantly impairing the accuracy of the solution. This approach was evaluated using a two-dimensional Neumann problem describing the inviscid, incompressible flow over an airfoil. Two different kinds of mode functions were investigated, namely eigenfunction series and Fourier series. The method using Fourier series was found preferable. It uses all of the coefficients from a Fast Fourier Transform algorithm in an approximate method which exploits the known structure of the transformed coefficient matrix and very promising results for the flow over a realistic airfoil are obtained. On the basis of the results presented here, an order of magnitude reduction in this computer time can be expected for such problems as compared with the time for a direct matrix solution.

James, R. M.↗

Nonlinear Rescaling and Proximal-Like Methods in Convex Optimization

The nonlinear rescaling principle (NRP) consists of transforming the objective function and/or the constraints of a given constrained optimization problem into another problem which is equivalent to the original one in the sense that their optimal set of solutions coincides. A nonlinear transformation parameterized by a positive scalar parameter and based on a smooth scaling function is used to transform the constraints. The methods based on NRP consist of sequential unconstrained minimization of the classical Lagrangian for the equivalent problem, followed by an explicit formula updating the Lagrange multipliers. We first show that the NRP leads naturally to proximal methods with an entropy-like kernel, which is defined by the conjugate of the scaling function, and establish that the two methods are dually equivalent for convex constrained minimization problems. We then study the convergence properties of the nonlinear rescaling algorithm and the corresponding entropy-like proximal methods for convex constrained optimization problems. Special cases of the nonlinear resealing algorithm are presented. In particular a new class of exponential penalty-modified barrier functions methods is introduced.

Polyak, Roman↗

Computational considerations for the simulation of shock-induced sound

The numerical study of aeroacoustic problems places stringent demands on the choice of a computational algorithm, because it requires the ability to propagate disturbances of small amplitude and short wavelength. The demands are particularly high when shock waves are involved, because the chosen algorithm must also resolve discontinuities in the solution. The extent to which a high-order-accurate shock-capturing method can be relied upon for aeroacoustics applications that involve the interaction of shocks with other waves has not been previously quantified. Such a study is initiated in this work. A fourth-order-accurate essentially nonoscillatory (ENO) method is used to investigate the solutions of inviscid, compressible flows with shocks in a quasi-one-dimensional nozzle flow. The design order of accuracy is achieved in the smooth regions of a steady-state test case. However, in an unsteady test case, only first-order results are obtained downstream of a sound-shock interaction. The difficulty in obtaining a globally high-order-accurate solution in such a case with a shock-capturing method is demonstrated through the study of a simplified, linear model problem. Some of the difficult issues and ramifications for aeroacoustics simulations of flows with shocks that are raised by these results are discussed.

Casper, Jay↗

Machine-assisted discovery of integrable symplectic mappings

Integrable systems possess a hidden symmetry associated with the existence of conserved quantities known as integrals of motion. These systems play an important role in understanding general dynamics in accelerators and have potential for future designs. This work will cover two automated methods for finding integrable symplectic maps of the plane. The first algorithm is based on the observation that the evolution of an integrable system in phase space is confined to a lower-dimensional submanifold of a specific type. The second algorithm relies on an analysis of dynamical variables. Both methods rediscover some of the famous McMillan-Suris integrable mappings and ultra-discrete Painlev\'e equations. Over 100 new integrable families are presented and analyzed, some of which are isolated in the space of parameters, while others are families with one parameter (or the ratio of parameters) being either continuous or discrete. In addition, the newly discovered maps are related to a general 2D symplectic map through the use of discrete perturbation theory. A method is proposed for constructing smooth near-integrable dynamical systems based on mappings with polygon invariants.

43 PARTICLE ACCELERATORS↗

Machine-Assisted Discovery of Integrable Symplectic Mappings

Integrable systems possess a hidden symmetry associated with the existence of conserved quantities known as integrals of motion. These systems play an important role in understanding general dynamics in accelerators and have potential for future designs. This work will cover two automated methods for finding integrable symplectic maps of the plane. The first algorithm is based on the observation that the evolution of an integrable system in phase space is confined to a lower-dimensional submanifold of a specific type. The second algorithm relies on an analysis of dynamical variables. Both methods rediscover some of the famous McMillan-Suris integrable mappings and ultra-discrete Painlev\'e equations. Over 100 new integrable families are presented and analyzed, some of which are isolated in the space of parameters, while others are families with one parameter (or the ratio of parameters) being either continuous or discrete. In addition, the newly discovered maps are related to a general 2D symplectic map through the use of discrete perturbation theory. A method is proposed for constructing smooth near-integrable dynamical systems based on mappings with polygon invariants.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Noniterative three-dimensional grid generation using parabolic partial differential equations

A new algorithm for generating three-dimensional grids has been developed and implemented which numerically solves a parabolic partial differential equation (PDE). The solution procedure marches outward in two coordinate directions, and requires inversion of a scalar tridiagonal system in the third. Source terms have been introduced to control the spacing and angle of grid lines near the grid boundaries, and to control the outer boundary point distribution. The method has been found to generate grids about 100 times faster than comparable grids generated via solution of elliptic PDEs, and produces smooth grids for finite-difference flow calculations.

Edwards, T. A.↗

The topology of large-scale structure. III - Analysis of observations

A recently developed algorithm for quantitatively measuring the topology of large-scale structures in the universe was applied to a number of important observational data sets. The data sets included an Abell (1958) cluster sample out to Vmax = 22,600 km/sec, the Giovanelli and Haynes (1985) sample out to Vmax = 11,800 km/sec, the CfA sample out to Vmax = 5000 km/sec, the Thuan and Schneider (1988) dwarf sample out to Vmax = 3000 km/sec, and the Tully (1987) sample out to Vmax = 3000 km/sec. It was found that, when the topology is studied on smoothing scales significantly larger than the correlation length (i.e., smoothing length, lambda, not below 1200 km/sec), the topology is spongelike and is consistent with the standard model in which the structure seen today has grown from small fluctuations caused by random noise in the early universe. When the topology is studied on the scale of lambda of about 600 km/sec, a small shift is observed in the genus curve in the direction of a 'meatball' topology.

Gott, J. Richard, III↗

A cancellation problem in hybrid particle-in-cell schemes due to finite particle size

The quasi-neutral hybrid particle-in-cell algorithm with kinetic ions and fluid electrons is a popular model to study multi-scale problems in laboratory, space, and astrophysical plasmas. Here, it is shown that the different spatial discretizations of ions as finite-spatial-size particles and electrons as a grid-based fluid can lead to significant numerical wave dispersion errors in the long wavelength limit (kd i «1, where k is the wavenumber and di is the ion skin-depth). The problem occurs when high-order particle-grid interpolations, or grid-based smoothing, spreads the electric field experienced by the ions across multiple spatial cells and leads to inexact cancellation of electric field terms in the total (ion + electron) momentum equation. Practical requirements on the mesh spacing Δx/d i are suggested to bound these errors from above. The accuracy impact of not respecting these resolution constraints is shown for a non-linear shock problem.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

ARISE (Antarctic Remote Ice Sensing Experiment) in the East 2003: Validation of Satellite-derived Sea-ice Data Product

Preliminary results are presented from the first validation of geophysical data products (ice concentration, snow thickness on sea ice (h(sub s) and ice temperature (T(sub i))fr om the NASA EOS Aqua AMSR-E sensor, in East Antarctica (in September-October 2003). The challenge of collecting sufficient measurements with which to validate the coarse-resolution AMSR-E data products adequately was addressed by means of a hierarchical approach, using detailed in situ measurements, digital aerial photography and other satellite data. Initial results from a circumnavigation of the experimental site indicate that, at least under cold conditions with a dry snow cover, there is a reasonably close agreement between satellite- and aerial-photo-derived ice concentrations, i.e. 97.2+/-.6% for NT2 and 96.5+/-2.5% for BBA algorithms vs 94.3% for the aerial photos. In general, the AMSR-E concentration represents a slight overestimate of the actual concentration, with the largest discrepancies occurring in regions containing a relatively high proportion of thin ice. The AMSR-E concentrations from the NT2 and BBA algorithms are similar on average, although differences of up to 5% occur in places, again related to thin-ice distribution. The AMSR-E ice temperature (T(sub i)) product agrees with coincident surface measurements to approximately 0.5 C in the limited dataset analyzed. Regarding snow thickness, the AMSR h(sub s) retrieval is a significant underestimate compared to in situ measurements weighted by the percentage of thin ice (and open water) present. For the case study analyzed, the underestimate was 46% for the overall average, but 23% compared to smooth-ice measurements. The spatial distribution of the AMSR-E h(sub s) product follows an expected and consistent spatial pattern, suggesting that the observed difference may be an offset (at least under freezing conditions). Areas of discrepancy are identified, and the need for future work using the more extensive dataset is highlighted.

Massom, Robert A.↗

Stochastic projective splitting

Here, we present a new, stochastic variant of the projective splitting (PS) family of algorithms for inclusion problems involving the sum of any finite number of maximal monotone operators. This new variant uses a stochastic oracle to evaluate one of the operators, which is assumed to be Lipschitz continuous, and (deterministic) resolvents to process the remaining operators. Our proposal is the first version of PS with such stochastic capabilities. We envision the primary application being machine learning (ML) problems, with the method’s stochastic features facilitating “mini-batch” sampling of datasets. Since it uses a monotone operator formulation, the method can handle not only Lipschitz-smooth loss minimization, but also min–max and noncooperative game formulations, with better convergence properties than the gradient descent-ascent methods commonly applied in such settings. The proposed method can handle any number of constraints and nonsmooth regularizers via projection and proximal operators. We prove almost-sure convergence of the iterates to a solution and a convergence rate result for the expected residual, and close with numerical experiments on a distributionally robust sparse logistic regression problem.

97 MATHEMATICS AND COMPUTING↗

Structural Analysis Methods for Structural Health Management of Future Aerospace Vehicles

Two finite element based computational methods, Smoothing Element Analysis (SEA) and the inverse Finite Element Method (iFEM), are reviewed, and examples of their use for structural health monitoring are discussed. Due to their versatility, robustness, and computational efficiency, the methods are well suited for real-time structural health monitoring of future space vehicles, large space structures, and habitats. The methods may be effectively employed to enable real-time processing of sensing information, specifically for identifying three-dimensional deformed structural shapes as well as the internal loads. In addition, they may be used in conjunction with evolutionary algorithms to design optimally distributed sensors. These computational tools have demonstrated substantial promise for utilization in future Structural Health Management (SHM) systems.

Tessler, Alexander↗

Inversion algorithms for the microwave remote sensing of soil moisture. Experiments with swept frequency microwaves

Two experiments were performed employing swept frequency microwaves for the purpose of investigating the reflectivity from soil volumes containing both discontinuous and continuous changes in subsurface soil moisture content. Discontinuous moisture profiles were artificially created in the laboratory while continuous moisture profiles were induced into the soil of test plots by the environment of an agricultural field. The reflectivity for both the laboratory and field experiments was measured using bi-static reflectometers operated over the frequency ranges of 1.0 to 2.0 GHz and 4.0 to 8.0 GHz. Reflectivity models that considered the discontinuous and continuous moisture profiles within the soil volume were developed and compared with the results of the experiments. This comparison shows good agreement between the smooth surface models and the measurements. In particular the comparison of the smooth surface multi-layer model for continuous moisture profiles and the yield experiment measurements points out the sensitivity of the specular component of the scattered electromagnetic energy to the movement of moisture in the soil.

Hancock, G. D.↗

The piecewise-linear predictor-corrector code - A Lagrangian-remap method for astrophysical flows

We describe a time-explicit finite-difference algorithm for solving the nonlinear fluid equations. The method is similar to existing Eulerian schemes in its use of operator-splitting and artificial viscosity, except that we solve the Lagrangian equations of motion with a predictor-corrector and then remap onto a fixed Eulerian grid. The remap is formulated to eliminate errors associated with coordinate singularities, with a general prescription for remaps of arbitrary order. We perform a comprehensive series of tests on standard problems. Self-convergence tests show that the code has a second-order rate of convergence in smooth, two-dimensional flow, with pressure forces, gravity, and curvilinear geometry included. While not as accurate on idealized problems as high-order Riemann-solving schemes, the predictor-corrector Lagrangian-remap code has great flexibility for application to a variety of astrophysical problems.

Lufkin, Eric A.↗

The creation of local clusters in arbitrarily given grids

A method is presented to smoothly insert pointwise clusters into any given grid regardless of its origin, its topology, or its dimensionality. The process amounts to a local movement of the given coordinate curves or surfaces to more highly resolve an object. The object about which clustering is created can be a point, a curve, a surface, or segments of a curve or surface. The basic clustering capability is established by forming a grid operator for a single cluster. With a view toward multiple clusters being created about various objects, the basic operator is seen as an elementary operator. An algorithm is presented to execute the general elementary operation in three dimensions. In FORTRAN, this assumes the form of a subroutine which is fully operational and is presented to serve as a basic model for any such elementary clustering operation.

Eiseman, Peter R.↗