Accelerated IE-GSTC Solver for Large-Scale Metasurface Field Scattering Problems Using Fast Multipole Method (FMM)
Bibliographic record
Abstract
An accelerated integral equations (IE) field solver for determining scattered fields from electrically large electromagnetic metasurfaces using fast multipole method (FMM) is proposed and demonstrated in 2-D. In the proposed method, practical general metasurfaces are expressed using an equivalent zero thickness sheet model described using surface susceptibilities, and where the total fields around it satisfy the generalized sheet transition conditions (GSTCs). While the standard IE-GSTC offers fast field computation compared with other numerical methods, it is still computationally demanding when solving electrically large problems, with a large number of unknowns. Here, we accelerate the IE-GSTC method using the FMM technique by dividing the current elements on the metasurface into near- and far-groups, where either the rigorous or approximated Green’s function is used, respectively, to reduce the computation time without losing solution accuracy. Using numerical examples, the speed improvement of the FMM IE-GSTC method {$O(N^{3/2})$} over the standard IE-GSTC {$O(N^{3})$} method is confirmed. Finally, the usefulness of FMM IE-GSTC is demonstrated by applying it to solve electromagnetic propagation inside an electrically large radio environment with strategically placed metasurfaces to improve signal coverage in blind areas, where a standard IE-GSTC solver would require prohibitively large computational resources and long simulation times.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".