The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Principal component analysis in linear systems: Controllability, observability, and model reduction
Abstract
Kalman's minimal realization theory involves geometric objects (controllable, unobservable subspaces) which are subject to structural instability. Specifically, arbitrarily small perturbations in a model may cause a change in the dimensions of the associated subspaces. This situation is manifested in computational difficulties which arise in attempts to apply textbook algorithms for computing a minimal realization. Structural instability associated with geometric theories is not unique to control; it arises in the theory of linear equations as well. In this setting, the computational problems have been studied for decades and excellent tools have been developed for coping with the situation. One of the main goals of this paper is to call attention to principal component analysis (Hotelling, 1933), and an algorithm (Golub and Reinsch, 1970) for computing the singular value decompositon of a matrix. Together they form a powerful tool for coping with structural instability in dynamic systems. As developed in this paper, principal component analysis is a technique for analyzing signals. (Singular value decomposition provides the computational machinery.) For this reason, Kalman's minimal realization theory is recast in terms of responses to injected signals. Application of the signal analysis to controllability and observability leads to a coordinate system in which the "internally balanced" model has special properties. For asymptotically stable systems, this yields working approximations ofX_{c}, X_{\bar{o}}, the controllable and unobservable subspaces. It is proposed that a natural first step in model reduction is to apply the mechanics of minimal realization using these working subspaces.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Analysis of a complex of statistical variables into principal components.
Hotelling, H. (1933) · Journal of Educational Psychology · doi:10.1037/h0071325 · Cited by 9,633
Solving Least Squares Problems
Lawson, C. L., & Hanson, R. J. (1995) · doi:10.1137/1.9781611971217 · Cited by 7,103
The algebraic eigenvalue problem
Wilkinson, J. H. (1965) · Cited by 5,833
The Algebraic Eigenvalue Problem
I., E., & Wilkinson, J. H. (1966) · Mathematics of Computation · doi:10.2307/2003558 · Cited by 5,140
Linear Multivariable Control: a Geometric Approach
Wonham, W. M. (1979) · Springer eBooks · doi:10.1007/978-1-4684-0068-7 · Cited by 3,136
Singular value decomposition and least squares solutions
Golub, G. H., & Reinsch, C. (1970) · Numerische Mathematik · doi:10.1007/bf02163027 · Cited by 2,929
Computer methods for mathematical computations
Forsythe, G. E., Malcolm, M. A., & Moler, C. (1977) · UCLA Biblioteca de Ingenieria Civil · Cited by 2,683
Introduction to matrix computations
Stewart, G. W. (1973) · International Linear Collider · Cited by 2,381
Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
Bartels, R. H., & Stewart, G. W. (1972) · Communications of the ACM · doi:10.1145/361573.361582 · Cited by 1,932
Linear Algebra and Its Applications
I., E., & Strang, G. (1976) · Mathematics of Computation · doi:10.2307/2005411 · Cited by 1,871
Foundations of optimal control theory
Hermes, H. (1968) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1968.1098847 · Cited by 1,713
The singular value decomposition: Its computation and some applications
Klema, V., & Laub, A. (1980) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1980.1102314 · Cited by 1,631
Finite Dimensional Linear Systems
Brockett, R. W. (2015) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611973884 · Cited by 1,157
Computer Solution of Linear Algebraic Systems
H., A. S., Forsythe, G. E., & Moler, C. B. (1970) · Mathematics of Computation · doi:10.2307/2004501 · Cited by 828
Synthesis of minimum roundoff noise fixed point digital filters
Mullis, C. T., & Roberts, R. A. (1976) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1976.1084254 · Cited by 803
A new identification and model reduction algorithm via singular value decomposition
Kung, S. (1978) · Medical Entomology and Zoology · Cited by 555
Finite dimensional linear systems
Tabak, D. (1971) · Journal of the Franklin Institute · doi:10.1016/0016-0032(71)90066-4 · Cited by 400
Optimum solution of model-reduction problem
Wilson, D. A. (1970) · Proceedings of the Institution of Electrical Engineers · doi:10.1049/piee.1970.0227 · Cited by 293
Approximate linear realizations of given dimension via Ho's algorithm
Zeiger, H., & McEwen, A. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100525 · Cited by 226
Elements of Continuous Multivariate Analysis.
Hawkins, D. M., & Dempster, A. P. (1970) · The Statistician · doi:10.2307/2986844 · Cited by 175
Balanced systems and model reduction
Pernebo, L., & Silverman, L. M. (1979) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.1979.270069 · Cited by 24
Cited by
All optimal Hankel-norm approximations of linear multivariable systems and their L,∞-error bounds†
GLOVER, K. (1984) · International Journal of Control · doi:10.1080/00207178408933239 · Cited by 2,873
An eigensystem realization algorithm for modal parameter identification and model reduction
Juang, J.-N., & Pappa, R. S. (1985) · Journal of Guidance, Control, and Dynamics · doi:10.2514/3.20031 · Cited by 2,762
Subspace Identification for Linear Systems
Van Overschee, P., & De Moor, B. (1996) · Springer eBooks · doi:10.1007/978-1-4613-0465-4 · Cited by 2,586
A Survey of Projection-Based Model Reduction Methods for Parametric Dynamical Systems
Benner, P., Gugercin, S., & Willcox, K. (2015) · SIAM Review · doi:10.1137/130932715 · Cited by 1,916
Digital twin: values, challenges and enablers from a modeling perspective
Rasheed, A., San, O., & Kvamsdal, T. (2020) · IEEE Access · doi:10.1109/access.2020.2970143 · Cited by 1,952
Metadata
- Authors
- Moore, B.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 1981-02
- Volume
- 26
- Issue
- 1
- Pages
- 17-32
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2064733273
- Cited by
- 5,282
- References
- 21
- FWCI
- 72.87
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.