nach oben

Calcolo

Erschienen in:

01.12.2021

A gradient based iterative method and associated preconditioning technique for solving the large multilinear systems

verfasst von: Eisa Khosravi Dehdezi, Saeed Karimi

Erschienen in: Calcolo | Ausgabe 4/2021

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 paper, a gradient based iterative method version is proposed for solving the large multilinear systems or tensor equations. A new preconditioner is presented to accelerate the convergence rate of the new iterative methods. Using the linear operator form of the multilinear system, the new methods can be implemented easily for solving several kinds of tensor equations. Finally, some numerical examples are given to illustrate the effectiveness of the proposed method.

Vorheriger Artikel On a high-order Gaussian radial basis function generated Hermite finite difference method and its application

Nächster Artikel Analysis of generalised alternating local discontinuous Galerkin method on layer-adapted mesh for singularly perturbed problems

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

Qi, L., Luo, Z.: Tensor Analysis: Spectral Theory and Special Tensors. SIAM, Philadelphia (2017)CrossRef

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

Ding, W., Wei, Y.: Solving multi-linear systems with \(M\)-tensors. J. Sci. Comput 68(2), 689–715 (2016)MathSciNetCrossRef

Sun, L., Zheng, B., Bu, C., Wei, Y.: Moore-Penrose inverse of tensors via Einstein product. Linear Multilinear Algebra 64(4), 686–698 (2016)MathSciNetCrossRef

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

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

Wang, Q.W., Xu, X., Duan, X.: Least squares solution of the quaternion Sylvester tensor equation. Linear Multilinear Algebra 69, 104–130 (2021)MathSciNetCrossRef

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

10.

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

11.

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)MathSciNetCrossRef

12.

Xu, X., Wanga, Q.W.: Extending Bi-CG and Bi-CR methods to solve the Stein tensor equation. Comput. Math. with Appl 77(12), 3117–3127 (2019)MathSciNetCrossRef

13.

Wang, Q.W., He, Z.H., Zhang, Y.: Constrained two-sided coupled Sylvester-type quaternion matrix equations. Automatica 101, 207–213 (2019)MathSciNetCrossRef

14.

Li, T., Wang, Q.W., Duan, X.F.: Numerical algorithms for solving discrete Lyapunov tensor equation. J. Comput. Appl. Math. 370, 112676 (2020)MathSciNetCrossRef

15.

Zhang, X.F., Wang, Q.W.: Developing iterative algorithms to solve Sylvester tensor equations. Appl. Math. Comput 409, 126403 (2021)MathSciNetMATH

16.

Lv, C.-Q., Ma, C.-F.: A modified CG algorithm for solving generalized coupled Sylvester tensor equations. Appl. Math. Comput 365, 124699 (2020)MathSciNetMATH

17.

Khosravi Dehdezi, E., Karimi, S.: Extended conjugate gradient squared and conjugate residual squared methods for solving the generalized coupled Sylvester tensor equations. T. I. Meas. Control 43(3), 519–527 (2021)CrossRef

18.

Dehdezi, E.K., Karimi, S.: A fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensors. J. Math. Model. (2021). https://doi.org/10.22124/jmm.2021.19005.1627MathSciNetCrossRef

19.

Ding, F., Chen, T.: Gradient-based iterative algorithms for solving a class of matrix equations. IEEE. Trans. Autom. Control 50(8), 1216–1221 (2005a)MathSciNetCrossRef

20.

Ding, F., Chen, T.: Iterative least-squares solutions of coupled Sylvester matrix equations. Syst. Control Lett. 54(2), 95–107 (2005b)MathSciNetCrossRef

21.

Golub, G.H., Nash, S., Van Loan, C.F.: A Hessenberg–Schur method for the problem \(AX + XB = C\). IEEE Trans. Auto. Control. 24(6), 909–913 (1979)MathSciNetCrossRef

22.

Grasedyck, L.: Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure. Computing 72(3–4), 247–265 (2004)MathSciNetMATH

23.

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)MathSciNetCrossRef

24.

Cui, L., Chen, C., Li, W., et al.: An eigenvalue problem for even order tensors with its applications. Linear Multilinear Algebra 64(4), 602–621 (2016)MathSciNetCrossRef

25.

Liu, X., Wang, L., Wang, J., Meng, H.: A three-dimensional point spread function for phase retrieval. Opt. Express 20(14), 15392–15405 (2012)CrossRef

26.

Behera, R., Mishra, D.: Further results on generalized inverses of tensors via the Einstein product. Linear Multilinear Algebra 65(8), 1662–1682 (2017)MathSciNetCrossRef

27.

Karimi, S., Dehghan, M.: Global least squares method based on tensor form to solve linear systems in Kronecker format. T. I. Meas. Control 40(7), 2378–2386 (2018)CrossRef

28.

Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of the 24th ACM National Conference, pp. 157–172 New York (1969)

29.

George, J.A., Liu, J.W.H.: Computer Solution of Large Sparse Positive Denite Systems. Prentice-Hall, Englewood Clis (1981)

30.

Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th edn. Johns Hopkins University Press, Baltimore (2013)MATH

31.

Karimi, S.: The right-left preconditioning technique for the solution of the large matrix equation \(AXB=C\). Int. J. Comput. Math. 93(7), 1226–1239 (2016)MathSciNetCrossRef

32.

Bader, B.W., Kolda, T.G.: Efficient MATLAB computations with sparse and factored tensors. SIAM. J. Sci. Comput 30(1), 205–231 (2007)MathSciNetCrossRef

33.

Bader, B.W., Kolda, T.G.: MATLAB tensor toolbox, version 2.6, Available online at https://www.tensortoolbox.org (2010)

Titel: A gradient based iterative method and associated preconditioning technique for solving the large multilinear systems
verfasst von: Eisa Khosravi Dehdezi
Saeed Karimi
Publikationsdatum: 01.12.2021
Verlag: Springer International Publishing
Erschienen in: Calcolo / Ausgabe 4/2021
Print ISSN: 0008-0624
Elektronische ISSN: 1126-5434
DOI: https://doi.org/10.1007/s10092-021-00438-1

Springer Professional

Abstract

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

Weitere Artikel der Ausgabe 4/2021

A fully well-balanced and asymptotic preserving scheme for the shallow-water equations with a generalized Manning friction source term

A new iterative method for solving a class of two-by-two block complex linear systems

All-at-once multigrid approaches for one-dimensional space-fractional diffusion equations

On decompositions and approximations of conjugate partial-symmetric tensors

Analysis of generalised alternating local discontinuous Galerkin method on layer-adapted mesh for singularly perturbed problems

Second-order well-balanced Lagrange-projection schemes for blood flow equations