Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
91 tokens/sec
Gemini 2.5 Pro Premium
52 tokens/sec
GPT-5 Medium
24 tokens/sec
GPT-5 High Premium
28 tokens/sec
GPT-4o
85 tokens/sec
DeepSeek R1 via Azure Premium
87 tokens/sec
GPT OSS 120B via Groq Premium
478 tokens/sec
Kimi K2 via Groq Premium
221 tokens/sec
2000 character limit reached

Controllability and reachability of singular linear discrete time systems (1406.1489v1)

Published 3 Jun 2014 in math.OC, cs.SY, and math.DS

Abstract: The main objective of this article is to develop a matrix pencil approach for the study of the controllability and reachability of a class of linear singular discrete time systems. The description equation of a practical system may be established through selection of the proper state variables. Time domain analysis is the method of analyzing the system based on this description equation, through which we may gain a fair understanding of the system's structural features as well as its internal properties. Using time domain analysis, this article studies the fundamentals in system theory such as reachability and controllability.

Citations (9)

Summary

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

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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