High performance computing of explicit schemes for electrofusion jointing process based on message-passing paradigm

The research focused on heterogeneous cluster workstations comprising of a number of CPUs in single and shared architecture platform. The problem statements under consideration involved one dimensional parabolic equations. The thermal process of electrofusion jointing was also discussed. Numerical schemes of explicit type such as AGE, Brian, and Charlies Methods were employed. The parallelization of these methods were based on the domain decomposition technique. Some parallel performance measurement for these methods were also addressed. Temperature profile of the one dimensional radial model of the electrofusion process were also given

HIGH ACCURACY MULTISCALE MULTIGRID COMPUTATION FOR PARTIAL DIFFERENTIAL EQUATIONS

Scientific computing and computer simulation play an increasingly important role in scientific investigation and engineering designs, supplementing traditional experiments, such as in automotive crash studies, global climate change, ocean modeling, medical imaging, and nuclear weapons. The numerical simulation is much cheaper than experimentation for these application areas and it can be used as the third way of science discovery beyond the experimental and theoretical analysis. However, the increasing demand of high resolution solutions of the Partial Differential Equations (PDEs) with less computational time has increased the importance for researchers and engineers to come up with efficient and scalable computational techniques that can solve very large-scale problems. In this dissertation, we build an efficient and highly accurate computational framework to solve PDEs using high order discretization schemes and multiscale multigrid method. Since there is no existing explicit sixth order compact finite difference schemes on a single scale grids, we used Gupta and Zhang’s fourth order compact (FOC) schemes on different scale grids combined with Richardson extrapolation schemes to compute the sixth order solutions on coarse grid. Then we developed an operator based interpolation scheme to approximate the sixth order solutions for every find grid point. We tested our method for 1D/2D/3D Poisson and convection-diffusion equations. We developed a multiscale multigrid method to efficiently solve the linear systems arising from FOC discretizations. It is similar to the full multigrid method, but it does not start from the coarsest level. The major advantage of the multiscale multigrid method is that it has an optimal computational cost similar to that of a full multigrid method and can bring us the converged fourth order solutions on two grids with different scales. In order to keep grid independent convergence for the multiscale multigrid method, line relaxation and plane relaxation are used for 2D and 3D convection diffusion equations with high Reynolds number, respectively. In addition, the residual scaling technique is also applied for high Reynolds number problems. To further optimize the multiscale computation procedure, we developed two new methods. The first method is developed to solve the FOC solutions on two grids using standardW-cycle structure. The novelty of this strategy is that we use the coarse level grid that will be generated in the standard geometric multigrid to solve the discretized equations and achieve higher order accuracy solution. It is more efficient and costs less CPU and memory compared with the V-cycle based multiscale multigrid method. The second method is called the multiple coarse grid computation. It is first proposed in superconvergent multigrid method to speed up the convergence. The basic idea of multigrid superconvergent method is to use multiple coarse grids to generate better correction for the fine grid solution than that from the single coarse grid. However, as far as we know, it has never been used to increase the order of solution accuracy for the fine grid. In this dissertation, we use the idea of multiple coarse grid computation to approximate the fourth order solutions on every coarse grid and fine grid. Then we apply the Richardson extrapolation for every fine grid point to get the sixth order solutions. For parallel implementation, we studied the parallelization and vectorization potential of the Gauss-Seidel relaxation by partitioning the grid space with four colors for solving 3D convection-diffusion equations. We used OpenMP to parallelize the loops in relaxation and residual computation. The numerical results show that the parallelized and the sequential implementation have the same convergence rate and the accuracy of the computed solutions

Domain decomposition methods for domain composition purpose: Chimera, overset, gluing and sliding mesh methods

