High Performance Parallel Solvers for the time-harmonic Maxwell Equations
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913946072514560 |
|---|---|
| author | Fressart, Elise Dubois, Sébastien Gouarin, Loïc Massot, Marc Nowak, Michel Spillane, Nicole |
| author_facet | Fressart, Elise Dubois, Sébastien Gouarin, Loïc Massot, Marc Nowak, Michel Spillane, Nicole |
| contents | We consider the numerical solution of large scale time-harmonic Maxwell equations. To this day, this problem remains difficult, in particular because the equations are neither Hermitian nor semi-definite. Our approach is to compare different strategies for solving this set of equations with preconditioners that are available either in PETSc, MUMPS, or in hypre. Four different preconditioners are considered. The first is the sparse approximate inverse, which is often applied to electromagnetic problems. The second is Restricted Additive Schwarz, a domain decomposition preconditioner. The third is the Hiptmair-Xu preconditioner which is tailored to the positive Maxwell equations, a nearby problem. The final preconditioner is MUMPS's Block Low-Rank method, a compressed block procedure. We also compare the performance of this method to the standard LU factorization technique, which is a direct solver. Performance with respect to the mesh size, the number of CPU cores, the wavelength and the physical size of the domain are considered. This work in progress yields temporary conclusions in favour of the Hiptmair-Xu and the Block Low-Rank preconditioners. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_13066 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | High Performance Parallel Solvers for the time-harmonic Maxwell Equations Fressart, Elise Dubois, Sébastien Gouarin, Loïc Massot, Marc Nowak, Michel Spillane, Nicole Numerical Analysis We consider the numerical solution of large scale time-harmonic Maxwell equations. To this day, this problem remains difficult, in particular because the equations are neither Hermitian nor semi-definite. Our approach is to compare different strategies for solving this set of equations with preconditioners that are available either in PETSc, MUMPS, or in hypre. Four different preconditioners are considered. The first is the sparse approximate inverse, which is often applied to electromagnetic problems. The second is Restricted Additive Schwarz, a domain decomposition preconditioner. The third is the Hiptmair-Xu preconditioner which is tailored to the positive Maxwell equations, a nearby problem. The final preconditioner is MUMPS's Block Low-Rank method, a compressed block procedure. We also compare the performance of this method to the standard LU factorization technique, which is a direct solver. Performance with respect to the mesh size, the number of CPU cores, the wavelength and the physical size of the domain are considered. This work in progress yields temporary conclusions in favour of the Hiptmair-Xu and the Block Low-Rank preconditioners. |
| title | High Performance Parallel Solvers for the time-harmonic Maxwell Equations |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2507.13066 |