No label defined (Q3974784)

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 17464
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 17464

      Statements

      0 references
      0 references
      0 references
      26 June 1992
      0 references
      constrained eigenvalue problem
      0 references
      eigenvalue decomposition
      0 references
      quadratic eigenvalue problem
      0 references
      [For the entire collection see Zbl 0728.00018.] The authors consider the problem \(x^ TAx=\min\) subject to the constraints \(N^ Tx=t\), \(x^ Tx=1\), where \(A\) is a symmetric \((n+m)\times (n+m)\) matrix, \(n>0\), \(N\) is a \((n+m)\times n\) matrix with full rank, and \(t\) is a vector of dimension \(m\) with \(\| (N^ T)^ +t\| < 1\). They show that the original minimization can be reduced to a problem of the form \(\lambda = \min\) subject to \(Cz=\lambda z+b\), \(z^ Tz=s^ 2\). This problem, after an eigenvalue decomposition, is reduced to a problem of finding the solution of a one-dimensional secular equation. From another point of view the last problem can be reduced to a quadratic eigenvalue problem, which is transformed into an equivalent linear one.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references