The nonsymmetric Lanczos algorithm and controllability

Daniel Boley, Gene Golub

Research output: Contribution to journalArticlepeer-review

27 Scopus citations

Abstract

We give a brief description of a non-symmetric Lanczos algorithm that does not require strict bi-orthogonality among the generated vectors. We show how the vectors generated are algebraically related to Reachable Space and Observable Space for a related linear dynamical system. The algorithm described is particularly appropriate for large sparse systems.

Original languageEnglish (US)
Pages (from-to)97-105
Number of pages9
JournalSystems and Control Letters
Volume16
Issue number2
DOIs
StatePublished - Feb 1991

Bibliographical note

Funding Information:
* E-mail address: boley@cs.umn.edu. The research reported by this author was supported in part by NSF grant CCR-8813493. * * E-mail address: golub@nanet.stanford.edu. The research reported by this author was supported in part by ARO grant DAAL03-90-G-0105 and in part by NSF grant DCR-8412314.

Copyright:
Copyright 2014 Elsevier B.V., All rights reserved.

Keywords

  • Controllability
  • linear systems
  • nonsymmetric Lanczos algorithm
  • observability

Fingerprint Dive into the research topics of 'The nonsymmetric Lanczos algorithm and controllability'. Together they form a unique fingerprint.

Cite this