Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
