Block-row and block-column iterative algorithms for solving linear matrix equation
Using tools like the Kronecker product and the vector operator, various Sylvester matrix equations can always be converted into the form A x = f , motivating us to investigate the algorithm for solving the linear matrix equation A x = f . By dividing the coefficient matrix A into row blocks or colum...
Uloženo v:
| Vydáno v: | Computational & applied mathematics Ročník 42; číslo 4 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Cham
Springer International Publishing
01.06.2023
|
| Témata: | |
| ISSN: | 2238-3603, 1807-0302 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | Using tools like the Kronecker product and the vector operator, various Sylvester matrix equations can always be converted into the form
A
x
=
f
, motivating us to investigate the algorithm for solving the linear matrix equation
A
x
=
f
. By dividing the coefficient matrix
A
into row blocks or column blocks, a block-row iterative (BRI) algorithm, a block-column iterative (BCI) algorithm and an accelerated block-column iterative (ABCI) algorithm are developed to solve
A
x
=
f
. It is successfully proved that the numerical solution produced by the proposed algorithms can converge to the exact solution for any given initial vector under appropriate conditions. Numerical examples are provided to demonstrate the effectiveness and superiority of the proposed algorithms. |
|---|---|
| ISSN: | 2238-3603 1807-0302 |
| DOI: | 10.1007/s40314-023-02312-y |