HOBi-CGSTAB and HOBi-CRSTAB methods for solving some tensor equations
From MaRDI portal
Publication:6138978
DOI10.1007/S13370-023-01155-4OpenAlexW4389615686MaRDI QIDQ6138978FDOQ6138978
Authors: 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
Multilinear algebra, tensor calculus (15A69) Basic linear algebra (15A99) Vector and tensor algebra, theory of invariants (15A72) Iterative numerical methods for linear systems (65F10)
Cites Work
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Tensor Decompositions and Applications
- Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
- A Hessenberg-Schur method for the problem AX + XB= C
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Title not available (Why is that?)
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- Iterative least-squares solutions of coupled sylvester matrix equations
- Gradient based iterative algorithms for solving a class of matrix equations
- Matrix form of the CGS method for solving general coupled matrix equations
- BiCR variants of the hybrid BiCG methods for solving linear systems with nonsymmetric matrices
- Schur-decomposition for 3D matrix equations and its application in solving radiative discrete ordinates equations discretized by Chebyshev collocation spectral method
- 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\)
- The inverse, rank and product of tensors
- A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
- A class of outer generalized inverses
- A gradient based iterative solutions for Sylvester tensor equations
- Moore–Penrose inverse of tensors via Einstein product
- Solving multilinear systems via tensor inversion
- Weighted Moore-Penrose inverses and fundamental theorem of even-order tensors with Einstein product
- Generalized inverses of tensors via a general product of tensors
- Extending BiCG and BiCR methods to solve the Stein tensor equation
- A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
- On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations.
- Iterative method to solve the generalized coupled Sylvester-transpose linear matrix equations over reflexive or anti-reflexive matrix
- The generalized inverses of tensors and an application to linear models
- Further results on generalized inverses of tensors via the Einstein product
- The Drazin inverse of an even-order tensor and its application to singular tensor equations
- Reverse-order law for weighted Moore-Penrose inverse of tensors
- Perturbation theory for Moore-Penrose inverse of tensor via Einstein product
- Backward error and perturbation bounds for high order Sylvester tensor equation
- Outer and (b,c) inverses of tensors
- Reverse-order law for the Moore–Penrose inverses of tensors
- A modified CG algorithm for solving generalized coupled Sylvester tensor equations
- An iterative algorithm to solve the generalized Sylvester tensor equations
- Generalized tensor function via the tensor singular value decomposition based on the T-product
- Tensor inversion and its application to the tensor equations with Einstein product
- Extension of Moore–Penrose inverse of tensor via Einstein product
- A gradient based iterative method and associated preconditioning technique for solving the large multilinear systems
- A fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensors
- A rapid and powerful iterative method for computing inverses of sparse tensors with applications
- 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
Cited In (1)
This page was built for publication: HOBi-CGSTAB and HOBi-CRSTAB methods for solving some tensor equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138978)