Comparison results for splitting iterations for solving multi-linear systems (Q1671737)

From MaRDI portal
Revision as of 09:35, 28 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129474573, #quickstatements; #temporary_batch_1724813321913)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Comparison results for splitting iterations for solving multi-linear systems
scientific article

    Statements

    Comparison results for splitting iterations for solving multi-linear systems (English)
    0 references
    0 references
    0 references
    0 references
    7 September 2018
    0 references
    It is known that the spectral radius of the iterative tensor associated with a stationary splitting method (like the Jacobi or Gauss-Seidel methods) can be seen as an approximate convergence rate for solving multi-linear systems. The paper first gives some spectral radius comparisons between different types of tensor splittings. Then, it proposes a particular preconditioned tensor splitting method with a tensor analogue of a bidiagonal preconditioner. The corresponding spectral radius is analyzed in dependence of the chosen entries of this preconditioner and compared with the situation without preconditioner. Numerical examples are given to demonstrate the efficiency of the preconditioned methods applied in both a Gauss-Seidel and an SOR-type of setting.
    0 references
    tensor splitting
    0 references
    tensor spectral radius
    0 references
    multi-linear systems
    0 references
    tensor preconditioning
    0 references
    stationary iterative methods
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references