Numerical resolution of cone-constrained eigenvalue problems
By A. Costa, A. Seeger. 2009
49 citations recorded by the source corpus.
Given a convex cone K and matrices A and B, one wishes to find a scalar λ and a nonzero vector x satisfying the complementarity system K ∋ x ⊥(Ax-λ Bx) ∈ K+. This problem arises in mechanics and in other areas of applied mathematics. Two numerical techniques for solving such kind of cone-constrained eigenvalue problem are discussed, namely, the Power Iteration Method and the Scaling and Projection Algorithm.
Subfields: Computational Theory and Mathematics, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/a78322a9e57f55cd347c7f69ba378fdc5d111ba5
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Numerical Analysis
Citations in the corpus
- Properties of circular cone and spectral factorization associated with circular cone (2013, background): “In fact, formula (14) can be found in several places, for example, [8], [1, page 508] or [2, Theorem 3.”