SEARCH · Engineering Papers

Results for “adaptive weighting schemes”

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 19 records

All sources NASA NTRS DOE OSTI

NASA NTRS1993

Structured adaptive grid generation using algebraic methods

The accuracy of the numerical algorithm depends not only on the formal order of approximation but also on the distribution of grid points in the computational domain. Grid adaptation is a procedure which allows optimal grid redistribution as the solution progresses. It offers the prospect of accurate flow field simulations without the use of an excessively timely, computationally expensive, grid. Grid adaptive schemes are divided into two basic categories: differential and algebraic. The differential method is based on a variational approach where a function which contains a measure of grid smoothness, orthogonality and volume variation is minimized by using a variational principle. This approach provided a solid mathematical basis for the adaptive method, but the Euler-Lagrange equations must be solved in addition to the original governing equations. On the other hand, the algebraic method requires much less computational effort, but the grid may not be smooth. The algebraic techniques are based on devising an algorithm where the grid movement is governed by estimates of the local error in the numerical solution. This is achieved by requiring the points in the large error regions to attract other points and points in the low error region to repel other points. The development of a fast, efficient, and robust algebraic adaptive algorithm for structured flow simulation applications is presented. This development is accomplished in a three step process. The first step is to define an adaptive weighting mesh (distribution mesh) on the basis of the equidistribution law applied to the flow field solution. The second, and probably the most crucial step, is to redistribute grid points in the computational domain according to the aforementioned weighting mesh. The third and the last step is to reevaluate the flow property by an appropriate search/interpolate scheme at the new grid locations. The adaptive weighting mesh provides the information on the desired concentration of points to the grid redistribution scheme. The evaluation of the weighting mesh is accomplished by utilizing the weight function representing the solution variation and the equidistribution law. The selection of the weight function plays a key role in grid adaptation. A new weight function utilizing a properly weighted boolean sum of various flowfield characteristics is defined. The redistribution scheme is developed utilizing Non-Uniform Rational B-Splines (NURBS) representation. The application of NURBS representation results in a well distributed smooth grid by maintaining the fidelity of the geometry associated with boundary curves. Several algebraic methods are applied to smooth and/or nearly orthogonalize the grid lines. An elliptic solver is utilized to smooth the grid lines if there are grid crossings. Various computational examples of practical interest are presented to demonstrate the success of these methods.

Yang, Jiann-Cherng↗

NASA NTRS1990

The fundamentals of adaptive grid movement

Basic grid point movement schemes are studied. The schemes are referred to as adaptive grids. Weight functions and equidistribution in one dimension are treated. The specification of coefficients in the linear weight, attraction to a given grid or a curve, and evolutionary forces are considered. Curve by curve and finite volume methods are described. The temporal coupling of partial differential equations solvers and grid generators was discussed.

Eiseman, Peter R.↗

NASA NTRS1989

A Simple Algebraic Grid Adaptation Scheme with Applications to Two- and Three-dimensional Flow Problems

An algebraic adaptive grid scheme based on the concept of arc equidistribution is presented. The scheme locally adjusts the grid density based on gradients of selected flow variables from either finite difference or finite volume calculations. A user-prescribed grid stretching can be specified such that control of the grid spacing can be maintained in areas of known flowfield behavior. For example, the grid can be clustered near a wall for boundary layer resolution and made coarse near the outer boundary of an external flow. A grid smoothing technique is incorporated into the adaptive grid routine, which is found to be more robust and efficient than the weight function filtering technique employed by other researchers. Since the present algebraic scheme requires no iteration or solution of differential equations, the computer time needed for grid adaptation is trivial, making the scheme useful for three-dimensional flow problems. Applications to two- and three-dimensional flow problems show that a considerable improvement in flowfield resolution can be achieved by using the proposed adaptive grid scheme. Although the scheme was developed with steady flow in mind, it is a good candidate for unsteady flow computations because of its efficiency.

Hsu, Andrew T.↗

NASA NTRS1994

An assessment of the adaptive unstructured tetrahedral grid, Euler Flow Solver Code FELISA

