Iterative algorithms for least-squares solutions of a quaternion matrix equation (Q513486): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: LSMR / rank | |||
Normal rank | |||
Revision as of 09:10, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Iterative algorithms for least-squares solutions of a quaternion matrix equation |
scientific article |
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
