Controllability Gramian

id: controllability-gramian-258-18371914
title: Controllability Gramian
text: In control theory, we may need to find out whether or not a system such as is controllable, where A , B , C and D are, respectively, n × n , n × p , q × n and q × p matrices for a system with p inputs, n state variables and q outputs. One of the many ways one can achieve such goal is by the use of the Controllability Gramian.
brand slug: wiki
category slug: encyclopedia
description:
original url: https://en.wikipedia.org/wiki/Controllability_Gramian
date created:
date modified: 2024-03-30T14:45:46Z
main entity: {"identifier":"Q83587","url":"https://www.wikidata.org/entity/Q83587"}
image:
fields total: 13
integrity: 13

Related Entries

Explore Next Part