Domain composition methods (DCM) consist in obtaining a solution to a problem, from the formulations of the same problem expressed on various subdomains. These methods have therefore the opposite objective of domain decomposition methods (DDM). Indeed, in contrast to DCM, these last techniques are usually applied to matching meshes as their purpose consists mainly in distributing the work in parallel environments. However, they are sometimes based on the same methodology as after decomposing, DDM have to recompose. As a consequence, in the literature, the term DDM has many times substituted DCM. DCM are powerful techniques that can be used for different purposes: to simplify the meshing of a complex geometry by decomposing it into different meshable pieces; to perform local refinement to adapt to local mesh requirements; to treat subdomains in relative motion (Chimera, sliding mesh); to solve multiphysics or multiscale problems, etc. The term DCM is generic and does not give any clue about how the fragmented solutions on the different subdomains are composed into a global one. In the literature, many methodologies have been proposed: they are mesh-based, equation-based, or algebraic-based. In mesh-based formulations, the coupling is achieved at the mesh level, before the governing equations are assembled into an algebraic system (mesh conforming, Shear-Slip Mesh Update, HERMESH). The equation-based counterpart recomposes the solution from the strong or weak formulation itself, and are implemented during the assembly of the algebraic system on the subdomain meshes. The different coupling techniques can be formulated for the strong formulation at the continuous level, for the weak formulation either at the continuous or at the discrete level (iteration-by-subdomains, mortar element, mesh free interpolation). Although the different methods usually lead to the same solutions at the continuous level, which usually coincide with the solution of the problem on the original domain, they have very different behaviors at the discrete level and can be implemented in many different ways. Eventually, algebraic- based formulations treat the composition of the solutions directly on the matrix and right-hand side of the individual subdomain algebraic systems. The present work introduces mesh-based, equation-based and algebraicbased DCM. It however focusses on algebraic-based domain composition methods, which have many advantages with respect to the others: they are relatively problem independent; their implicit implementation can be hidden in the iterative solver operations, which enables one to avoid intensive code rewriting; they can be implemented in a multi-code environment

Parallel algorithm of navier-stokes model for magnetic nanoparticles drug delivery system on distributed parallel computing system

Integrated mathematical Navier-Stokes model for transportation of drug across the blood flow medium by partial differential equations (PDE) with one dimensional (1D) and two dimensional (2D) parabolic type in cylindrical coordinates system are considered. The process of magnetic nanoparticle drug delivery system is made measurable by identifying some parameter such as magnetic nanoparticle targeted delivery, blood flow, momentum transport, density and viscosity on drug release through blood medium, the intensity of magnetic fields, the radius of the capillary and controllability expression to control the concentration of blood. Finite difference method (FDM) with centre difference formula was used to discretization the mathematical model. This research focuses on two types of discretization controlled by weighted parameter 6 = 1 and 6 = - which are implicit (IMP) and Crank Nicolson (CN) schemes respectively. The implementation of several numerical iterative methods such as Alternating Group Explicit (AGE), Red Black Gauss Seidel (RBGS) and Jacobi (JB) method are used to solve the linear system equation (LSE) and is one of the contributions of this research. The sequential algorithm was developed by using C Microsoft Visual Studio 2010 Software. The numerical result was analysed based on execution time, number of iteration, maximum error, root mean square error, and computational complexity. The grid generation process involved fine grained of large sparse matrix by minimizing the size of interval, increasing the dimension of model and level of time steps. Parallel algorithm was proposed for increasing the speedup of computations and reducing computational complexity problem. The parallel algorithms for solution of large sparse systems were design and implemented supported by the distributed parallel computing system (DPCS) containing 8 processors Intel CORE i3 CPUs employing the Parallel Virtual Machine (PVM) software. The parallel performance evaluation (PPE) in term of execution time, speedup, efficiency, effectiveness, temporal performance, granularity, computational complexity and communication cost were analysed for the performance of parallel algorithm. As a conclusion, the thesis proved that the 1D and 2D Navier-Stokes model is able to be parallelized and parallel AGE method is the alternative solution for the large sparse simulation. Based on numerical result and PPE, the parallel algorithm is able to reduce the execution time and computational complexity compared to the sequential algorithm

