The Chebyshev solution of certain matrix equations (Q920580)

From MaRDI portal
Revision as of 18:21, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    Chebyshev solution
    0 references
    matrix equations
    0 references
    algorithm
    0 references
    best approximations
    0 references
    alternating algorithm
    0 references
    convergence
    0 references