The Chebyshev solution of certain matrix equations

DOI10.1007/BF01386444MaRDI QIDQ920580zbMATH OpenOpenAlexFDO

Authors W. A. Light

Publication date 1990

Published in Numerische Mathematik (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/133482

zbMATH Keywords

algorithmalternating algorithmbest approximationsChebyshev solutionconvergencematrix equations

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Best approximation, Chebyshev systems (41A50)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 205857
• scientific article; zbMATH DE number 1282019
• The Chebyshev solution of the linear matrix equation \(AX+YB=C\)
• Extremal signatures for bivariate Chebyshev approximation problems
• Strict Chebyshev approximation for general systems of linear equations

Cites work

• An algorithm for scaling matrices and computing the minimum cycle mean in a digraph
• Approximation theory in tensor product spaces
• Convergence of the diliberto-straus algorithm in L₁(XxY)
• Functional Operators (AM-21), Volume 1
• scientific article; zbMATH DE number 3871984 (Why is no real title available?)
• scientific article; zbMATH DE number 3671029 (Why is no real title available?)
• On the approximation of a bivariate function by the sum of univariate functions
• On the approximation of a function of several variables by the sum of functions of fewer variables
• Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones
• The Alternating Algorithm in Uniformly Convex Spaces
• The best approximation of bivariate functions by separable functions
• The Chebyshev solution of the linear matrix equation \(AX+YB=C\)
• The Diliberto-Straus algorithm in \(L_ 1(X\times Y)\)

Cited in

(9)

• The Chebyshev approximation of a rectangular matrix by matrices of smaller rank as the limit of \(\ell_p\)-approximation
• Properties of the strict Chebyshev solutions of the linear matrix equation AX+YB=C
• The multi-dimensional von Neumann alternating direction search algorithm in \(C(B)\) and \(L_1\)
• Extremal signatures for bivariate Chebyshev approximation problems
• Diophantine approximation of matrices
• Where there's a Will there's a way -- the research of Will Light
• The analysis of a Chebyshev problem via spectral matrix theory
• scientific article; zbMATH DE number 4201485 (Why is no real title available?)
• The Chebyshev solution of the linear matrix equation \(AX+YB=C\)

This page was built for publication: The Chebyshev solution of certain matrix equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q920580)