1987
DOI: 10.1109/tac.1987.1104549
|View full text |Cite
|
Sign up to set email alerts
|

Computation of system balancing transformations and other applications of simultaneous diagonalization algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
246
0
11

Year Published

1988
1988
2020
2020

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 492 publications
(258 citation statements)
references
References 22 publications
1
246
0
11
Order By: Relevance
“…For this one-dimensional problem, standard algorithms for computing balanced truncation are computationally tractable. Therefore, we are able to compare the models resulting from exact balanced truncation (which for the 1-D case can be computed in MATLAB using standard algorithms [19]) to BPOD models obtained from three-dimensional simulations of the real part of the full field, Re {q(x, y, z, t)} at a particular wavenumber pair (α, β) on a large grid, similar to the comparison made by Rowley [30] for a streamwise-constant perturbation.…”
Section: Results: Single-wavenumber Perturbationsmentioning
confidence: 99%
“…For this one-dimensional problem, standard algorithms for computing balanced truncation are computationally tractable. Therefore, we are able to compare the models resulting from exact balanced truncation (which for the 1-D case can be computed in MATLAB using standard algorithms [19]) to BPOD models obtained from three-dimensional simulations of the real part of the full field, Re {q(x, y, z, t)} at a particular wavenumber pair (α, β) on a large grid, similar to the comparison made by Rowley [30] for a streamwise-constant perturbation.…”
Section: Results: Single-wavenumber Perturbationsmentioning
confidence: 99%
“…As A is assumed to be stable and thus P and Q are positive semi-definite, there exist Cholesky factorizations P = S T S and Q = R T R. In the so-called squareroot balanced truncation (SRBT) algorithms [24,25] these are used to define the truncation matrices…”
Section: Large Scale Sparse Standard State Space Systemsmentioning
confidence: 99%
“…We shall assume throughout this paper that our system is completely controllable and observable. 2 A convenient way to express the balancing transformation is due to [24,25]: Noting that Σ 2 contains the positive eigenvalues of the product W c W o , we decompose the two Gramians according to…”
Section: Balancing Transformationsmentioning
confidence: 99%
“…We thank Volker Mehrmann, Tatjana Stykel, and Timo Reis for valuable discussions and comments. We greatly benefited from the remarks of the anonymous referees, which helped to improve the first version of this article, and we are grateful to them for pointing out [8,24,25].…”
mentioning
confidence: 99%