Parallel Direct Solver for the Finite Integration Technique in Electrokinetic Problems
- 19 July 2010
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Magnetics
- Vol. 46 (8) , 3269-3272
Abstract
The finite integration technique allows the simulation of real-world electromagnetic field problems with complex geometries. It provides a discrete reformulation of Maxwell's equations in their integral form suitable for numerical computing. The resulting matrix equations of the discretized fields can be used for efficient numerical simulations on modern computers and can be exploited to use a parallel computing. In fact, by reordering the unknowns by the nested dissection method, it is possible to directly construct the lower triangular matrix of the Cholesky factorization with many processors without assembling the matrix system. In this paper, a parallel algorithm is proposed for the direct solution of large sparse linear systems with the finite integration technique. This direct solver has the advantage of handling singularities in the matrix of linear systems. The computational effort for these linear systems, often encountered in numerical simulation of electromagnetic phenomena by finite integration technique, is very significant in terms of run-time and memory requirements. Many numerical tests have been carried out to evaluate the performance of the parallel direct solver.Keywords
This publication has 6 references indexed in Scilit:
- Numerical solutions in primal and dual meshes of magnetostatic problems solved with the finite integration techniqueCOMPEL - The international journal for computation and mathematics in electrical and electronic engineering, 2008
- Iterative Methods for Sparse Linear Systems2003
- Multifrontal parallel distributed symmetric and unsymmetric solversComputer Methods in Applied Mechanics and Engineering, 2000
- A Supernodal Approach to Sparse Partial PivotingSIAM Journal on Matrix Analysis and Applications, 1999
- An Approximate Minimum Degree Ordering AlgorithmSIAM Journal on Matrix Analysis and Applications, 1996
- Nested Dissection of a Regular Finite Element MeshSIAM Journal on Numerical Analysis, 1973