Detail
Article
Online article
FT
Medvik - BMC
  • Something wrong with this record ?

Gridding discretization-based multiple stability switching delay search algorithm: The movement of a human being on a controlled swaying bow

L. Pekař, R. Matušů, R. Prokop,

. 2017 ; 12 (6) : e0178950. [pub] 20170608

Language English Country United States

Document type Journal Article

Persistent link   https://www.medvik.cz/link/bmc17030762

Delay represents a significant phenomenon in the dynamics of many human-related systems-including biological ones. It has i.a. a decisive impact on system stability, and the study of this influence is often mathematically demanding. This paper presents a computationally simple numerical gridding algorithm for the determination of stability margin delay values in multiple-delay linear systems. The characteristic quasi-polynomial-the roots of which decide about stability-is subjected to iterative discretization by means of pre-warped bilinear transformation. Then, a linear and a quadratic interpolation are applied to obtain the associated characteristic polynomial with integer powers. The roots of the associated characteristic polynomial are closely related to the estimation of roots of the original characteristic quasi-polynomial which agrees with the system's eigenvalues. Since the stability border is crossed by the leading one, the switching root locus is enhanced using the Regula Falsi interpolation method. Our methodology is implemented on-and verified by-a numerical bio-cybernetic example of the stabilization of a human-being's movement on a controlled swaying bow. The advantage of the proposed novel algorithm lies in the possibility of the rapid computation of polynomial zeros by means of standard programs for technical computing; in the low level of mathematical knowledge required; and, in the sufficiently high precision of the roots loci estimation. The relationship to the direct search QuasiPolynomial (mapping) Rootfinder algorithm and computational complexity are discussed as well. This algorithm is also applicable for systems with non-commensurate delays.

References provided by Crossref.org

000      
00000naa a2200000 a 4500
001      
bmc17030762
003      
CZ-PrNML
005      
20171025122736.0
007      
ta
008      
171025s2017 xxu f 000 0|eng||
009      
AR
024    7_
$a 10.1371/journal.pone.0178950 $2 doi
035    __
$a (PubMed)28594904
040    __
$a ABA008 $b cze $d ABA008 $e AACR2
041    0_
$a eng
044    __
$a xxu
100    1_
$a Pekař, Libor $u Department of Automation and Control Engineering, Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic.
245    10
$a Gridding discretization-based multiple stability switching delay search algorithm: The movement of a human being on a controlled swaying bow / $c L. Pekař, R. Matušů, R. Prokop,
520    9_
$a Delay represents a significant phenomenon in the dynamics of many human-related systems-including biological ones. It has i.a. a decisive impact on system stability, and the study of this influence is often mathematically demanding. This paper presents a computationally simple numerical gridding algorithm for the determination of stability margin delay values in multiple-delay linear systems. The characteristic quasi-polynomial-the roots of which decide about stability-is subjected to iterative discretization by means of pre-warped bilinear transformation. Then, a linear and a quadratic interpolation are applied to obtain the associated characteristic polynomial with integer powers. The roots of the associated characteristic polynomial are closely related to the estimation of roots of the original characteristic quasi-polynomial which agrees with the system's eigenvalues. Since the stability border is crossed by the leading one, the switching root locus is enhanced using the Regula Falsi interpolation method. Our methodology is implemented on-and verified by-a numerical bio-cybernetic example of the stabilization of a human-being's movement on a controlled swaying bow. The advantage of the proposed novel algorithm lies in the possibility of the rapid computation of polynomial zeros by means of standard programs for technical computing; in the low level of mathematical knowledge required; and, in the sufficiently high precision of the roots loci estimation. The relationship to the direct search QuasiPolynomial (mapping) Rootfinder algorithm and computational complexity are discussed as well. This algorithm is also applicable for systems with non-commensurate delays.
650    12
$a algoritmy $7 D000465
650    _2
$a lidé $7 D006801
650    _2
$a pohyb $x fyziologie $7 D009068
655    _2
$a časopisecké články $7 D016428
700    1_
$a Matušů, Radek $u Regional Research Centre CEBIA-Tech, Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic.
700    1_
$a Prokop, Roman $u Department of Mathematics, Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic.
773    0_
$w MED00180950 $t PloS one $x 1932-6203 $g Roč. 12, č. 6 (2017), s. e0178950
856    41
$u https://pubmed.ncbi.nlm.nih.gov/28594904 $y Pubmed
910    __
$a ABA008 $b sig $c sign $y a $z 0
990    __
$a 20171025 $b ABA008
991    __
$a 20171025122818 $b ABA008
999    __
$a ok $b bmc $g 1254355 $s 991789
BAS    __
$a 3
BAS    __
$a PreBMC
BMC    __
$a 2017 $b 12 $c 6 $d e0178950 $e 20170608 $i 1932-6203 $m PLoS One $n PLoS One $x MED00180950
LZP    __
$a Pubmed-20171025
Back

Find record

Citation metrics

Archiving options