Computer-aided study of a problem in Hermitian matrix theory (Q752802)

From MaRDI portal





scientific article; zbMATH DE number 4179561
Language Label Description Also known as
default for all languages
No label defined
    English
    Computer-aided study of a problem in Hermitian matrix theory
    scientific article; zbMATH DE number 4179561

      Statements

      Computer-aided study of a problem in Hermitian matrix theory (English)
      0 references
      0 references
      0 references
      1990
      0 references
      Let A be an \(n\times n\) positive definite Hermitian matrix and let B be an \(n\times n\) nonnegative semidefinite Hermitian matrix. For \(n\geq 3\), there is a smallest real number \(t_ n>2\) such that if \(-2<t\leq t_ n\) then the solution X to the equation \(A^ 2X+XA^ 2+tAXA=B\) is nonnegative semidefinite Hermitian. The authors describe their use of REDUCE and MAPLE in showing that \(t_ 4=4\) and in obtaining bounds for \(t_ n\) when \(5\leq n\leq 8\).
      0 references
      symbolic computation
      0 references
      matrix equation
      0 references
      positive definite Hermitian matrix
      0 references
      REDUCE
      0 references
      MAPLE
      0 references
      bounds
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references