2000 character limit reached
Fast and flexible preconditioners for solving multilinear systems
Published 6 Oct 2021 in math.NA and cs.NA | (2110.03015v1)
Abstract: This paper investigates a type of fast and flexible preconditioners to solve multilinear system $\mathcal{A}\textbf{x}{m-1}=\textbf{b}$ with $\mathcal{M}$-tensor $\mathcal{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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.