Search NASA⌕ Search

SEARCH · Search NASA

Results for “smoothing methods”

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 199 records · Page 11

Formation of on-site normal points

We describe our methods of fitting a smoothing function to observational range differences from a predicted orbit, by deducing corrections to the orbit in the radial and along-track directions. The method has been used on observations of a variety of satellites, and using predicted orbits computed both by numerical integration using IRV's as starting values and analytically from orbital elements. The along-track corrections to the predicted orbit have been successfully used in the form of time biases to improve subsequent predictions, and a statistical test has been devised to ensure that the range residuals may be used to form unbiased quick look normal points.

Appleby, G. M.↗

Estimation of divergence and vorticity using multidimensional smoothing splines

Laplacian smoothing splines, smoothing splines on the sphere, and smoothing pseudo splines on the sphere are presented. The method of generalized cross validation to choose the smoothing parameter is described. These methods are applied to estimate divergence and vorticity of the atmosphere from wind speed and wind direction.

Wendelberger, J. G.↗

Smoothing Lexis diagrams using kernel functions: A contemporary approach

Lexis diagrams are rectangular arrays of event rates indexed by age and period. Analysis of Lexis diagrams is a cornerstone of cancer surveillance research. Typically, population-based descriptive studies analyze multiple Lexis diagrams defined by sex, tumor characteristics, race/ethnicity, geographic region, etc. Inevitably the amount of information per Lexis diminishes with increasing stratification. Several methods have been proposed to smooth observed Lexis diagrams up front to clarify salient patterns and improve summary estimates of averages, gradients, and trends. In this article, we develop a novel bivariate kernel-based smoother that incorporates two key innovations. First, for any given kernel, we calculate its singular values decomposition, and select an optimal truncation point—the number of leading singular vectors to retain—based on the bias-corrected Akaike information criterion. Second, we model-average over a panel of candidate kernels with diverse shapes and bandwidths. The truncated model averaging approach is fast, automatic, has excellent performance, and provides a variance-covariance matrix that takes model selection into account. We present an in-depth case study (invasive estrogen receptor-negative breast cancer incidence among non-Hispanic white women in the United States) and simulate operating characteristics for 20 representative cancers. The truncated model averaging approach consistently outperforms any fixed kernel. Our results support the routine use of the truncated model averaging approach in descriptive studies of cancer.

60 APPLIED LIFE SCIENCES↗

Stability analysis of the Eulerian–Lagrangian finite volume methods for nonlinear hyperbolic equations in one space dimension

In this paper, we construct a novel Eulerian–Lagrangian finite volume (ELFV) method for nonlinear scalar hyperbolic equations in one space dimension. It is well known that the exact solutions to such problems may contain shocks though the initial conditions are smooth, and direct numerical methods may suffer from restricted time step sizes. To relieve the restriction, we propose an ELFV method, where the space-time domain was separated by the partition lines originated from the cell interfaces whose slopes are obtained following the Rakine–Hugoniot junmp condition. Unfortunately, to avoid the intersection of the partition lines, the time step sizes are still limited. To fix this gap, we detect effective troubled cells (ETCs) and carefully design the influence region of each ETC, within which the partitioned space-time regions are merged together to form a new one. Then with the new partition of the space-time domain, we theoretically prove that the proposed first-order scheme with Euler forward time discretization is total-variation-diminishing and maximum-principle-preserving with at least twice larger time step constraints than the classical first order Eulerian method for Burgers’ equation. Numerical experiments verify the optimality of the designed time step sizes.

97 MATHEMATICS AND COMPUTING↗

A purely Lagrangian method for simulating the shallow water equations on a sphere using smooth particle hydrodynamics

It has long been suggested that a purely Lagrangian solution to global-scale atmospheric/oceanic flows can potentially outperform tradition Eulerian schemes. Meanwhile, a demonstration of a scalable and practical framework remains elusive. Motivated by recent progress in particle-based methods when applied to convection dominated flows, this work presents a fully Lagrangian method for solving the inviscid shallow water equations on a rotating sphere in a smooth particle hydrodynamics framework. To avoid singularities at the poles, the governing equations are solved in Cartesian coordinates, augmented with a Lagrange multiplier to ensure that fluid particles are constrained to the surface of the sphere. An underlying grid in spherical coordinates is used to facilitate efficient neighbor detection and parallelization. The method is applied to a suite of canonical test cases, and conservation, accuracy, and parallel performance are assessed..

Computer Science↗

Meshfree simulation and prediction of recrystallized grain size in friction stir processed 316L stainless steel

