4.4 Article

Two algorithms for solving generalized coupled Sylvester tensor equations

Journal

FILOMAT
Volume 37, Issue 30, Pages 10249-10264

Publisher

UNIV NIS, FAC SCI MATH
DOI: 10.2298/FIL2330249L

Keywords

Tensor form; Generalized coupled Sylvester tensor equations; Biconjugate A-orthogonal residual algorithm; Conjugate A-orthogonal residual squared algorithm

Ask authors/readers for more resources

This paper discusses the generalized coupled Sylvester tensor equations and introduces two specific algorithms for solving them. It is shown that these methods converge to the exact solution group within finite steps when there are no round-off errors and the equations are consistent. Through numerical examples, the effectiveness of the proposed methods is demonstrated in color image restoration problems and randomly generated data.
In this paper, we consider the generalized coupled Sylvester tensor equations by the tensor forms of the biconjugate A-orthogonal residual and the conjugate A-orthogonal residual squared algorithms. With the absence of round-off errors, we show that our methods converge to the exact solution group within finite steps when they are consistent. Finally, we provide some numerical examples to demonstrate the effectiveness of the proposed methods, including when testing the algorithms by color image restoration problems and randomly generated data.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.4
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available