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 distinct coding patterns. 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 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 is theoretically lower than that of $\mathcal{H}$-matrix within the same paradigm. Numerical results for two types of DCMs indicate that R3M is accurate in comparison with commercial software. Besides, R3M is also compatible with the preconditioning for efficient iterative solutions. The efficiency of R3M for DCMs outperforms the conventional fast algorithms by a large margin in both the storage and CPU time cost.
翻译:本文建议重现重置和检索方法(R3M),以加速大型数字编码元表(DCM)的电磁(EM)验证。R3M旨在加速对具有各种编码的DCM(DCM)的电磁(EM)验证,这涉及对一组类似但不同的编码模式的分析。该方法将普通DCM(DCM)转换为严格的定期阵列,用由所有可能的编码国组成的宏观单位替换每个编码单位。严格定期阵列对应的系统矩阵通过隐含检索,为DCM(DCM)在全球共享任意的编码簿共享。边和角单元的相互作用差异通过定期边界的基础扩展加以排除。此外,等级模式开发算法还被用来高效率地组装系统矩阵,以便进一步加速。由于充分利用了僵硬的周期,R3M(R3M)的计算复杂性在理论上低于由所有可能的编码国组成的宏编码单位。两种类型的DCM(DCM)的数值矩阵结果显示,与商业软件相比R3M(R3M)之间的相互作用是准确的。此外,R3M(R3M)还被用来高效率的基点和快速的DC(CM(CM)的时差)的大型存储法)的快速基压效率。