Tensor splitting preconditioners for multilinear systems

Document Type : Research Article

Authors

Mathematics Department, Faculty of Intelligent Systems Engineering and Data Science, Persian Gulf University, Bushehr, Iran

Abstract

In this paper, we propose some new preconditioners  for solving multilinear system $\mathcal{A}\mathbf{x}^{m-1}=\mathbf{b}$. These preconditioners are based on tensor splitting. We also present some theorems for analyzing and convergence of the preconditioned  Jacobi-, Gauss-Seidel-, and SOR-type iterative methods. Numerical examples are presented to verify the efficiency of the proposed preconditioned methods.

Keywords

Main Subjects


[1] F.P. Ali Beik, M. Najafi-Kalyani, Residual norm steepest descent based iterative algorithms for
Sylvester tensor equations, J. Math. Model. 2 (2015) 115–131.
[2] F.P. Ali Beik, M. Najafi-Kalyani, K. Jbilou, Preconditioned iterative methods for multi-linear sys-
tems based on the majorization matrix, Linear Multilinear Algebra 70 (2022) 5827–5846.
[3] B.W. Bader, T.G., Kolda, Efficient MATLAB computations with sparse and factored tensors, SIAM.
J. Sci. Comput. 30 (2007) 205–231.
[4] B.W. Bader, T.G., Kolda, MATLAB tensor toolbox, version 2.6, 2010, Available at https://www.
tensortoolbox.org.
[5] X. Bai, H. He, C. Ling, G. Zhou, A nonnegativity preserving algorithm for multilinear systems with
nonsingular M -tensors, Numer. Algorithms 87 (2021) 1301–1320 .
[6] L.B. Cui, C. Chen, W. Li, M. Ng, An eigenvalue problem for even order tensors with its applica-
tions, Linear Multilinear Algebra 64 (2016) 602–621.
[7] L.B. Cui, M.H. Li, Y. Song, Preconditioned tensor splitting iterations method for solving multi-
linear systems, Appl. Math. Lett. 96 (2019) 89–94.
[8] L. Cui, Y. Song, On the uniqueness of the positive Z-eigenvector for nonnegative tensor, J. Comput.
Appl. Math. 352 (2019) 72–78.
[9] E.K. Dehdezi, Iterative methods for solving Sylvester transpose tensor equation A ?N X ?M B +
C ?M X T ?N D = E , Oper. Res. Forum. 2 (2021) 1–21.
[10] E.K. Dehdezi, S. Karimi, Extended conjugate gradient squared and conjugate residual squared
methods for solving the generalized coupled Sylvester tensor equations, Trans. Inst. Meas. Control.
43 (2021) 519–527.
[11] E.K. Dehdezi, S. Karimi, A gradient based iterative method and associated preconditioning tech-
nique for solving the large multilinear systems, Calcolo 58 (2021) 1–19.
[12] E.K. Dehdezi, S. Karimi, A rapid and powerful iterative method for computing inverses of sparse
tensors with applications, Appl. Math. Comput. 415 (2022) 126720.
[13] E.K. Dehdezi, S. Karimi, GIBS: A general and efficient iterative method for computing the approx-
imate inverse and Moore-Penrose inverse of sparse matrices based on the Shultz iterative method
with applications, Linear Multilinear Algebra 71 (2023) 1905–1921.
[14] E.K. Dehdezi, S. Karimi, On finding strong approximate inverses for tensors, Numer. Linear Alge-
bra Appl. 30 (2023) e2460 .
[15] W. Ding, Y., Wei, Solving multi-linear system with M -tensors, J. Sci. Comput. 68 (2016) 689–715.
[16] L. Han, A homotopy method for solving multilinear systems with M -tensors, Appl. Math. Lett. 69
(2017) 49–54.
[17] H. He, C. Ling, L. Qi, G. Zhou, A globally and quadratically convergent algorithm for solving
multilinear systems with M -tensors, J. Sci. Comput. 76 (2018) 1718–1741
[18] M. Liang, B. Zheng, R. Zhao, Alternating iterative methods for solving tensor equations with ap-
plications, Numer. Algorithms. 80 (2019) 1437–1465.
[19] D. Li, H.B. Guan, X.Z. Wang, Finding a nonnegative solution to an M -tensor equation, Pac. J.
Math. 16 (2020) 419–440.
[20] Z. Li, Y. Dai, H. Gao, Alternating projection method for a class of tensor equations, J. Comput.
Appl. Math. 346 (2019) 490–504.
[21] W. Li, D. Liu, S.W. Vong, Comparison results for splitting iterations for solving multi-linear sys-
tems, Appl. Numer. Math. 134 (2018) 105–121.
[22] D. Li, S. Xie, H.R. Xu, Splitting methods for tensor equations, Numer. Linear Algebra Appl. 24
(2017) e2102.
[23] D. Liu, W. Li, S.W. Vong, The tensor splitting with application to solve multi-linear systems, J.
Comput. Appl. Math. 330 (2018) 75–94.
[24] D. Liu, W. Li, S.W. Vong, A new preconditioned SOR method for solving multilinear systems with
an M -tensors, Calcolo 15 (2020) 57.
[25] C.Q. Lv, C.F. Ma, A LevenbergMarquardt method for solving semi-symmetric tensor equations, J.
Comput. Appl. Math. 332 (2018) 13–25.
[26] M. Neumann, J. Plemmons, Convergence of parallel multisplitting iterative methods for M-
matrices, Linear Algebra Appl. 88 (1987) 559–573.
[27] M. Ng, L., Qi, G. Zhou, Finding the largest eigenvalue of a nonnegative tensor, SIAM J. Matrix
Anal. Appl. 31 (2010) 1090–1099.
[28] K. Pearson, Essentially positive tensors, Int. J. Algebra Comput. 4 (2010) 421–427.
[29] L. Qi, Eigenvalues of a real supersymmetric tensor, J. Symb. Comput. 40 (2005) 1302–1324.
[30] X. Wang, M. Che, Y. Wei, Neural networks based approach solving multi-linear systems with M -
tensors, Neurocomputing 351 (2019) 33–42.
[31] Z. Xie, X.Q. Jin, Y. Wei, Tensor methods for solving symmetric M -tensor systems, J. Sci. Comput.
74 (2018) 412–425.
[32] L. Zhang, L. Qi, G. Zhou, M -tensors and some applications, SIAM J. Matrix Anal. Appl. 35
(2014) 437–452.
[33] Y. Zhang, Q. Liu, Z. Chen, Preconditioned Jacobi-type method for solving multi-linear systems
with M -tensors, Appl. Math. Lett. 104 (2020) 106287.