A preconditioned tensor splitting iteration method and associated global correction technique for solving multilinear systems
From MaRDI portal
Publication:2108512
DOI10.1007/s10092-022-00499-wOpenAlexW4311813899MaRDI QIDQ2108512
Publication date: 19 December 2022
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10092-022-00499-w
Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99) Preconditioners for iterative methods (65F08)
Cites Work
- Unnamed Item
- Tensor Decompositions and Applications
- Spectra of uniform hypergraphs
- Convergence of parallel multisplitting iterative methods for M-matrices
- Modified iterative methods for consistent linear systems
- Comparison results for splitting iterations for solving multi-linear systems
- Algebraic connectivity of an even uniform hypergraph
- A preconditioning technique in conjunction with Krylov subspace methods for solving multilinear systems
- Tensor extrapolation methods with applications
- A gradient based iterative method and associated preconditioning technique for solving the large multilinear systems
- A new preconditioned SOR method for solving multi-linear systems with an \(\mathcal{M} \)-tensor
- Conjugate gradient-like methods for solving general tensor equation with Einstein product
- Further results on Moore-Penrose inverses of tensors with application to tensor nearness problems
- Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations
- A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
- An eigenvalue problem for even order tensors with its applications
- On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations
- Solving Multilinear Systems via Tensor Inversion
- Tensor inversion and its application to the tensor equations with Einstein product
- Hermitian and skew-Hermitian splitting methods for solving a tensor equation
- An efficient algorithm for solving the nonnegative tensor least squares problem
- An iterative algorithm to solve the generalized Sylvester tensor equations
- An optimal preconditioner for tensor equations involving Einstein product
- Krylov subspace methods to solve a class of tensor equations via the Einstein product
- Iterative algorithms for solving some tensor equations
- Matrix Iterative Analysis
- Numerical subspace algorithms for solving the tensor equations involving Einstein product
This page was built for publication: A preconditioned tensor splitting iteration method and associated global correction technique for solving multilinear systems
