On the Kaczmarz methods based on relaxed greedy selection for solving matrix equation \(A X B = C\) (Q2146340)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Unfortunately, we do not yet have an article page for this item.
scientific article; zbMATH DE number 7542692
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Kaczmarz methods based on relaxed greedy selection for solving matrix equation \(A X B = C\) |
scientific article; zbMATH DE number 7542692 |
Statements
On the Kaczmarz methods based on relaxed greedy selection for solving matrix equation \(A X B = C\) (English)
0 references
16 June 2022
0 references
linear matrix equation
0 references
Petrov-Galerkin conditions
0 references
relaxed greedy selection
0 references
Kaczmarz iterate
0 references
convergence analysis
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8323827385902405
0 references
0.8028203845024109
0 references
0.8015220761299133
0 references
0.7974823117256165
0 references
0.795903742313385
0 references
