Multigrid optimization for space-time discontinuous Galerkin discretizations of advection dominated flows

The goal of this research is to optimize multigrid methods for higher order accurate space-time discontinuous Galerkin discretizations. The main analysis tool is discrete Fourier analysis of two- and three-level multigrid algorithms. This gives the spectral radius of the error transformation operator which predicts the asymptotic rate of convergence of the multigrid algorithm. In the optimization process we therefore choose to minimize the spectral radius of the error transformation operator. We specifically consider optimizing h-multigrid methods with explicit Runge-Kutta type smoothers for second and third order accurate space-time discontinuous Galerkin finite element discretizations of the 2D advection-diffusion equation. The optimized schemes are compared with current h-multigrid techniques employing Runge-Kutta type smoothers. Also, the efficiency of h-, p- and hp-multigrid methods for solving the Euler equations of gas dynamics with a higher order accurate space-time DG method is investigated

Ascent trajectory optimisation for a single-stage-to-orbit vehicle with hybrid propulsion

This paper addresses the design of ascent trajectories for a hybrid-engine, high performance, unmanned, single-stage-to-orbit vehicle for payload deployment into low Earth orbit. A hybrid optimisation technique that couples a population-based, stochastic algorithm with a deterministic, gradient-based technique is used to maximize the nal vehicle mass in low Earth orbit after accounting for operational constraints on the dynamic pressure, Mach number and maximum axial and normal accelerations. The control search space is first explored by the population-based algorithm, which uses a single shooting method to evaluate the performance of candidate solutions. The resultant optimal control law and corresponding trajectory are then further refined by a direct collocation method based on finite elements in time. Two distinct operational phases, one using an air-breathing propulsion mode and the second using rocket propulsion, are considered. The presence of uncertainties in the atmospheric and vehicle aerodynamic models are considered in order to quantify their effect on the performance of the vehicle. Firstly, the deterministic optimal control law is re-integrated after introducing uncertainties into the models. The proximity of the final solutions to the target states are analysed statistically. A second analysis is then performed, aimed at determining the best performance of the vehicle when these uncertainties are included directly in the optimisation. The statistical analysis of the results obtained are summarized by an expectancy curve which represents the probable vehicle performance as a function of the uncertain system parameters. This analysis can be used during the preliminary phase of design to yield valuable insights into the robustness of the performance of the vehicle to uncertainties in the specification of its parameters

Grid sensitivity for aerodynamic optimization and flow analysis

After reviewing relevant literature, it is apparent that one aspect of aerodynamic sensitivity analysis, namely grid sensitivity, has not been investigated extensively. The grid sensitivity algorithms in most of these studies are based on structural design models. Such models, although sufficient for preliminary or conceptional design, are not acceptable for detailed design analysis. Careless grid sensitivity evaluations, would introduce gradient errors within the sensitivity module, therefore, infecting the overall optimization process. Development of an efficient and reliable grid sensitivity module with special emphasis on aerodynamic applications appear essential. The organization of this study is as follows. The physical and geometric representations of a typical model are derived in chapter 2. The grid generation algorithm and boundary grid distribution are developed in chapter 3. Chapter 4 discusses the theoretical formulation and aerodynamic sensitivity equation. The method of solution is provided in chapter 5. The results are presented and discussed in chapter 6. Finally, some concluding remarks are provided in chapter 7

Computational fluid dynamics

An overview of computational fluid dynamics (CFD) activities at the Langley Research Center is given. The role of supercomputers in CFD research, algorithm development, multigrid approaches to computational fluid flows, aerodynamics computer programs, computational grid generation, turbulence research, and studies of rarefied gas flows are among the topics that are briefly surveyed

ESTABLISHED WAYS TO ATTACK EVEN THE BEST ENCRYPTION ALGORITHM

Which solution is the best – public key or private key encryption? This question cannot have a very rigorous, logical and definitive answer, so that the matter be forever settled :). The question supposes that the two methods could be compared on completely the same indicators – well, from my point of view, the comparison is not very relevant. Encryption specialists have demonstrated that the sizes of public key encrypted messages are much bigger than the encrypted message using private key algorithms. From this point of view, we can say that private key algorithms are more efficient than their newer counterparts. Looking at the issue through the eyeglass of the security level, the public key encryption have a great advantage of the private key variants, their level of protection, in the most pessimistic scenarios, being at least 35 time higher. As a general rule, each type of algorithm has managed to find its own market niche where could be applicable as a best solution and be more efficient than the other encryption model.Encryption, decryption, key, cryptanalysis, brute-force, linear, differential, algebra

Optimized explicit Runge-Kutta schemes for the spectral difference method applied to wave propagation problems

Explicit Runge-Kutta schemes with large stable step sizes are developed for integration of high order spectral difference spatial discretization on quadrilateral grids. The new schemes permit an effective time step that is substantially larger than the maximum admissible time step of standard explicit Runge-Kutta schemes available in literature. Furthermore, they have a small principal error norm and admit a low-storage implementation. The advantages of the new schemes are demonstrated through application to the Euler equations and the linearized Euler equations.Comment: 37 pages, 3 pages of appendi