Solvability of Cauchy problem for a differential-algebraic system with concentrated delay (Q2191561)

This paper studies the solvability of systems of linear delay-differential-algebraic equations with a single discrete delay and a (functional) initial value: \[ A(t) \dot{z}(t) = B(t) z(t) + C(t) z(t-T) + f(t), \;\;\; z(t) = \varphi(t), \; t \in [0, T] \] (\(z(t)\in \mathbb{R}^n\), \(f(t) \in \mathbb{R}^m\) and \(A(t)\), \(B(t)\), \(C(t)\) are matrices of appropriate sizes.) The method of steps is used to reduce the problem to a sequence of linear differential-algebraic equations. The analysis is therefore similar to the one already performed in [\textit{S. M. Chuĭko}, J. Math. Sci., New York 235, No. 1, 2--14 (2018; Zbl 1418.34021); translation from Ukr. Mat. Visn. 15, No. 1, 1--17 (2018)] for differential-algebraic equations. The author first considers the nondegenerate case (when \(A(t)\) is onto) for which the space of solutions can be readily characterized. Otherwise, under a constant rank assumption and after a change of variable, the original system is decomposed into a (delay-)algebraic equation and a (delay-)differential-algebraic equation. When some consistency conditions are met, the set of solutions of the algebraic part is not empty and can be parametrized by some arbitrary function. This function corresponds to a solution of the full system if and only if it is itself solution of a (delay-)differential algebraic equation, smaller than the original. The same analysis may then be applied to this new (delay-)differential-algebraic equation. If the new system is non-degenerate, we can conclude the goal is reached, otherwise, the analysis above needs to be iterated. The theorem that concludes the paper only partially manages to summarize the complexity of this process; notably, checking the consistency conditions that ensure the existence of solutions requires to go through all the steps described above.