Parallel Computation of Finite Element Navier-Stokes codes using MUMPS Solver

The study deals with the parallelization of 2D and 3D finite element based Navier-Stokes codes using direct solvers. Development of sparse direct solvers using multifrontal solvers has significantly reduced the computational time of direct solution methods. Although limited by its stringent memory requirements, multifrontal solvers can be computationally efficient. First the performance of MUltifrontal Massively Parallel Solver (MUMPS) is evaluated for both 2D and 3D codes in terms of memory requirements and CPU times. The scalability of both Newton and modified Newton algorithms is tested

Multifrontal vs. frontal techniques for chemical process simulation on supercomputers

Abstract-A critical computational step in large-scale process simulation using rigorous equation-based models is the solution of a sparse linear equation system. Traditional sparse solvers based on indirect addressing are not effective on supercomputers because they do not vectorize well. By relying on vectorized dense matrix kernels, the multifrontal and frontal methods provide much better performance, as demonstrated using several examples. These examples are also used to compare the performance of frontal and multifrontal solvers. On problems with good initial matrix orderings the frontal method is most effective, while without a good initial ordering the multifrontal method is attractive

A new numerical method to construct binary neutron star initial data

We present a new numerical method for the generation of binary neutron star initial data using a method along the lines of the the Wilson-Mathews or the closely related conformal thin sandwich approach. Our method uses six different computational domains, which include spatial infinity. Each domain has its own coordinates which are chosen such that the star surfaces always coincide with domain boundaries. These properties facilitate the imposition of boundary conditions. Since all our fields are smooth inside each domain, we are able to use an efficient pseudospectral method to solve the elliptic equations associated with the conformal thin sandwich approach. Currently we have implemented corotating configurations with arbitrary mass ratios, but an extension to arbitrary spins is possible. The main purpose of this paper is to introduce our new method and to test our code for several different configurations.Comment: 18 pages, 8 figures, 1 tabl

Numerical simulation for lossy microwave transmission lines including PML

Finite-difference analysis of transmission lines including lossy materials and radiation effects leads to a complex eigenvalue problem. A method is presented which preserves sparseness and delivers only the small number of interesting modes out of the complete spectrum. The propagation constants are found solving a sequence of eigenvalue problems of modified matrices with the aid of the shift-and-invert mode of the Arnoldi method. In an additional step non physical Perfectly Matched Layer modes are eliminated

Perfectly matched layers in transmission lines

The field distribution at the ports of the transmission line structure is computed by applying Maxwell's equations to the structure and solving an eigenvalue problem. The high dimensional sparse system matrix is complex in the presence of losses and Perfectly Matched Layer. A method is presented which preserves sparseness and delivers only the small number of interesting modes out with the smallest attenuation. The modes are found solving a sequence of eigenvalue problems of modified matrices with the aid of the invert mode of the Arnoldi iteration using shifts. A new strategy is described which allows the application of the method, first developed for microwave structures, to optoelectronic devices

On the Computation of Eigen Modes for Lossy Microwave Transmission Lines Including Perfectly Matched Layer Boundary Conditions

Design of microwave circuits requires detailed knowledge on the electromagnetic properties of the transmission lines used. This can be obtained by applying the Maxwellian equations to a longitudinally homogeneous waveguide structure, which results in an eigenvalue problem for the propagation constant. Using a finite-volume approach we get an algebraic formulation. In the presence of losses or absorbing boundary conditions its system matrix is complex. A method is presented which avoids the computation of all eigenvalues to find the few propagating modes one is interested in. Special attention is paid to the so-called Perfectly Matched Layer boundary conditions

High Performance Computing of Three-Dimensional Finite Element Codes on a 64-bit Machine

Three dimensional Navier-Stokes finite element formulations require huge computational power in terms of memory and CPU time. Recent developments in sparse direct solvers have significantly reduced the memory and computational time of direct solution methods. The objective of this study is twofold. First is to evaluate the performance of various state-of-the-art sequential sparse direct solvers in the context of finite element formulation of fluid flow problems. Second is to examine the merit in upgrading from 32 bit machine to a 64 bit machine with larger RAM capacity in terms of its capacity to solve larger problems. The choice of a direct solver is dependent on its computational time and its in-core memory requirements. Here four different solvers, UMFPACK, MUMPS, HSL_MA78 and PARDISO are compared. The performances of these solvers with respect to the computational time and memory requirements on a 64-bit windows server machine with 16GB RAM is evaluated

Application of HPC in eddy current electromagnetic problem solution

As engineering problems are becoming more and more advanced, the size of an average model solved by partial differential equations is rapidly growing and, in order to keep simulation times within reasonable bounds, both faster computers and more efficient software implementations are needed. In the first part of this thesis, the full potential of simulation software has been exploited through high performance parallel computing techniques. In particular, the simulation of induction heating processes is accomplished within reasonable solution times, by implementing different parallel direct solvers for large sparse linear system, in the solution process of a commercial software. The performance of such library on shared memory systems has been remarkably improved by implementing a multithreaded version of MUMPS (MUltifrontal Massively Parallel Solver) library, which have been tested on benchmark matrices arising from typical induction heating process simulations. A new multithreading approach and a low rank approximation technique have been implemented and developed by MUMPS team in Lyon and Toulouse. In the context of a collaboration between MUMPS team and DII-University of Padova, a preliminary version of such functionalities could be tested on induction heating benchmark problems, and a substantial reduction of the computational cost and memory requirements could be achieved. In the second part of this thesis, some examples of design methodology by virtual prototyping have been described. Complex multiphysics simulations involving electromagnetic, circuital, thermal and mechanical problems have been performed by exploiting parallel solvers, as developed in the first part of this thesis. Finally, multiobjective stochastic optimization algorithms have been applied to multiphysics 3D model simulations in search of a set of improved induction heating device configurations