Parallel Splitting and Decomposition Method for Computations of Heat Distribution in Permafrost

A mathematical model, numerical algorithm and program code for simulation and long-term forecasting of changes in permafrost as a result of operation of a multiple well pad of northern oil and gas field are presented. In the model the most significant climatic and physical factors are taken into account such as solar radiation, determined by specific geographical location, heterogeneous structure of frozen soil, thermal stabilization of soil, possible insulation of the objects, seasonal fluctuations in air temperature, and freezing and thawing of the upper soil layer. A parallel algorithm of decomposition with splitting by spatial variables is presented

Krylov implicit integration factor discontinuous Galerkin methods on sparse grids for high dimensional reaction-diffusion equations

Computational costs of numerically solving multidimensional partial differential equations (PDEs) increase significantly when the spatial dimensions of the PDEs are high, due to large number of spatial grid points. For multidimensional reaction-diffusion equations, stiffness of the system provides additional challenges for achieving efficient numerical simulations. In this paper, we propose a class of Krylov implicit integration factor (IIF) discontinuous Galerkin (DG) methods on sparse grids to solve reaction-diffusion equations on high spatial dimensions. The key ingredient of spatial DG discretization is the multiwavelet bases on nested sparse grids, which can significantly reduce the numbers of degrees of freedom. To deal with the stiffness of the DG spatial operator in discretizing reaction-diffusion equations, we apply the efficient IIF time discretization methods, which are a class of exponential integrators. Krylov subspace approximations are used to evaluate the large size matrix exponentials resulting from IIF schemes for solving PDEs on high spatial dimensions. Stability and error analysis for the semi-discrete scheme are performed. Numerical examples of both scalar equations and systems in two and three spatial dimensions are provided to demonstrate the accuracy and efficiency of the methods. The stiffness of the reaction-diffusion equations is resolved well and large time step size computations are obtained

h-multigrid agglomeration based solution strategies for discontinuous Galerkin discretizations of incompressible flow problems

In this work we exploit agglomeration based $h$-multigrid preconditioners to speed-up the iterative solution of discontinuous Galerkin discretizations of the Stokes and Navier-Stokes equations. As a distinctive feature $h$-coarsened mesh sequences are generated by recursive agglomeration of a fine grid, admitting arbitrarily unstructured grids of complex domains, and agglomeration based discontinuous Galerkin discretizations are employed to deal with agglomerated elements of coarse levels. Both the expense of building coarse grid operators and the performance of the resulting multigrid iteration are investigated. For the sake of efficiency coarse grid operators are inherited through element-by-element $L^2$ projections, avoiding the cost of numerical integration over agglomerated elements. Specific care is devoted to the projection of viscous terms discretized by means of the BR2 dG method. We demonstrate that enforcing the correct amount of stabilization on coarse grids levels is mandatory for achieving uniform convergence with respect to the number of levels. The numerical solution of steady and unsteady, linear and non-linear problems is considered tackling challenging 2D test cases and 3D real life computations on parallel architectures. Significant execution time gains are documented.Comment: 78 pages, 7 figure

An efficient parallel immersed boundary algorithm using a pseudo-compressible fluid solver

We propose an efficient algorithm for the immersed boundary method on distributed-memory architectures, with the computational complexity of a completely explicit method and excellent parallel scaling. The algorithm utilizes the pseudo-compressibility method recently proposed by Guermond and Minev [Comptes Rendus Mathematique, 348:581-585, 2010] that uses a directional splitting strategy to discretize the incompressible Navier-Stokes equations, thereby reducing the linear systems to a series of one-dimensional tridiagonal systems. We perform numerical simulations of several fluid-structure interaction problems in two and three dimensions and study the accuracy and convergence rates of the proposed algorithm. For these problems, we compare the proposed algorithm against other second-order projection-based fluid solvers. Lastly, the strong and weak scaling properties of the proposed algorithm are investigated

Thermodynamic Conditions in Quenching Chamber of Low Voltage Circuit Breaker

