The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
A Schur method for balanced-truncation model reduction
Abstract
It is shown that a not-necessarily-balanced state-space realization of the Moore reduced model can be computed directly without balancing via projections defined in terms of arbitrary bases for the left and right eigenspaces associated with the large eigenvalues of the product PQ of the reachability and controllability Grammians. Two specific methods for computing these bases are proposed, one based on the ordered Schur decomposition of PQ and the other based on the Cholesky factors of P and Q. The algorithms perform reliably even for nonminimal models.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Principal component analysis in linear systems: Controllability, observability, and model reduction
Moore, B. (1981) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1981.1102568 · Cited by 5,282
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
Introduction to matrix computations
Stewart, G. W. (1973) · International Linear Collider · Cited by 2,381
Cited by
Sub-Synchronous Interaction Damping Control for DFIG Wind Turbines
Leon, A. E., & Solsona, J. A. (2015) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2014.2327197 · Cited by 316
Sengupta, A., & Das, D. K. (2024) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2023.3330433 · Cited by 7
Metadata
- Authors
- Safonov, M. G., & Chiang, R. Y.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 1989-07
- Volume
- 34
- Issue
- 7
- Pages
- 729-733
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W1985927505
- Cited by
- 600
- References
- 3
- FWCI
- 11.86
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Schur method for balanced-truncation model reduction. https://app.cochat.ai/papers/10.1109/9.29399
- The paper
- Safonov, M. G., & Chiang, R. Y. (1989). A Schur method for balanced-truncation model reduction. IEEE Transactions on Automatic Control. https://doi.org/10.1109/9.29399
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.
