2,614 research outputs found
Space-time discontinuous Galerkin finite element method with dynamic grid motion for inviscid compressible flows. Part I. General formulation
A new space-time discontinuous Galerkin finite element method for the solution of the Euler equations of gas dynamics in time-dependent flow domains is presented. The discontinuous Galerkin discretization results in an efficient element-wise conservative upwind finite element method, which is particularly well suited for local mesh refinement. The upwind scheme uses a formulation of the HLLC flux applicable to moving meshes and several formulations for the stabilization operator to ensure monotone solutions around discontinuities are investigated. The non-linear equations of the space-time discretization are solved using a multigrid accelerated pseudo-time integration technique with an optimized Runge-Kutta method. The linear stability of the pseudo-time integration method is investigated for the linear advection equation. The numerical scheme is demonstrated with simulations of the flow field in a shock tube, a channel with a bump, and an oscillating NACA 0012 airfoil. These simulations show that the accuracy of the numerical discretization is in space for smooth subsonic flows, both on structured and locally refined meshes, and that the space-time adaptation can significantly improve the accuracy and efficiency of the numerical method. \u
Space-time discontinuous Galerkin finite element method with dynamic grid motion for inviscid compressible flows. Part II. Efficient flux quadrature
A new and efficient quadrature rule for the flux integrals arising in the space-time discontinuous Galerkin discretization of the Euler equations in a moving and deforming space-time domain is presented and analyzed. The quadrature rule is a factor three more efficient than the commonly applied quadrature rule and does not affect the local truncation error and stability of the numerical scheme. The local truncation error of the resulting numerical discretization is determined and is shown to be the same as when product Gauss quadrature rules are used. Details of the approximation of the dissipation in the numerical flux are presented, which render the scheme consistent and stable. The method is succesfully applied to the simulation of a three-dimensional, transonic flow over a deforming wing. \u
HP-multigrid as smoother algorithm for higher order discontinuous Galerkin discretizations of advection dominated flows. Part I. Multilevel Analysis
The hp-Multigrid as Smoother algorithm (hp-MGS) for the solution of higher order accurate space-(time) discontinuous Galerkin discretizations of advection dominated flows is presented. This algorithm combines p-multigrid with h-multigrid at all p-levels, where the h-multigrid acts as smoother in the p-multigrid. The performance of the hp-MGS algorithm is further improved using semi-coarsening in combination with a new semi-implicit Runge-Kutta method as smoother. A detailed multilevel analysis of the hp-MGS algorithm is presented to obtain more insight into the theoretical performance of the algorithm. As model problem a fourth order accurate space-time discontinuous Galerkin discretization of the advection-diffusion equation is considered. The multilevel analysis shows that the hp-MGS algorithm has excellent convergence rates, both for low and high cell Reynolds numbers and on highly stretched meshes
Discrete Fourier analysis of multigrid algorithms
The main topic of this report is a detailed discussion of the discrete Fourier multilevel analysis of multigrid algorithms. First, a brief overview of multigrid methods is given for discretizations of both linear and nonlinear partial differential equations. Special attention is given to the hp-Multigrid as Smoother algorithm, which is a new algorithm suitable for higher order accurate discontinuous Galerkin discretizations of advection dominated flows. In order to analyze the performance of the multigrid algorithms the error transformation operator for several linear multigrid algorithms are derived. The operator norm and spectral radius of the multigrid error transformation are then computed using discrete Fourier analysis. First, the main operations in the discrete Fourier analysis are defined, including the aliasing of modes. Next, the Fourier symbol of the multigrid operators is computed and used to obtain the Fourier symbol of the multigrid error transformation operator. In the multilevel analysis, two and three level h-multigrid, both for uniformly and semi-coarsened meshes, are considered, and also the analysis of the hp-Multigrid as Smoother algorithm for three polynomial levels and three uniformly and semi-coarsened meshes. The report concludes with a discussion of the multigrid operator norm and spectral radius. In the appendix some useful auxiliary results are summarized
A reliable and efficient implicit a posteriori error estimation technique for the time harmonic Maxwell equations
We analyze an implicit a posteriori error indicator for the time harmonic Maxwell equations and prove that it is both reliable and locally efficient. For the derivation, we generalize some recent results concerning explicit a posteriori error estimates. In particular, we relax the divergence free constraint for the source term. We also justify the complexity of the obtained estimator
HP-multigrid as smoother algorithm for higher order discontinuous Galerkin discretizations of advection dominated flows. Part II. Optimization of the Runge-Kutta smoother
Using a detailed multilevel analysis of the complete hp-Multigrid as Smoother algorithm accurate predictions are obtained of the spectral radius and operator norms of the multigrid error transformation operator. This multilevel analysis is used to optimize the coefficients in the semi-implicit Runge-Kutta smoother, such that the spectral radius of the multigrid error transformation operator is minimal under properly chosen constraints. The Runge-Kutta coefficients for a wide range of cell Reynolds numbers and a detailed analysis of the performance of the hp-MGS algorithm are presented. In addition, the computational complexity of the hp-MGS algorithm is investigated. The hp-MGS algorithm is tested on a fourth order accurate space-time discontinuous Galerkin finite element discretization of the advection-diffusion equation for a number of model problems, which include thin boundary layers and highly stretched meshes, and a non-constant advection velocity. For all test cases excellent multigrid convergence is obtained
Self-Evaluation Applied Mathematics 2003-2008 University of Twente
This report contains the self-study for the research assessment of the Department of Applied Mathematics (AM) of the Faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS) at the University of Twente (UT). The report provides the information for the Research Assessment Committee for Applied Mathematics, dealing with mathematical sciences at the three universities of technology in the Netherlands. It describes the state of affairs pertaining to the period 1 January 2003 to 31 December 2008
Space-time discontinuous Galerkin method for the compressible Navier-Stokes equations on deforming meshes
An overview is given of a space-time discontinuous Galerkin finite element method for the compressible Navier-Stokes equations. This method is well suited for problems with moving (free) boundaries which require the use of deforming elements. In addition, due to the local discretization, the space-time discontinuous Galerkin method is well suited for mesh adaptation and parallel computing. The algorithm is demonstrated with computations of the unsteady \ud
ow field about a delta wing and a NACA0012 airfoil in rapid pitch up motion
- …