A constrained eigenvalue problem (Q1117002): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W4210599947 / rank
 
Normal rank

Revision as of 21:36, 19 March 2024

scientific article
Language Label Description Also known as
English
A constrained eigenvalue problem
scientific article

    Statements

    A constrained eigenvalue problem (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    For the problem of finding \(Min(x^ TAx)\) for a symmetric matrix A subject to \(x^ Tx=1\) and \(N^ Tx=t\) theoretical and numerical methods are described. First the linear constraint is removed and then Lagrange multipliers are employed reducing the problem to solve either a secular equation or a quadratic eigenvalue problem.
    0 references
    Lagrange equation
    0 references
    singular value decomposition
    0 references
    QR decomposition
    0 references
    Rayleigh quotient
    0 references
    symmetric matrix
    0 references
    Lagrange multipliers
    0 references
    secular equation
    0 references
    quadratic eigenvalue problem
    0 references

    Identifiers