Abstract
The eigenvalue assignment problem of second-order singular system is investigated by using acceleration–velocity–displacement feedback. The conditions are established to ensure the solvability of partial eigenvalue assignment problem of second-order singular system. The derived results are extended to complete eigenvalue assignment problem of second-order singular system. The presented solvability conditions are easily tested. Then, the methods are given to solve the eigenvalue assignment problem of second-order singular systems. Finally, several examples are given to validate our results and algorithms.



Similar content being viewed by others
Availability of data and materials
The datasets generated or analyzed during this study are available from the corresponding author on request.
References
Singh KV, Brown RN, Kolonay R (2016) Receptance-based active aeroelastic control with embedded control surfaces having actuator dynamics. J Aircr 1:1–16
Cui Y, Yang Z (2006) The series solutions to coupled RLC circuit and spring system. J Vib Shock 25:76–77
Udwadia FE, Phohomsiri P (2006) Explicit equations of motion for constrained mechanical systems with singular mass matrices and applications to multi-body dynamics. Proc R Soc Ser A 462:2097–2117
Campbell SL, Rose NJ (1982) A second order singular linear system arising in electric power systems analysis. Int J Syst Sci 13:101–108
Losse P, Mehrmann V (2008) Controllability and observability of second order descriptor systems. SIAM J Control Optim 47:1351–1379
Duan GR (2004) Parametric eigenstructure assignment in second-order descriptor linear systems. IEEE Trans Autom Control 49:1789–1794
Abdelaziz THS (2016) Eigenstructure assignment by displacement-acceleration feedback for second-order systems. J Dyn Syst Meas Contr 138(6):064502
Abdelaziz THS (2019) Robust solution for second-order systems using displacement–acceleration feedback. J Control Autom Electr Syst 30(5):632–644
Abdelaziz THS (2015) Robust pole assignment using velocity-acceleration feedback for second-order dynamical systems with singular mass matrix. ISA Trans 57:71–84
Yu P, Zhang G (2016) Eigenstructure assignment and impulse elimination for singular second-order system via feedback control. IET Control Theory Appl 10(8):869–876
Yu P, Wang C, Li M, Liu P, Fang J (2022) Robust minimum norm partial eigenstructure assignment approach in singular vibrating structure via active control. Int J Dyn Control 10:1094–1108
Lancaster P, Psarrakos P (2005) A note on weak and strong linearizations of regular matrix polynomials. http://eprints.maths.manchester.ac.uk/
Bunse-Gerstner A, Mehrmann V, Nichols NK (1992) Regularization of descriptor systems by derivative and proportional state feedback. SIAM J Matrix Anal Appl 13(1):46–67
Sun JG (1980) Invariant subspaces and generalized invariant subspaces (i) existence and uniqueness theorems. Math Numer Sin 2(1):1–13
Kautsky J, Nichols NK, Chu KW (1989) Robust pole assignment in singular control systems. Linear Algebra Appl 121:9–37
Kautsky J, Nichols NK, Van Dooren P (1985) Robust pole assignment in linear state feedback. Int J Control 41:1129–1155
Tisseur F, Meerbergen K (2001) The quadratic eigenvalue problem. SIAM Rev 43:235–286
Losse P, Mehrmann V (2006) Algebraic characterization of controllability and observability for second order descriptor systems. preprint 2006/21, Institut für Mathematik, TU Berlin, D-10623 Berlin, FRG, also available at http://www.math.tuberlin.de/preprints/
Mackey DS, Mackey N, Mehl C, Mehrmann V (2006) Vector spaces of linearizations for matrix polynomials. SIAM J Matrix Anal Appl 28(4):971–1004
Mehrmann V, Shi C (2006) Transformation of high order linear differential-algebraic systems to first order. Numer Algorithm 42:281–307
Funding
This research was supported by Shanghai Natural Science Fund (No. 15ZR1408400).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare no potential conflict of interests.
Ethical approval
Not applicable.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Proof of some lemmas
Proof of some lemmas
In this part, we give the proofs of Lemma 2.2, Lemma 2.3, Lemma 2.4 and Lemma 2.5.
1.1 Proof of Lemma 2.2
(1) It is easily seen that a base of \({\mathcal {N}}({\mathcal {E}}_2)\) can be taken as the columns of
Then, we have
Note that \(B_3\) has full row rank. Then \([{\mathcal {E}}_2, {\mathcal {A}}_2 N({\mathcal {E}}_2), {\mathcal {B}}_2]\) has full row rank.
(2) Denote \({\widehat{I}}_{n-n_1}^T=[0_{(n-n_1)\times n_1}, I_{n-n_1}]\). Clearly, \(N({\widetilde{M}})={\widehat{I}}_{n-n_1}\). Then we have \({\widetilde{Z}}^T {\widetilde{C}}-{\widetilde{Z}}^T {\widetilde{C}} {\widetilde{I}}_{n_1}{\widetilde{I}}_{n_1}^T={\widetilde{Z}}^T {\widetilde{C}} (I_n-{\widetilde{I}}_{n_1}{\widetilde{I}}_{n_1}^T)={\widetilde{Z}}^T {\widetilde{C}} [0, {\widehat{I}}_{n-n_1}]=0\). Thus,
Let \({\widetilde{C}}=\left[ {\widetilde{C}}_{1}, {\widetilde{C}}_{2}\right] , \ {\widetilde{C}}_{1}\in {{\mathbb {R}}}^{n\times n_1}\). Then, we have
Thus, \(\dim ({\mathcal {N}}({\mathcal {E}}_2^T))=n-\text{ rank }[{\widetilde{M}}, {\widetilde{C}} N({\widetilde{M}})]\). On the other hand,
Thus, \(N({\mathcal {E}}_2^T)=\left[ {\widetilde{Z}}^T, -({\widetilde{I}}_{n_1}^T {\widetilde{C}}^T {\widetilde{Z}})^T\right] ^T\).
(3) Observe that
By Lemma 2.1, there exist nonsingular matrices P, Q, V such that (2.5) holds. Then from above equation we have
1.2 Proof of Lemma 2.3
(1) Observe that
Then, by [19], \(\widetilde{{\mathcal {A}}}_1-\lambda \widetilde{{\mathcal {E}}}_1\) is a strong linearization of \(\lambda ^2\,M+\lambda C+K\).
(2) By (A1), \((-1)^{n(n+1)}|\widetilde{{\mathcal {A}}}_1-\lambda \widetilde{{\mathcal {E}}}_1|=|\lambda ^2\,M+\lambda C+K|\). Thus, \(\widetilde{{\mathcal {A}}}_1-\lambda \widetilde{{\mathcal {E}}}_1\) is regular if and only if \(\lambda ^2 M+\lambda C+K\) is regular.
(3) It is easily seen that
Thus, result (3) of this lemma holds.
(4) It is easily seen that (2.9) holds. Observe that
Then we have
Then, \(\text{ rank }[{\mathcal {E}}_1, {\mathcal {A}}_1 N({\mathcal {E}}_1), {\mathcal {B}}_1]=2n\) if and only if \(\text{ rank }[M, CN(M), B]=n\).
(5) The second-order system (1.1) can be re-written as
By Result (1) of this lemma, \(\widetilde{{\mathcal {A}}}_1-\lambda \widetilde{{\mathcal {E}}}_1\) is a strong linearization of \(\lambda ^2 M+\lambda C+K\). Then \(ind(\widetilde{{\mathcal {E}}}_1, \widetilde{{\mathcal {A}}}_1)=ind_1(M, C, K)\leqslant 1\). Further from [5][Section 1], we know that for any continuous input function u, system (A2) must have a continuous solution. Observe that systems (1.1) and (A2) are equivalent. Thus, it is ensured that system (1.1) has a continuous solution for a continuous input u, i.e., system (1.1) is impulse-free.
1.3 Proof of Lemma 2.4
(1) It is easily seen that
Thus, \(\left| \widetilde{{\mathcal {A}}}_2-\lambda \widetilde{{\mathcal {E}}}_2\right| \not \equiv 0\Leftrightarrow \left| \lambda ^2\,M+\lambda C+K\right| \not \equiv 0\). Then result (1) of Lemma 2.4 follows.
(2) Assume that \((\lambda , x)\) is a finite eigenpair of \(\lambda ^2\,M+\lambda C+K\) and \({\widetilde{x}}=\lambda {\widetilde{I}}_{n_1}^T x\). Then we see that \(\lambda M_1 {\widetilde{x}} +\lambda C_1 x+C_2 {\widetilde{x}}+Kx=0\). Thus \(\widetilde{{\mathcal {A}}}_2 [{\widetilde{x}}^T, x^T]^T=\lambda \widetilde{{\mathcal {E}}}_2 [{\widetilde{x}}^T, x^T]^T\), i.e., \((\lambda , [{\widetilde{x}}^T, x^T]^T)\) is a finite eigenpair of \(\widetilde{{\mathcal {A}}}_2-\lambda \widetilde{{\mathcal {E}}}_2\).
Conversely, if \((\lambda , [{\widetilde{x}}^T, x^T]^T)\) is a finite eigenpair of \(\widetilde{{\mathcal {A}}}_2-\lambda \widetilde{{\mathcal {E}}}_2\), where \({\widetilde{x}}\in {{\mathbb {C}}}^{n_1}\), then from (2.13) we see that \(\lambda (M_1 {\widetilde{x}} +C_1 x)+C_2 {\widetilde{x}}+Kx=0\) and \({\widetilde{x}}=\lambda {\widetilde{I}}_{n_1}^T x\). Substituting the second equation into the first equation and using (2.11), (2.12) yield \((\lambda ^2 M+\lambda C+K)x=0\), i.e., \((\lambda , x)\) is an eigenpair of \(\lambda ^2 M+\lambda C+K\).
(3) Consider the differential equation
Note that \(ind(\widetilde{{\mathcal {E}}}_2, \widetilde{{\mathcal {A}}}_2)\leqslant 1\). Then for any continuous input function u, there exists a continuous solution \([{\widetilde{x}}^T, x^T]^T\) to (A3) such that \(\widetilde{{\mathcal {E}}}_2[{\widetilde{x}}^T, x^T]^T\) is continuously differentiable, i.e., \([{\widetilde{x}}^T, x^T]^T\) satisfies that
From (A4) and (A5), we see that
Further by (2.11) and (2.12) we know that x satisfies that
By (A6), (2.11)–(2.13), we know that \(M\ddot{x}\), \(C{\dot{x}}\) are continuous. Thus, for any continuous u, there exists a continuous solution x to equation (A7) such that \(Mx,\ Cx\) are, respectively, twice and once continuously differentiable. Then \(ind_2(M, C, K)\leqslant 1\).
1.4 Proof of Lemma 2.5
(1) By Theorem 2.4, Theorem 3.13, Theorem 3.14 in [5], the proof of Theorem 9 in [18] and the first equation in (2.14), we know that there exist nonsingular matrices P, Q, V such that
where \({\widetilde{K}}_{11},\ {\widetilde{C}}_{11}\in {{\mathbb {R}}}^{n_1\times n_1}\), \({\widetilde{C}}_{31},\ {\widetilde{K}}_{31}\in {{\mathbb {R}}}^{d_1\times n_1}\), \({\widetilde{K}}_{22}\in {{\mathbb {R}}}^{n_2\times n_2}\), \({\widetilde{B}}_1\in {{\mathbb {R}}}^{n_1},\ {\widetilde{B}}_2\in {{\mathbb {R}}}^{n_2}\), \({\widetilde{B}}_3\in {{\mathbb {R}}}^{d_1}\), \({\widetilde{B}}_4\in {{\mathbb {R}}}^{n_3}\). Moreover, matrices \({\widetilde{C}}_{31}\) and \([{\widetilde{B}}_3^T, {\widetilde{B}}_4^T]^T\) have full row rank.
From Lemma 13 in [20] and the second equation in (2.14), we know that \(d_1=0\). Then, we have result (1) of Lemma 2.5.
(2) From Result (1) of this lemma, we see that (1.1) can be reduced to
Denote
Then (A8) can be rewritten as
Then, (1.1) has a continuous solution x such that Mx is twice and Cx is once continuously differentiable if and only if (A9) has a continuous solution \({\widehat{x}}\) such that \({\mathcal {E}}_2 {\widehat{x}}\) is once continuously differentiable. Thus, \(ind_2(M, C, K)=ind({\mathcal {E}}_2, {\mathcal {A}}_2)\).
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Xie, H., Li, Y. Eigenvalue assignment of second-order singular systems by acceleration–velocity–displacement feedback. Math. Control Signals Syst. 36, 629–659 (2024). https://doi.org/10.1007/s00498-023-00379-w
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00498-023-00379-w