Ashish Kothyari
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
Ashish Kothyari has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Madhu N. Belur
Department of Electrical Engineering, Indian Institute of Technology Bombay, Mumbai, India
3 shared publications - Avaneet Kumar
Indian Institute of Technology Roorkee
1 shared publication - Biswajit Das
Mathematics, Indian Institute of Technology Guwahati, guwahati, assam India 781039
1 shared publication - Chayan Bhawal
Department of Electrical Engineering, Indian Institute of Technology Bombay, Mumbai, India
1 shared publication - Cornelis Praagman
Faculty of Economics and Business, University of Groningen, 9712 CP Groningen, The Netherlands
1 shared publication - Debasattam Pal
Indian Institute of Technology Bombay
1 shared publication
Latest Publications
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 2617-2622
Robust Stabilization of Constrained Linear Time-Delay Systems via Output Feedback
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 2617-2622
Robust Stabilization of Constrained Linear Time-Delay Systems via Output Feedback
- 5 October 2022
- Published by Taylor & Francis in International Journal of Control
- Vol. 96 (12) , 2958-2975
Imaginary axis eigenvalues of Hamiltonian matrix: controllability, defectiveness and the ϵ-characteristic
The eigenstructure of imaginary axis eigenvalues of a Hamiltonian matrix is of importance in many fields of control systems, for example, in stability analysis of linear Hamiltonian systems, computation of the solutions of an algebraic Riccati equation (ARE), existence of a Lyapunov function for LTI systems, etc. The dynamical system consisting of all stationary trajectories for an optimal control problem – often called the Hamiltonian system – is known to admit, in its state space dynamical equation, a Hamiltonian matrix for the system matrix. In each of these cases, defectiveness of imaginary axis eigenvalues of a Hamiltonian matrix turns out to be of crucial importance. For example, defectiveness causes unboundedness of the oscillatory stationary trajectories in the Hamiltonian system. A characterisation of the ARE solutions in terms of Lagrangian invariant subspaces of the Hamiltonian matrix when the imaginary axis eigenvalues are defective has been addressed in the literature for the controllable case. This paper focuses on the general case of uncontrollable systems; we formulate conditions under which the imaginary axis eigenvalues of the Hamiltonian matrix are non-defective: this is central for solutions corresponding to imaginary axis eigenvalues to not become unbounded. We provide conditions on the so-called -characteristic of the non-defective imaginary axis eigenvalue: this helps in the characterisation of Lagrangian invariant subspaces. We formulate conditions under which a passivity-based Hamiltonian matrix is normal (i.e. it commutes with its transpose), and we link normality of such Hamiltonian matrices with all-pass behaviour. In summary, this paper formulates results that link defectiveness of imaginary axis eigenvalues of Hamiltonian matrix to solvabilities of Lyapunov and Algebraic Riccati equations, controllability/observability, -characteristic and sign-controllability. We consider examples in the area of bounded-real transfer functions and RLC circuits, both controllable and uncontrollable, to study applicability of the results of this paper.- 5 October 2022
- Published by Taylor & Francis in International Journal of Control
- Vol. 96 (12) , 2958-2975
Imaginary axis eigenvalues of Hamiltonian matrix: controllability, defectiveness and the ϵ-characteristic
The eigenstructure of imaginary axis eigenvalues of a Hamiltonian matrix is of importance in many fields of control systems, for example, in stability analysis of linear Hamiltonian systems, computation of the solutions of an algebraic Riccati equation (ARE), existence of a Lyapunov function for LTI systems, etc. The dynamical system consisting of all stationary trajectories for an optimal control problem – often called the Hamiltonian system – is known to admit, in its state space dynamical equation, a Hamiltonian matrix for the system matrix. In each of these cases, defectiveness of imaginary axis eigenvalues of a Hamiltonian matrix turns out to be of crucial importance. For example, defectiveness causes unboundedness of the oscillatory stationary trajectories in the Hamiltonian system. A characterisation of the ARE solutions in terms of Lagrangian invariant subspaces of the Hamiltonian matrix when the imaginary axis eigenvalues are defective has been addressed in the literature for the controllable case. This paper focuses on the general case of uncontrollable systems; we formulate conditions under which the imaginary axis eigenvalues of the Hamiltonian matrix are non-defective: this is central for solutions corresponding to imaginary axis eigenvalues to not become unbounded. We provide conditions on the so-called -characteristic of the non-defective imaginary axis eigenvalue: this helps in the characterisation of Lagrangian invariant subspaces. We formulate conditions under which a passivity-based Hamiltonian matrix is normal (i.e. it commutes with its transpose), and we link normality of such Hamiltonian matrices with all-pass behaviour. In summary, this paper formulates results that link defectiveness of imaginary axis eigenvalues of Hamiltonian matrix to solvabilities of Lyapunov and Algebraic Riccati equations, controllability/observability, -characteristic and sign-controllability. We consider examples in the area of bounded-real transfer functions and RLC circuits, both controllable and uncontrollable, to study applicability of the results of this paper.- 30 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 65 (12) , 4349-4362
Lossless Systems Storage Function: New Results and Numerically Stable and Non-Iterative Computational Methods
In this paper, we formulate and prove new results in the context of storage functions for lossless systems: we use these results to propose new algorithms to compute the storage function. The computation of the storage function for the lossless case is not possible using conventional algebraic Riccati equation-based algorithms, though the storage function itself is well-defined. This is because a certain ``regularity condition'' on the feedthrough term in the i/s/o representation of the lossless system does not hold. We formulate new results about the storage function matrix for the lossless case and use them to propose non-iterative and stable algorithms to compute the storage function directly from different representations of the given system, namely, a kernel representation, transfer function, and the i/s/o representation of the system. Across the methods, for randomly generated transfer functions, we compare: 1) the computational effort (in flops); 2) the computation time using numerical experiments; and 3) the computational error.
- 30 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 65 (12) , 4349-4362
Lossless Systems Storage Function: New Results and Numerically Stable and Non-Iterative Computational Methods
In this paper, we formulate and prove new results in the context of storage functions for lossless systems: we use these results to propose new algorithms to compute the storage function. The computation of the storage function for the lossless case is not possible using conventional algebraic Riccati equation-based algorithms, though the storage function itself is well-defined. This is because a certain ``regularity condition'' on the feedthrough term in the i/s/o representation of the lossless system does not hold. We formulate new results about the storage function matrix for the lossless case and use them to propose non-iterative and stable algorithms to compute the storage function directly from different representations of the given system, namely, a kernel representation, transfer function, and the i/s/o representation of the system. Across the methods, for randomly generated transfer functions, we compare: 1) the computational effort (in flops); 2) the computation time using numerical experiments; and 3) the computational error.
- 27 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 64 (3) , 1137-1149
On the Distance to Singular Descriptor Dynamical Systems With Impulsive Initial Conditions
This paper studies the problem of computing the distance between a given singular descriptor system $(E,A)$, and a nearest descriptor system that has impulsive initial conditions. Much of the literature focusses on the case when only one of $E$ and $A$ is perturbed. We give a closed form expression of the distance to a nearest descriptor system having impulsive solutions via rank-1 perturbations when both $E$ and $A$ are perturbed. Next, for the case of perturbations without rank restrictions, we propose and evaluate the bounds for the distance. In the context of structured perturbations, we formulate and obtain an explicit expression for the distance, when $E$ and $A$ are Hermitian and are perturbed by Hermitian matrices. For a suitable class of systems, we also show that the upper/lower bounds are within a factor of $\sqrt{2}$. We also construct examples and compare our bounds with those from the literature as well as with computed values of the distance obtained via three numerical optimization techniques like the Structured Low Rank Approximation (SLRA), the Broyden Fletcher Goldfarb Shanno (BFGS) algorithm, and direct optimization tools like globalsearch.- 27 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 64 (3) , 1137-1149
On the Distance to Singular Descriptor Dynamical Systems With Impulsive Initial Conditions
This paper studies the problem of computing the distance between a given singular descriptor system $(E,A)$, and a nearest descriptor system that has impulsive initial conditions. Much of the literature focusses on the case when only one of $E$ and $A$ is perturbed. We give a closed form expression of the distance to a nearest descriptor system having impulsive solutions via rank-1 perturbations when both $E$ and $A$ are perturbed. Next, for the case of perturbations without rank restrictions, we propose and evaluate the bounds for the distance. In the context of structured perturbations, we formulate and obtain an explicit expression for the distance, when $E$ and $A$ are Hermitian and are perturbed by Hermitian matrices. For a suitable class of systems, we also show that the upper/lower bounds are within a factor of $\sqrt{2}$. We also construct examples and compare our bounds with those from the literature as well as with computed values of the distance obtained via three numerical optimization techniques like the Structured Low Rank Approximation (SLRA), the Broyden Fletcher Goldfarb Shanno (BFGS) algorithm, and direct optimization tools like globalsearch.