A family of position- and orientation-independent embedded boundary methods for viscous flow and fluid–structure interaction problems
Explore the source record for details and available documents.
SEARCH · Engineering Papers
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.
Explore the source record for details and available documents.
Many problems in aerodynamic design can be characterized by smooth and convex objective functions. This motivates the use of gradient-based algorithms, particularly for problems with a large number of design variables, to efficiently determine optimal shapes and configurations that maximize aerodynamic performance. Accurate and efficient computation of the gradient, however, remains a challenging task. In optimization problems where the number of design variables dominates the number of objectives and flow- dependent constraints, the cost of gradient computations can be significantly reduced by the use of the adjoint method. The problem of aerodynamic optimization using the adjoint method has been analyzed and validated for both structured and unstructured grids. The method has been applied to design problems governed by the potential, Euler, and Navier-Stokes equations and can be subdivided into the continuous and discrete formulations. Giles and Pierce provide a detailed review of both approaches. Most implementations rely on grid-perturbation or mapping procedures during the gradient computation that explicitly couple changes in the surface shape to the volume grid. The solution of the adjoint equation is usually accomplished using the same scheme that solves the governing flow equations. Examples of such code reuse include multistage Runge-Kutta schemes coupled with multigrid, approximate-factorization, line-implicit Gauss-Seidel, and also preconditioned GMRES. The development of the adjoint method for aerodynamic optimization problems on Cartesian grids has been limited. In contrast to implementations on structured and unstructured grids, Cartesian grid methods decouple the surface discretization from the volume grid. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin e t al. developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the Euler equations. In both approaches, a boundary condition is introduced to approximate the effects of the evolving surface shape that results in accurate gradient computation.
Computational Fluid Dynamics (CFD) is increasingly being used to both augment and create an aerodynamic performance database for aircraft configurations. This aerodynamic database contains the response of the aircraft to varying flight conditions and control surface deflections. The current work presents a novel method for calculating dynamic stability derivatives which reduces the computational cost over traditional unsteady CFD approaches by an order of magnitude, while still being applicable to arbitrarily complex geometries over a wide range of flow regimes. The primary thesis of this work is that the response to a forced motion can often be represented with a small, predictable number of frequency components without loss of accuracy. By resolving only those frequencies of interest, the computational effort is significantly reduced so that the routine calculation of dynamic derivatives becomes practical. The current implementation uses this same non-linear, frequency-domain approach and extends the application to the 3-D Euler equations. The current work uses a Cartesian, embedded-boundary method to automate the generation of dynamic stability derivatives.
Cartesian-mesh methods are perhaps the most promising approach for addressing the issues of flow solution automation for aerodynamic design problems. In these methods, the discretization of the wetted surface is decoupled from that of the volume mesh. This not only enables fast and robust mesh generation for geometry of arbitrary complexity, but also facilitates access to geometry modeling and manipulation using parametric Computer-Aided Design (CAD) tools. Our goal is to combine the automation capabilities of Cartesian methods with an eficient computation of design sensitivities. We address this issue using the adjoint method, where the computational cost of the design sensitivities, or objective function gradients, is esseutially indepeudent of the number of design variables. In previous work, we presented an accurate and efficient algorithm for the solution of the adjoint Euler equations discretized on Cartesian meshes with embedded, cut-cell boundaries. Novel aspects of the algorithm included the computation of surface shape sensitivities for triangulations based on parametric-CAD models and the linearization of the coupling between the surface triangulation and the cut-cells. The objective of the present work is to extend our adjoint formulation to problems involving general shape changes. Central to this development is the computation of volume-mesh sensitivities to obtain a reliable approximation of the objective finction gradient. Motivated by the success of mesh-perturbation schemes commonly used in body-fitted unstructured formulations, we propose an approach based on a local linearization of a mesh-perturbation scheme similar to the spring analogy. This approach circumvents most of the difficulties that arise due to non-smooth changes in the cut-cell layer as the boundary shape evolves and provides a consistent approximation tot he exact gradient of the discretized abjective function. A detailed gradient accurace study is presented to verify our approach. Thereafter, we focus on a shape optimization problem for an Apollo-like reentry capsule. The optimization seeks to enhance the lift-to-drag ratio of the capsule by modifyjing the shape of its heat-shield in conjunction with a center-of-gravity (c.g.) offset. This multipoint and multi-objective optimization problem is used to demonstrate the overall effectiveness of the Cartesian adjoint method for addressing the issues of complex aerodynamic design. This abstract presents only a brief outline of the numerical method and results; full details will be given in the final paper.
The development of embedded functions to represent the mean velocity and total enthalpy distributions in the wall layer of a supersonic turbulent boundary layer is considered. The asymptotic scaling laws (in the limit of large Reynolds number) for high speed compressible flows are obtained to facilitate eventual implementation of the embedded functions in a general prediction method. A self-consistent asymptotic structure is derived, as well as a compressible law of the wall in which the velocity and total enthalpy are logarithmic within the overlap zone, but in the Howarth-Dorodnitsyn variable. Simple outer region turbulence models are proposed (some of which are modifications of existing incompressible models) to reflect the effects of compressibility. As a test of the methodology and the new turbulence models, a set of self-similar outer region profiles is obtained for constant pressure flow; these are then coupled with embedded functions in the wall layer. The composite profiles thus obtained are compared directly with experimental data and good agreement is obtained for flows with Mach numbers up to 10.
The work presents a new method for on-the-fly domain decomposition technique for mapping grids and solution algorithms to parallel machines, and is applicable to both shared-memory and message-passing architectures. It will be demonstrated on the Cray T3E, HP Exemplar, and SGI Origin 2000. Computing time has been secured on all these platforms. The decomposition technique is an outgrowth of techniques used in computational physics for simulations of N-body problems and the event horizons of black holes, and has not been previously used by the CFD community. Since the technique offers on-the-fly partitioning, it offers a substantial increase in flexibility for computing in heterogeneous environments, where the number of available processors may not be known at the time of job submission. In addition, since it is dynamic it permits the job to be repartitioned without global communication in cases where additional processors become available after the simulation has begun, or in cases where dynamic mesh adaptation changes the mesh size during the course of a simulation. The platform for this partitioning strategy is a completely new Cartesian Euler solver tarcreted at parallel machines which may be used in conjunction with Ames' "Cart3D" arbitrary geometry simulation package.
Preliminary verification and validation of an efficient Euler solver for adaptively refined Cartesian meshes with embedded boundaries is presented. The parallel, multilevel method makes use of a new on-the-fly parallel domain decomposition strategy based upon the use of space-filling curves, and automatically generates a sequence of coarse meshes for processing by the multigrid smoother. The coarse mesh generation algorithm produces grids which completely cover the computational domain at every level in the mesh hierarchy. A series of examples on realistically complex three-dimensional configurations demonstrate that this new coarsening algorithm reliably achieves mesh coarsening ratios in excess of 7 on adaptively refined meshes. Numerical investigations of the scheme's local truncation error demonstrate an achieved order of accuracy between 1.82 and 1.88. Convergence results for the multigrid scheme are presented for both subsonic and transonic test cases and demonstrate W-cycle multigrid convergence rates between 0.84 and 0.94. Preliminary parallel scalability tests on both simple wing and complex complete aircraft geometries shows a computational speedup of 52 on 64 processors using the run-time mesh partitioner.
A new method of computing jet noise, called mSrc, was developed on the general principles of acoustic analogies. In the method, the problem of translating turbulent flow energy into acoustic energy at a far-field observer is broken into two parts, a calculation of acoustic source strengths and then their propagation. The acoustic sources are related to turbulent quantities in the jet plume in a robust manner. The propagation, which is more properly computed using a Green's function accounting for nonuniform speed of sound and solid surfaces, is instead modeled using commonly observed features of jet acoustic far field directivity, and by diffraction barrier theory for surfaces. The mSrc method does not require gradients of the predicted flow field, allowing it to make use of robust unstructured RANS CFD methods, including embedded boundary codes. Such codes do not require specification of surface meshes, and auto-refine their grid to resolve flow gradients, putting resolution where it is required without a priori user input. The ability of mSrc to use such radically unstructured flow input results in an efficient method of estimating noise from jet flows from complex nozzles installed on aircraft. Many validation cases are presented to demonstrate the accuracy and range of applicability of the mSrc method for representative jet noise applications.
A new method of computing jet noise, called mSrc, was developed on the general principles of acoustic analogies. In the method, the problem of translating turbulent flow energy into acoustic energy at a far-field observer is broken into two parts, a calculation of acoustic source strengths and then their propagation. The acoustic sources are related to turbulent quantities in the jet plume in a robust manner. The propagation, which is more properly computed using a Green's function accounting for nonuniform speed of sound and solid surfaces, is instead modeled using commonly observed features of jet acoustic far field directivity, and by diffraction barrier theory for surfaces. The mSrc method does not require gradients of the predicted flow field, allowing it to make use of robust unstructured RANS CFD methods, including embedded boundary codes. Such codes do not require specification of surface meshes, and auto-refine their grid to resolve flow gradients, putting resolution where it is required without a priori user input. The ability of mSrc to use such radically unstructured flow input results in an efficient method of estimating noise from jet flows from complex nozzles installed on aircraft. Many validation cases are presented to demonstrate the accuracy and range of applicability of the mSrc method for representative jet noise applications.
Automated, high-fidelity tools for aerodynamic design face critical issues in attempting to optimize real-life geometry arid in permitting radical design changes. Success in these areas promises not only significantly shorter design- cycle times, but also superior and unconventional designs. To address these issues, we investigate the use of a parmetric-CAD system in conjunction with an embedded-boundary Cartesian method. Our goal is to combine the modeling capabilities of feature-based CAD with the robustness and flexibility of component-based Cartesian volume-mesh generation for complex geometry problems. We present the development of an automated optimization frame-work with a focus on the deployment of such a CAD-based design approach in a heterogeneous parallel computing environment.
The proposed paper reports advances in developing a method for high Reynolds number compressible viscous flow simulations using a Cartesian cut-cell method with embedded boundaries. This preliminary work focuses on accuracy of the discretization near solid wall boundaries. A model problem is used to investigate the accuracy of various difference stencils for second derivatives and to guide development of the discretization of the viscous terms in the Navier-Stokes equations. Near walls, quadratic reconstruction in the wall-normal direction is used to mitigate mesh irregularity and yields smooth skin friction distributions along the body. Multigrid performance is demonstrated using second-order coarse grid operators combined with second-order restriction and prolongation operators. Preliminary verification and validation for the method is demonstrated using flat-plate and airfoil examples at compressible Mach numbers. Simulations of flow on laminar and turbulent flat plates show skin friction and velocity profiles compared with those from boundary-layer theory. Airfoil simulations are performed at laminar and turbulent Reynolds numbers with results compared to both other simulations and experimental data
An embedded-boundary, Cartesian-mesh flow solver is coupled with a three degree-of-freedom structural model to perform static, aeroelastic analysis of complex aircraft geometries. The approach solves a nonlinear, aerostructural system of equations using a loosely-coupled strategy. An open-source, 3-D discrete-geometry engine is utilized to deform a triangulated surface geometry according to the shape predicted by the structural model under the computed aerodynamic loads. The deformation scheme is capable of modeling large deflections and is applicable to the design of modern, very-flexible transport wings. The coupling interface is modular so that aerodynamic or structural analysis methods can be easily swapped or enhanced. After verifying the structural model with comparisons to Euler beam theory, two applications of the analysis method are presented as validation. The first is a relatively stiff, transport wing model which was a subject of a recent workshop on aeroelasticity. The second is a very flexible model recently tested in a low speed wind tunnel. Both cases show that the aeroelastic analysis method produces results in excellent agreement with experimental data.
Structural and energetics properties of atoms near a grain boundary are of great importance from theoretical and experimental standpoints. From various experimental work it is concluded that diffusion at low temperatures at polycrystalline materials take place near grain boundary. Experimental and theoretical results also indicate changes of up to 70 percent in physical properties near a grain boundary. The Embedded Atom Method (EAM) calculations on structural properties of Au twist grain boundaries are in quite good agreement with their experimental counterparts. The EAM is believed to predict reliable values for the single vacancy formation energy as well as migration energy. However, it is not clear whether the EAM functions which are fitted to the bulk properties of a perfect crystalline solid can produce reliable results on grain boundaries. One of the objectives of this work is to construct the EAM functions for Cu and use them in conjunction with the molecular static simulation to study structures and energetics of atoms near twist grain boundaries in Cu. This provides tests of the EAM functions near a grain boundary. In particular, we determine structure, single vacancy formation energy, migration energy, single vacancy activation energy, and interlayer spacing as a function of distance from grain boundary. Our results are compared with the available experimental and theoretical results from grain boundaries and bulk.
Simulation results for the First AIAA Sonic Boom Prediction Workshop (LBW1) are presented using an inviscid, embedded-boundary Cartesian mesh method. The method employs adjoint-based error estimation and adaptive meshing to automatically determine resolution requirements of the computational domain. Results are presented for both mandatory and optional test cases. These include an axisymmetric body of revolution, a 69deg delta wing model and a complete model of the Lockheed N+2 supersonic tri-jet with V-tail and flow through nacelles. In addition to formal mesh refinement studies and examination of the adjoint-based error estimates, mesh convergence is assessed by presenting simulation results for meshes at several resolutions which are comparable in size to the unstructured grids distributed by the workshop organizers. Data provided includes both the pressure signals required by the workshop and information on code performance in both memory and processing time. Various enhanced techniques offering improved simulation efficiency will be demonstrated and discussed.
The results are presented of a series of computational experiments aimed at studying the characteristics of time-dependent turbulent boundary layers with embedded reversed-flow regions. A calculation method developed earlier was extended to boundary layers with reversed flows for this purpose. The calculations were performed for an idealized family of external velocity distributions, and covered a range of degrees of unsteadiness. The results confirmed those of previous studies in demonstrating that the point of flow reversal is nonsingular in a time-dependent boundary layer. A singularity was observed to develop downstream of reversal, under certain conditions, accompanied by the breakdown of the boundary-layer approximations. A tentative hypothesis was advanced in an attempt to predict the appearance of the singularity, and is shown to be consistent with the calculated results.
We introduce the path resistance method for lower bounds on the smallest nontrivial eigenvalue of the Laplacian matrix of a graph. The method is based on viewing the graph in terms of electrical circuits; it uses clique embeddings to produce lower bounds on lambda(sub 2) and star embeddings to produce lower bounds on the smallest Rayleigh quotient when there is a zero Dirichlet boundary condition. The method assigns priorities to the paths in the embedding; we show that, for an unweighted tree T, using uniform priorities for a clique embedding produces a lower bound on lambda(sub 2) that is off by at most an 0(log diameter(T)) factor. We show that the best bounds this method can produce for clique embeddings are the same as for a related method that uses clique embeddings and edge lengths to produce bounds.
The proposed paper will present recent extensions in the development of an efficient Euler solver for adaptively-refined Cartesian meshes with embedded boundaries. The paper will focus on extensions of the basic method to include solution adaptation, time-dependent flow simulation, and arbitrary rigid domain motion. The parallel multilevel method makes use of on-the-fly parallel domain decomposition to achieve extremely good scalability on large numbers of processors, and is coupled with an automatic coarse mesh generation algorithm for efficient processing by a multigrid smoother. Numerical results are presented demonstrating parallel speed-ups of up to 435 on 512 processors. Solution-based adaptation may be keyed off truncation error estimates using tau-extrapolation or a variety of feature detection based refinement parameters. The multigrid method is extended to for time-dependent flows through the use of a dual-time approach. The extension to rigid domain motion uses an Arbitrary Lagrangian-Eulerlarian (ALE) formulation, and results will be presented for a variety of two- and three-dimensional example problems with both simple and complex geometry.
The extension of computational fluid dynamics techniques to artificial heart flow simulations is illustrated. Unsteady incompressible Navier-Stokes equations written in 3-D generalized curvilinear coordinates are solved iteratively at each physical time step until the incompressibility condition is satisfied. The solution method is based on the pseudo compressibility approach and uses an implicit upwind differencing scheme together with the Gauss-Seidel line relaxation method. The efficiency and robustness of the time accurate formulation of the algorithm are tested by computing the flow through model geometries. A channel flow with a moving indentation is computed and validated with experimental measurements and other numerical solutions. In order to handle the geometric complexity and the moving boundary problems, a zonal method and an overlapping grid embedding scheme are used, respectively. Steady state solutions for the flow through a tilting disk heart valve was compared against experimental measurements. Good agreement was obtained. The flow computation during the valve opening and closing is carried out to illustrate the moving boundary capability.