Pages that link to "Item:Q2247163"
From MaRDI portal
The following pages link to A rapid and powerful iterative method for computing inverses of sparse tensors with applications (Q2247163):
Displaying 8 items.
- 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} \) (Q2068845) (← links)
- Exploiting higher computational efficiency index for computing outer generalized inverses (Q2120789) (← links)
- Finite-time zeroing neural networks with novel activation function and variable parameter for solving time-varying Lyapunov tensor equation (Q6106003) (← links)
- Convergence analysis of iterative methods for computing the T-pseudoinverse of complete full-rank third-order tensors based on the T-product (Q6110430) (← links)
- 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 (Q6125430) (← links)
- HOBi-CGSTAB and HOBi-CRSTAB methods for solving some tensor equations (Q6138978) (← links)
- Iterative methods for sparse symmetric multilinear systems (Q6642545) (← links)
- A novel iterative method to find the Moore-Penrose inverse of a tensor with Einstein product (Q6662385) (← links)
