...
首页> 外文期刊>Components, Packaging and Manufacturing Technology, IEEE Transactions on >Fast ${cal H}$ -Matrix-Based Direct Integral Equation Solver With Reduced Computational Cost for Large-Scale Interconnect Extraction
【24h】

Fast ${cal H}$ -Matrix-Based Direct Integral Equation Solver With Reduced Computational Cost for Large-Scale Interconnect Extraction

机译:快速的 $ {cal H} $ 基于矩阵的直接积分方程求解器,可降低大规模互连提取的计算成本

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we propose a fast ${cal H}$-matrix-based direct solution with a significantly reduced computational cost for an integral-equation-based capacitance extraction of large-scale 3-D interconnects in multiple dielectrics. We reduce the computational cost of an ${cal H}$ -matrix-based computation by simultaneously optimizing the ${cal H}$ -matrix partition to minimize the number of matrix blocks and minimizing the rank of each matrix block based on a prescribed accuracy. With the proposed cost-reduction method, we develop a fast LU-based direct solver. This solver possesses a complexity of $kC_{rm sp}O (N{bf log}N)$ in storage, a complexity of $k^{2}C_{{rm sp}}^{2}O(N{log}^{2}{rm N})$ in LU factorization, and a complexity of $kC_{{rm sp}}O(Nlog {rm N})$ in LU solution, where $k$ is the maximal rank, $C_{{rm sp}}$ is a constant dependent on matrix partition, and the constant $kC_{{rm sp}}$ is minimized based on accuracy by the proposed cost-reduction method. The proposed solver successfully factorizes dense matrices that involve millions of unknowns in fast CPU time and modest memory consumption, and with the prescribed accuracy satisfied. As an algebraic method, the underlying fast technique is kernel independent.
机译:在本文中,我们提出了一种快速的基于$ {cal H} $矩阵的直接解决方案,该方案显着降低了在多个介质中大规模3-D互连的基于积分方程的电容提取的计算成本。通过同时优化$ {cal H} $-矩阵分区以最小化矩阵块的数量并根据规定最小化每个矩阵块的等级,我们降低了基于$ {cal H} $ -matrix的计算的计算成本准确性。通过提出的降低成本的方法,我们开发了一种基于LU的快速直接求解器。该求解器的存储复杂度为$ kC_ {rm sp} O(N {bf log} N)$,复杂度为$ k ^ {2} C _ {{rm sp}} ^ {2} O(N {log } ^ {2} {rm N})$在LU因式分解中的复杂度为$ kC _ {{rm sp}} O(Nlog {rm N})$在LU解中,其中$ k $是最大秩$ C _ {{rm sp}} $是一个依赖于矩阵划分的常数,并且通过提出的成本降低方法,基于精度将常数$ kC _ {{rm sp}} $最小化。所提出的求解器成功分解了密集矩阵,这些矩阵涉及快速CPU时间和适度的内存消耗中的数百万个未知数,并且满足规定的精度。作为一种代数方法,基本的快速技术是与内核无关的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号