Abstract
PurposeThe purpose of this paper is to develop a solving method based on the parallelization of the calculus of the finite integration technique on many processors and discuss its efficiency following the number of processors.Design/methodology/approachThe finite integration technique is used in different engineering domains as well as to compute the electromagnetic phenomena. This technique is efficient and generates a linear system with regular structure, this system can be implemented and solved in parallel with a direct solver. In fact, in reordering the unknowns by the nested dissection method, the lower triangular matrix of the Cholesky factorization can be constructed with many processors without assembling the matrix system.FindingsThis paper deals with the parallelization of the finite integration technique which is performed by data partitioning and leads to a high‐performance.Originality/valueThe paper presents a parallel implementation of the finite integration technique associated to a direct solver which is practical and efficient.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: COMPEL - The international journal for computation and mathematics in electrical and electronic engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
