ON THE ALGORITHMIC COMPLEXITY OF STATIC STRUCTURES

Joel RATSABY;J. CHASKALOVIC

系统科学与复杂性(英文) ›› 2010, Vol. 23 ›› Issue (6) : 1037-1053.

PDF(528 KB)
中国科学院数学与系统科学研究院期刊网
JSSC
PDF(528 KB)
系统科学与复杂性(英文) ›› 2010, Vol. 23 ›› Issue (6) : 1037-1053. DOI: 10.1007/s11424-010-8465-2
论文

ON THE ALGORITHMIC COMPLEXITY OF STATIC STRUCTURES

    Joel RATSABY(1), J. CHASKALOVIC(2)
作者信息 +

ON THE ALGORITHMIC COMPLEXITY OF STATIC STRUCTURES

    Joel RATSABY(1), J. CHASKALOVIC(2)
Author information +
文章历史 +

摘要

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.

Abstract

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.

关键词

Data compression / descriptional complexity / randomness / static structure.

Key words

Data compression / descriptional complexity / randomness / static structure.

引用本文

EndNote

Ris (Procite)

Bibtex

导出引用
Joel RATSABY , J. CHASKALOVIC. ON THE ALGORITHMIC COMPLEXITY OF STATIC STRUCTURES. 系统科学与复杂性(英文), 2010, 23(6): 1037-1053 https://doi.org/10.1007/s11424-010-8465-2
Joel RATSABY , J. CHASKALOVIC. ON THE ALGORITHMIC COMPLEXITY OF STATIC STRUCTURES. Journal of Systems Science and Complexity, 2010, 23(6): 1037-1053 https://doi.org/10.1007/s11424-010-8465-2
PDF(528 KB)

141

Accesses

0

Citation

Detail
段落导航
相关文章

/

〈 〉