Abstract
In this paper, the eigenvalue problem with multiple uncertain parameters is analyzed by the sparse grid stochastic collocation method. This method provides an interpolation approach to approximate eigenvalues and eigenvectors’ functional dependencies on uncertain parameters. This method repetitively evaluates the deterministic solutions at the pre-selected nodal set to construct a high-dimensional interpolation formula of the result. Taking advantage of the smoothness of the solution in the uncertain space, the sparse grid collocation method can achieve a high order accuracy with a small nodal set. Compared with other sampling based methods, this method converges fast with the increase of the number of points. Some numerical examples with different dimensions are presented to demonstrate the accuracy and efficiency of the sparse grid stochastic collocation method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.