The recurrence rebuild and retrieval method (R3M) is proposed in this paper to accelerate the electromagnetic (EM) validations of large-scale digital coding metasurfaces (DCMs). R3M aims to accelerate the EM validations of DCMs with varied codebooks, which involves the analysis of a group of similar but not identical structures. The method transforms general DCMs to rigorously periodic arrays by replacing each coding unit with the macro unit, which comprises all possible coding states. The system matrix corresponding to the rigorously periodic array is globally shared for DCMs with arbitrary codebooks via implicit retrieval. The discrepancy of the interactions for edge and corner units are precluded by the basis extension of periodic boundaries. Moreover, the hierarchical pattern exploitation (HPE) algorithm is leveraged to efficiently assemble the system matrix for further acceleration. Due to the fully utilization of the rigid periodicity, the computational complexity of R3M-HPE is theoretically lower than that of $\mathcal{H}$-matrix within the same paradigm. Numerical results for two types of DCMs indicate that R3M-HPE is accurate in comparison with commercial software. Besides, R3M-HPE is also compatible with the preconditioning for efficient iterative solutions. The efficiency of R3M-HPE for DCMs outperforms the conventional fast algorithms in both the storage and CPU time cost.
翻译:本文建议重现重置和检索方法(R3M),以加速大型数字编码元表(DCM)的电磁(EM)验证。R3M旨在加速对具有各种代码的DCM(DCM)进行电磁(EM)验证,这涉及对一组类似但并不完全相同的结构进行分析。该方法将普通DCM(DCM)转换成严格的定期阵列,用由所有可能的编码国组成的宏单位替换每个编码单位。与严格定期阵列相对应的系统矩阵,通过隐含检索,在全球共享任意的代码阵列。边和角单元的相互作用差异通过定期边界的基础延伸加以排除。此外,等级模式的利用(HPE)算法(HPE)算法被用来高效率地组合系统矩阵,以便进一步加速。由于充分利用了严格的周期,R3M-HPE的计算复杂性在理论上低于同一模式内的$mathc{HP{H} 基数。对于两种类型的DCM(R3M-HPE)的数值结果表明,在与商业软件的高效成本上,R3M-M-HPE(C-FAF)快速存储中,也与DC-SLS-S-C-FAFAFAF)的快速成本兼容。