A bisection method for computing the H ∞ norm of a transfer matrix and related problems

作者: S. Boyd , V. Balakrishnan , P. Kabamba

DOI: 10.1007/BF02551385

关键词:

摘要: We establish a correspondence between the singular values of transfer matrix evaluated along imaginary axis and eigenvalues related Hamiltonian matrix. give simple linear algebraic proof, also more intuitive explanation based on certain indefinite quadratic optimal control problem. This result yields bisection algorithm to compute H∞ norm The method is far efficient than algorithms which involve search over frequencies, usual problems associated with such methods (such as determining how fine should be) do not arise. readily extended other quantities system-theoretic interest, for instance, minimum dissipation A variation can be used solve Armijo line-search problem no computation required single norm.

参考文章(18)
Bruce A. Francis, A Course in H Control Theory ,(1986)
S. Barnett, D. D. šiljak, Routh’s Algorithm: A Centennial Survey Siam Review. ,vol. 19, pp. 472- 489 ,(1977) , 10.1137/1019070
B. Anderson, An algebraic solution to the spectral factorization problem IEEE Transactions on Automatic Control. ,vol. 12, pp. 410- 414 ,(1967) , 10.1109/TAC.1967.1098646
J. Willems, Least squares stationary optimal control and the algebraic Riccati equation IEEE Transactions on Automatic Control. ,vol. 16, pp. 621- 634 ,(1971) , 10.1109/TAC.1971.1099831
Peter Henrici, Henry C. Thacher, Applied and Computational Complex Analysis ,(1974)
Stephen Boyd, John Doyle, Comparison of peak and RMS gains for discrete-time systems Systems & Control Letters. ,vol. 9, pp. 1- 6 ,(1987) , 10.1016/0167-6911(87)90002-8
Charles A. Desoer, M. Vidyasagar, Feedback Systems: Input-output Properties ,(1975)
Ralph Byers, A Hamiltonian $QR$ Algorithm SIAM Journal on Scientific and Statistical Computing. ,vol. 7, pp. 212- 229 ,(1986) , 10.1137/0907015