Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 54 tok/s
Gemini 2.5 Pro 54 tok/s Pro
GPT-5 Medium 22 tok/s Pro
GPT-5 High 25 tok/s Pro
GPT-4o 99 tok/s Pro
Kimi K2 196 tok/s Pro
GPT OSS 120B 333 tok/s Pro
Claude Sonnet 4.5 34 tok/s Pro
2000 character limit reached

Invertibility of Discrete-Time Linear Systems with Sparse Inputs (2403.20294v1)

Published 29 Mar 2024 in math.OC, cs.SY, eess.SP, and eess.SY

Abstract: One of the fundamental problems of interest for discrete-time linear systems is whether its input sequence may be recovered given its output sequence, a.k.a. the left inversion problem. Many conditions on the state space geometry, dynamics, and spectral structure of a system have been used to characterize the well-posedness of this problem, without assumptions on the inputs. However, certain structural assumptions, such as input sparsity, have been shown to translate to practical gains in the performance of inversion algorithms, surpassing classical guarantees. Establishing necessary and sufficient conditions for left invertibility of systems with sparse inputs is therefore a crucial step toward understanding the performance limits of system inversion under structured input assumptions. In this work, we provide the first necessary and sufficient characterizations of left invertibility for linear systems with sparse inputs, echoing classic characterizations for standard linear systems. The key insight in deriving these results is in establishing the existence of two novel geometric invariants unique to the sparse-input setting, the weakly unobservable and strongly reachable subspace arrangements. By means of a concrete example, we demonstrate the utility of these characterizations. We conclude by discussing extensions and applications of this framework to several related problems in sparse control.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (22)
  1. M. Sain and J. Massey, “Invertibility of linear time-invariant dynamical systems,” IEEE Transactions on automatic control, vol. 14, no. 2, pp. 141–149, 1969.
  2. R. M. Hirschorn, “Invertibility of nonlinear control systems,” SIAM Journal on Control and Optimization, vol. 17, no. 2, pp. 289–297, 1979.
  3. B. Liu and J. Si, “Fault detection and isolation for linear time-invariant systems,” in Proceedings of 1994 33rd IEEE Conference on Decision and Control, vol. 3, 1994, pp. 3048–3053 vol.3.
  4. A. Edelmayer, J. Bokor, Z. Szabó, and F. Szigeti, “Input reconstruction by means of system inversion: A geometric approach to fault detection and isolation in nonlinear systems,” International Journal of Applied Mathematics and Computer Science, vol. 14, no. 2, pp. 189–199, 2004.
  5. M. Hou and R. J. Patton, “Input observability and input reconstruction,” Automatica, vol. 34, no. 6, pp. 789–794, 1998.
  6. A. Martinelli, “Nonlinear unknown input observability: Extension of the observability rank condition,” IEEE Transactions on Automatic Control, vol. 64, no. 1, pp. 222–237, 2019.
  7. P. Sannuti and A. Saberi, “Special coordinate basis for multivariable linear systems—finite and infinite zero structure, squaring down and decoupling,” International Journal of Control, vol. 45, no. 5, pp. 1655–1704, 1987.
  8. M. Tranninger, H. Niederwieser, R. Seeber, and M. Horn, “Unknown input observer design for linear time-invariant systems—a unifying framework,” International Journal of Robust and Nonlinear Control, vol. 33, no. 15, pp. 8911–8934, 2023.
  9. A. Ansari and D. S. Bernstein, “Deadbeat unknown-input state estimation and input reconstruction for linear discrete-time systems,” Automatica, vol. 103, pp. 11–19, 2019.
  10. H. L. Trentelman, A. A. Stoorvogel, M. Hautus, and L. Dewell, “Control theory for linear systems,” Appl. Mech. Rev., vol. 55, no. 5, pp. B87–B87, 2002.
  11. P. Moylan, “Stable inversion of linear systems,” IEEE Transactions on Automatic Control, vol. 22, no. 1, pp. 74–78, 1977.
  12. S. Sefati, N. J. Cowan, and R. Vidal, “Linear systems with sparse inputs: Observability and input recovery,” in IEEE American Control Conference (ACC), 2015, pp. 5251–5257.
  13. K. Poe, E. Mallada, and R. Vidal, “Necessary and sufficient conditions for simultaneous state and input recovery of linear systems with sparse inputs by ℓ1subscriptℓ1\ell_{1}roman_ℓ start_POSTSUBSCRIPT 1 end_POSTSUBSCRIPT-minimization,” in IEEE Conference on Decision and Control (CDC), 2023, pp. 6499–6506.
  14. R. K. Chakraborty, G. Joseph, and C. R. Murthy, “Joint state and input estimation for linear dynamical systems with sparse control,” arXiv preprint arXiv:2312.02082, 2023.
  15. C. Sriram, G. Joseph, and C. R. Murthy, “Control of linear dynamical systems using sparse inputs,” in IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2020, pp. 5765–5769.
  16. A. J. Florez and L. F. Giraldo, “Structural sparsity in networked control systems,” IEEE Transactions on Systems, Man, and Cybernetics: Systems, vol. 50, no. 12, pp. 5152–5161, 2020.
  17. M. Zhang, B. Alenezi, S. Hui, and S. H. Żak, “State estimation of networked control systems corrupted by unknown input and output sparse errors,” in American Control Conference (ACC), 2020, pp. 4393–4398.
  18. A. S. Charles, A. Balavoine, and C. J. Rozell, “Dynamic filtering of time-varying sparse signals via ℓ1subscriptℓ1\ell_{1}roman_ℓ start_POSTSUBSCRIPT 1 end_POSTSUBSCRIPT minimization,” IEEE Transactions on Signal Processing, vol. 64, no. 21, pp. 5644–5656, 2016.
  19. N. P. Bertrand, A. S. Charles, J. Lee, P. B. Dunn, and C. J. Rozell, “Efficient tracking of sparse signals via an earth mover’s distance dynamics regularizer,” IEEE Signal Processing Letters, vol. 27, pp. 1120–1124, 2020.
  20. G. Joseph, C. R. Murthy, R. Prasad, and B. D. Rao, “Online recovery of temporally correlated sparse signals using multiple measurement vectors,” in IEEE Global Communications Conference (GLOBECOM), 2015, pp. 1–6.
  21. G. Joseph and C. R. Murthy, “A noniterative online bayesian algorithm for the recovery of temporally correlated sparse vectors,” IEEE Transactions on Signal Processing, vol. 65, no. 20, pp. 5510–5525, 2017.
  22. F. Garin, “Generic delay-l left invertibility of structured systems,” IFAC-PapersOnLine, vol. 55, no. 13, pp. 210–215, 2022.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.