A three-dimensional solution-adaptive Euler flow solver for unstructured tetrahedral meshes is assessed, and the accuracy and efficiency of the method for predicting sonic boom pressure signatures about simple generic models are demonstrated. Comparison of computational and wind tunnel data and enhancement of numerical solutions by means of grid adaptivity are discussed. The mesh generation is based on the advancing front technique. The FELISA code consists of two solvers, the Taylor-Galerkin and the Runge-Kutta-Galerkin schemes, both of which are spacially discretized by the usual Galerkin weighted residual finite-element methods but with different explicit time-marching schemes to steady state. The solution-adaptive grid procedure is based on either remeshing or mesh refinement techniques. An alternative geometry adaptive procedure is also incorporated.

Djomehri, M. Jahed↗

NASA NTRS1989

Aerodynamics of engine-airframe interaction

The development of the variational approach for the solution of inviscid aerodynamic problems using solution adaptive grids is discussed. The formulation of a new, directional weighting, functional has been shown to have desirable properties. The scheme has been applied to compute the transonic flow past two-dimensional airfoils using the Euler equations of inviscid, compressible flow. Transonic flows in quasi-one-dimensional nozzles and over the two dimensional airfoils are solved on the various solution-adaptive-grids to demonstrate the applicability of the proposed directional-concentration functional and the grid adaptation process from the stand point of improving the solution accuracy and demonstrating the overall convergence.

Caughey, David A.↗

NASA NTRS1975

Adaptive spacecraft attitude control utilizing eigenaxis rotations

