A constrained eigenvalue problem (Q1117002): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4210599947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: "Ridge Analysis" of Response Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Stationary Values of a Second-Degree Polynomial on the Unit Sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least squares with a quadratic constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Modified Matrix Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5185900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4148902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Trust Region Step / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing by spline functions. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on a Theorem of Forsythe and Golub / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple Comparison of Regression Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974784 / rank
 
Normal rank

Latest revision as of 13:20, 19 June 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