A parallel implementation of the fast multipole method for Maxwell's equations | Zendy

Havé Pascal | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

A parallel implementation of the fast multipole method for Maxwell's equations

Author(s) -

Havé Pascal

Publication year - 2003

Publication title -

international journal for numerical methods in fluids

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.938

H-Index - 112

eISSN - 1097-0363

pISSN - 0271-2091

DOI - 10.1002/fld.534

Subject(s) - fast multipole method , multipole expansion , computation , computer science , resolution (logic) , iterative method , computational science , maxwell's equations , parallel computing , system of linear equations , linear system , fortran , mathematics , algorithm , physics , programming language , mathematical analysis , quantum mechanics

It is well known that the resolution of Maxwell equations may provide large dense matrices, being thus a computer intensive problem. Even small problems require a huge amount of memory to manipulate matrices during the O( N 3 ) involved operations. The fast multipole method enables to compress and approximate matrices. Coupled with an iterative resolution of the linear system the complexity reduces to O ( N iter N log N ) operations. In order to use multiprocessors machine and to reduce computation times, we propose here a parallel implementation of the fast multiple method. This article relates our first results, as well as the difficulties encountered. Copyright © 2003 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research