Parallelization of multidimensional hyperbolic partial differential equation on détente instantanée contrôlée dehydration process

The purpose of this research is to propose some new modified mathematical models to enhance the previous model in simulating, visualizing and predicting the heat and mass transfer in dehydration process using instant controlled pressure drop (DIC) technique. The main contribution of this research is the mathematical models which are formulated from the regression model (Haddad et al., 2007) to multidimensional hyperbolic partial differential equation (HPDE) involving dependent parameters; moisture content, temperature, and pressure, and independent parameters; time and dimension of region. The HPDE model is performed in multidimensional; one, two and three dimensions using finite difference method with central difference formula is used to discretize the mathematical models. The implementation of numerical methods such as Alternating Group Explicit with Brian (AGEB) and Douglas-Rachford (AGED) variances, Red Black Gauss Seidel (RBGS) and Jacobi (JB) method to solve the system of linear equation is another contribution of this research. The sequential algorithm is developed by using Matlab R2011a software. The numerical results are analyzed based on execution time, number of iterations, maximum error, root mean square error, and computational complexity. The grid generation process involved a fine grained large sparse data by minimizing the size of interval, increasing the dimension of the model and level of time steps. Another contribution is the implementation of the parallel algorithm to increase the speedup of computation and to reduce computational complexity problem. The parallelization of the mathematical model is run on Matlab Distributed Computing Server with Linux operating system. The parallel performance evaluation of multidimensional simulation in terms of execution time, speedup, efficiency, effectiveness, temporal performance, granularity, computational complexity and communication cost are analyzed for the performance of parallel algorithm. As a conclusion, the thesis proved that the multidimensional HPDE is able to be parallelized and PAGEB method is the alternative solution for the large sparse simulation. Based on the numerical results and parallel performance evaluations, the parallel algorithm is able to reduce the execution time and computational complexity compared to the sequential algorithm

Parallel computing of numerical schemes and big data analytic for solving real life applications

This paper proposed the several real life applications for big data analytic using parallel computing software. Some parallel computing software under consideration are Parallel Virtual Machine, MATLAB Distributed Computing Server and Compute Unified Device Architecture to simulate the big data problems. The parallel computing is able to overcome the poor performance at the runtime, speedup and efficiency of programming in sequential computing. The mathematical models for the big data analytic are based on partial differential equations and obtained the large sparse matrices from discretization and development of the linear equation system. Iterative numerical schemes are used to solve the problems. Thus, the process of computational problems are summarized in parallel algorithm. Therefore, the parallel algorithm development is based on domain decomposition of problems and the architecture of difference parallel computing software. The parallel performance evaluations for distributed and shared memory architecture are investigated in terms of speedup, efficiency, effectiveness and temporal performance

Group implicit concurrent algorithms in nonlinear structural dynamics

During the 70's and 80's, considerable effort was devoted to developing efficient and reliable time stepping procedures for transient structural analysis. Mathematically, the equations governing this type of problems are generally stiff, i.e., they exhibit a wide spectrum in the linear range. The algorithms best suited to this type of applications are those which accurately integrate the low frequency content of the response without necessitating the resolution of the high frequency modes. This means that the algorithms must be unconditionally stable, which in turn rules out explicit integration. The most exciting possibility in the algorithms development area in recent years has been the advent of parallel computers with multiprocessing capabilities. So, this work is mainly concerned with the development of parallel algorithms in the area of structural dynamics. A primary objective is to devise unconditionally stable and accurate time stepping procedures which lend themselves to an efficient implementation in concurrent machines. Some features of the new computer architecture are summarized. A brief survey of current efforts in the area is presented. A new class of concurrent procedures, or Group Implicit algorithms is introduced and analyzed. The numerical simulation shows that GI algorithms hold considerable promise for application in coarse grain as well as medium grain parallel computers