Spectral power iterations for the random eigenvalue problem

Hadi Meidani, Roger Ghanem Prof.

Research output: Contribution to journalArticlepeer-review


Two computationally efficient algorithms are developed for solving the stochastic eigenvalue problem. An algorithm based on the power iteration technique is proposed for the calculation of the dominant eigenpairs. This algorithm is then extended to find other subdominant random eigenpairs. The uncertainty in the operator is represented by a polynomial chaos expansion, and a similar representation is considered for the random eigenvalues and eigenvectors. The algorithms are distinguished due to their speed in converging to the true random eigenpairs and their ability to estimate a prescribed number of subdominant eigenpairs. The algorithms are demonstrated on two examples with close agreement observed with the exact solution and a solution synthesized through Monte Carlo sampling.

Original languageEnglish (US)
Pages (from-to)912-924
Number of pages13
JournalAIAA journal
Issue number5
StatePublished - May 2014
Externally publishedYes

ASJC Scopus subject areas

  • Aerospace Engineering


Dive into the research topics of 'Spectral power iterations for the random eigenvalue problem'. Together they form a unique fingerprint.

Cite this