Matrix Sign Function Methods for Solving Projected Generalized Continuous-Time Sylvester Equations
From MaRDI portal
Cited in
(14)- Stochastic bounded consensus tracking of second-order multi-agent systems with measurement noises and sampled-data
- On the perturbation bounds of projected generalized continuous-time Sylvester equations
- Second-order consensus of nonlinear multi-agent systems with restricted switching topology and time delay
- Iterative algorithm for solving a class of general Sylvester-conjugate matrix equation \(\sum_{i=1}^sA_iV+\sum_{j=1}^tB_jW=\sum_{l=1}^mE_l\overline VF_l+C\)
- Accelerating average consensus by using the information of second-order neighbours with communication delays
- Second-order consensus of multi-agent systems via periodically intermittent pinning control
- Controllability analysis of multi-agent systems with directed and weighted interconnection
- Robust consensus algorithm for second-order multi-agent systems with external disturbances
- A direct method for solving projected generalized continuous-time Sylvester equations
- Fourth-order tensor Riccati equations with the Einstein product
- On \(\mathcal H_{\infty}\)-consensus filtering for multi-agent systems
- Second-order consensus in multi-agent systems based on second-order neighbours’ information
- Consensus tracking of linear multi-agent systems under networked observability conditions
- Allowable delay bound for consensus of linear multi-agent systems with communication delay
This page was built for publication: Matrix Sign Function Methods for Solving Projected Generalized Continuous-Time Sylvester Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4979011)
