کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
8253524 | 1533613 | 2018 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Computation of the largest positive Lyapunov exponent using rounding mode and recursive least square algorithm
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
فیزیک و نجوم
فیزیک آماری و غیرخطی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
It has been shown that natural interval extensions (NIE) can be used to calculate the largest positive Lyapunov exponent (LLE). However, the elaboration of NIE are not always possible for some dynamical systems, such as those modelled by simple equations or by Simulink-type blocks. In this paper, we use rounding mode of floating-point numbers to compute the LLE. We have exhibited how to produce two pseudo-orbits by means of different rounding modes; these pseudo-orbits are used to calculate the Lower Bound Error (LBE). The LLE is the slope of the line gotten from the logarithm of the LBE, which is estimated by means of a recursive least square algorithm (RLS). The main contribution of this paper is to develop a procedure to compute the LLE based on the LBE without using the NIE. Additionally, with the aid of RLS the number of required points has been decreased. Eight numerical examples are given to show the effectiveness of the proposed technique.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Chaos, Solitons & Fractals - Volume 112, July 2018, Pages 36-43
Journal: Chaos, Solitons & Fractals - Volume 112, July 2018, Pages 36-43
نویسندگان
Márcia L.C. Peixoto, Erivelton G. Nepomuceno, Samir A.M. Martins, Márcio J. Lacerda,