Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “iterative smoothing”

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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2023

Evaluation of Voronoi Meshes for Large Eddy Simulations of High Lift Aerodynamics

Numerical sensitivity to 3 different Voronoi seeding methods is investigated for Large Eddy Simulations (LES). A second order accurate, non-dissipative finite volume discretization is used to systematically investigate the effects of different polyhedral Voronoi mesh types using a sequence of three canonical problems with increasing complexity. First, inviscid isentropic vortex propagation is studied to demonstrate the substantial reduction of errors for rhombic dodecahedron and truncated octahedral cell types over Cartesian hexagonal cells of identical spacing. Furthermore, the reduction of errors induced at cell-size transitions (grid-coarsening interfaces) due to Lloyd smoothing iterations is quantified. It is shown that by utilizing an appropriate viscous flux discretization, a constant coefficient subgrid scale model is sufficient for non-linear stability at the 2:1 cell-size transitions on polyhedral grids, although some further error reduction does occur when smoothing is utilized. Next, forced homogeneous isotropic turbulence at an asymptotically large Reynolds number is studied to demonstrate the non-dissipative character of the inviscid flux discretization, and the non-linear robustness and accuracy offered by the viscous flux discretization using a subgrid scale model for all three Voronoi grid types. Finally,Wall-Modeled Large Eddy Simulations (WMLES) are performed to study the high-lift aerodynamics on the McDonnell Douglas 30P30N multi-element airfoil at two distinct grid levels and for two distinct Voronoi cell types. The formulation is shown to predict the aerodynamic loading with high accuracy at all angles of attack when sufficient resolution is reached, and the hexagonal prism grid topology, while computationally more expensive, has higher effective resolution compared to the Cartesian grid topology with the same spacing.

TTT↗
NASA NTRS2023

Evaluation of Voronoi Meshes for Large Eddy Simulations of High Lift Aerodynamics

Numerical sensitivity to 3 different Voronoi seeding methods is investigated for Large Eddy Simulations (LES). A second order accurate, non-dissipative finite volume discretization is used to systematically investigate the effects of different polyhedral Voronoi mesh types using a sequence of three canonical problems with increasing complexity. First, inviscid isentropic vortex propagation is studied to demonstrate the substantial reduction of errors for rhombic dodecahedron and truncated octahedral cell types over Cartesian hexagonal cells of identical spacing. Furthermore, the reduction of errors induced at cell-size transitions (grid-coarsening interfaces) due to Lloyd smoothing iterations is quantified. It is shown that by utilizing an appropriate viscous flux discretization, a constant coefficient subgrid scale model is sufficient for non-linear stability at the 2:1 cell-size transitions on polyhedral grids, although some further error reduction does occur when smoothing is utilized. Next, forced homogeneous isotropic turbulence at an asymptotically large Reynolds number is studied to demonstrate the non-dissipative character of the inviscid flux discretization, and the non-linear robustness and accuracy offered by the viscous flux discretization using a subgrid scale model for all three Voronoi grid types. Finally, Wall-Modeled Large Eddy Simulations (WMLES) are performed to study the high-lift aerodynamics on the McDonnell Douglas 30P30N multi-element airfoil at two distinct grid levels and for two distinct Voronoi cell types. The formulation is shown to predict the aerodynamic loading with high accuracy at all angles of attack when sufficient resolution is reached, and the hexagonal prism grid topology, while computationally more expensive, has higher effective resolution compared to the Cartesian grid topology with the same spacing.

TTT↗
NASA NTRS1972

The least squares process of MEDIA for computing DRVID calibration polynomials

