A gradient based iterative method and associated preconditioning technique for solving the large multilinear systems
From MaRDI portal
Publication:2059724
DOI10.1007/s10092-021-00438-1zbMath1483.65073OpenAlexW3211116228MaRDI QIDQ2059724
Eisa Khosravi Dehdezi, Saeed Karimi
Publication date: 14 December 2021
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10092-021-00438-1
Iterative numerical methods for linear systems (65F10) Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99) Preconditioners for iterative methods (65F08)
Related Items (5)
HOBi-CGSTAB and HOBi-CRSTAB methods for solving some tensor equations ⋮ Unnamed Item ⋮ A rapid and powerful iterative method for computing inverses of sparse tensors with applications ⋮ Iterative methods for solving Sylvester transpose tensor equation \(\mathcal A\star_N\mathcal X\star_M\mathcal{B}+\mathcal{C}\star_M\mathcal X^T\star_N\mathcal{D}=\mathcal{E} \) ⋮ A preconditioned tensor splitting iteration method and associated global correction technique for solving multilinear systems
Cites Work
- Tensor Decompositions and Applications
- Constrained two-sided coupled Sylvester-type quaternion matrix equations
- Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
- Extending BiCG and BiCR methods to solve the Stein tensor equation
- Developing iterative algorithms to solve Sylvester tensor equations
- A modified CG algorithm for solving generalized coupled Sylvester tensor equations
- A novel intelligent option price forecasting and trading system by multiple kernel adaptive filters
- Numerical algorithms for solving discrete Lyapunov tensor equation
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- Iterative least-squares solutions of coupled sylvester matrix equations
- An eigenvalue problem for even order tensors with its applications
- Moore–Penrose inverse of tensors via Einstein product
- Solving Multilinear Systems via Tensor Inversion
- Efficient MATLAB Computations with Sparse and Factored Tensors
- A Hessenberg-Schur method for the problem AX + XB= C
- Least squares solution of the quaternion Sylvester tensor equation
- 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
- An optimal preconditioner for tensor equations involving Einstein product
- Krylov subspace methods to solve a class of tensor equations via the Einstein product
- Gradient based iterative algorithms for solving a class of matrix equations
- Further results on generalized inverses of tensors via the Einstein product
- Tensor Analysis
- Iterative algorithms for solving some tensor equations
- The right–left preconditioning technique for the solution of the large matrix equationAXB = C
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A gradient based iterative method and associated preconditioning technique for solving the large multilinear systems
