SEARCH · Engineering Papers

Results for “Smoothed boundary method”

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 91 records · Page 5

All sources NASA NTRS DOE OSTI

DOE OSTI2022

A Moving Embedded Boundary Approach for the Compressible Navier-Stokes Equations in a Block-Structured Adaptive Refinement Framework

A computational technique has been developed to perform compressible flow simulations involving moving boundaries using an embedded boundary approach within the block-structured adaptive mesh refinement (SAMR) framework of AMReX [1], [91], [92]. We leverage the SAMR capability to obtain quantitatively accurate results whilst using robust, second-order finite volume schemes. A conservative, unsplit, cut-cell approach is utilized and a ghost-cell approach is developed for computing the flux on the moving, embedded boundary faces. A third-order least-squares formulation has been developed to compute the wall velocity gradients, and was found to significantly improve the performance of the solver in terms of the quantitative comparison of surface quantities such as the skin friction coefficient. Various test cases are performed to validate the method, and compared with analytical, experimental, and other numerical results in literature. Inviscid and viscous test cases are performed that span a wide regime of flow speeds - acoustic (harmonically pulsating sphere), smooth flows (expansion fan created by a receding piston) and flows with shocks (shock-cylinder interaction, shock-wedge interaction, pitching NACA 0012 airfoil and shock-cone interaction). A closed system with moving boundaries - an oscillating piston in a cylinder, showed that the percentage error in mass within the system decreases with refinement, demonstrating that the numerical scheme is conservative with grid refinement, but is not discretely conservative. Viscous test cases involve that of a horizontally moving cylinder at Re = 40, an inline oscillating cylinder at Re = 100, and a transversely oscillating cylinder at Re = 185. The judicious use of adaptive mesh refinement with appropriate refinement criteria to capture the regions of interest leads to well-resolved flow features, and good quantitative comparison is observed with the results available in literature.

adaptive refinement↗

NASA NTRS2004

Frequency Domain Calculations Of Acoustic Propagation

Two complex geometry problems are solved using the linearized Euler equations. The impedance mismatch method1 is used to impose the solid surfaces without the need to use a body-fitted grid. The problem is solved in the frequency domain to avoid long run times. Although the harmonic assumption eliminates all time dependence, a pseudo-time term is added to allow conventional iterative methods to be employed. A Jameson type, Runge-Kutta scheme is used to advance the solution in pseudo time. The spatial operator is based on a seven-point, sixth-order finite difference. Constant coefficient, sixth-derivative artificial dissipation is used throughout the domain. A buffer zone technique employing a complex frequency to damp all waves near the boundaries is used to minimize reflections. The results show that the method is capable of capturing the salient features of the scattering, but an excessive number of grid points are required to resolve the phenomena in the vicinity of the solid bodies because the wavelength of the acoustics is relatively short compared with the size of the bodies. Smoothly transitioning into the immersed boundary condition alleviates the difficulties, but a fine mesh is still required.

Lockard, David P.↗

NASA NTRS1991

One shot methods for optimal control of distributed parameter systems 1: Finite dimensional control

The efficient numerical treatment of optimal control problems governed by elliptic partial differential equations (PDEs) and systems of elliptic PDEs, where the control is finite dimensional is discussed. Distributed control as well as boundary control cases are discussed. The main characteristic of the new methods is that they are designed to solve the full optimization problem directly, rather than accelerating a descent method by an efficient multigrid solver for the equations involved. The methods use the adjoint state in order to achieve efficient smoother and a robust coarsening strategy. The main idea is the treatment of the control variables on appropriate scales, i.e., control variables that correspond to smooth functions are solved for on coarse grids depending on the smoothness of these functions. Solution of the control problems is achieved with the cost of solving the constraint equations about two to three times (by a multigrid solver). Numerical examples demonstrate the effectiveness of the method proposed in distributed control case, pointwise control and boundary control problems.

Taasan, Shlomo↗

NASA NTRS1986

An efficient method for solving the steady Euler equations

An efficient numerical procedure for solving a set of nonlinear partial differential equations, the steady Euler equations, using Newton's linearization procedure is presented. A theorem indicating quadratic convergence for the case of differential equations is demonstrated. A condition for the domain of quadratic convergence Omega(2) is obtained which indicates that whether an approximation lies in Omega(2) depends on the rate of change and the smoothness of the flow vectors, and hence is problem-dependent. The choice of spatial differencing, of particular importance for the present method, is discussed. The treatment of boundary conditions is addressed, and the system of equations resulting from the foregoing analysis is summarized and solution strategies are discussed. The convergence of calculated solutions is demonstrated by comparing them with exact solutions to one and two-dimensional problems.

