Fast and flexible preconditioners for solving multilinear systems

10/06/2021
by   Eisa Khosravi Dehdezi, et al.
0

This paper investigates a type of fast and flexible preconditioners to solve multilinear system 𝒜x^m-1=b with ℳ-tensor 𝒜 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/18/2020

Kaczmarz-type inner-iteration preconditioned flexible GMRES methods for consistent linear systems

We propose using greedy and randomized Kaczmarz inner-iterations as prec...
research
11/13/2020

A new iterative method for solving a class of two-by-two block complex linear systems

We present an iterative method for solving the system arisen from finite...
research
01/26/2021

On level set type methods for elliptic Cauchy problems

Two methods of level set type are proposed for solving the Cauchy proble...
research
02/03/2020

On preconditioned AOR method for solving linear systems

In this paper, we investigate the preconditioned AOR method for solving ...
research
11/04/2019

Nonstationary iterative processes

In this paper we present iterative methods of high efficiency by the cri...
research
07/31/2019

Fast Tensor Needlet Transforms for Tangent Vector Fields on the Sphere

This paper constructs a semi-discrete tight frame of tensor needlets ass...

Please sign up or login with your details

Forgot password? Click here to reset