Numerical resolution of cone-constrained eigenvalue problems (Q1020997)

From MaRDI portal
Revision as of 01:55, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Numerical resolution of cone-constrained eigenvalue problems
scientific article

    Statements

    Numerical resolution of cone-constrained eigenvalue problems (English)
    0 references
    0 references
    4 June 2009
    0 references
    This paper deals with a kind of cone-constrained eigenvalue problem. An interesting particular case is the so-called Pareto eigenvalue problem. Two numerical techniques are discussed, namely, the power iteration method and the scaling and projection algorithm (SPA). Several important observations are made. For example, numerical tests demonstrate that a right choice of scaling factor is crucial for obtaining a good performance of the SPA.
    0 references
    0 references
    complementarity condition
    0 references
    generalized eigenvalue problem
    0 references
    power iteration method
    0 references
    scaling
    0 references
    projection algorithm
    0 references
    numerical examples
    0 references
    Pareto eigenvalue problem
    0 references

    Identifiers