HOBi-CGSTAB and HOBi-CRSTAB methods for solving some tensor equations

DOI10.1007/s13370-023-01155-4OpenAlexW4389615686MaRDI QIDQ6138978

Eisa Khosravi Dehdezi

Publication date: 16 January 2024

Published in: Afrika Matematika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13370-023-01155-4

zbMATH Keywords

iterative methodstensor equations\(k\)-mode productHOBi-CGSTABHOBi-CRSTAB

Mathematics Subject Classification ID

Vector and tensor algebra, theory of invariants (15A72) Iterative numerical methods for linear systems (65F10) Multilinear algebra, tensor calculus (15A69) Basic linear algebra (15A99)

Cites Work

• Unnamed Item
• Tensor Decompositions and Applications
• Iterative algorithms for the minimum-norm solution and the least-squares solution of the linear matrix equations \(A_1XB_1 + C_1X^TD_1 = M_1, A_2XB_2 + C_2 X^TD_2 = M_2\)
• A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
• A gradient based iterative solutions for Sylvester tensor equations
• Weighted Moore-Penrose inverses and fundamental theorem of even-order tensors with Einstein product
• Schur-decomposition for 3D matrix equations and its application in solving radiative discrete ordinates equations discretized by Chebyshev collocation spectral method
• BiCR variants of the hybrid BiCG methods for solving linear systems with nonsymmetric matrices
• The generalized inverses of tensors and an application to linear models
• The Drazin inverse of an even-order tensor and its application to singular tensor equations
• Generalized inverses of tensors via a general product of tensors
• Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
• A gradient based iterative method and associated preconditioning technique for solving the large multilinear systems
• Generalized tensor function via the tensor singular value decomposition based on the T-product
• Extending BiCG and BiCR methods to solve the Stein tensor equation
• A rapid and powerful iterative method for computing inverses of sparse tensors with applications
• A modified CG algorithm for solving generalized coupled Sylvester tensor equations
• Reverse-order law for weighted Moore-Penrose inverse of tensors
• Perturbation theory for Moore-Penrose inverse of tensor via Einstein product
• Matrix form of the CGS method for solving general coupled matrix equations
• A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
• Iterative method to solve the generalized coupled Sylvester-transpose linear matrix equations over reflexive or anti-reflexive matrix
• A class of outer generalized inverses
• The inverse, rank and product of tensors
• Iterative least-squares solutions of coupled sylvester matrix equations
• Moore–Penrose inverse of tensors via Einstein product
• On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations
• Solving Multilinear Systems via Tensor Inversion
• Backward error and perturbation bounds for high order Sylvester tensor equation
• A Hessenberg-Schur method for the problem AX + XB= C
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
• Tensor inversion and its application to the tensor equations with Einstein product
• Extension of Moore–Penrose inverse of tensor via Einstein product
• A fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensors
• An iterative algorithm to solve the generalized Sylvester tensor equations
• Outer and (b,c) inverses of tensors
• Reverse-order law for the Moore–Penrose inverses of tensors
• Gradient based iterative algorithms for solving a class of matrix equations
• Further results on generalized inverses of tensors via the Einstein product
• On finding strong approximate inverses for tensors
• GIBS: a general and efficient iterative method for computing the approximate inverse and Moore–Penrose inverse of sparse matrices based on the Schultz iterative method with applications

This page was built for publication: HOBi-CGSTAB and HOBi-CRSTAB methods for solving some tensor equations