Low rank solution of data‐sparse Sylvester equations
Low rank solution of data‐sparse Sylvester equations
复制标题
DOI：
10.1002/nla.605
复制
发表时间：
2008-11
影响因子：
4.3
通讯作者：
Ulrike Baur
中科院分区：
文献类型：
--
作者：
Ulrike Baur
本文提出了一种求解大型西尔维斯特方程的方法。该方法是基于符号函数迭代的，对具有因子分解右手边的西尔维斯特方程特别有效。在这种情况下，解将以因子形式计算，因为它例如在模型简化中需要。在迭代格式中集成了层次矩阵格式和相应的格式化算法，使该方法适用于大规模计算。版权所有© 2008约翰威利父子有限公司。
In this paper, a method for solving large‐scale Sylvester equations is presented. The method is based on the sign function iteration and is particularly effective for Sylvester equations with factorized right‐hand side. In this case, the solution will be computed in factored form as it is for instance required in model reduction. The hierarchical matrix format and the corresponding formatted arithmetic are integrated in the iteration scheme to make the method feasible for large‐scale computations. Copyright © 2008 John Wiley & Sons, Ltd.