The Chebyshev solution of certain matrix equations (Q920580): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2001721060 / rank | |||
Normal rank |
Latest revision as of 11:25, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Chebyshev solution of certain matrix equations |
scientific article |
Statements
The Chebyshev solution of certain matrix equations (English)
0 references
1990
0 references
The problem of approximating an \((n,m)\)-matrix by a matrix of the form \(XA+BY\) is considered. The problem is closely related to that of approximating a function by a function of the form \(xh+gy\), so that the language of function is used, rather than that of matrices. The described algorithm for constructing best approximations is a version of the alternating algorithm of John von Neumann. Certain convergence properties of the alternating algorithm hold in a very general setting.
0 references
Chebyshev solution
0 references
matrix equations
0 references
algorithm
0 references
best approximations
0 references
alternating algorithm
0 references
convergence
0 references
0 references
0 references