Fast and flexible preconditioners for solving multilinear systems

2021/10/06 by Eisa Khosravi Dehdezi, Dehdezi, Eisa Khosravi, Saeed Karimi +1
Computer Science · Mathematics · #FOS: Mathematics #Numerical Analysis (math.NA) #cs.NA #math.NA

paper · pdf · doi:10.48550/arxiv.2110.03015

arxiv created 2021/10/06 · arxiv updated 2021/10/08

Abstract

This paper investigates a type of fast and flexible preconditioners to solve multilinear system Ax^m-1=b with M-tensor A and obtains some important convergent theorems about preconditioned Jacobi, Gauss-Seidel and SOR type iterative methods. The main results theoretically prove that the preconditioners can accelerate the convergence of iterations. Numerical examples are presented to reverify the efficiency of the proposed preconditioned methods.

Related

• A tensor Alternating Anderson-Richardson method for solving multilinear systems with M-tensors
• Restarted Nonnegativity Preserving Tensor Splitting Methods via Relaxed Anderson Acceleration for Solving Multi-linear Systems
• A universal matrix-free split preconditioner for the fixed-point iterative solution of non-symmetric linear systems
• Preconditioning Parametrized Linear Systems
• Fast and Near-Optimal Diagonal Preconditioning