Remember Me
Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:

OpenAIRE is about to release its new face with lots of new content and services.
During September, you may notice downtime in services, while some functionalities (e.g. user registration, login, validation, claiming) will be temporarily disabled.
We apologize for the inconvenience, please stay tuned!
For further information please contact helpdesk[at]openaire.eu

fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Mohammed, Najla Abdullah (2016)
Languages: English
Types: Doctoral thesis
Subjects: QA801
Lyapunov functions are functions with negative orbital derivative, whose existence guarantee the stability of an equilibrium point of an ODE. Moreover, sub-level sets of a Lyapunov function are subsets of the domain of attraction of the equilibrium. In this thesis, we improve an established numerical method to construct Lyapunov functions using the radial basis functions (RBF) collocation method. The RBF collocation method approximates the solution of linear PDE's using scattered collocation points, and one of its applications is the construction of Lyapunov functions. More precisely, we approximate Lyapunov functions, that satisfy equations for their orbital derivative, using the RBF collocation method. Then, it turns out that the RBF approximant itself is a Lyapunov function. \ud Our main contributions to improve this method are firstly to combine this construction method with a new grid refinement algorithm based on Voronoi diagrams. Starting with a coarse grid and applying the refinement algorithm, we thus manage to reduce the number of collocation points needed to construct Lyapunov functions. Moreover, we design two modified refinement algorithms to deal with the issue of the early termination of the original refinement algorithm without constructing a Lyapunov function. These algorithms uses cluster centres to place points where the Voronoi vertices failed to do so. \ud Secondly, we derive two verification estimates, in terms of the first and second derivatives of the orbital derivative, to verify if the constructed function, with either a regular grid of collocation points or with one of the refinement algorithms, is a Lyapunov function, i.e., has negative orbital derivative over a given compact set. Finally, the methods are applied to several numerical examples up to 3 dimensions.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • 2079c4r3 1431c3r2 405c2r
    • 45c2r ;
    • 132c2r(21c2r2 + 8cr + 1) = 0 [1] C. Aggarwal and C. Reddy. Data Clustering: Algorithms and Applications. CRC
    • Press, Boca Raton, 2014. [2] J. Alam, N. Kevlahan, and O. Vasilyev. Simultaneous space-time adaptive wavelet
    • solution of nonlinear parabolic di erential equations. J. Comput. Phys., 214:829{857,
    • 2006. [3] A. Angulo, L. Perez Pozo, and F. Perazzo. A posteriori error estimator and an adap-
    • tive technique in meshless nite points method. Eng. Anal. Bound. Elem., 33:1322{
    • 1338, 2009. [4] R. Baier, L. Grune, and S. Hafstein. Linear programming based Lyapunov function
    • computation for Di erential Inclusions. Discrete Contin. Dyn. Syst. Ser. B., 17:33{56,
    • 2012. [5] M. Bardi and I. Capuzzo Dolcetta. Optimal Control and Viscosity Solutions of
    • Hamilton-Jacobi-Bellman equations. Birkhauser, Boston, 1997. [6] M. Berg, O. Cheong, M. Kerveld, and M. Overmars. Computational geometry: Algo-
    • rithms and Applications. Springer-Verlag, Berlin, 2008. [7] M. Berger and P. Colella. Local adaptive mesh re nement for shock hydrodynamics.
    • J. Comput. Phys., 82:64{84, 1989. [8] M. D. Buhmann. Radial basis functions. In Acta numerica, 2000, volume 9 of Acta
    • Numer., pages 1{38. Cambridge Univ. Press, Cambridge, 2000. [9] F. Camilli, L. Grune, and F. Wirth. A generalization of Zubov's method to perturbed
    • systems. SIAM J. Control Optim., 40(2):496{515 (electronic), 2001. [10] S. Cheng, T. Dey, and J. Shewchuk. Delaunay Mesh Generation. CRC Press, Boca
    • Raton, 2013. [25] L. Grune. Asymptotic behavior of dynamical and control systems under perturbation
    • and discretization, volume 1783 of Lecture Notes in Mathematics. Springer-Verlag,
    • Berlin, 2002. [26] S. Hafstein. A constructive converse Lyapunov theorem on exponential stability.
    • Discrete and Continuous Dynamical Systems - Series A, 10(3):657{678, 2004. [27] S. Hafstein. An algorithm for constructing Lyapunov functions. Monograph. Electron.
    • J. Di . Eqns., 2007. [28] K. Hammouda and F Karray. A comparative study on data clustering techniques.
    • University of Waterloo, Ontario, Canada, 2000. [29] . Hjelle and M. D. Triangulations and Applications. Springer-Verlag, Berlin, 2006. [30] C. S. Hsu. Cell-to-cell mapping, volume 64 of Applied Mathematical Sciences.
    • Springer-Verlag, New York, 1987. [31] A. Iske. On the construction of kernel-based adaptive particle methods in numerical
    • conservation laws, volume 120 of Notes Numer. Fluid Mech. Multidiscip. Des., pages
    • 197{221. Springer, Heidelberg, 2013. [32] S. Iyengar, K. Boroojeni, and N. Balakrishnan. Mathematical Theories of Distributed
    • Sensor Networks. Springer, New York, 2014. [33] L. Jameson. A wavelet-optimized, very high order adaptive grid and numerical
    • method. SIAM J. Sci. Comput., 19:1980{2013, 1998. [34] J. Jessee, W. Fiveland, L. Howell, P. Colella, and R. Pember. An adaptive mesh
    • re nement algorithm for the radiative transport equation. J. Comput. Phys., 139:380{
    • 398, 1998. [35] Z. Jian. Development of Strong Form Methods with Applications in Computational
    • Mechanics. PhD thesis: National University of Singapore, Singapore, 2008. [36] C. M. Kellett. Classical converse theorems in Lyapunov's second method. Discrete
    • Contin. Dyn. Syst. Ser. B., 20(8):2333{2360, 2015. [37] R. Klein. Concrete and Abstract Voronoi Diagrams. Lecture Notes in Computer
    • Science. Springer-Verlag, Berlin, 1989. [64] X. Zhang, R. Ding, and Y. Li. Adaptive RPIM meshless method. In Proceedings of the
    • 2011 International Conference on Multimedia Technology (ICMT), pages 2388{2392.
    • IEEE, 2011.
  • No related research data.
  • No similar publications.

Share - Bookmark

Download from

Cite this article

Cookies make it easier for us to provide you with our services. With the usage of our services you permit us to use cookies.
More information Ok