Bounding the growth factor in Gaussian elimination for Buckley's class of complex symmetric matrices (Q4814484)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2098221
Language Label Description Also known as
default for all languages
No label defined
    English
    Bounding the growth factor in Gaussian elimination for Buckley's class of complex symmetric matrices
    scientific article; zbMATH DE number 2098221

      Statements

      0 references
      0 references
      7 September 2004
      0 references
      complex symmetric positive definite matrix
      0 references
      growth factor
      0 references
      Buckley matrix
      0 references
      Gaussian elimination
      0 references
      Loewner order
      0 references
      Bounding the growth factor in Gaussian elimination for Buckley's class of complex symmetric matrices (English)
      0 references
      Let an \(n\times n\) complex non-singular matrix \(A\) be considered and let \(A^{(k)}=( a_{ij}^{(k)})\) be the matrix obtained from \(A\) through the \(k\) steps of Gaussian elimination applied to \(A\). The quantity \(\rho _n(A)\) defined by \(\rho _n(A)= (\max _{i,j,k} | a_{ij}^{(k)}| )/\max _{i,j}| a_{ij}| \) is called the growth factor (in Gaussian elimination) for \(A\). After presenting a brief list of basic results concerning the growth factor, the authors prove that if \(A\) is a Buckley matrix, i.e., \(A=I_n+\text{i}C\), where \(I_n\) is the identity matrix and \(C\) is real symmetric positive definite, then \(\rho _n(A)\leq (1+\sqrt {17})/4\approx 1.28078\).
      0 references

      Identifiers