Liou, M.-S.↗

NASA NTRS1982

Numerical generation of composite three dimensional grids by quasilinear elliptic systems

A three-dimensional grid generation technique designed to numerically construct a boundary-conforming grid within a three-dimensional region bounded by a closed surface is described. The boundary values are generated numerically by a modified elliptic system and are used to compute grid control parameters that are contained in the elliptic systems. The interior grid distribution is governed by the distribution of points on the boundary as well as by the boundary's geometric shape. The composite three-dimensional grid remains both continuous and smooth across the surface of juncture between any two adjoining subregions. The details of the method and its implementation are presented, displaying numerical results for three-dimensional composite grid for a wing-body combination and surface grids.

Thomas, P. D.↗

NASA NTRS1985

Algebraic grid generation using tensor product B-splines

Finite difference methods are more successful if the accompanying grid has lines which are smooth and nearly orthogonal. The development of an algorithm which produces such a grid when given the boundary description. Topological considerations in structuring the grid generation mapping are discussed. The concept of the degree of a mapping and how it can be used to determine what requirements are necessary if a mapping is to produce a suitable grid is examined. The grid generation algorithm uses a mapping composed of bicubic B-splines. Boundary coefficients are chosen so that the splines produce Schoenberg's variation diminishing spline approximation to the boundary. Interior coefficients are initially chosen to give a variation diminishing approximation to the transfinite bilinear interpolant of the function mapping the boundary of the unit square onto the boundary grid. The practicality of optimizing the grid by minimizing a functional involving the Jacobian of the grid generation mapping at each interior grid point and the dot product of vectors tangent to the grid lines is investigated. Grids generated by using the algorithm are presented.

Saunders, B. V.↗

NASA NTRS1993

A nonconforming multigrid method using conforming subspaces

For second-order elliptic boundary value problems, we develop a nonconforming multigrid method using the coarser-grid correction on the conforming finite element subspaces. The convergence proof with an arbitrary number of smoothing steps for nu-cycle is presented.

Lee, Chang Ock↗

NASA NTRS1980

Geometric methods in computational fluid dynamics

General methods for the construction of geometric computational fluid dynamic algorithms are presented which simulate a variety of flow fields in various nontrivial regions. Included are: basic developments with tensors; various forms for the equations of motion; generalized numerical methods and boundary conditions; and methods for mesh generation to meet the strong geometric constraints of turbomachines. Coordinate generation is shown generally to yield mesh descriptions from one or more transformations that are smoothly joined together to form a composite mesh.

Eiseman, P. R.↗

NASA NTRS1983

Pseudospectral solution of two-dimensional gas-dynamic problems

Chebyshev pseudospectral methods are used to compute two dimensional smooth compressible flows. Grid refinement tests show that spectral accuracy can be obtained. Filtering is not needed if resolution is sufficiently high and if boundary conditions are carefully prescribed.

Kopriva, D. A.↗

NASA NTRS1991

Analysis of flight-measured boundary-layer stability and transition data

The paper concentrates on the computational analysis of both the Tollmien-Schlichting and crossflow-type instabilities using the results of a boundary-layer transition flight experiment on a smooth swept test surface. In addition, the effect of nonadiabatic wall conditions is analyzed using the measured surface temperature distribution on the boundary-layer development and stability growth. The computational methods utilized in analyzing the boundary-layer stability characteristics are discussed: one approach analyzes the Tollmien-Schlichting and crossflow instabilities independently with maximum Tollmien-Schlichting n-factors near nine and maximum crossflow n-factors near six at transition onset for separate cases, while the second approach analyzes the instabilities for maximum growth regardless of the type. As much as a 27-percent increase in n-factor is found at transition onset due to an increased Tollmien-Schlichting instability.

Obara, Clifford J.↗

NASA NTRS1992

The semi-discrete Galerkin finite element modelling of compressible viscous flow past an airfoil

