×

On the decay rate of Hankel singular values and related issues. (English) Zbl 1003.93024

Summary: This paper investigates the decay rate of the Hankel singular values of linear dynamical systems. This issue is of considerable interest in model reduction by means of balanced truncation, for instance, since the sum of the neglected singular values provides an upper bound for an appropriate norm of the approximation error. The decay rate involves a new set of invariants associated with a linear system, which are obtained by evaluating a modified transfer function at the poles of the system. These considerations are equivalent to studying the decay rate of the eigenvalues of the product of the solutions of two Lyapunov equations. The related problem of determining the decay rate of the eigenvalues of the solution to one Lyapunov equation will also be addressed. Very often these eigenvalues, like the Hankel singular values, are rapidly decaying. This fact has motivated the development of several algorithms for computing low-rank approximate solutions to Lyapunov equations. However, until now, conditions assuring rapid decay have not been well understood. Such conditions are derived here by relating the solution to a numerically low-rank Cauchy matrix determined by the poles of the system. Bounds explaining rapid decay rates are obtained under some mild conditions.

MSC:

93B60 Eigenvalue problems
93B11 System structure simplification
15A18 Eigenvalues, singular values, and eigenvectors
15A24 Matrix equations and identities

Software:

mctoolbox
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] A.C. Antoulas, On eigenvalues and singular values of linear dynamical systems, Proceedings of the House-holder XIV Symposium, Chateau Whistler, BC, 14-18 June 1999, pp. 8-11.; A.C. Antoulas, On eigenvalues and singular values of linear dynamical systems, Proceedings of the House-holder XIV Symposium, Chateau Whistler, BC, 14-18 June 1999, pp. 8-11.
[2] Antoulas, A. C., Lectures on the Approximation of Large-scale Dynamical Systems (2002), SIAM: SIAM Philadelphia · Zbl 1023.93012
[3] Antoulas, A. C.; Sorensen, D. C.; Gugercin, S., A survey of model reduction methods for large-scale systems, Contemp. Math., 280, 193-219 (2001) · Zbl 1048.93014
[4] Bazán, F. S.V.; Toint, Ph. L., Conditioning of infinite Hankel matrices of finite rank, Systems Control Lett., 41, 347-359 (2000) · Zbl 0980.93028
[5] Beckermann, B., The condition number of real Vandermonde, Krylov and positive definite Hankel matrices, Numer. Math., 85, 553-577 (2000) · Zbl 0965.15003
[6] Donoho, D. L., Unconditional bases are optimal bases for data compression and for statistical estimation, Appl. Comput. Harmonic Anal., 1, 100-115 (1993) · Zbl 0796.62083
[7] Fuhrmann, P. A., A polynomial approach to Hankel norm and balanced approximations, Linear Algebra Appl., 146, 133-220 (1991) · Zbl 0727.47004
[8] Gajic, Z.; Qureshi, M. T.J., Lyapunov Matrix Equations in System Stability and Control (1995), Academic Press: Academic Press New York
[9] Gohberg, I.; Koltracht, I., Triangular factors of Cauchy and Vandermonde matrices, Integral Equations Operator Theory, 46, 46-59 (1996) · Zbl 0858.15006
[10] Grimme, E.; Sorensen, D. C.; Van Dooren, P., Model reduction of state space systems via an implicity restarted Lanczos method, Numer. Algorithms, 12, 1-32 (1996) · Zbl 0870.65052
[11] Gudmundsson, T.; Laub, A. J., Approximate solution of large sparse Lyapunov equations, IEEE Trans. Automat. Control, AC-39, 1110-1114 (1994) · Zbl 0816.93041
[12] S. Gugercin, D.C. Sorensen, A.C. Antoulas, A modified low-rank Smith method for large-scale Lyapunov equations, Technical Report, Rice University ECE-CAAM Depts, June 2001.; S. Gugercin, D.C. Sorensen, A.C. Antoulas, A modified low-rank Smith method for large-scale Lyapunov equations, Technical Report, Rice University ECE-CAAM Depts, June 2001.
[13] N.J. Higham, Accuracy and Stability of Numerical Algorithms, SIAM Press, Philadelphia, PA, 1996, Section 26.1: the Hilbert and Cauchy matrices.; N.J. Higham, Accuracy and Stability of Numerical Algorithms, SIAM Press, Philadelphia, PA, 1996, Section 26.1: the Hilbert and Cauchy matrices. · Zbl 0847.65010
[14] Hodel, A.; Poolla, K.; Tenison, B., Numerical solution of the Lyapunov equation by approximate power iteration, Linear Algebra Appl., 236, 205-230 (1996) · Zbl 0848.65033
[15] Horn, A., On the eigenvalues of a matrix with prescribed singular values, Proc. Amer. Math. Soc., 5, 4-7 (1954) · Zbl 0055.00908
[16] Jaimoukha, I.; Kasenally, E., Krylov subspace methods for solving large Lyapunov equations, SIAM J. Numer. Anal., 31, 227-251 (1994) · Zbl 0798.65060
[17] Kwon, W.; Moon, Y.; Ahn, S., Bounds in algebraic Riccati and Lyapunov equationsa survey and some new results, Internat. J. Control, 64, 377-389 (1996) · Zbl 0852.93005
[18] Mullis, C. T.; Roberts, R. A., Synthesis of minimum round-off noise fixed point digital filters, IEEE Trans. Circuits Systems, CAS-33, 551-562 (1976) · Zbl 0342.93066
[19] Penzl, T., Eigenvalue decay bounds for solutions of Lyapunov equationsthe symmetric case, Systems Control Lett., 40, 139-144 (2000) · Zbl 0977.93034
[20] Penzl, T., A cyclic low-rank smith method for large sparse Lyapunov equations, SIAM J. Sci. Comput., 21, 1401-1418 (2000) · Zbl 0958.65052
[21] Y. Saad, Numerical solution of large Lyapunov equations, in: M. Kaashoek, J.H. van Schuppen, A. Ran (Eds.), Processing, Scattering, Operator Theory and Numerical Methods: Proceedings of the International Symposium MTNS-89, Vol. III, Birkhäuser, Boston, MA, 1990, pp. 503-511.; Y. Saad, Numerical solution of large Lyapunov equations, in: M. Kaashoek, J.H. van Schuppen, A. Ran (Eds.), Processing, Scattering, Operator Theory and Numerical Methods: Proceedings of the International Symposium MTNS-89, Vol. III, Birkhäuser, Boston, MA, 1990, pp. 503-511.
[22] Sherman, S.; Thompson, C. J., Equivalences on eigenvalues, Indiana Univ. Math. J., 21, 807-814 (1972) · Zbl 0222.15009
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.