Efficient characterization of the random eigenvalue problem in a polynomial chaos decomposition

2007 ◽  
Vol 72 (4) ◽  
pp. 486-504 ◽  
Author(s):  
Roger Ghanem ◽  
Debraj Ghosh
Author(s):  
Roger Ghanem ◽  
Debraj Ghosh

For a system with the parameters modeled as uncertain, polynomial approximations such as polynomial chaos expansion provide an effective way to estimate the statistical behavior of the eigenvalues and eigenvectors, provided the eigenvalues are widely spaced. For a system with a set of clustered eigenvalues, the corresponding eigenvalues and eigenvectors are very sensitive to perturbation of the system parameters. An enrichment scheme to the polynomial chaos expansion is proposed here in order to capture the behavior of such eigenvalues and eigenvectors. It is observed that for judiciously chosen enrichment functions, the enriched expansion provides better estimate of the statistical behavior of the eigenvalues and eigenvectors.


AIAA Journal ◽  
2014 ◽  
Vol 52 (5) ◽  
pp. 912-925 ◽  
Author(s):  
Hadi Meidani ◽  
Roger Ghanem

2017 ◽  
Vol 113 (3) ◽  
pp. 450-478 ◽  
Author(s):  
Bin Huang ◽  
Heng Zhang ◽  
Kok-Kwang Phoon

Sign in / Sign up

Export Citation Format

Share Document