An iterative algorithm for the least squares bisymmetric solutions of the matrix equations \(A_{1}XB_{1}=C_{1},A_{2}XB_{2}=C_{2}\) (Q970024)

From MaRDI portal





scientific article; zbMATH DE number 5705793
Language Label Description Also known as
default for all languages
No label defined
    English
    An iterative algorithm for the least squares bisymmetric solutions of the matrix equations \(A_{1}XB_{1}=C_{1},A_{2}XB_{2}=C_{2}\)
    scientific article; zbMATH DE number 5705793

      Statements

      An iterative algorithm for the least squares bisymmetric solutions of the matrix equations \(A_{1}XB_{1}=C_{1},A_{2}XB_{2}=C_{2}\) (English)
      0 references
      0 references
      0 references
      8 May 2010
      0 references
      The authors propose an iterative algorithm for solving the minimum Frobenius norm residual problem \(\min \left[ \left( A_{1}XB_{1}-C_{1} \right)^2 + \left( A_{2}XB_{2}-C_{2} \right)^2 \right]\) over bisymmetric matrices. The algorithm acts on the associated normal equation of the initial one.
      0 references
      iterative algorithm
      0 references
      least squares bisymmetric solution
      0 references
      matrix equation
      0 references
      optimal approximation solution
      0 references
      minimum Frobenius norm residual problem
      0 references
      normal equation
      0 references

      Identifiers