A process is described and evaluated for computing a least squares polynomial approximation of data points in which the optimum degree of the polynomial is automatically determined. An iterative smoothing technique is used to replace every point with the value taken on by a moving least squares polynomial computed from a subset of points centered at the point to be replaced. The optimum degree of the resulting polynomial approximation is determined by analyzing the finite differences of each successive set of smoothed points. To evaluate the process, both artificially constructed data and actual Mariner Mars 1971 (MM'71) tracking data are used. This process was incorporated into a transmission media calibration computer program (MEDIA), which calibrates radiometric data to overcome the effects on the tracking signal of charged particle media. MEDIA was used in support of MM'71.

Leavitt, R. K.↗
NASA NTRS1981

Procedures for analysis of spatial relationships among ship survey data and sea surface temperature

The establishment of a limited spatial data base for the U.S. eastern seaboard vicinity is discussed along with the demonstration of computer assisted analysis techniques for investigating spatial patterns and relationships among ship survey data and remotely sensed sea surface temperature. Ship survey variables included concentrations of two zooplankton, two icthyoplankton, and two fish species, in addition to physical data of depth to bottom and surface and bottom water temperatures. Continuous spatial distributions of these data were created by both weighted nearest neighbor and iterative smoothing interpolation techniques. Maps of surface water temperature were created by digitizing GOES satellite images. All mapped data were spatially registered by conversion of latitude and longitude coordinates to rotated Lambert conic conformal rectilinear coordinates and stored in grid format of approximately one hundred square kilometers per cell. The analysis of these data include the generation of statistical summaries and maps describing the joint occurrence among variables.

Berry, J. K.↗
NASA NTRS1986

Airfoil Smoothing and Scaling Programs

Two programs smooth and scale arbitrary airfoil coordinates. Airfoil smoothing program (AFSMO) utilizes both least-squares polynomial and leastsquares cubic-spline techniques to smooth iteratively second derivatives of y-axis airfoil coordinates with respect to transformed x-axis system that unwraps airfoil and stretches nose and trailing-edge regions.

Morgan, Harry L., Jr.↗
NASA NTRS1992

An installed nacelle design code using a multiblock Euler solver. Volume 1: Theory document

An efficient multiblock Euler design code was developed for designing a nacelle installed on geometrically complex airplane configurations. This approach employed a design driver based on a direct iterative surface curvature method developed at LaRC. A general multiblock Euler flow solver was used for computing flow around complex geometries. The flow solver used a finite-volume formulation with explicit time-stepping to solve the Euler Equations. It used a multiblock version of the multigrid method to accelerate the convergence of the calculations. The design driver successively updated the surface geometry to reduce the difference between the computed and target pressure distributions. In the flow solver, the change in surface geometry was simulated by applying surface transpiration boundary conditions to avoid repeated grid generation during design iterations. Smoothness of the designed surface was ensured by alternate application of streamwise and circumferential smoothings. The capability and efficiency of the code was demonstrated through the design of both an isolated nacelle and an installed nacelle at various flow conditions. Information on the execution of the computer program is provided in volume 2.

Chen, H. C.↗
NASA NTRS1993

An installed nacelle design method using multiblock Euler solver

An efficient multiblock Euler design method was developed for designing a nacelle installed on geometrically complex airplane configurations. This approach employed a design module based on a direct iterative surface curvature method developed at NASA-Langley. A multiblock Euler flow solver was used for computing flow around complex geometries. The flow solver used a finite-volume formulation with explicit time-stepping to solve the Euler equations. It used a multiblock version of the multigrid method to accelerate the convergence of the calculations. The design module successively updated the surface geometry to reduce the difference between the computed and target pressure distributions. In the flow solver, the change in surface geometry was simulated by applying surface transpiration boundary conditions to avoid repeated grid generation during design iterations. Smoothness of the designed surface was ensured by alternate application of streamwise and circumferential smoothings.

Chen, H. C.↗
NASA NTRS1996

A Full Multi-Grid Method for the Solution of the Cell Vertex Finite Volume Cauchy-Riemann Equations

The system of inhomogeneous Cauchy-Riemann equations defined on a square domain and subject to Dirichlet boundary conditions is considered. This problem is discretised by using the cell vertex finite volume method on quadrilateral meshes. The resulting algebraic problem is overdetermined and the solution is defined in a least squares sense. By this approach a consistent algebraic problem is obtained which differs from the original one by O(h(exp 2)) perturbations of the right-hand side. A suitable cell-based convergent smoothing iteration is presented which is naturally linked to the least squares formulation. Hence, a standard multi-grid algorithm is reported which combines the given smoother and cell-based transfer operators. Some remarkable reduction properties of these operators are shown. A full multi-grid method is discussed which solves the discrete problem to the level of truncation error by employing one multi-grid cycle at each current level of discretisation. Experiments and applications of the full multi-grid scheme are presented.

Borzi, A.↗
NASA NTRS1993

Nonlinear smoothing identification algorithm with application to data consistency checks

A parameter identification algorithm for nonlinear systems is presented. It is based on smoothing test data with successively improved sets of model parameters. The smoothing, which is iterative, provides all of the information needed to compute the gradients of the smoothing performance measure with respect to the parameters. The parameters are updated using a quasi-Newton procedure, until convergence is achieved. The advantage of this algorithm over standard maximum likelihood identification algorithms is the computational savings in calculating the gradient. This algorithm was used for flight-test data consistency checks based on a nonlinear model of aircraft kinematics. Measurement biases and scale factors were identified. The advantages of the presented algorithm and model are discussed.

Idan, M.↗
NASA NTRS1986

An efficient method for solving the steady Euler equations

An efficient numerical procedure for solving a set of nonlinear partial differential equations is given, specifically for the steady Euler equations. Solutions of the equations were obtained by Newton's linearization procedure, commonly used to solve the roots of nonlinear algebraic equations. In application of the same procedure for solving a set of differential equations we give a theorem showing that a quadratic convergence rate can be achieved. While the domain of quadratic convergence depends on the problems studied and is unknown a priori, we show that firstand second-order derivatives of flux vectors determine whether the condition for quadratic convergence is satisfied. The first derivatives enter as an implicit operator for yielding new iterates and the second derivatives indicates smoothness of the flows considered. Consequently flows involving shocks are expected to require larger number of iterations. First-order upwind discretization in conjunction with the Steger-Warming flux-vector splitting is employed on the implicit operator and a diagonal dominant matrix results. However the explicit operator is represented by first- and seond-order upwind differencings, using both Steger-Warming's and van Leer's splittings. We discuss treatment of boundary conditions and solution procedures for solving the resulting block matrix system. With a set of test problems for one- and two-dimensional flows, we show detailed study as to the efficiency, accuracy, and convergence of the present method.

Liou, M. S.↗
NASA NTRS1988

Analysis of spectra using correlation functions

A novel method is presented for the quantitative analysis of spectra based on the properties of the cross correlation between a real spectrum and either a numerical synthesis or laboratory simulation. A new goodness-of-fit criterion called the heteromorphic coefficient H is proposed that has the property of being zero when a fit is achieved and varying smoothly through zero as the iteration proceeds, providing a powerful tool for automatic or near-automatic analysis. It is also shown that H can be rendered substantially noise-immune, permitting the analysis of very weak spectra well below the apparent noise level and, as a byproduct, providing Doppler shift and radial velocity information with excellent precision. The technique is in regular use in the Atmospheric Trace Molecule Spectroscopy (ATMOS) project and operates in an interactive, realtime computing environment with turn-around times of a few seconds or less.

Beer, Reinhard↗
NASA NTRS1990

Fuselage design for a specified Mach-sliced area distribution

A procedure for designing a fuselage having a prescribed effective area distribution computed from -90 deg Mach slices is described. This type of calculation is an essential tool in designing a complete configuration with an effective area distribution that corresponds to a desired sonic boom signature shape. Sample calculations are given for M=2 and M=3 designs. The examples include fuselages constrained to have circular cross sections and fuselages having cross sections of arbitrary shape. It is found that, for a prescribed effective area distribution having sharp variations, the iterative procedure converges to a smoothed approximation to the prescribed distribution. For a smooth prescribed area distribution, the solution is not unique.

Barger, Raymond L.↗
NASA NTRS1995

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↗
NASA NTRS1992

Deployable reflector antenna performance optimization using automated surface correction and array-feed compensation

Methods for increasing the electromagnetic (EM) performance of reflectors with rough surfaces were tested and evaluated. First, one quadrant of the 15-meter hoop-column antenna was retrofitted with computer-driven and controlled motors to allow automated adjustment of the reflector surface. The surface errors, measured with metric photogrammetry, were used in a previously verified computer code to calculate control motor adjustments. With this system, a rough antenna surface (rms of approximately 0.180 inch) was corrected in two iterations to approximately the structural surface smoothness limit of 0.060 inch rms. The antenna pattern and gain improved significantly as a result of these surface adjustments. The EM performance was evaluated with a computer program for distorted reflector antennas which had been previously verified with experimental data. Next, the effects of the surface distortions were compensated for in computer simulations by superimposing excitation from an array feed to maximize antenna performance relative to an undistorted reflector. Results showed that a 61-element array could produce EM performance improvements equal to surface adjustments. When both mechanical surface adjustment and feed compensation techniques were applied, the equivalent operating frequency increased from approximately 6 to 18 GHz.

Schroeder, Lyle C.↗
NASA NTRS2001

Use of a genetic algorithm for the analysis of eye movements from the linear vestibulo-ocular reflex

It is common in vestibular and oculomotor testing to use a single-frequency (sine) or combination of frequencies [sum-of-sines (SOS)] stimulus for head or target motion. The resulting eye movements typically contain a smooth tracking component, which follows the stimulus, in which are interspersed rapid eye movements (saccades or fast phases). The parameters of the smooth tracking--the amplitude and phase of each component frequency--are of interest; many methods have been devised that attempt to identify and remove the fast eye movements from the smooth. We describe a new approach to this problem, tailored to both single-frequency and sum-of-sines stimulation of the human linear vestibulo-ocular reflex. An approximate derivative is used to identify fast movements, which are then omitted from further analysis. The remaining points form a series of smooth tracking segments. A genetic algorithm is used to fit these segments together to form a smooth (but disconnected) wave form, by iteratively removing biases due to the missing fast phases. A genetic algorithm is an iterative optimization procedure; it provides a basis for extending this approach to more complex stimulus-response situations. In the SOS case, the genetic algorithm estimates the amplitude and phase values of the component frequencies as well as removing biases.

Non-NASA Center↗
NASA NTRS1985

Speed of sound in the solar interior

The sound speed of the solar interior is directly determinable on the basis of the frequencies of solar 5-min oscillations, irrespective of solar model, and relying only on a simple asymptotic description of the oscillations in terms of trapped acoustic waves. It is plausible that, by using this asymptotic determination as an initial trial in a more accurate inversion, and imposing constraints of smoothness on the solution resulting from the iteration, a good model representing the large scale structure of the sun which satisfies the observed frequencies may be determined.

Christensen-Dalsgaard, J.↗
NASA NTRS1987

Optimal application of Morrison's iterative noise removal for deconvolution. Appendices

Morrison's iterative method of noise removal, or Morrison's smoothing, is applied in a simulation to noise-added data sets of various noise levels to determine its optimum use. Morrison's smoothing is applied for noise removal alone, and for noise removal prior to deconvolution. For the latter, an accurate method is analyzed to provide confidence in the optimization. The method consists of convolving the data with an inverse filter calculated by taking the inverse discrete Fourier transform of the reciprocal of the transform of the response of the system. Various length filters are calculated for the narrow and wide Gaussian response functions used. Deconvolution of non-noisy data is performed, and the error in each deconvolution calculated. Plots are produced of error versus filter length; and from these plots the most accurate length filters determined. The statistical methodologies employed in the optimizations of Morrison's method are similar. A typical peak-type input is selected and convolved with the two response functions to produce the data sets to be analyzed. Both constant and ordinate-dependent Gaussian distributed noise is added to the data, where the noise levels of the data are characterized by their signal-to-noise ratios. The error measures employed in the optimizations are the L1 and L2 norms. Results of the optimizations for both Gaussians, both noise types, and both norms include figures of optimum iteration number and error improvement versus signal-to-noise ratio, and tables of results. The statistical variation of all quantities considered is also given.

Ioup, George E.↗
NASA NTRS1996

Algebraic Multigrid by Smoothed Aggregation for Second and Fourth Order Elliptic Problems

Multigrid methods are very efficient iterative solvers for system of algebraic equations arising from finite element and finite difference discretization of elliptic boundary value problems. The main principle of multigrid methods is to complement the local exchange of information in point-wise iterative methods by a global one utilizing several related systems, called coarse levels, with a smaller number of variables. The coarse levels are often obtained as a hierarchy of discretizations with different characteristic meshsizes, but this requires that the discretization is controlled by the iterative method. To solve linear systems produced by existing finite element software, one needs to create an artificial hierarchy of coarse problems. The principal issue is then to obtain computational complexity and approximation properties similar to those for nested meshes, using only information in the matrix of the system and as little extra information as possible. Such algebraic multigrid method that uses the system matrix only was developed by Ruge. The prolongations were based on the matrix of the system by partial solution from given values at selected coarse points. The coarse grid points were selected so that each point would be interpolated to via so-called strong connections. Our approach is based on smoothed aggregation introduced recently by Vanek. First the set of nodes is decomposed into small mutually disjoint subsets. A tentative piecewise constant interpolation (in the discrete sense) is then defined on those subsets as piecewise constant for second order problems, and piecewise linear for fourth order problems. The prolongation operator is then obtained by smoothing the output of the tentative prolongation and coarse level operators are defined variationally.

Vanek, Petr↗