Accurate and Fast Analysis of Reflective Surfaces and Metasurface Antennas With Sheet Impedance Boundary Conditions
Bibliographic record
Abstract
Simulating the fine geometry of Metasurfaces (MTS) structures in a conventional way is a difficult task requiring huge computational resources. On the other hand, the metallization can usually be modeled as an impedance sheet with modulation scale of the order of the operating wavelength. Even then, direct solution of the system of equations is usually not possible due to memory saturation. As a consequence, one has to resort to iterative methods. However, the analysis of an impedance sheet lying on a grounded slab based on an iterative solution of the Method of Moments (MoM) may lead to ill-conditioning and a large number of iterations. This is certainly the case when the range of impedance spans both the capacitive and inductive domains. Such impedances range is in practice required for Reflective Intelligent Surfaces (RIS), and for some MTS antennas. This paper proposes a preconditioner aiming to solve bad convergence issues caused by the wide range of the surface impedance. The preconditioner involves a multiplication by the conjugate of the MoM matrix followed by a block diagonal preconditioner. The block diagonal preconditioner has memory and multiplication complexity <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i><sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3/2</sup>. It is precalculated in an accelerated scheme relying on FFTs. Besides, multiplication with the MoM matrix is carried out with complexity <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i> log(<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i>) thanks to the use of FFTs.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 teacher head, 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".