Splitting methods for tensor equations
Summary The Jacobi, Gauss‐Seidel and successive over‐relaxation methods are well‐known basic iterative methods for solving system of linear equations. In this paper, we extend those basic methods to solve the tensor equation Axm−1−b=0, where A is an mth‐order n−dimensional symmetric tensor and b is...
Gespeichert in:
Veröffentlicht in: | Numerical linear algebra with applications 2017-10, Vol.24 (5), p.n/a |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Summary
The Jacobi, Gauss‐Seidel and successive over‐relaxation methods are well‐known basic iterative methods for solving system of linear equations. In this paper, we extend those basic methods to solve the tensor equation
Axm−1−b=0, where
A is an mth‐order n−dimensional symmetric tensor and b is an n‐dimensional vector. Under appropriate conditions, we show that the proposed methods are globally convergent and locally r‐linearly convergent. Taking into account the special structure of the Newton method for the problem, we propose a Newton‐Gauss‐Seidel method, which is expected to converge faster than the above methods. The proposed methods can be extended to solve a general symmetric tensor equations. Our preliminary numerical results show the effectiveness of the proposed methods. |
---|---|
ISSN: | 1070-5325 1099-1506 |
DOI: | 10.1002/nla.2102 |