Friction stir processing (FSP) is a promising solid-phase microstructural modification technique that can repair and enhance damaged stainless steel surfaces exposed to harsh environments. The quality of the repaired material is closely correlated to the recrystallized grain size in the stir zone (SZ), which is influenced by the thermomechanical conditions dictated by FSP process parameters. Thus, establishing a reliable relationship between these parameters and recrystallized grain size in the SZ is crucial for optimizing repair quality. However, existing experimental approaches often rely on indirect temperatures measured far from the SZ, along with rough strain rate estimations, which are imprecise and time-consuming. Meanwhile, existing mesh-based modeling methods usually face numerical challenges when dealing with the large material deformations inherent in FSP. Here, to address these issues, this study introduces a meshfree process model for FSP based on the smoothed particle hydrodynamics (SPH) method, aimed at predicting process conditions under different parameters. The model is validated using experimental data from 11 combinations of tool traverse and rotation speeds on 316 L stainless steel. Correlations between process parameters, material flow, temperature, strain, strain rate, and recrystallized grain size are revealed through SPH simulations and electron backscatter diffraction (EBSD) imaging. The results show that in situ SZ temperatures range from 1071 to 1322°C, which exceed the tool temperature by over 300°C. Furthermore, SZ temperature, strain rate, and grain size increase monotonically with higher tool temperature and faster traverse speed. A relationship is then established between the model-predicted Zener-Hollomon parameter and the recrystallized grain size based on EBSD data, expressed as ln(d) = -0.364 ln(Z) + 14.673. Finally, this relationship exhibits satisfactory accuracy with errors of less than 26.9% in predicting grain sizes at various SZ locations, which offers valuable insights for optimizing FSP repair processes for 316 L stainless steel.

316L stainless steel↗

On finite-dimensional smoothed-particle Hamiltonian reductions of the Vlasov equation

The inclusion of spatial smoothing in finite-dimensional particle-based Hamiltonian reductions of the Vlasov equation and related models is considered. Here, this work investigates the underlying Hamiltonian structure of such smoothed particle-based methods for Hamiltonian systems and the small-scale regularization such methods implicitly make in approximating the continuum theory. In the context of the Vlasov–Poisson equation and other mean-field Lie–Poisson systems, of which Vlasov–Poisson is a special case, smoothing amounts to a convolutive regularization of the Hamiltonian. This regularization may be interpreted as a change of the inner product structure used to identify the dual space in the Lie–Poisson Hamiltonian formulation. In particular, the shape function used for spatial smoothing may be identified as the kernel function of a reproducing kernel Hilbert space whose inner product is used to define the Lie–Poisson Hamiltonian structure. It is likewise possible to introduce smoothing in the Vlasov–Maxwell system, but in this case the Poisson bracket must be modified rather than the Hamiltonian. The smoothing applied to the Vlasov–Maxwell system is incorporated by inserting smoothing in the map from canonical to kinematic coordinates. In the filtered system, the Lorentz force law and the current, the two terms coupling the Vlasov equation with Maxwell’s equations, are spatially smoothed.

Hamiltonian mechanics↗

Multilevel elliptic smoothing of large three-dimensional grids

Elliptic grid generation methods have been used for many years to smooth and improve grids generated by algebraic interpolation schemes. However, the elliptic system that must be solved is nonlinear and convergence is generally very slow for large grids. In an attempt to make elliptic methods practical for large three-dimensional grids, a two-stage implementation is developed where the overall grid point locations are set using a coarse grid generated by the elliptic system. The coarse grid is then interpolated to generate a finer grid which is smoothed using only a few iterations of the elliptic system.

Mastin, C. Wayne↗

Conforming window functions for meshfree methods

Window functions provide a base for the construction of approximation functions in many meshfree methods. They control the smoothness and extent of the approximation functions and are commonly defined using Euclidean distances which helps eliminate the need for a meshed discretization, simplifying model development for some classes of problems. However, for problems with complicated geometries such as nonconvex or multi-body domains, poor solution accuracy and convergence can occur unless the extents of the window functions, and thus approximation functions, are carefully controlled, often a time consuming or intractable task. Here in this paper, we present a method to provide more control in window function design, allowing efficient and systematic handling of complex geometries. “Conforming” window functions are constructed using Bernstein–Bézier splines defined on local triangulations with constraints imposed to control smoothness. Graph distances are used in conjunction with Euclidean metrics to provide adequate information for shaping the window functions. The conforming window functions are demonstrated using the Reproducing Kernel Particle Method showing improved accuracy and convergence rates for problems with challenging geometries. Conforming window functions are also demonstrated as a means to simplify the imposition of essential boundary conditions.

, rapid design-to-analysis↗

