On the algorithmic complexity of static structures

Joel Ratsaby, J. Chaskalovic

نتاج البحث: نشر في مجلةمقالةمراجعة النظراء

3 اقتباسات (Scopus)

ملخص

This paper provides a first indication that this is true for a system comprised of a static structure described by hyperbolic partial differential equations and is subjected to an external random input force. The system deforms the randomness of an input force sequence in proportion to its algorithmic complexity. The authors demonstrate this by numerical analysis of a one-dimensional vibrating elastic solid (the system) on which we apply a maximally-random force sequence (input). The level of complexity of the system is controlled via external parameters. The output response is the field of displacements observed at several positions on the body. The algorithmic complexity and stochasticity of the resulting output displacement sequence is measured and compared against the complexity of the system. The results show that the higher the system complexity, the more random-deficient the output sequence.

اللغة الأصليةالإنجليزيّة
الصفحات (من إلى)1037-1053
عدد الصفحات17
دوريةJournal of Systems Science and Complexity
مستوى الصوت23
رقم الإصدار6
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - 2010

بصمة

أدرس بدقة موضوعات البحث “On the algorithmic complexity of static structures'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا