nach oben

Calcolo

Erschienen in:

01.03.2023

A preconditioned tensor splitting iteration method and associated global correction technique for solving multilinear systems

verfasst von: Baohua Huang

Erschienen in: Calcolo | Ausgabe 1/2023

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

In this work, we propose a preconditioned tensor splitting iteration method for solving the multilinear system with Einstein product and give the corresponding theoretical analysis. Then we give a global correction method and theoretically prove that the proposed global correction method accelerates the convergence of the existing algorithm. These studies give some new accelerated iterative techniques which are not appeared in the previously published works. Some numerical results are disclosed to experimentally illustrate the effectiveness of the preconditioned method and the global correction technique.

Vorheriger Artikel Convergence of a Jacobi-type method for the approximate orthogonal tensor diagonalization

Nächster Artikel Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds

Smilde, A., Bro, R., Geladi, P.: Multi-way analysis: applications in the chemical sciences. Wiley, West Sussex, England (2004)

Vlasic, D., Brand, M., Pfister, H., Popovic, J.: Face transfer with multilinear models. ACM Trans. Graph. 24(3), 426–433 (2005)CrossRef

Einstein, A.: The foundation of the general theory of relativity. In: Kox A.J., Klein M.J., Schulmann R., (eds) The collected papers of Albert Einstein. Vol. 6. Princeton University Press, Princeton, pp 146–200 (2007)

Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455–500 (2009)MathSciNetCrossRefMATH

Cooper, J., Dutle, A.: Spectra of uniform hypergraphs. Linear Algebra Appl. 436(9), 3268–3292 (2012)MathSciNetCrossRefMATH

Hu, S.L., Qi, L.Q.: Algebraic connectivity of an even uniform hypergraph. J. Comb. Optim. 24(4), 564–579 (2012)MathSciNetCrossRefMATH

Brazell, M., Li, N., Navasca, C., Tamon, C.: Solving multilinear systems via tensor inversion. SIAM J. Matrix Anal. Appl. 34(2), 542–570 (2013)MathSciNetCrossRefMATH

Chen, Z., Lu, L.Z.: A projection method and Kronecker product preconditioner for solving Sylvester tensor equations. Sci. China Math. 55, 1281–1292 (2012)MathSciNetCrossRefMATH

Beik, F.P.A., Movahed, F.S., Ahmadi-Asl, S.: On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations. Numer. Linear Algebra Appl. 23(3), 444–466 (2016)MathSciNetCrossRefMATH

10.

Li, W., Liu, D.D., Vong, S.W.: Comparison results for splitting iterations for solving multi-linear systems. Appl. Numer. Math. 134, 105–121 (2018)MathSciNetCrossRefMATH

11.

Liu, D.D., Li, W., Vong, S.W.: A new preconditioned SOR method for solving multi-linear systems with an M-tensor. Calcolo 57(2), 15 (2020)MathSciNetCrossRefMATH

12.

Lai, W.M., Rubin, D., Krempl, E.: Introduction to Continuum Mechanics. Butterworth Heinemann, Oxford (2009)

13.

Fry, A., Navasca, C.: Tensor restricted isometry property for multilinear sparse system of genomic interactions. In: the 48th Asilomar Conference on Signals, Systems and Computers, IEEE (2014)

14.

Cui, L.B., Chen, C., Li, W., Ng, M.K.: An eigenvalue problem for even order tensors with its applications. Linear Multilinear Algebra. 64(4), 602–621 (2016)MathSciNetCrossRefMATH

15.

Xie, Z.J., Jin, X.Q., Sin, V.K.: An optimal preconditioner for tensor equations involving Einstein product. Linear Multilinear Algebra. 68(5), 886–902 (2020)MathSciNetCrossRefMATH

16.

Liang, M.L., Zheng, B., Zhao, R.J.: Tensor inversion and its application to the tensor equations with Einstein product. Linear Multilinear Algebra. 67(4), 843–870 (2019)MathSciNetCrossRefMATH

17.

Wang, Q.W., Xu, X.J.: Iterative algorithms for solving some tensor equations. Linear Multilinear Algebra. 67(7), 1325–1349 (2019)MathSciNetCrossRefMATH

18.

Huang, B.H., Xie, Y.J., Ma, C.F.: Krylov subspace methods to solve a class of tensor equations via the Einstein product. Numer. Linear Algebra Appl. 26, e2254 (2019)MathSciNetCrossRefMATH

19.

Hajarian, M.: Conjugate gradient-like methods for solving general tensor equation with Einstein product. J. Franklin Inst. 357(7), 4272–4285 (2020)MathSciNetCrossRefMATH

20.

Huang, B.H., Ma, C.F.: An iterative algorithm to solve the generalized Sylvester tensor equations. Linear Multilinear Algebra 68(6), 1175–1200 (2020)MathSciNetCrossRefMATH

21.

Huang, B.H., Ma, C.F.: Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations. Appl. Math. Comput. 369, 124892 (2020)MathSciNetMATH

22.

Huang, B.H., Li, W.: Numerical subspace algorithms for solving the tensor equations involving Einstein product. Numer. Linear Algebra Appl. 28(2), e2351 (2021)MathSciNetCrossRefMATH

23.

Beik, F.P.A., Najafi-Kalyani, M.: A preconditioning technique in conjunction with Krylov subspace methods for solving multilinear systems. Appl. Math. Lett. 116(3), 107051 (2021)MathSciNetCrossRefMATH

24.

Li, T., Wang, Q.W., Zhang, X.F.: Hermitian and skew-Hermitian splitting methods for solving a tensor equation. Int. J. Comput. Math. 98(6), 1274–1290 (2021)MathSciNetCrossRefMATH

25.

Dehdezi, E.K., Karimi, S.: A gradient based iterative method and associated preconditioning technique for solving the large multilinear systems. Calcolo. 58(4), 1–19 (2021)MathSciNetMATH

26.

Duan, X.F., Duan, S.Q., Li, J.F., Wang, Q.W.: An efficient algorithm for solving the nonnegative tensor least squares problem. Numer. Linear Algebra Appl. 28(6), e2385 (2021)MathSciNetCrossRefMATH

27.

Ichi, A.E., Jbilou, K., Sadaka, R.: Tensor global extrapolation methods using the \(n\)-mode and the Einstein products. Mathematics 8, 1298 (2020)CrossRef

28.

Beik, F.P.A., Ichi, A.E., Jbilou, K., Sadaka, R.: Tensor extrapolation methods with applications. Numer. Algor. 87(4), 1421–1444 (2021)MathSciNetCrossRefMATH

29.

Liang, M.L., Zheng, B.: Further results on Moore–Penrose inverses of tensors with application to tensor nearness problems. Comput. Math. Appl. 77(5), 1282–1293 (2019)MathSciNetCrossRefMATH

30.

Gunawardena, A.D., Jain, S.K., Snyder, L.: Modified iterative methods for consistent linear systems. Linear Algebra Appl. 154–156, 123–143 (1991)MathSciNetCrossRefMATH

31.

Varga, R.S.: Matrix Iterative Analysis. Springer, Berlin (2009)

32.

Neumann, M., Plemmons, J.: Covergence of parallel multisplitting iterative methods for M-matrices. Linear Algebra Appl. 88–89, 559–573 (1987)CrossRefMATH

Titel: A preconditioned tensor splitting iteration method and associated global correction technique for solving multilinear systems
verfasst von: Baohua Huang
Publikationsdatum: 01.03.2023
Verlag: Springer International Publishing
Erschienen in: Calcolo / Ausgabe 1/2023
Print ISSN: 0008-0624
Elektronische ISSN: 1126-5434
DOI: https://doi.org/10.1007/s10092-022-00499-w

Springer Professional

A preconditioned tensor splitting iteration method and associated global correction technique for solving multilinear systems

Abstract

Premium Partner

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 1/2023

Explicit error bound of the fast multipole method for scattering problems in 2-D

One-stage explicit trigonometric integrators for effectively solving quasilinear wave equations

On the acceleration of optimal regularization algorithms for linear ill-posed inverse problems

Shape preserving rational [3/2] Hermite interpolatory subdivision scheme

Optimal error estimates of spectral Galerkin method for mixed diffusion equations

Spectral methods in space and time for parabolic problems on semi-infinite domains

Premium Partner