A method is developed to solve the two-dimensional, steady, compressible, turbulent boundary-layer equations and is coupled to an existing Euler solver for attached transonic airfoil analysis problems. The boundary-layer formulation utilizes the semi-discrete Galerkin (SDG) method to model the spatial variable normal to the surface with linear finite elements and the time-like variable with finite differences. A Dorodnitsyn transformed system of equations is used to bound the infinite spatial domain thereby permitting the use of a uniform finite element grid which provides high resolution near the wall and automatically follows boundary-layer growth. The second-order accurate Crank-Nicholson scheme is applied along with a linearization method to take advantage of the parabolic nature of the boundary-layer equations and generate a non-iterative marching routine. The SDG code can be applied to any smoothly-connected airfoil shape without modification and can be coupled to any inviscid flow solver. In this analysis, a direct viscous-inviscid interaction is accomplished between the Euler and boundary-layer codes, through the application of a transpiration velocity boundary condition. Results are presented for compressible turbulent flow past NACA 0012 and RAE 2822 airfoils at various freestream Mach numbers, Reynolds numbers, and angles of attack. All results show good agreement with experiment, and the coupled code proved to be a computationally-efficient and accurate airfoil analysis tool.

Meade, Andrew J., Jr.↗

NASA NTRS1993

Semi-discrete Galerkin solution of the compressible boundary-layer equations with viscous-inviscid interaction

A semi-discrete Galerkin (SDG) method is under development to model attached, turbulent, and compressible boundary layers for transonic airfoil analysis problems. For the boundary-layer formulation the method models the spatial variable normal to the surface with linear finite elements and the time-like variable with finite differences. A Dorodnitsyn transformed system of equations is used to bound the infinite spatial domain thereby providing high resolution near the wall and permitting the use of a uniform finite element grid which automatically follows boundary-layer growth. The second-order accurate Crank-Nicholson scheme is applied along with a linearization method to take advantage of the parabolic nature of the boundary-layer equations and generate a non-iterative marching routine. The SDG code can be applied to any smoothly-connected airfoil shape without modification and can be coupled to any inviscid flow solver. In this analysis, a direct viscous-inviscid interaction is accomplished between the Euler and boundary-layer codes through the application of a transpiration velocity boundary condition. Results are presented for compressible turbulent flow past RAE 2822 and NACA 0012 airfoils at various freestream Mach numbers, Reynolds numbers, and angles of attack.

Day, Brad A.↗

NASA NTRS1980

Calculation of skin-friction coefficients for low Reynolds number turbulent boundary layer flows

An analysis is presented of the reliability of various generally accepted empirical expressions for the prediction of the skin-friction coefficient C/sub f/ of turbulent boundary layers at low Reynolds numbers in zero-pressure-gradient flows on a smooth flat plate. The skin-friction coefficients predicted from these expressions were compared to the skin-friction coefficients of experimental profiles that were determined from a graphical method formulated from the law of the wall. These expressions are found to predict values that are consistently different than those obtained from the graphical method over the range 600 Re/sub theta 2000. A curve-fitted empirical relationship was developed from the present data and yields a better estimated value of C/sub f/ in this range. The data, covering the range 200 Re/sub theta 7000, provide insight into the nature of transitional flows. They show that fully developed turbulent boundary layers occur at Reynolds numbers Re/sub theta/ down to 425. Below this level there appears to be a well-ordered evolutionary process from the laminar to the turbulent profiles. These profiles clearly display the development of the turbulent core region and the shrinking of the laminar sublayer with increasing values of Re/sub theta/.

Barr, P. K.↗

DOE OSTI2022

Physics‐Informed Machine Learning Method for Large‐Scale Data Assimilation Problems

Abstract We develop a physics‐informed machine learning approach for large‐scale data assimilation and parameter estimation and apply it for estimating transmissivity and hydraulic head in the two‐dimensional steady‐state subsurface flow model of the Hanford Site given synthetic measurements of said variables. In our approach, we extend the physics‐informed conditional Karhunen‐Loéve expansion (PICKLE) method to modeling subsurface flow with unknown flux (Neumann) and varying head (time‐dependent Dirichlet) boundary conditions. We demonstrate that the PICKLE method is comparable in accuracy with the standard maximum a posteriori (MAP) method, but is significantly faster than MAP for large‐scale problems. Both methods use a mesh to discretize the computational domain. In MAP, the parameters and states are discretized on the mesh; therefore, the size of the MAP parameter estimation problem directly depends on the mesh size. In PICKLE, the mesh is used to evaluate the residuals of the governing equation, while the parameters and states are approximated by the truncated conditional Karhunen‐Loéve expansions with the number of parameters controlled by the smoothness of the parameter and state fields, and not by the mesh size. For a considered example, we demonstrate that the computational cost of PICKLE increases near linearly (as N 1.15 ) with the number of grid nodes N , while that of MAP increases much faster (as N 3.28 ). We also show that once trained for one set of Dirichlet boundary conditions (i.e., one river stage), the PICKLE method provides accurate estimates of the hydraulic head for any value of the Dirichlet boundary conditions (i.e., for any river stage).

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1975

Computer simulation of transonic flow past airfoils with boundary layer correction

A computer program has been developed to solve the compressible flow equation for the velocity potential. The exterior of the airfoil is mapped onto the unit circle and the flow is computed on a grid in the circle plane. A relaxation method using backward differencing in the flow direction at supersonic points permits solutions for large supersonic areas. The pressure distribution resulting from the flow becomes the input to the von Karman momentum equation which when integrated gives the displacement thickness. This displacement thickness is smoothed and added to the airfoil to account for the turbulent boundary layer. The boundary layer correction is computed iteratively with the flow. Results from this program and test data agree well.

Bauer, F.↗

NASA NTRS2019

Extrusion of Complex Surface Meshes Utilizing Face Offsetting and Mean Curvature Smoothing

Grids for three-dimensional Computational Fluid Dynamics problems frequently require a prismatic layer of cells, typically extruded in the off-body direction from a two-dimensional surface mesh to properly resolve boundary layers. When the surface geometry is complex, the extrusion process can fail, resulting in the physical boundary layer being thicker than the prismatic layer, leading to under-resolved boundary layers. To address the shortcomings of existing grid generation tools, a new tool has been developed as part of the Mesh Tools suite, that is capable of extruding complex surface meshes. The new tool uses a face offsetting method to preserve surface curvature and a mean curvature smoothing algorithm to prevent the cells from self-intersecting in concave regions. Testing of the new tool found that not only were complex surface meshes able to be extruded to the desired thickness, but extrusion of simple surface meshes was also improved, due to the face offsetting method.

mesh extrusion↗

DOE OSTI2021

A coupled discontinuous Galerkin-Finite Volume framework for solving gas dynamics over embedded geometries

Herein, we present a computational framework for solving the equations of inviscid gas dynamics using structured grids with embedded geometries. The novelty of the proposed approach is the use of high-order discontinuous Galerkin (dG) schemes and a shock-capturing Finite Volume (FV) scheme coupled via an hp adaptive mesh refinement (hp-AMR) strategy that offers high-order accurate resolution of the embedded geometries. The hp-AMR strategy is based on a multi-level block-structured domain partition in which each level is represented by block-structured Cartesian grids and the embedded geometry is represented implicitly by a level set function. The intersection of the embedded geometry with the grids produces the implicitly-defined mesh that consists of a collection of regular rectangular cells plus a relatively small number of irregular curved elements in the vicinity of the embedded boundaries. High-order quadrature rules for implicitly-defined domains enable high-order accuracy resolution of the curved elements with a cell-merging strategy to address the small-cell problem. The hp-AMR algorithm treats the system with a second-order finite volume scheme at the finest level to dynamically track the evolution of solution discontinuities while using dG schemes at coarser levels to provide high-order accuracy in smooth regions of the flow. On the dG levels, the methodology supports different orders of basis functions on different levels. The space-discretized governing equations are then advanced explicitly in time using high-order Runge-Kutta algorithms. Numerical tests are presented for two-dimensional and three-dimensional problems involving an ideal gas. The results are compared with both analytical solutions and experimental observations and demonstrate that the framework provides high-order accuracy for smooth flows and accurately captures solution discontinuities.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1953

On transonic flow past a wave-shaped wall

This report is an extension of a previous investigation (described in NACA rep. 1069) concerned with the solution of the nonlinear differential equation for transonic flow past a wavy wall. In the present work several new notions are introduced which permit the solution of the recursion formulas arising from the method of integration in series. In addition, a novel numerical tests of convergence, applied to the power series (in transonic similarity parameter) representing the local Mach number distribution at the boundary, indicates that smooth symmetrical potential flow past the wavy wall is no longer possible once the critical value of the stream Mach number has been exceeded.

Kaplan, Carl↗