A note on ``A new iteration method for the matrix equation \(AX=B\)'' (Q450291)
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 6081859
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on ``A new iteration method for the matrix equation \(AX=B\)'' |
scientific article; zbMATH DE number 6081859 |
Statements
A note on ``A new iteration method for the matrix equation \(AX=B\)'' (English)
0 references
13 September 2012
0 references
The present note is concerned with the results presented in a previous paper by \textit{K. Guo} et al. [Appl. Math. Comput. 187, No. 2, 1434--1441 (2007; Zbl 1121.65043)]. The author shows that the iteration method proposed there is the steepest descent method with exact line search for some optimization problems
0 references
matrix equation
0 references
steepest descent method
0 references
exact line search
0 references
0.7915452718734741
0 references
0.7774677276611328
0 references
0.7582517266273499
0 references
0.757882297039032
0 references
0.7551953196525574
0 references
