Debasattam Pal
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Debasattam Pal has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Harish K. Pillai
Department of Electrical Engineering, Indian Institute of Technology Bombay, Mumbai, India
3 shared publications - Chirayu D. Athalye
Department of Electrical Engineering Indian Institute of Technology Bombay India. Debasattam Pal
1 shared publication - Madhu N. Belur
Department of Electrical Engineering, Indian Institute of Technology Bombay, Mumbai, India
1 shared publication - Rachel Kalpana Kalaimani
Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai, India
1 shared publication Shriram C. Jugade
1 shared publication
Latest Publications
- Open Access
Novel representation of discrete n-D autonomous systems
In this paper we address the problem of representing solutions of a system of scalar linear partial difference equations akin to state space equations of 1-D systems theory. We first obtain a representation formula for a special class of autonomous systems. Then we show every autonomous system can be converted into the special ones by a coordinate transformation on n-d integer grid. Using this conversion we provide representation formula for general autonomous systems. The representation formula we present can be viewed as multidimensional flow operators acting on initial conditions. These initial conditions are required to satisfy certain compatibility conditions. We give a full description of the set of allowable initial conditions. In our search for a general representation formula, one algebraic result plays a very crucial role. In this result we show that every quotient ring of the n-variable Laurent polynomial ring can be made a finitely generated faithful module over another Laurent polynomial ring of smaller dimension by doing a suitable change of coordinates. We call this result a discrete version of Noether's Normalization Lemma.
Open AccessNovel representation of discrete n-D autonomous systems
In this paper we address the problem of representing solutions of a system of scalar linear partial difference equations akin to state space equations of 1-D systems theory. We first obtain a representation formula for a special class of autonomous systems. Then we show every autonomous system can be converted into the special ones by a coordinate transformation on n-d integer grid. Using this conversion we provide representation formula for general autonomous systems. The representation formula we present can be viewed as multidimensional flow operators acting on initial conditions. These initial conditions are required to satisfy certain compatibility conditions. We give a full description of the set of allowable initial conditions. In our search for a general representation formula, one algebraic result plays a very crucial role. In this result we show that every quotient ring of the n-variable Laurent polynomial ring can be made a finitely generated faithful module over another Laurent polynomial ring of smaller dimension by doing a suitable change of coordinates. We call this result a discrete version of Noether's Normalization Lemma.
- Open Access
Necessary condition on Lyapunov functions corresponding to the globally asymptotically stable equilibrium point
It is well known that, the existence of a Lyapunov function is a sufficient condition for stability, asymptotic stability, or global asymptotic stability of an equilibrium point of an autonomous system $\dot{\mathbf{x}} = f(\mathbf{x})$. In variants of Lyapunov theorems, the condition for a Lyapunov candidate $V$ (continuously differentiable and positive definite function) to be a Lyapunov function is that its time derivative along system trajectories must be negative semi-definite or negative definite. Numerically checking positive definiteness of $V$ is very difficult; checking negative definiteness of $\dot{V}(\cdot)=\langle \nabla V(\cdot), f(\cdot) \rangle$ is even more difficult, because it involves dynamics of the system. We give a necessary condition independent of the system dynamics, for every Lyapunov function corresponding to the globally asymptotically stable equilibrium point of $\dot{\mathbf{x}} = f(\mathbf{x})$. This necessary condition is numerically easier to check than checking positive definiteness of a function. Therefore, it can be used as a first level test to check whether a given continuously differentiable function is a Lyapunov function candidate or not. We also propose a method, which we call a generalized steepest descent method, to check this condition numerically. Generalized steepest descent method can be used for ruling out Lyapunov candidates corresponding to the globally asymptotically stable equilibrium point of $\dot{\mathbf{x}} = f(\mathbf{x})$. It can also be used as a heuristic to check the local positive definiteness of a function, which is a necessary condition for a Lyapunov function corresponding to a stable and/or asymptotically stable equilibrium point of an autonomous system.Open AccessNecessary condition on Lyapunov functions corresponding to the globally asymptotically stable equilibrium point
It is well known that, the existence of a Lyapunov function is a sufficient condition for stability, asymptotic stability, or global asymptotic stability of an equilibrium point of an autonomous system $\dot{\mathbf{x}} = f(\mathbf{x})$. In variants of Lyapunov theorems, the condition for a Lyapunov candidate $V$ (continuously differentiable and positive definite function) to be a Lyapunov function is that its time derivative along system trajectories must be negative semi-definite or negative definite. Numerically checking positive definiteness of $V$ is very difficult; checking negative definiteness of $\dot{V}(\cdot)=\langle \nabla V(\cdot), f(\cdot) \rangle$ is even more difficult, because it involves dynamics of the system. We give a necessary condition independent of the system dynamics, for every Lyapunov function corresponding to the globally asymptotically stable equilibrium point of $\dot{\mathbf{x}} = f(\mathbf{x})$. This necessary condition is numerically easier to check than checking positive definiteness of a function. Therefore, it can be used as a first level test to check whether a given continuously differentiable function is a Lyapunov function candidate or not. We also propose a method, which we call a generalized steepest descent method, to check this condition numerically. Generalized steepest descent method can be used for ruling out Lyapunov candidates corresponding to the globally asymptotically stable equilibrium point of $\dot{\mathbf{x}} = f(\mathbf{x})$. It can also be used as a heuristic to check the local positive definiteness of a function, which is a necessary condition for a Lyapunov function corresponding to a stable and/or asymptotically stable equilibrium point of an autonomous system. - 12 March 2014
- Published by Springer Nature in Multidimensional Systems and Signal Processing
- Vol. 26 (2) , 439-457
Algorithms for the theory of restrictions of scalar $n$ n -D systems to proper subspaces of $\mathbb {R}^n$ R n- 12 March 2014
- Published by Springer Nature in Multidimensional Systems and Signal Processing
- Vol. 26 (2) , 439-457
Algorithms for the theory of restrictions of scalar $n$ n -D systems to proper subspaces of $\mathbb {R}^n$ R n