A fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensors
From MaRDI portal
Publication:5080089
DOI10.22124/jmm.2021.19005.1627OpenAlexW3195536086MaRDI QIDQ5080089
Dehdezi Eisa Khosravi, Saeed Karimi
Publication date: 31 May 2022
Full work available at URL: https://jmm.guilan.ac.ir/article_4759_9e2610958a73db960e7ebc974df187f2.pdf
Related Items (5)
Paige's algorithm for solving a class of tensor least squares problem ⋮ Convergence analysis of iterative methods for computing the T-pseudoinverse of complete full-rank third-order tensors based on the T-product ⋮ HOBi-CGSTAB and HOBi-CRSTAB methods for solving some tensor equations ⋮ A rapid and powerful iterative method for computing inverses of sparse tensors with applications ⋮ A gradient based iterative method and associated preconditioning technique for solving the large multilinear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
- Weighted Moore-Penrose inverses and fundamental theorem of even-order tensors with Einstein product
- Golub-Kahan bidiagonalization for ill-conditioned tensor equations with applications
- A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix
- Some variant of Newton's method with third-order convergence.
- 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
- Generalized inverses. Theory and applications.
- On global iterative schemes based on Hessenberg process for (ill-posed) Sylvester tensor equations
- A preconditioning technique in conjunction with Krylov subspace methods for solving multilinear systems
- Tensor extrapolation methods with applications
- Generalized tensor function via the tensor singular value decomposition based on the T-product
- Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations
- Reverse-order law for weighted Moore-Penrose inverse of tensors
- Perturbation theory for Moore-Penrose inverse of tensor via Einstein product
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- A class of outer generalized inverses
- The inverse, rank and product of 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
- On finding robust approximate inverses for large sparse matrices
- Efficient MATLAB Computations with Sparse and Factored Tensors
- Tensor inversion and its application to the tensor equations with Einstein product
- Extension of Moore–Penrose inverse of tensor via Einstein product
- An iterative algorithm to solve the generalized Sylvester tensor equations
- An optimal preconditioner for tensor equations involving Einstein product
- Outer and (b,c) inverses of tensors
- Reverse-order law for the Moore–Penrose inverses of tensors
- Krylov subspace methods to solve a class of tensor equations via the Einstein product
- Further results on generalized inverses of tensors via the Einstein product
- Tensor Analysis
- Iterative algorithms for solving some tensor equations
- An Introduction to Iterative Toeplitz Solvers
- On the Numerical Properties of an Iterative Method for Computing the Moore–Penrose Generalized Inverse
This page was built for publication: A fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensors
