2019
DOI: 10.1109/access.2019.2938011
|View full text |Cite
|
Sign up to set email alerts
|

Massively Parallel Implementation of FETI-2LM Methods for the Simulation of the Sparse Receiving Array Evolution of the GRAVES Radar System for Space Surveillance and Tracking

Abstract: This paper presents the massively parallel implementation of the FETI-2LM techniques (Finite Element Tearing and Interconnecting with two Lagrange Multipliers) in the FACTOPO code to solve largescale sparse receiving array evolutions of the GRAVES bistatic radar in the VHF band. There are four main ingredients in the proposed work and methodology: 1) the implementation of a total field weak formulation of FETI-2LM algorithms for multi-sources modeling using an efficient block Krylov recycling strategy for the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
16
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 12 publications
(16 citation statements)
references
References 26 publications
0
16
0
Order By: Relevance
“…One main particularity in our implementation remains in the fact that we do not mesh the initial global sparse array before the resolution of the electromagnetic problem. The global array is geometrically broken down in few generic sub-domains (3 unit-cell in [1]) each equipped with its own local mesh. They are generated separately with an automatic procedure of the GID preprocessor and as a consequence we do not use METIS [11] for partitionning the large scale initial mesh into sub-domains.…”
Section: The Sub-domain Decompositionmentioning
confidence: 99%
See 3 more Smart Citations
“…One main particularity in our implementation remains in the fact that we do not mesh the initial global sparse array before the resolution of the electromagnetic problem. The global array is geometrically broken down in few generic sub-domains (3 unit-cell in [1]) each equipped with its own local mesh. They are generated separately with an automatic procedure of the GID preprocessor and as a consequence we do not use METIS [11] for partitionning the large scale initial mesh into sub-domains.…”
Section: The Sub-domain Decompositionmentioning
confidence: 99%
“…Since the method is implemented on parallel machines, each computing core with at least 4 GB of memory is allocated exclusively to a sub-domain (elementary cell of the sparse array). The strategy used in a recent work [1] was to populate a regular grid of regular periodicity with three types of sub-domains: 1) Antenna sub-domain: It embeds the antenna geometry with surrounding Absorbing Boundary Conditions (ABC) and a Perfect Electrical Conductor (PEC) at z=0 as shown in Fig. 2.…”
Section: The Sub-domain Decompositionmentioning
confidence: 99%
See 2 more Smart Citations
“…However, the methodology to extract the scattering matrix of the array is based on a mix of periodic approximations (for the center elements) and partial local embedded zones for the border elements of the array. In this work, so as to efficiently calculate the embedded radiation patterns of all the radiating elements (internal and boundary radiating elements) as well as the complete Scattering Matrix [6] of the array, we discuss the interest of the implementation of the FETI-2LM domain decomposition methods taking into account the finitude o f t he a rray on massively parallel computers initially developed in [14] and optimized in [15] and [16] for large size sparse arrays. The main goal is to implement a method allowing in a first step to calculate the radiating elements radiation patterns and the GSM of the array, and in a second post processing step to calculate the gain patterns of the antenna array for azimuth and elevation scanning directions while taking into account the active reflection c oefficient.…”
Section: Introductionmentioning
confidence: 99%