z-logo
Premium
Linear random vibration by stochastic reduced‐order models
Author(s) -
Grigoriu Mircea
Publication year - 2009
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.2809
Subject(s) - gaussian , random vibration , noise (video) , mathematics , gaussian noise , linear system , vibration , state (computer science) , algorithm , computer science , mathematical optimization , statistical physics , mathematical analysis , artificial intelligence , physics , image (mathematics) , quantum mechanics
A practical method is developed for calculating statistics of the states of linear dynamic systems with deterministic properties subjected to non‐Gaussian noise and systems with uncertain properties subjected to Gaussian and non‐Gaussian noise. These classes of problems are relevant as most systems have uncertain properties, physical noise is rarely Gaussian, and the classical theory of linear random vibration applies to deterministic systems and can only deliver the first two moments of a system state if the noise is non‐Gaussian. The method (1) is based on approximate representations of all or some of the random elements in the definition of linear random vibration problems by stochastic reduced‐order models (SROMs), that is, simple random elements having a finite number of outcomes of unequal probabilities, (2) can be used to calculate statistics of a system state beyond its first two moments, and (3) establishes bounds on the discrepancy between exact and SROM‐based solutions of linear random vibration problems. The implementation of the method has required to integrate existing and new numerical algorithms. Examples are presented to illustrate the application of the proposed method and assess its accuracy. Copyright © 2009 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here