首页> 外文会议>IEEE International Symposium on Antennas and Propagation >Direct Methods for Unsymmetric Blockwise Sparse Matrices: Application to Domain Decomposition Global Preconditioning
【24h】

Direct Methods for Unsymmetric Blockwise Sparse Matrices: Application to Domain Decomposition Global Preconditioning

机译:非对称块块稀疏矩阵的直接方法:应用于域分解全球预处理

获取原文

摘要

A memory and time efficient block-wise sparse LU factorization and forward/backward(F/B) substitution for the application of the W-FETI (Woodbury-FETI) global algebraic Domain Decomposition preconditioner is presented. The proposed direct solver exploits inherited block-wise sparsity (sparse collection of dense block submatrices) of the unsymmetric W-FETI matrix, reducing memory and attaining high degree of cache coherency and maximal BLAS Level 3 performance. Comparisons with state-of-the-art sparse direct solvers on various electrically large problems suggest up to 3 times less memory and run-time complexity for the factorization and for the multiple rhs F/B substitution part, while maintaining the same accuracy.
机译:介绍了用于应用W-Feti(伍德伯里-FETI)全球代数域分解器的应用程序和时间高效的块稀疏LU分解和前进/后向(F / B)替换。所提出的直接求解器利用未对称的W-FETI矩阵的继承的块状稀疏性(浓度块底屑稀疏集合),减少了存储器并获得高高程度的高速缓存一致性和最大BLA级别3性能。在各种电力问题上具有最先进的稀疏直接求解器的比较表明,对于分解和多RHS F / B替换部分,较少的内存和运行时间复杂度较少3倍,同时保持相同的准确性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号