Iterative algorithms for least-squares solutions of a quaternion matrix equation (Q513486)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Iterative algorithms for least-squares solutions of a quaternion matrix equation |
scientific article; zbMATH DE number 6692478
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iterative algorithms for least-squares solutions of a quaternion matrix equation |
scientific article; zbMATH DE number 6692478 |
Statements
Iterative algorithms for least-squares solutions of a quaternion matrix equation (English)
0 references
7 March 2017
0 references
The authors analyse four classes of algorithms for numerical computation of least squares solutions of the quaternion matrix equation, with large and sparse matrices, of the form \[ AX + (AX)^{\eta H} + B Y B^{\eta H} + C Z C^{\eta H} = D. \]
0 references
quaternion matrix equations
0 references
\(\eta\)-(anti)-Hermitian matrix
0 references
iterative algorithm
0 references
preconditioner
0 references
convergence
0 references
least squares solutions
0 references
sparse matrices
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9060965180397034
0 references
0.8620455265045166
0 references
0.8605258464813232
0 references
0.860019862651825
0 references