Práce se zabývá studiem procesů probíhajících při zhášení silnoproudého oblouku ve zhášecí komoře jističe. Je zaměřena na výpočet dynamiky tekutin a teplotního pole v okolí elektrického oblouku. V práci je dále popsán vliv vzdálenosti plechů v komoře a vliv tvarů plechů z hlediska aerodynamických podmínek uvnitř komory. Dalším cílem dosaženým touto prací je poskytnutí informací o vlivu polohy elektrického oblouku na termodynamické vlastnosti uvnitř komory. Toto je důležité, zejména pokud je oblouk do komory vtahován jinými silami, např. elektromagnetickými a během tohoto vtahovacího procesu mění svůj tvar i polohu. Za účelem co nejjednoduššího, ale zároveň co nejefektivnějšího řešení úkolu, byl vyvinut software určen speciálně pro výpočet dynamiky tekutin numerickou metodou konečných objemů (FVM). Tato metoda je, v porovnání s rozšířenější metodou konečných prvků (FEM), vhodnější pro výpočet dynamiky tekutin (CFD) zejména proto, že režie na výpočet jedné iterace jsou menší v porovnání s ostatními numerickými metodami. Další výhodou tohoto softwarového řešení je jeho modularita a rozšiřitelnost. Cely koncept softwaru je postaven na tzv. zásuvných modulech. Díky tomuto řešení můžeme využít výpočtové jádro pro další numerické analýzy, např. strukturální, elektromagnetickou apod. Jediná potřeba pro úspěšné používání těchto analýz je napsáni solveru pro konečné prvky (FEM). Jelikož je software koncipován jako multi–thread aplikace, využívá výkon současných vícejádrových procesorů naplno. Tato vlastnost se ještě více projeví, pokud se výpočet přesune z CPU na GPU. Jelikož současné grafické karty vyšších tříd mají několik desítek až stovek výpočetních jader a pracují s mnohem rychlejšími pamětmi, než CPU, je výpočetní výkon několikanásobně vyšší.Work deals with the study of processes that attend the electric arc extinction inside the quenching chamber of a circuit breaker. It is focused on several areas. The first one is concerned to fluid dynamics calculations (CFD) and the second one is aimed at thermal field calculations. In this work effects of metal plates distance together with metal plates shapes are described from aerodynamical point of view. Another objective solved by this work is to give information about influence of an electric arc position in a quenching chamber, which changed its shape due to forces acting on it during extinction process. For purpose of this work a new software solution for CFD was developed. Whole software concept is based on plug-ins. Due to this solution, the software§s calculation core can be used for other numerical analyses, like structural, electromagnetic, etc. The only requirement is to write a plug-in for these analyses. Because the software is designed as multi-threaded application, it can use the fully performance of current multi-core processors. Above mentioned property can be especially shown off, when a calculation is moved from CPU to GPU (Graphics Processing Units). Current high-end graphic cards have tens to hundreds cores and work with faster memories than CPU. Due to this fact, the simulation performance can raised manifold.

An Optimized and Scalable Eigensolver for Sequences of Eigenvalue Problems

In many scientific applications the solution of non-linear differential equations are obtained through the set-up and solution of a number of successive eigenproblems. These eigenproblems can be regarded as a sequence whenever the solution of one problem fosters the initialization of the next. In addition, in some eigenproblem sequences there is a connection between the solutions of adjacent eigenproblems. Whenever it is possible to unravel the existence of such a connection, the eigenproblem sequence is said to be correlated. When facing with a sequence of correlated eigenproblems the current strategy amounts to solving each eigenproblem in isolation. We propose a alternative approach which exploits such correlation through the use of an eigensolver based on subspace iteration and accelerated with Chebyshev polynomials (ChFSI). The resulting eigensolver is optimized by minimizing the number of matrix-vector multiplications and parallelized using the Elemental library framework. Numerical results show that ChFSI achieves excellent scalability and is competitive with current dense linear algebra parallel eigensolvers.Comment: 23 Pages, 6 figures. First revision of an invited submission to special issue of Concurrency and Computation: Practice and Experienc