2019
DOI: 10.1007/978-3-030-16272-6_2
|View full text |Cite
|
Sign up to set email alerts
|

Parallelization of Hierarchical Matrix Algorithms for Electromagnetic Scattering Problems

Abstract: Numerical solution methods for electromagnetic scattering problems lead to large systems of equations with millions or even billions of unknown variables. The coefficient matrices are dense, leading to large computational costs and storage requirements if direct methods are used. A commonly used technique is to instead form a hierarchical representation for the parts of the matrix that corresponds to far-field interactions. The overall computational cost and storage requirements can then be reduced to O(N log … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 58 publications
(70 reference statements)
0
1
0
Order By: Relevance
“…The computing platform is the desktop PC with Intel Core I9-9900K CPU at 3.60 GHz and 64 GB RAM. Although H-matrix supports efficient parallelization of matrix operations [33], the single-thread mode is utilized to count the CPU time for fair comparisons. The accuracy, convergence and efficiency of R3M are examined to validate its feasibility.…”
Section: E Analysis Of Computational Complexitiesmentioning
confidence: 99%
“…The computing platform is the desktop PC with Intel Core I9-9900K CPU at 3.60 GHz and 64 GB RAM. Although H-matrix supports efficient parallelization of matrix operations [33], the single-thread mode is utilized to count the CPU time for fair comparisons. The accuracy, convergence and efficiency of R3M are examined to validate its feasibility.…”
Section: E Analysis Of Computational Complexitiesmentioning
confidence: 99%