Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. A Quotient Subspace Algorithm for Testing Controllability and Computing Brunovsky's Outputs
 
conference paper

A Quotient Subspace Algorithm for Testing Controllability and Computing Brunovsky's Outputs

Mullhaupt, Ph.  
2004
IEEE Conference on Decision and Control
  • Files
  • Details
  • Metrics
Type
conference paper
DOI
10.1109/CDC.2004.1430368
Web of Science ID

WOS:000226745601177

Author(s)
Mullhaupt, Ph.  
Date Issued

2004

Published in
IEEE Conference on Decision and Control
Volume

2

Start page

2161

End page

2164

Subjects

Linear Systems

•

Computational Methods

•

Canonical Forms

•

Controllability

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LA  
Available on Infoscience
November 26, 2004
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/176987
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés