Matrix iterative solutions to the least squares problem of \(BXA^{T} = F\) with some linear constraints (Q870162): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.amc.2006.06.097 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2035625942 / rank | |||
Normal rank | |||
Revision as of 03:32, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Matrix iterative solutions to the least squares problem of \(BXA^{T} = F\) with some linear constraints |
scientific article |
Statements
Matrix iterative solutions to the least squares problem of \(BXA^{T} = F\) with some linear constraints (English)
0 references
12 March 2007
0 references
The matrix least squares (LS) problem \(BXA^T= F\) is considered with various linear constraints on the solutions such as symmetry, skew-symmetry, and symmetry/skew-symmetry commuting with a given symmetric matrix. Matrix iterative algorithms are proposed, based on the classical LSQR algorithm [see \textit{C. C. Paige} and \textit{M. A. Saunders}, ACM Trans. Math. Softw. 8, 43--71 (1982; Zbl 0478.65016)] for solving the unconstrained LS problem. Numerical examples are given to display the efficiency of the algorithms.
0 references
matrix equation
0 references
LSQR algorithm
0 references
iterative algorithm
0 references
numerical examples
0 references
