返回
Tensor product-type methods for solving Sylvester tensor equations
DOI:10.1016/j.amc.2023.128155.png)
摘要
En 中文
The tensor biconjugate gradient (TBiCG) method has recently been proposed for solving Sylvester tensor equations. The TBiCG method is based on the BiCG method that may exhibit irregular convergence behavior. To overcome the limitations, product-type methods, such as BiCGSTAB and GPBiCG, have been proposed. In this study, we apply the idea of product-type methods to solve Sylvester tensor equations and propose tensor GPBiCG and BiCGSTAB methods. Furthermore, we consider preconditioned algorithms of the tensor GPBiCG and BiCGSTAB methods using the nearest Kronecker product preconditioner. Numerical experiments illustrate that the proposed methods are competitive with some existing methods. & COPY; 2023 Elsevier Inc. All rights reserved.
Keyword:
Sylvester tensor equations
Product-type methods
Nearest Kronecker product
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
GPBi-CG: Generalized product-type methods based on Bi-CG for solving nonsymmetric linear systemsGpbi-cg: 基于bi-cg求解非对称线性系统的广义乘积型方法
Sonochemical synthesis of reduced graphene oxide uniformly decorated with hierarchical ZnS nanospheres and its enhanced photocatalytic activities超声化学合成均匀装饰有分级ZnS纳米球的还原氧化石墨烯及其增强的光催化活性
RSC Advances
IF0

