Abstract
AbstractWe present a new approach to obtain solutions for general random oscillators using a broad class of polynomial chaos expansions, which are more efficient than the classical Wiener–Hermite expansions. The approach is general but here we present results for linear oscillators only with random forcing or random coefficients. In this context, we are able to obtain relatively sharp error estimates in the representation of the stochastic input as well as the solution. We have also performed computational comparisons with Monte Carlo simulations which show that the new approach can be orders of magnitude faster, especially for compact distributions. Copyright © 2004 John Wiley & Sons, Ltd.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal for Numerical Methods in Engineering
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.
