Iterative methods for sparse symmetric multilinear systems
From MaRDI portal
Recommendations
- A gradient based iterative method and associated preconditioning technique for solving the large multilinear systems
- Gradient based iterative methods for solving symmetric tensor equations
- The accelerated overrelaxation splitting method for solving symmetric tensor equations
- Improving the Gauss–Seidel iterative method for solving multi-linear systems with $$\mathcal {M}$$-tensors
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
Cites work
- A fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensors
- A globally and quadratically convergent algorithm for solving multilinear systems with \(\mathcal {M}\)-tensors
- A gradient based iterative method and associated preconditioning technique for solving the large multilinear systems
- A homotopy method for solving multilinear systems with M-tensors
- A Levenberg-Marquardt method for solving semi-symmetric tensor equations
- A new preconditioned SOR method for solving multi-linear systems with an \(\mathcal{M} \)-tensor
- A nonnegativity preserving algorithm for multilinear systems with nonsingular \(\mathcal{M}\)-tensors
- A rapid and powerful iterative method for computing inverses of sparse tensors with applications
- Alternating iterative methods for solving tensor equations with applications
- Alternating projection method for a class of tensor equations
- An eigenvalue problem for even order tensors with its applications
- Comparison results for splitting iterations for solving multi-linear systems
- Eigenvalues of a real supersymmetric tensor
- 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
- Gradient based iterative methods for solving symmetric tensor equations
- 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} \)
- Methods of conjugate gradients for solving linear systems
- On finding strong approximate inverses for tensors
- On the solvability of tensor absolute value equations
- On the uniqueness of the positive Z-eigenvector for nonnegative tensors
- Parallel iterative methods for sparse linear systems
- Preconditioned iterative methods for multi-linear systems based on the majorization matrix
- Preconditioned tensor splitting iterations method for solving multi-linear systems
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- Solving tensor E-eigenvalue problem faster
- Tensor methods for solving symmetric \({\mathcal {M}}\)-tensor systems
- The tensor splitting with application to solve multi-linear systems
This page was built for publication: Iterative methods for sparse symmetric multilinear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6642545)