GEOS-2 C-band radar system project. Spectral analysis as related to C-band radar data analysis

Work performed on spectral analysis of data from the C-band radars tracking GEOS-2 and on the development of a data compaction method for the GEOS-2 C-band radar data is described. The purposes of the spectral analysis study were to determine the optimum data recording and sampling rates for C-band radar data and to determine the optimum method of filtering and smoothing the data. The optimum data recording and sampling rate is defined as the rate which includes an optimum compromise between serial correlation and the effects of frequency folding. The goal in development of a data compaction method was to reduce to a minimum the amount of data stored, while maintaining all of the statistical information content of the non-compacted data. A digital computer program for computing estimates of the power spectral density function of sampled data was used to perform the spectral analysis study.

Source record↗

Efficient proximal subproblem solvers for a nonsmooth trust-region method

In [R. J. Baraldi and D. P. Kouri, Mathematical Programming, (2022), pp. 1-40], we introduced an inexact trust-region algorithm for minimizing the sum of a smooth nonconvex and nonsmooth convex function. The principle expense of this method is in computing a trial iterate that satisfies the so-called fraction of Cauchy decrease condition—a bound that ensures the trial iterate produces sufficient decrease of the subproblem model. In this paper, we expound on various proximal trust-region subproblem solvers that generalize traditional trust-region methods for smooth unconstrained and convex-constrained problems. We introduce a simplified spectral proximal gradient solver, a truncated nonlinear conjugate gradient solver, and a dogleg method. Finally, we compare algorithm performance on examples from data science and PDE-constrained optimization.

97 MATHEMATICS AND COMPUTING↗

Method of measuring elastic strain distribution in specimens used for high frequency fatigue testing

A technique using a point contact piezoelectric detector has been developed which permits the displacement amplitude distributions over the entire length of high frequency fatigue specimens to be measured. Elastic strain distributions can be derived with a computer analysis that uses curve smoothing and numerical derivative methods. The equipment and techniques for measuring and processing the data are described, and displacement amplitudes, strain distributions, and magnification factors for straight rods and dumbbell-shaped specimens are obtained and shown to agree with theoretically predicted values. It is shown that the technique presented here can be used to design specimens with unusual displacement amplitudes and strain distributions.

Sirian, C. R.↗

On Utilization of NEXRAD Scan Strategy Information to Infer Discrepancies Associated With Radar and Rain Gauge Surface Volumetric Rainfall Accumulations

To evaluate the Tropical Rainfall Measuring Mission (TRMM) monthly Ground Validation (GV) rain map, 42 quality controlled tipping bucket rain gauge data (1 minute interpolated rain rates) were utilized. We have compared the gauge data to the surface volumetric rainfall accumulation of NEXRAD reflectivity field, (converting to rain rates using a 0.5 dB resolution smooth Z-R table). The comparison was carried out from data collected at Melbourne, Florida during the month of July 98. GV operational level 3 (L3 monthly) accumulation algorithm was used to obtain surface volumetric accumulations for the radar. The gauge records were accumulated using the 1 minute interpolated rain rates while the radar Volume Scan (VOS) intervals remain less than or equal to 75 minutes. The correlation coefficient for the radar and gauge totals for the monthly time-scale remain at 0.93, however, a large difference was noted between the gauge and radar derived rain accumulation when the radar data interval is either 9 minute, or 10 minute. This difference in radar and gauge accumulation is being explained in terms of the radar scan strategy information. The discrepancy in terms of the Volume Coverage Pattern (VCP) of the NEXRAD is being reported where VCP mode is ascertained using the radar tilt angle information. Hourly radar and gauge accumulations have been computed using the present operational L3 method supplemented with a threshold period of +/- 5 minutes (based on a sensitivity analysis). These radar and gauge accumulations are subsequently improved using a radar hourly scan weighting factor (taking ratio of the radar scan frequency within a time bin to the 7436 total radar scans for the month). This GV procedure is further being improved by introducing a spatial smoothing method to yield reasonable bulk radar to gauge ratio for the hourly and daily scales.

Roy, Biswadev↗

Fast Particle Methods for Multiscale Phenomena Simulations

We are developing particle methods oriented at improving computational modeling capabilities of multiscale physical phenomena in : (i) high Reynolds number unsteady vortical flows, (ii) particle laden and interfacial flows, (iii)molecular dynamics studies of nanoscale droplets and studies of the structure, functions, and evolution of the earliest living cell. The unifying computational approach involves particle methods implemented in parallel computer architectures. The inherent adaptivity, robustness and efficiency of particle methods makes them a multidisciplinary computational tool capable of bridging the gap of micro-scale and continuum flow simulations. Using efficient tree data structures, multipole expansion algorithms, and improved particle-grid interpolation, particle methods allow for simulations using millions of computational elements, making possible the resolution of a wide range of length and time scales of these important physical phenomena.The current challenges in these simulations are in : [i] the proper formulation of particle methods in the molecular and continuous level for the discretization of the governing equations [ii] the resolution of the wide range of time and length scales governing the phenomena under investigation. [iii] the minimization of numerical artifacts that may interfere with the physics of the systems under consideration. [iv] the parallelization of processes such as tree traversal and grid-particle interpolations We are conducting simulations using vortex methods, molecular dynamics and smooth particle hydrodynamics, exploiting their unifying concepts such as : the solution of the N-body problem in parallel computers, highly accurate particle-particle and grid-particle interpolations, parallel FFT's and the formulation of processes such as diffusion in the context of particle methods. This approach enables us to transcend among seemingly unrelated areas of research.

Koumoutsakos, P.↗

Algorithms for the automatic generation of 2-D structured multi-block grids

Two different approaches to the fully automatic generation of structured multi-block grids in two dimensions are presented. The work aims to simplify the user interactivity necessary for the definition of a multiple block grid topology. The first approach is based on an advancing front method commonly used for the generation of unstructured grids. The original algorithm has been modified toward the generation of large quadrilateral elements. The second method is based on the divide-and-conquer paradigm with the global domain recursively partitioned into sub-domains. For either method each of the resulting blocks is then meshed using transfinite interpolation and elliptic smoothing. The applicability of these methods to practical problems is demonstrated for typical geometries of fluid dynamics.

Schoenfeld, Thilo↗

Comparison of large-scale structures and velocities in the local universe

Comparison of the large-scale density and velocity fields in the local universe shows detailed agreement, strengthening the standard paradigm of the gravitational origin of these structures. Quantitative analysis can determine the cosmological density parameter, Omega, and biasing factor, b; there is virtually no sensitivity in any local analyses to the cosmologial constant, lambda. Comparison of the dipole anisotropy of the cosmic microwave background with the acceleration due to the Infrared Astronomy Satellite (IRAS) galaxies puts the linear growth factor in the range beta approximately equals Omega (exp 0.6)/b = 0.6(+0.7/-0.3) (95% confidence). A direct comparison of the density and velocity fields of nearby galaxies gives beta = 1.3 (+0.7/-0.6), and from nonlinear analysis the weaker limit (Omega greater than 0.45 for b greater than 0.5 (again 95% confidence). A tighter limit (Omega greater than 0.3 (4-6 sigma)), is obtained by a reconstruction of the probability distribution function of the initial fluctuations from which the structures observed today arose. The last two methods depend critically on the smooth velocity field determined from the observed velocities of nearby galaxies by the POTENT method. A new analysis of these velocities, with more than three times the data used to obtain the above quoted results, is now underway and promises to tighten the uncertainties considerably, as well as reduce systematic bias.

Yahil, Amos↗

$L^1$ penalization of volumetric dose objectives in optimal control of PDEs

This work is concerned with a class of PDE-constrained optimization problems that are motivated by an application in radiotherapy treatment planning. Here the primary design objective is to minimize the volume where a functional of the state violates a prescribed level, but prescribing these levels in the form of pointwise state constraints leads to infeasible problems. We therefore propose an alternative approach based on L 1 penalization of the violation that is also applicable when state constraints are infeasible. We establish well-posedness of the corresponding optimal control problem, derive first-order optimality conditions, discuss convergence of minimizers as the penalty parameter tends to infinity, and present a semismooth Newton method for their efficient numerical solution. Finally, the performance of this method for a model problem is illustrated and contrasted with an alternative approach based on (regularized) state constraints.

97 MATHEMATICS AND COMPUTING↗

A generalized transport-velocity formulation for smoothed particle hydrodynamics

The standard smoothed particle hydrodynamics (SPH) method suffers from tensile instability. In fluid-dynamics simulations this instability leads to particle clumping and void regions when negative pressure occurs. In solid-dynamics simulations, it results in unphysical structure fragmentation. In this work the transport-velocity formulation of Adami et al. (2013) is generalized for providing a solution of this long-standing problem. Other than imposing a global background pressure, a variable background pressure is used to modify the particle transport velocity and eliminate the tensile instability completely. Furthermore, such a modification is localized by defining a shortened smoothing length. The generalized formulation is suitable for fluid and solid materials with and without free surfaces. The results of extensive numerical tests on both fluid and solid dynamics problems indicate that the new method provides a unified approach for multi-physics SPH simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