Skip to Main content Skip to Navigation
Conference papers

Analyzing Stability of Algorithmic Systems Using Algebraic Constructs

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.
Complete list of metadata

https://hal.inria.fr/hal-01480216
Contributor : Hal Ifip <>
Submitted on : Wednesday, March 1, 2017 - 11:06:48 AM
Last modification on : Thursday, March 2, 2017 - 1:04:26 AM
Long-term archiving on: : Tuesday, May 30, 2017 - 2:53:18 PM

File

978-3-642-36818-9_9_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

376

Files downloads

272