A rapid and powerful iterative method for computing inverses of sparse tensors with applications
From MaRDI portal
Publication:2247163
DOI10.1016/j.amc.2021.126720OpenAlexW3205930864WikidataQ114210966 ScholiaQ114210966MaRDI QIDQ2247163
Saeed Karimi, Eisa Khosravi Dehdezi
Publication date: 16 November 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2021.126720
Numerical linear algebra (65Fxx) Basic linear algebra (15Axx) Linear and multilinear algebra; matrix theory (15-XX)
Related Items (6)
Exploiting higher computational efficiency index for computing outer generalized inverses ⋮ Finite-time zeroing neural networks with novel activation function and variable parameter for solving time-varying Lyapunov tensor equation ⋮ Convergence analysis of iterative methods for computing the T-pseudoinverse of complete full-rank third-order tensors based on the T-product ⋮ Several efficient iterative algorithms for solving nonlinear tensor equation \(\mathcal{X} + \mathcal{A}^T \ast_N \mathcal{X}^{-1} \ast_N \mathcal{A} = \mathcal{I}\) with Einstein product ⋮ HOBi-CGSTAB and HOBi-CRSTAB methods for solving some tensor equations ⋮ 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} \)
Uses Software
Cites Work
- Unnamed Item
- Tensor Decompositions and Applications
- Some variant of Newton's method with third-order convergence.
- Generalized inverses. Theory and applications.
- A gradient based iterative method and associated preconditioning technique for solving the large multilinear systems
- Computation of outer inverses of tensors using the QR decomposition
- Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations
- Core and core-EP inverses of tensors
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- An eigenvalue problem for even order tensors with its applications
- Moore–Penrose inverse of tensors via Einstein product
- Solving Multilinear Systems via Tensor Inversion
- On finding robust approximate inverses for large sparse matrices
- Efficient MATLAB Computations with Sparse and Factored Tensors
- A fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensors
- Krylov subspace methods to solve a class of tensor equations via the Einstein product
- Tensor Analysis
- Iterative algorithms for solving some tensor equations
- On the Numerical Properties of an Iterative Method for Computing the Moore–Penrose Generalized Inverse
This page was built for publication: A rapid and powerful iterative method for computing inverses of sparse tensors with applications
