Analyzing Stability of Algorithmic Systems Using Algebraic Constructs - Information and Communication Technology Access content directly
Conference Papers Year : 2013

Analyzing Stability of Algorithmic Systems Using Algebraic Constructs

Susmit Bagchi
  • Function : Author
  • PersonId : 1003134

Abstract

In general, the modeling and analysis of algorithmic systems involve discrete structural elements. However, the modeling and analysis of recursive algorithmic systems can be done in the form of differential equation following control theoretic approaches. In this paper, the modeling and analysis of generalized algorithmic systems are proposed based on heuristics along with z-domain formulation in order to determine the stability of the systems. The recursive algorithmic systems are analyzed in the form of differential equation for asymptotic analysis. The biplane structure is employed for determining the boundary of the recursions, stability and, oscillatory behaviour. This paper illustrates that biplane structural model can compute the convergence of complex recursive algorithmic systems through periodic perturbation.
Fichier principal
Vignette du fichier
978-3-642-36818-9_9_Chapter.pdf (110.31 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01480216 , version 1 (01-03-2017)

Licence

Attribution

Identifiers

Cite

Susmit Bagchi. Analyzing Stability of Algorithmic Systems Using Algebraic Constructs. 1st International Conference on Information and Communication Technology (ICT-EurAsia), Mar 2013, Yogyakarta, Indonesia. pp.81-90, ⟨10.1007/978-3-642-36818-9_9⟩. ⟨hal-01480216⟩
305 View
95 Download

Altmetric

Share

Gmail Facebook X LinkedIn More