Iterative refinement method by higher-order singular value decomposition for solving multi-linear systems
From MaRDI portal
Publication:6052208
DOI10.1016/j.aml.2023.108819MaRDI QIDQ6052208
No author found.
Publication date: 21 September 2023
Published in: Applied Mathematics Letters (Search for Journal in Brave)
LU decompositionhigher-order singular value decompositioniterative refinement methodmulti-linear systems
Cites Work
- Iterative refinement using splitting methods
- A globally and quadratically convergent algorithm for solving multilinear systems with \(\mathcal {M}\)-tensors
- A nonnegativity preserving algorithm for multilinear systems with nonsingular \(\mathcal{M}\)-tensors
- Triangular decomposition of CP factors of a third-order tensor with application to solving nonlinear systems of equations
- Solving the system of nonsingular tensor equations via randomized Kaczmarz-like method
- Preconditioned Jacobi type method for solving multi-linear systems with \(\mathcal{M}\)-tensors
- A new preconditioned SOR method for solving multi-linear systems with an \(\mathcal{M} \)-tensor
- Preconditioned tensor splitting iterations method for solving multi-linear systems
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- A homotopy method for solving multilinear systems with M-tensors
- $M$-Tensors and Some Applications
- A Multilinear Singular Value Decomposition
- On Nonnegative Solution of Multi-Linear System with Strong $\mathcal{M}_z$-Tensors
- Preconditioned diagonal dominant matrices
This page was built for publication: Iterative refinement method by higher-order singular value decomposition for solving multi-linear systems
