DOCSLIB.ORG

Computational Fluid Dynamics

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Computational Fluid Dynamics Computational fluid dynamics Computational fluid dynamics, usually abbreviated as The fundamental basis of almost all CFD problems are CFD, is a branch of fluid mechanics that uses numerical the Navier–Stokes equations, which define any single- analysis and algorithms to solve and analyze problems that phase (gas or liquid, but not both) fluid flow. These involve fluid flows. Computers are used to perform the equations can be simplified by removing terms de- calculations required to simulate the interaction of liquids scribing viscous actions to yield the Euler equations. and gases with surfaces defined by boundary conditions. Further simplification, by removing terms describing With high-speed supercomputers, better solutions can be vorticity yields the full potential equations. Finally, for achieved. Ongoing research yields software that improves small perturbations in subsonic and supersonic flows (not the accuracy and speed of complex simulation scenarios transonic or hypersonic) these equations can be linearized such as transonic or turbulent flows. Initial experimen- to yield the linearized potential equations. tal validation of such software is performed using a wind Historically, methods were first developed to solve the tunnel with the final validation coming in full-scale test- linearized potential equations. Two-dimensional (2D) ing, e.g. flight tests. methods, using conformal transformations of the flow about a cylinder to the flow about an airfoil were devel- oped in the 1930s.[1] 1 Background and history One of the earliest type of calculations resembling mod- ern CFD are those by Lewis Fry Richardson, in the sense that these calculations used finite differences and divided the physical space in cells. Although they failed dra- matically, these calculations, together with Richardson’s book “Weather prediction by numerical process”,[2] set the basis for modern CFD and numerical meteorology. In fact, early CFD calculations during the 1940s using ENIAC used methods close to those in Richardson’s 1922 book.[3] The computer power available paced development of three-dimensional methods. Probably the first work using computers to model fluid flow, as governed by the Navier- Stokes equations, was performed at Los Alamos National Lab, in the T3 group.[4][5] This group was led by Francis H. Harlow, who is widely considered as one of the pio- neers of CFD. From 1957 to late 1960s, this group de- A computer simulation of high velocity air flow around the Space Shuttle during re-entry. veloped a variety of numerical methods to simulate tran- sient two-dimensional fluid flows, such as Particle-in-cell method (Harlow, 1957),[6] Fluid-in-cell method (Gen- try, Martin and Daly, 1966),[7] Vorticity stream func- tion method (Jake Fromm, 1963),[8] and Marker-and-cell method (Harlow and Welch, 1965).[9] Fromm’s vorticity- stream-function method for 2D, transient, incompressible flow was the first treatment of strongly contorting incom- pressible flows in the world. The first paper with three-dimensional model was published by John Hess and A.M.O. Smith of Douglas Aircraft in 1967.[10] This method discretized the surface of the geometry with panels, giving rise to this class of programs being called Panel Methods. Their method itself was simplified, in that it did not include lifting A simulation of the Hyper-X scramjet vehicle in operation at flows and hence was mainly applied to ship hulls and Mach−7 1 2 2 METHODOLOGY aircraft fuselages. The first lifting Panel Code (A230) at Grumman Aircraft and the Courant Institute of NYU, was described in a paper written by Paul Rubbert and worked with David Caughey to develop the important Gary Saaris of Boeing Aircraft in 1968.[11] In time, three-dimensional Full Potential code FLO22[28] in 1975. more advanced three-dimensional Panel Codes were Many Full Potential codes emerged after this, culminat- developed at Boeing (PANAIR, A502),[12] Lockheed ing in Boeing’s Tranair (A633) code,[29] which still sees (Quadpan),[13] Douglas (HESS),[14] McDonnell Air- heavy use. craft (MACAERO),[15] NASA (PMARC)[16] and [17] [18] The next step was the Euler equations, which promised to Analytical Methods (WBAERO, USAERO provide more accurate solutions of transonic flows. The and VSAERO[19][20]). Some (PANAIR, HESS and methodology used by Jameson in his three-dimensional MACAERO) were higher order codes, using higher FLO57 code[30] (1981) was used by others to pro- order distributions of surface singularities, while others duce such programs as Lockheed’s TEAM program[31] (Quadpan, PMARC, USAERO and VSAERO) used and IAI/Analytical Methods’ MGAERO program.[32] single singularities on each surface panel. The advantage MGAERO is unique in being a structured cartesian of the lower order codes was that they ran much faster mesh code, while most other such codes use struc- on the computers of the time. Today, VSAERO has tured body-fitted grids (with the exception of NASA’s grown to be a multi-order code and is the most widely highly successful CART3D code,[33] Lockheed’s SPLIT- used program of this class. It has been used in the devel- FLOW code[34] and Georgia Tech's NASCART-GT).[35] opment of many submarines, surface ships, automobiles, Antony Jameson also developed the three-dimensional helicopters, aircraft, and more recently wind turbines. AIRPLANE code[36] which made use of unstructured Its sister code, USAERO is an unsteady panel method tetrahedral grids. that has also been used for modeling such things as high speed trains and racing yachts. The NASA PMARC In the two-dimensional realm, Mark Drela and Michael code from an early version of VSAERO and a derivative Giles, then graduate students at MIT, developed the ISES of PMARC, named CMARC,[21] is also commercially Euler program[37] (actually a suite of programs) for air- available. foil design and analysis. This code first became available in 1986 and has been further developed to design, ana- In the two-dimensional realm, a number of Panel Codes lyze and optimize single or multi-element airfoils, as the have been developed for airfoil analysis and design. MSES program.[38] MSES sees wide use throughout the The codes typically have a boundary layer analysis in- world. A derivative of MSES, for the design and anal- cluded, so that viscous effects can be modeled. Pro- ysis of airfoils in a cascade, is MISES,[39] developed by fessor Richard Eppler of the University of Stuttgart de- Harold “Guppy” Youngren while he was a graduate stu- veloped the PROFILE code, partly with NASA fund- dent at MIT. ing, which became available in the early 1980s.[22] This was soon followed by MIT Professor Mark Drela’s The Navier–Stokes equations were the ultimate tar- XFOIL code.[23] Both PROFILE and XFOIL incorpo- get of development. Two-dimensional codes, such as rate two-dimensional panel codes, with coupled bound- NASA Ames’ ARC2D code first emerged. A number ary layer codes for airfoil analysis work. PROFILE uses of three-dimensional codes were developed (ARC3D, a conformal transformation method for inverse airfoil de- OVERFLOW, CFL3D are three successful NASA con- sign, while XFOIL has both a conformal transformation tributions), leading to numerous commercial packages. and an inverse panel method for airfoil design. An intermediate step between Panel Codes and Full Potential codes were codes that used the Transonic 2 Methodology Small Disturbance equations. In particular, the three- dimensional WIBCO code,[24] developed by Charlie In all of these approaches the same basic procedure is Boppe of Grumman Aircraft in the early 1980s has seen followed. heavy use. • During preprocessing Developers turned to Full Potential codes, as panel meth- ods could not calculate the non-linear flow present at • The geometry (physical bounds) of the prob- transonic speeds. The first description of a means of us- lem is defined. ing the Full Potential equations was published by Earll • The volume occupied by the fluid is divided Murman and Julian Cole of Boeing in 1970.[25] Frances into discrete cells (the mesh). The mesh may Bauer, Paul Garabedian and David Korn of the Courant be uniform or non-uniform. Institute at New York University (NYU) wrote a se- • The physical modeling is defined – for exam- ries of two-dimensional Full Potential airfoil codes that ple, the equations of motion + enthalpy + ra- were widely used, the most important being named Pro- diation + species conservation [26] gram H. A further growth of Program H was de- • Boundary conditions are defined. This in- veloped by Bob Melnik and his group at Grumman volves specifying the fluid behaviour and prop- [27] Aerospace as Grumfoil. Antony Jameson, originally erties at the boundaries of the problem. For 2.1 Discretization methods 3 transient problems, the initial conditions are a conservative solution. The FEM formulation has been also defined. adapted for use with fluid dynamics governing equations. Although FEM must be carefully formulated to be con- • The simulation is started and the equations are servative, it is much more stable than the finite volume solved iteratively as a steady-state or transient. approach.[41] However, FEM can require more memory [42] • Finally a postprocessor is used for the analysis and and has slower solution times than the FVM. visualization of the resulting solution. In this method, a weighted residual equation is formed: 2.1 Discretization methods ZZZ e Ri = WiQ dV Further information: Discretization of Navier–Stokes equations where Ri is the equation residual at an element vertex i , Q is the conservation equation expressed on an element basis, W is the weight factor, and V e is the volume of The stability of the selected discretisation is generally es- i tablished numerically rather than analytically as with sim- the element. ple linear problems. Special care must also be taken to ensure that the discretisation handles discontinuous solu- 2.1.3 Finite difference method tions gracefully.
Load more

Recommended publications
  • Efficient Spectral-Galerkin Method I. Direct Solvers for the Second And
    SIAM J. SCI. COMPUT. °c 1994 Society for Industrial and Applied Mathematics Vol. 15, No. 6, pp. 1489{1505, November 1994 013 E±cient Spectral-Galerkin Method I. Direct Solvers for the Second and Fourth Order Equations Using Legendre Polynomials¤ Jie Sheny Abstract. We present some e±cient algorithms based on the Legendre-Galerkin approxima- tions for the direct solution of the second and fourth order elliptic equations. The key to the e±ciency of our algorithms is to construct appropriate base functions, which lead to systems with sparse matri- ces for the discrete variational formulations. The complexities of the algorithms are a small multiple of N d+1 operations for a d dimensional domain with (N ¡ 1)d unknowns, while the convergence rates of the algorithms are exponential for problems with smooth solutions. In addition, the algorithms can be e®ectively parallelized since the bottlenecks of the algorithms are matrix-matrix multiplications. Key words. spectral-Galerkin method, Legendre polynomial, Helmholtz equation, biharmonic equation, direct solver AMS subject classi¯cations. 65N35, 65N22, 65F05, 35J05 1. Introduction. This article is the ¯rst in a series for developing e±cient spectral Galerkin algorithms for elliptic problems. The spectral method employs global polynomials as the trial functions for the discretization of partial di®erential equations. It provides very accurate approximations with a relatively small number of unknowns. Consequently it has gained increasing popularity in the last two decades, especially in the ¯eld of computational fluid dynamics (see [11], [8] and the references therein). The use of di®erent test functions in a variational formulation leads to three most commonly used spectral schemes, namely, the Galerkin, tau and collocation versions.
    [Show full text]
  • Family Name Given Name Presentation Title Session Code
    Family Name Given Name Presentation Title Session Code Abdoulaev Gassan Solving Optical Tomography Problem Using PDE-Constrained Optimization Method Poster P Acebron Juan Domain Decomposition Solution of Elliptic Boundary Value Problems via Monte Carlo and Quasi-Monte Carlo Methods Formulations2 C10 Adams Mark Ultrascalable Algebraic Multigrid Methods with Applications to Whole Bone Micro-Mechanics Problems Multigrid C7 Aitbayev Rakhim Convergence Analysis and Multilevel Preconditioners for a Quadrature Galerkin Approximation of a Biharmonic Problem Fourth-order & ElasticityC8 Anthonissen Martijn Convergence Analysis of the Local Defect Correction Method for 2D Convection-diffusion Equations Flows C3 Bacuta Constantin Partition of Unity Method on Nonmatching Grids for the Stokes Equations Applications1 C9 Bal Guillaume Some Convergence Results for the Parareal Algorithm Space-Time ParallelM5 Bank Randolph A Domain Decomposition Solver for a Parallel Adaptive Meshing Paradigm Plenary I6 Barbateu Mikael Construction of the Balancing Domain Decomposition Preconditioner for Nonlinear Elastodynamic Problems Balancing & FETIC4 Bavestrello Henri On Two Extensions of the FETI-DP Method to Constrained Linear Problems FETI & Neumann-NeumannM7 Berninger Heiko On Nonlinear Domain Decomposition Methods for Jumping Nonlinearities Heterogeneities C2 Bertoluzza Silvia The Fully Discrete Fat Boundary Method: Optimal Error Estimates Formulations2 C10 Biros George A Survey of Multilevel and Domain Decomposition Preconditioners for Inverse Problems in Time-dependent
    [Show full text]
  • Turbulent Transition Simulation and Particulate Capture Modeling with an Incompressible Lattice Boltzmann Method
    Michigan Technological University Digital Commons @ Michigan Tech Dissertations, Master's Theses and Master's Reports 2017 TURBULENT TRANSITION SIMULATION AND PARTICULATE CAPTURE MODELING WITH AN INCOMPRESSIBLE LATTICE BOLTZMANN METHOD John R. Murdock Michigan Technological University, [email protected] Copyright 2017 John R. Murdock Recommended Citation Murdock, John R., "TURBULENT TRANSITION SIMULATION AND PARTICULATE CAPTURE MODELING WITH AN INCOMPRESSIBLE LATTICE BOLTZMANN METHOD", Open Access Dissertation, Michigan Technological University, 2017. https://doi.org/10.37099/mtu.dc.etdr/525 Follow this and additional works at: https://digitalcommons.mtu.edu/etdr Part of the Applied Mechanics Commons, Computer-Aided Engineering and Design Commons, and the Heat Transfer, Combustion Commons TURBULENT TRANSITION SIMULATION AND PARTICULATE CAPTURE MODELING WITH AN INCOMPRESSIBLE LATTICE BOLTZMANN METHOD By John R. Murdock A DISSERTATION Submitted in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY In Mechanical Engineering-Engineering Mechanics MICHIGAN TECHNOLOGICAL UNIVERSITY 2017 © 2017 John R. Murdock This dissertation has been approved in partial fulfillment of the requirements for the Degree of DOCTOR OF PHILOSOPHY in Mechanical Engineering-Engineering Mechanics. Department of Mechanical Engineering-Engineering Mechanics Dissertation Advisor: Dr. Song-Lin Yang Committee Member: Dr. Franz X. Tanner Committee Member: Dr. Kazuya Tajiri Committee Member: Dr. Youngchul Ra Department Chair: Dr. William W. Predebon
    [Show full text]
  • A Space-Time Discontinuous Galerkin Spectral Element Method for the Stefan Problem
    Noname manuscript No. (will be inserted by the editor) A Space-Time Discontinuous Galerkin Spectral Element Method for the Stefan problem Chaoxu Pei · Mark Sussman · M. Yousuff Hussaini Received: / Accepted: Abstract A space-time Discontinuous Galerkin (DG) spectral element method is presented to solve the Stefan problem in an Eulerian coordinate system. In this scheme, the level set method describes the time evolving interface. To deal with the prior unknown interface, two global transformations, a backward transformation and a forward transformation, are introduced in the space-time mesh. The idea of the transformations is to combine an Eulerian description, i.e. a fixed frame of reference, with a Lagrangian description, i.e. a moving frame of reference. The backward transformation maps the unknown time- varying interface in the fixed frame of reference to a known stationary inter- face in the moving frame of reference. In the moving frame of reference, the transformed governing equations, written in the space-time framework, are discretized by a DG spectral element method in each space-time slab. The forward transformation is used to update the level set function and then to project the solution in each phase onto the new corresponding time-dependent domain. Two options for calculating the interface velocity are presented, and both methods exhibit spectral accuracy. Benchmark tests in one spatial di- mension indicate that the method converges with spectral accuracy in both space and time for both the temperature distribution and the interface ve- locity. The interrelation between the interface position and the temperature makes the Stefan problem a nonlinear problem; a Picard iteration algorithm is introduced in order to solve the nonlinear algebraic system of equations and it is found that only a few iterations lead to convergence.
    [Show full text]
  • Large Eddy Simulation of Turbulent Flow Over a Backward-Facing Step
    IT 18 009 Examensarbete 45 hp Mars 2018 Large Eddy Simulation of Turbulent Flow over a Backward-Facing Step Edmond Shehadi Institutionen för informationsteknologi Department of Information Technology Abstract Large Eddy Simulation of Turbulent Flow over a Backward-Facing Step Edmond Shehadi Teknisk- naturvetenskaplig fakultet UTH-enheten This work studies the effect of grid resolution and subgrid scale modeling on the predictive accuracy of Large Eddy Simulation. In particular, the problems considered Besöksadress: are: turbulent flow over a backward-facing step and fully-developed turbulent channel Ångströmlaboratoriet Lägerhyddsvägen 1 flow. A SGS-free model and four subgrid scale models are used: Smagorsinky, Hus 4, Plan 0 k-equation, dynamic k-equation and WALE. Different combinations of streamwise and spanwise grid resolutions are considered along with different strategies for the Postadress: cell-size distribution in the wall-normal direction. Box 536 751 21 Uppsala First, a detailed study pertaining to fully-developed turbulent channel flow is Telefon: presented for target friction Reynolds numbers 180 and 300. A symmetric 018 – 471 30 03 three-layered wall-normal meshing strategy in conjunction with a SGS-free model is Telefax: shown to be the best compromise between computational efficiency and agreement 018 – 471 30 00 with benchmark data. Overall, the accuracy of the results was observed to be most sensitive to the spanwise resolution of the grid. Cell sizes in wall units ranging in Hemsida: between 25-28 and 12-20 in the streamwise and spanwise directions, respectively, http://www.teknat.uu.se/student yielded excellent agreement with reference data. Second, a detailed study of turbulent flow over a backward-facing step at a step-height Reynolds number of 5100 is conducted.
    [Show full text]
  • Spectral Element Simulations of Laminar and Turbulent Flows in Complex Geometries
    Applied Numerical Mathematics 6 (1989/90) 85-105 85 North-Holland SPECTRAL ELEMENT SIMULATIONS OF LAMINAR AND TURBULENT FLOWS IN COMPLEX GEOMETRIES George Em KARNIADAKIS* Center for Turbulence Research, Stanford University/NASA Ames Research Center, Stanford, CA 94305, USA Spectral element methods are high-order weighted residual techniques based on spectral expansions of variables and geometry for the Navier-Stokes and transport equations . Their success in the recent past in simulating flows of industrial complexity derives from the flexibility of the method to accurately represent nontrivial geometries while preserving the good resolution properties of the spectral methods . In this paper, we review some of the main ideas of the method with emphasis placed on implementation and data management . These issues need special attention in order to make the method efficient in practice, especially in view of the fact that high computing cost as well as strenuous storage requirements have been a major drawback of high-order methods in the past . Several unsteady, laminar complex flows are simulated, and a direct simulation of turbulent channel flow is presented, for the first time, using spectral element techniques . 1 . Introduction Spectral methods have proven in recent years a very powerful tool for analyzing fluid flows and have been used almost exclusively in direct simulations of transitional and turbulent flows [8]. To date, however, only simple geometry turbulent flows have been studied accurately [14], chiefly because of the poor performance of global spectral methods in representing more complex geometries. The development of the spectral element method [26] and its success to accurately simulate highly unsteady, two-dimensional laminar flows [6,13] suggests that a three-dimensional implementation may be the right approach to direct simulations of turbulent flows in truly complex geometries.
    [Show full text]
  • Hybrid Multigrid/Schwarz Algorithms for the Spectral Element Method
    Hybrid Multigrid/Schwarz Algorithms for the Spectral Element Method James W. Lottes¤ and Paul F. Fischery February 4, 2004 Abstract We study the performance of the multigrid method applied to spectral element (SE) discretizations of the Poisson and Helmholtz equations. Smoothers based on finite element (FE) discretizations, overlapping Schwarz methods, and point-Jacobi are con- sidered in conjunction with conjugate gradient and GMRES acceleration techniques. It is found that Schwarz methods based on restrictions of the originating SE matrices converge faster than FE-based methods and that weighting the Schwarz matrices by the inverse of the diagonal counting matrix is essential to effective Schwarz smoothing. Sev- eral of the methods considered achieve convergence rates comparable to those attained by classic multigrid on regular grids. 1 Introduction The availability of fast elliptic solvers is essential to many areas of scientific computing. For unstructured discretizations in three dimensions, iterative solvers are generally optimal from both work and storage standpoints. Ideally, one would like to have computational complexity that scales as O(n) for an n-point grid problem in lRd, implying that the it- eration count should be bounded as the mesh is refined. Modern iterative methods such as multigrid and Schwarz-based domain decomposition achieve bounded iteration counts through the introduction of multiple representations of the solution (or the residual) that allow efficient elimination of the error at each scale. The theory for these methods is well established for classical finite difference (FD) and finite element (FE) discretizations, and order-independent convergence rates are often attained in practice. For spectral element (SE) methods, there has been significant work on the development of Schwarz-based methods that employ a combination of local subdomain solves and sparse global solves to precondition conjugate gradient iteration.
    [Show full text]
  • SCHWARZ Rr'"YPE DOMAIN DECOMPOSITION ]\1ETHODS FOR
    SCHWARZ rr'"YPE DOMAIN DECOMPOSITION ]\1ETHODS FOR St<EC'l'RAL ELEMENT DISCRETIZATIONS Shannon S. Pahl University of the Witwatersrand December 1993 .() Degree awarded with distinction on 30 June 1994. , o A research report submitted to the Faculty of Science in partial fulfillment of the requirements 'L for the degree of Mastel' of Science at the University of the Witwatersrand, Johannesburg. () II " Abstract Most cf the theory for domain decomposition methods of Schwarz tyne has been set in the framework of the h ~',ndp~version finite element method. In this study, Schwarz methods are formulated for both the conforming and nonconforming spectral element discretizations applied to linear scalar self adjoint second order elliptic problems in two dimensions. An overlapping additive Schwarz method for the conforming spectral element discretization is formulated. However, unlike p~nnite element discretizations, a minimum overlap strategy com- mon to h-J11niteelement discret)zations can be accommodated. Computational results indicate if that the convergence rate of the overlapping Schwarz method is similar for the corresponding method defined for the h-finite element discretization. It is also shown that the minimum over- lap additive Schwarz method results in significantly fewer floating point operations than finite element preconditioning for the spectral element method. Iterative substructuring and Neumann-Neumann methods carealso formulated for the conforming spectral element discretization. These methods demonstrate greater robustness when increasing the degree p of the elements than the minimum overlap additive Schwarz method. Computa- tionally, convergencerates are also similar for the corresponding methods defined for the h-finite element discretization. In addition, an efficient interface preconditioner for iterative substruc- turing methods is employed which does not degrade the performance of the method for tY..e problems considered.
    [Show full text]
  • NONCONFORMING FORMULATIONS with SPECTRAL ELEMENT METHODS a Dissertation by CUNEYT SERT Submitted to the Office of Graduate Studi
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Texas A&amp;M Repository NONCONFORMING FORMULATIONS WITH SPECTRAL ELEMENT METHODS A Dissertation by CUNEYT SERT Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY August 2003 Major Subject: Mechanical Engineering NONCONFORMING FORMULATIONS WITH SPECTRAL ELEMENT METHODS A Dissertation by CUNEYT SERT Submitted to Texas A&M University in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY Approved as to style and content by: Ali Beskok (Chair of Committee) J. N. Reddy N. K. Anand (Member) (Member) Paul Cizmas Dennis O’Neal (Member) (Head of Department) August 2003 Major Subject: Mechanical Engineering iii ABSTRACT Nonconforming Formulations with Spectral Element Methods. (August 2003) Cuneyt Sert, B.S., Middle East Technical University; M.S., Middle East Technical University Chair of Advisory Committee: Dr. Ali Beskok A spectral element algorithm for solution of the incompressible Navier-Stokes and heat transfer equations is developed, with an emphasis on extending the classical conforming Galerkin formulations to nonconforming spectral elements. The new algorithm employs both the Constrained Approximation Method (CAM), and the Mortar Element Method (MEM) for p-and h-type nonconforming elements. Detailed descriptions, and formulation steps for both methods, as well as the performance com- parisons between CAM and MEM, are presented. This study fills an important gap in the literature by providing a detailed explanation for treatment of p-and h-type nonconforming interfaces. A comparative eigenvalue spectrum analysis of diffusion and convection operators is provided for CAM and MEM.
    [Show full text]
  • Fekete-Gauss Spectral Elements for Incompressible Navier-Stokes Flows: the Two-Dimensional Case 1 1, 1 Laura Lazar , Richard Pasquetti ∗ and Francesca Rapetti 1 Lab
    Commun. Comput. Phys. Vol. 13, No. 5, pp. 1309-1329 doi: 10.4208/cicp.180112.110612a May 2013 Fekete-Gauss Spectral Elements for Incompressible Navier-Stokes Flows: The Two-Dimensional Case 1 1, 1 Laura Lazar , Richard Pasquetti ∗ and Francesca Rapetti 1 Lab. J.A. Dieudonn´e, UMR 7351 CNRS UNS, Universit´ede Nice - Sophia Antipolis, 06108 Nice Cedex 02, France. Received 18 January 2012; Accepted (in revised version) 11 June 2012 Available online 8 October 2012 Abstract. Spectral element methods on simplicial meshes, say TSEM, show both the advantages of spectral and finite element methods, i.e., spectral accuracy and geomet- rical flexibility. We present a TSEM solver of the two-dimensional (2D) incompressible Navier-Stokes equations, with possible extension to the 3D case. It uses a projection method in time and piecewise polynomial basis functions of arbitrary degree in space. The so-called Fekete-Gauss TSEM is employed, i.e., Fekete (resp. Gauss) points of the triangle are used as interpolation (resp. quadrature) points. For the sake of consistency, isoparametric elements are used to approximate curved geometries. The resolution al- gorithm is based on an efficient Schur complement method, so that one only solves for the element boundary nodes. Moreover, the algebraic system is never assembled, therefore the number of degrees of freedom is not limiting. An accuracy study is car- ried out and results are provided for classical benchmarks: the driven cavity flow, the flow between eccentric cylinders and the flow past a cylinder. AMS subject classifications: 65M60, 65M70, 76D05 Key words: Spectral elements, simplicial meshes, Fekete-Gauss approximation, Navier-Stokes equations, projection methods, domain decomposition.
    [Show full text]
  • Additive Schwarz Preconditioners with Minimal Overlap For
    Commun. Comput. Phys. Vol. 13, No. 2, pp. 411-427 doi: 10.4208/cicp.080711.160212a February 2013 Additive Schwarz Preconditioners with Minimal Overlap for Triangular Spectral Elements Yuen-Yick Kwan∗ Center for Computational Science, Tulane University, New Orleans, LA 70118, USA. Received 8 July 2011; Accepted (in revised version) 16 February 2012 Communicated by Jie Shen Available online 28 June 2012 Abstract. The additive Schwarz preconditioner with minimal overlap is extended to triangular spectral elements (TSEM). The method is a generalization of the correspond- ing method in tensorial quadrilateral spectral elements (QSEM). The proposed precon- ditioners are based on partitioning the domain into overlapping subdomains, solving local problems on these subdomains and solving an additional coarse problem asso- ciated with the subdomain mesh. The results of numerical experiments show that the proposed preconditioner are robust with respect to the number of elements and are more efficient than the preconditioners with generous overlaps. AMS subject classifications: 65F08, 65N35 Key words: Spectral elements, additive Schwarz. 1 Introduction Spectral element method, which combines the flexibility of the low-order finite element methods and the high accuracy of the spectral methods, are popular in computational science and engineering. The efficiency of the spectral element method depends on the solution method employed to solve the resultant linear system. Since direct methods are infeasible when the number of elements get large, preconditioned iterative methods are usually used. Preconditioners can be based on an overlapping or non-overlapping domain decomposition [24, 28]. The former include the multiplicative Schwarz [18], ad- ditive Schwarz [9] and the restricted Schwarz preconditioners [6].
    [Show full text]
  • Large Eddy Simulation of the Pulsating, Non-Reacting Flow in Combustion Chambers
    Large Eddy Simulation of the Pulsating, Non-Reacting Flow in Combustion Chambers Balázs Pritz Karlsruhe 2009 II Cover page: Iso-surfaces of the Q-criterion at 5·104 s-2 in the model combustion chamber III IV Large Eddy Simulation of the Pulsating, Non-Reacting Flow in Combustion Chambers Zur Erlangung des akademischen Grades Doktor der Ingenieurwissenschaften der Fakultät für Maschinenbau Universität Karlsruhe (TH) genehmigte Dissertation von Dipl.-Ing. Balázs Pritz aus Budapest (Ungarn) Tag der mündlichen Prüfung: 03.08.2009 Hauptreferent: Prof. Dr.-Ing. M. Gabi Korreferenten: Prof. Dr.-Ing. habil. H. Büchner Dr. L. Kullmann V VI Abstract It is well known that in order to fulfil the stringent demands for low emissions of NOx, the lean premixed combustion concept is commonly used. However, lean premixed combustors are susceptible to thermo-acoustic instabilities driven by the combustion process and possibly sustained by a resonant feedback mechanism coupling pressure and heat release. This resonant feedback mechanism creates pulsations typically in the frequency range of several hundred Hz, which reach high amplitudes so that the system has to be shut down or it is even damaged. Although the research activities of the recent years have contributed to a better understanding of this phenomenon, the underlying mechanisms are still not understood well enough. For the prediction of the stability of technical combustion systems regarding the development and maintaining of self-sustained combustion instabilities the knowledge of the periodic-non- stationary mixing and reacting behaviour of the applied flame type and a quantitative description of the resonance characteristics of the gas volumes in the combustion chamber is conclusively needed.
    [Show full text]