Conventional and adaptive attitude control of spacecraft which use control moment gyros (CMG's) as torque sources are discussed. Control laws predicated on the assumption of a linear system are used since the spacecraft equations of motion are formulated in an 'eigenaxis system' so that they are essentially linear during 'slow' maneuvers even if large angles are involved. The overall control schemes are 'optimal' in several senses. Eigenaxis rotations and a weighted pseudo-inverse CMG steering law are used and, in the adaptive case, a Model Reference Adaptive System (MRAS) controller based on Liapunov's Second Method is adopted. To substantiate the theory, digital simulation results obtained using physical parameters of a Large Space Telescope type spacecraft are presented. These results indicate that an adaptive control law is often desirable.

Cochran, J. E., Jr.↗

NASA NTRS2018

Tetrahedral-Mesh Simulations of Shock-Turbulence Interaction

Despite decades of development of unstructured mesh methods, direct numerical simulations (DNS) of turbulent flows are still predominantly performed on structured or unstructured hexahedral meshes with high-order finite-difference methods, weighted essentially nonoscillatory (WENO) schemes, or hybrid schemes formed by their combinations. Tetrahedral meshes offer easy mesh generation and adaptation around complex geometries and the potential of an orientation-free grid that would benefit the isotropic nature of small-scale dissipation, as well as the solution accuracy of intermediate scales. To advance the state of the art of unstructured-mesh simulation capabilities for shock/turbulence interaction, DNS using pure tetrahedral meshes are carried out with the space-time conservation element, solution element (CESE) method in this research. By its design, the CESE method is constructed based on a non-dissipative scheme and is a genuinely multidimensional numerical framework that is free from the use of an approximate Riemann-solver. The numerical framework also provides the ability to add numerical dissipation (the nondissipative scheme acts as the reference state like that of the reversible state in thermodynamics) when needed (with justification from mathematics/physics). The above-mentioned features along with the CESE method's consistent shock-capturing approach and strong enforcement of flux conservation in spacetime offers a novel method to accurately simulate turbulent flows and their interaction with shocks using tetrahedral meshes. Two canonical problems, namely, isotropic turbulence interaction with a normal shock and a Mach 2.9 turbulent boundary layer flow over a 24deg compression corner are investigated in this study. Computational results show reasonably good agreement with experimental data and results from structured-mesh, high-order simulations available in the literature. Successful validation of these canonical problems demonstrated here paves the way for future high-fidelity supersonic flow simulations involving complex-geometries.

Venkatachari, Balaji Shankar↗

NASA NTRS1990

A solution adaptive grid procedure for an upwind parabolized flow solver

A solution adaptive grid procedure based on an error equi-distribution scheme is developed and applied to a Parabolized Navier-Stokes solver. An improved method for selecting weighting functions is introduced which involves normalizing a combination of flowfield gradients and curvature of a number of dependent variables and then selecting the largest at each point. The scheme re-distributes grid points line-by-line, with grid point motion controlled by forces analogous to tensional and torsional spring forces with the spring constants set equal to the weighting functions. Torsional terms are functions of the grid point positions along neighboring grid lines and provide grid smoothness and stability. A grid-fitting scheme is introduced for external flows in which the number of grid points in the freestream are reduced to a minimum. Results for several problems are presented to demonstrate the improvements obtainable with the solution adaptive grid procedure.

Harvey, Albert D.↗

NASA NTRS2007

Quaternion Averaging

Many applications require an algorithm that averages quaternions in an optimal manner. For example, when combining the quaternion outputs of multiple star trackers having this output capability, it is desirable to properly average the quaternions without recomputing the attitude from the the raw star tracker data. Other applications requiring some sort of optimal quaternion averaging include particle filtering and multiple-model adaptive estimation, where weighted quaternions are used to determine the quaternion estimate. For spacecraft attitude estimation applications, derives an optimal averaging scheme to compute the average of a set of weighted attitude matrices using the singular value decomposition method. Focusing on a 4-dimensional quaternion Gaussian distribution on the unit hypersphere, provides an approach to computing the average quaternion by minimizing a quaternion cost function that is equivalent to the attitude matrix cost function Motivated by and extending its results, this Note derives an algorithm that deterniines an optimal average quaternion from a set of scalar- or matrix-weighted quaternions. Rirthermore, a sufficient condition for the uniqueness of the average quaternion, and the equivalence of the mininiization problem, stated herein, to maximum likelihood estimation, are shown.

Markley, F. Landis↗

NASA NTRS2001

Grid Convergence of High Order Methods for Multiscale Complex Unsteady Viscous Compressible Flows

Grid convergence of several high order methods for the computation of rapidly developing complex unsteady viscous compressible flows with a wide range of physical scales is studied. The recently developed adaptive numerical dissipation control high order methods referred to as the ACM and wavelet filter schemes are compared with a fifth-order weighted ENO (WENO) scheme. The two 2-D compressible full Navier-Stokes models considered do not possess known analytical and experimental data. Fine grid solutions from a standard second-order TVD scheme and a MUSCL scheme with limiters are used as reference solutions. The first model is a 2-D viscous analogue of a shock tube problem which involves complex shock/shear/boundary-layer interactions. The second model is a supersonic reactive flow concerning fuel breakup. The fuel mixing involves circular hydrogen bubbles in air interacting with a planar moving shock wave. Both models contain fine scale structures and are stiff in the sense that even though the unsteadiness of the flows are rapidly developing, extreme grid refinement and time step restrictions are needed to resolve all the flow scales as well as the chemical reaction scales.

Sjoegreen, B.↗

NASA NTRS2014

Toward Automatic Verification of Goal-Oriented Flow Simulations

We demonstrate the power of adaptive mesh refinement with adjoint-based error estimates in verification of simulations governed by the steady Euler equations. The flow equations are discretized using a finite volume scheme on a Cartesian mesh with cut cells at the wall boundaries. The discretization error in selected simulation outputs is estimated using the method of adjoint-weighted residuals. Practical aspects of the implementation are emphasized, particularly in the formulation of the refinement criterion and the mesh adaptation strategy. Following a thorough code verification example, we demonstrate simulation verification of two- and three-dimensional problems. These involve an airfoil performance database, a pressure signature of a body in supersonic flow and a launch abort with strong jet interactions. The results show reliable estimates and automatic control of discretization error in all simulations at an affordable computational cost. Moreover, the approach remains effective even when theoretical assumptions, e.g., steady-state and solution smoothness, are relaxed.

Simulations↗

NASA NTRS2006

An Ensemble-Based Smoother with Retrospectively Updated Weights for Highly Nonlinear Systems

Monte Carlo computational methods have been introduced into data assimilation for nonlinear systems in order to alleviate the computational burden of updating and propagating the full probability distribution. By propagating an ensemble of representative states, algorithms like the ensemble Kalman filter (EnKF) and the resampled particle filter (RPF) rely on the existing modeling infrastructure to approximate the distribution based on the evolution of this ensemble. This work presents an ensemble-based smoother that is applicable to the Monte Carlo filtering schemes like EnKF and RPF. At the minor cost of retrospectively updating a set of weights for ensemble members, this smoother has demonstrated superior capabilities in state tracking for two highly nonlinear problems: the double-well potential and trivariate Lorenz systems. The algorithm does not require retrospective adaptation of the ensemble members themselves, and it is thus suited to a streaming operational mode. The accuracy of the proposed backward-update scheme in estimating non-Gaussian distributions is evaluated by comparison to the more accurate estimates provided by a Markov chain Monte Carlo algorithm.

Monte Carlo↗

NASA NTRS1997

Essentially Non-Oscillatory and Weighted Essentially Non-Oscillatory Schemes for Hyperbolic Conservation Laws

In these lecture notes we describe the construction, analysis, and application of ENO (Essentially Non-Oscillatory) and WENO (Weighted Essentially Non-Oscillatory) schemes for hyperbolic conservation laws and related Hamilton- Jacobi equations. ENO and WENO schemes are high order accurate finite difference schemes designed for problems with piecewise smooth solutions containing discontinuities. The key idea lies at the approximation level, where a nonlinear adaptive procedure is used to automatically choose the locally smoothest stencil, hence avoiding crossing discontinuities in the interpolation procedure as much as possible. ENO and WENO schemes have been quite successful in applications, especially for problems containing both shocks and complicated smooth solution structures, such as compressible turbulence simulations and aeroacoustics. These lecture notes are basically self-contained. It is our hope that with these notes and with the help of the quoted references, the reader can understand the algorithms and code them up for applications.

Shu, Chi-Wang↗

NASA NTRS2010

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Inviscid Fluxes

Cell-centered and node-centered approaches have been compared for unstructured finite-volume discretization of inviscid fluxes. The grids range from regular grids to irregular grids, including mixed-element grids and grids with random perturbations of nodes. Accuracy, complexity, and convergence rates of defect-correction iterations are studied for eight nominally second-order accurate schemes: two node-centered schemes with weighted and unweighted least-squares (LSQ) methods for gradient reconstruction and six cell-centered schemes two node-averaging with and without clipping and four schemes that employ different stencils for LSQ gradient reconstruction. The cell-centered nearest-neighbor (CC-NN) scheme has the lowest complexity; a version of the scheme that involves smart augmentation of the LSQ stencil (CC-SA) has only marginal complexity increase. All other schemes have larger complexity; complexity of node-centered (NC) schemes are somewhat lower than complexity of cell-centered node-averaging (CC-NA) and full-augmentation (CC-FA) schemes. On highly anisotropic grids typical of those encountered in grid adaptation, discretization errors of five of the six cell-centered schemes converge with second order on all tested grids; the CC-NA scheme with clipping degrades solution accuracy to first order. The NC schemes converge with second order on regular and/or triangular grids and with first order on perturbed quadrilaterals and mixed-element grids. All schemes may produce large relative errors in gradient reconstruction on grids with perturbed nodes. Defect-correction iterations for schemes employing weighted least-square gradient reconstruction diverge on perturbed stretched grids. Overall, the CC-NN and CC-SA schemes offer the best options of the lowest complexity and secondorder discretization errors. On anisotropic grids over a curved body typical of turbulent flow simulations, the discretization errors converge with second order and are small for the CC-NN, CC-SA, and CC-FA schemes on all grids and for NC schemes on triangular grids; the discretization errors of the CC-NA scheme without clipping do not converge on irregular grids. Accurate gradient reconstruction can be achieved by introducing a local approximate mapping; without approximate mapping, only the NC scheme with weighted LSQ method provides accurate gradients. Defect correction iterations for the CC-NA scheme without clipping diverge; for the NC scheme with weighted LSQ method, the iterations either diverge or converge very slowly. The best option in curved geometries is the CC-SA scheme that offers low complexity, second-order discretization errors, and fast convergence.

Diskin, Boris↗

NASA NTRS2000

A Posteriori Error Estimation for Finite Volume and Finite Element Approximations Using Broken Space Approximation

We consider a posteriori error estimates for finite volume and finite element methods on arbitrary meshes subject to prescribed error functionals. Error estimates of this type are useful in a number of computational settings: (1) quantitative prediction of the numerical solution error, (2) adaptive meshing, and (3) load balancing of work on parallel computing architectures. Our analysis recasts the class of Godunov finite volumes schemes as a particular form of discontinuous Galerkin method utilizing broken space approximation obtained via reconstruction of cell-averaged data. In this general framework, weighted residual error bounds are readily obtained using duality arguments and Galerkin orthogonality. Additional consideration is given to issues such as nonlinearity, efficiency, and the relationship to other existing methods. Numerical examples are given throughout the talk to demonstrate the sharpness of the estimates and efficiency of the techniques. Additional information is contained in the original.

Barth, Timothy J.↗

NASA NTRS1989

An improved algorithm for optimum structural design with multiple frequency constraints

An optimality criterion (OC) method for minimum-weight design of structures having multiple constraints on natural frequencies is presented. In this work a new resizing strategy is developed based on relaxation techniques. A computationally adaptive control parameter is used in conjunction with existing OC recursive formulae to promote convergence of optimum structural designs. Some considerations regarding the coupling of the modified Aitken accelerator with the OC method are discussed. Improved and rapidly converged minimum-weight designs are obtained when using an under-relaxed recursive scheme combined with the modified Aitken accelerator.

Mcgee, Oliver G.↗

NASA NTRS2009

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Viscous Fluxes - Part 1

Discretization of the viscous terms in current finite-volume unstructured-grid schemes are compared using node-centered and cell-centered approaches in two dimensions. Accuracy and efficiency are studied for six nominally second-order accurate schemes: a node-centered scheme, cell-centered node-averaging schemes with and without clipping, and cell-centered schemes with unweighted, weighted, and approximately mapped least-square face gradient reconstruction. The grids considered range from structured (regular) grids to irregular grids composed of arbitrary mixtures of triangles and quadrilaterals, including random perturbations of the grid points to bring out the worst possible behavior of the solution. Two classes of tests are considered. The first class of tests involves smooth manufactured solutions on both isotropic and highly anisotropic grids with discontinuous metrics, typical of those encountered in grid adaptation. The second class concerns solutions and grids varying strongly anisotropically over a curved body, typical of those encountered in high-Reynolds number turbulent flow simulations. Results from the first class indicate the face least-square methods, the node-averaging method without clipping, and the node-centered method demonstrate second-order convergence of discretization errors with very similar accuracies per degree of freedom. The second class of tests are more discriminating. The node-centered scheme is always second order with an accuracy and complexity in linearization comparable to the best of the cell-centered schemes. In comparison, the cell-centered node-averaging schemes are less accurate, have a higher complexity in linearization, and can fail to converge to the exact solution when clipping of the node-averaged values is used. The cell-centered schemes using least-square face gradient reconstruction have more compact stencils with a complexity similar to the complexity of the node-centered scheme. For simulations on highly anisotropic curved grids, the least-square methods have to be amended either by introducing a local mapping of the surface anisotropy or modifying the scheme stencil to reflect the direction of strong coupling.

Diskin, Boris↗

NASA NTRS2000

System Concepts for the Advanced Post-TRMM Rainfall Profiling Radars

Global rainfall is the primary distributor of latent heat through atmospheric circulation. The recently launched Tropical Rainfall Measuring Mission satellite is dedicated to advance our understanding of tropical precipitation patterns and their implications on global climate and its change. The Precipitation Radar (PR) aboard the satellite is the first radar ever flown in space and has provided. exciting, new data on the 3-D rain structures for a variety of scientific uses. However, due to the limited mission lifetime and the dynamical nature of precipitation, the TRMM PR data acquired cannot address all the issues associated with precipitation, its related processes, and the long-term climate variability. In fact, a number of new post-TRMM mission concepts have emerged in response to the recent NASA's request for new ideas on Earth science missions at the post 2002 era. This paper will discuss the system concepts for two advanced, spaceborne rainfall profiling radars. In the first portion of this paper, we will present a system concept for a second-generation spaceborne precipitation radar for operations at the Low Earth Orbit (LEO). The key PR-2 electronics system will possess the following capabilities: (1) A 13.6/35 GHz dual frequency radar electronics that has Doppler and dual-polarization capabilities. (2) A large but light weight, dual-frequency, wide-swath scanning, deployable antenna. (3) Digital chirp generation and the corresponding on-board pulse compression scheme. This will allow a significant improvement on rain signal detection without using the traditional, high-peak-power transmitters and without sacrificing the range resolution. (4) Radar electronics and algorithm to adaptively scan the antenna so that more time can be spent to observe rain rather than clear air. and (5) Built-in flexibility on the radar parameters and timing control such that the same radar can be used by different future rain missions. This will help to reduce the overall instrument development costs. In the second portion of this paper, we will present a system concept for a geostationary rainfall monitoring radar for operations at the geosynchronous Earth Orbit (GEO). In particular, the science requirements, the observational strategy, the instrument design, and the required technologies will be discussed.

Im, Eastwood↗