Modifications of rational transfer matrices to achieve positive realness

Signal Processing

Volumn 80, Issue 4, 2000, Pages 615-635

  Mari, Jorge ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; MATHEMATICAL PROGRAMMING; RANDOM PROCESSES;

BACKWARD LEVINSON ALGORITHM; RATIONAL TRANSFER MATRIX;

MATRIX ALGEBRA;

EID: 0033885544     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0165-1684(99)00157-7     Document Type: Article

References (57)

1. Ammar G., Gragg W. The QR algorithm for unitary Hessenberg matrices. J. Comput. Appl. Math. 16:1986;1-8.
2. B.D.O. Anderson, S. Vongpanitlerd, Network Analysis and Synthesis, Prentice-Hall, Englewood Cliffs, NJ, 1973.
3. M. Aoki, State Space Modeling of Time Series, Springer, Berlin, 1987.
4. R. Bahadur, S. Zabell, J. Gupta. Large deviations, tests, and estimates, in: I.M. Chatcravarti (Ed.), Asymptotic Theory of Statistical Tests and Estimation, Academic Press, New York, 1980.
5. Ball J., Helton J. A Beurling-Lax theorem for the Lie group. U(m,n) which contains most classical interpolation theory J. Oper. Theory. 9:1983;107-142.
6. Ball J., Ran A. Optimal Hankel norm model reductions and Wiener-Hopf factorization I: the canonical case. SIAM J. Control Optim. 25:1987;363-382.
7. ∞ norm of a transfer matrix and related problems Math. Control Signals Systems. 2:1989;207-219.
8. S. Boyd, L. El Ghaoui, E. Feron, V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory, SIAM, Philadelphia, PA, 1994.
9. J.P. Burg, Maximum entropy spectral analysis, Ph.D. Thesis, Stanford University, Dept. Geophysics, Stanford, CA, 1975.
10. Byers R. A bisection method for measuring the distance of a stable matrix to the unstable matrices. SIAM J. Sci. Statist. Comput. 9:1988;875-881.
11. Byrnes C.I., Lindquist A., McGregor T. Predictability and unpredictability in Kalman filtering. IEEE Trans. Automat. Control. 36:1991;563-579.
12. Byrnes C.I., Lindquist A., Zhou Y. On the nonlinear dynamics of fast filtering algorithms. SIAM J. Control Optim. 32:1994;744-789.
13. Caratheodory C., Fejér L. Über den Zusammenhang der Extremen von harmonischen Funktionen mit ihren Koeffizienten und über den Picard-Landauschen Satz. Rend. Circolo Mat. Palermo. 32:1911;193-239.
14. Dahlén A., Lindquist A., Mari J. Experimental evidence showing that stochastic subspace identification methods may fail. Systems Control Lett. 34:1998;303-312.
15. Delsarte P., Genin Y.V., Kamp Y.G. Orthogonal polynomial matrices on the unit circle. IEEE Trans. Circuits Systems. CAS-25:1978;149-160.
16. J.L. Doob, Stochastic Processes, Wiley, New York, 1953.
17. p Spaces, Academic Press, New York, 1970.
18. H. Dym, H.P. McKean, Fourier Series and Integrals, Academic Press Inc., New York, 1972.
19. P. Faurre, M. Clerget, F. Germain, Opérateurs Rationnels Postitifs, Dunod, Paris, 1979.
20. P. Gahinet, A. Nemirovski, A. Laub, LMI Control Toolbox User's Guide, The Math Works, Inc., 24 Prime Park Way, Natick, MA 01760-1500, 1995.
21. Georgiou T. Realization of power spectra from partial covariance sequences. IEEE Trans. Accoust. Speech Signal Process. ASSP-35:1987;438-449.
22. ∞ -error bounds Int. J. Control. 39:1984;1115-1193.
23. I. Gochberg, S. Goldberg, M. Kaashoek, Classes of Linear Operators, Vol. II, Birkhäuser, Basel, 1993.
24. Golub G., Nash S., Van Loan C. A Hessenberg-Schur method for the problem. AX + XB=C IEEE Trans Automat. Control. AC-24:1979;909-913.
25. G.H. Golub, C.F. van Loan, Matrix Computations, Johns Hopkins, Baltimore, MD, 1989.
26. W.B. Gragg, Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle, in: E.S. Nikolaev (Ed.), Numerical Methods in Linear Algebra, Moscow Univ. Press, Moscow, 1982, pp. 16-32.
27. ∞ optimization Int. J. Control. 49:1989;1683-1723.
28. E.J. Hannan, M. Deistler, The Statistical Theory of Linear Systems, Wiley, New York, 1988.
29. Hitz K., Anderson B.D.O. Discrete positive real functions and their application to system stability. Proc. Inst. Elctr. Eng. 116:1969;153-155.
30. Kågström, P. Van Dooren, Additive decomposition of a transfer function with respect to a specified region, in: M.A. Kaashoek et al. (Eds.), Signal Processing, Scattering, Operator Theory and Numerical Methods, 1990, pp. 469-477.
31. H. Kimura, Positive partial realization of covariance sequences, in: C.I. Byrnes, A. Lindquist (Eds.), Modelling, Identification and Robust Control, 1987, pp. 499-513.
32. Kung S., Lin D. Optimal Hankel norm model reductions: multivariate systems. IEEE Trans. Automat. Control. 26:1983;832-852.
33. Lindquist A., Picci G. A geometric approach to modelling and estimation of linear stochastic systems. J. Math. Systems Estimation Control. 1:1990;241-333.
34. A. Lindquist, G. Picci, On "subspace methods" identification and stochastic model reduction, in Proceedings of SYSID '94, Copenhaguen, 1994, pp. 397-404.
35. Lindquist A., Picci G. Canonical correlation analysis, approximate covariance extension, and identification of stationary time series. Automatica. 32(5):1996;709-733.
36. Maciejowski J.M. Guaranteed stability with subspace methods. Systems Control Lett. 26:1995;153-156.
37. Moore B.C. Principal component analysis in linear systems: controllability, observability and model reduction. IEEE Trans. Automat. Control. AC-26:1981;17-32.
38. Morf M., Vieira A., Kailath T. Covariance characterization by partial autocorrelation matrices. Ann. Statist. 6:1978;643-648.
39. R. Moses, D. Liu, Determining the closest stable polynomial to an unstable one, in: Proceedings of 1988 International Conference Acoustics Speech and Signal Processing, 11-14 April 1988, pp. 2332-2335.
40. Nehari Z. On bounded bilinear forms. Ann. Math. 65:1957;153-162.
41. Y. Nesterov, A. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, PA, 1994.
42. M. Overton, SDPpack: a package for semidefinite-quadratic-linear programming (SQLP), http://www.cs.nyu.edu/faculty/overton/sdppack/.
43. Pappas T., Laub A., Sandell N. On the numerical solution of the discrete time algebraic Riccati equation. IEEE Trans. Automat. Control. AC-25:1980;631-641.
44. W. Rudin, Real and Complex Analysis, McGraw-Hill, New York, 1987.
45. Schur I. Über Potenzreihen, die im Innern des Einheitskreises beschränkt sind. J. Reine Angew. Math. 147:1917;205-232.
46. SLICOT, Control and Systems Library, www.win.tue.nl/wgs/slicot.html, 1998.
47. Stewart G. HQR3 and EXCHNG: Fortran subroutines for calculating the eigenvalues of a real upper Hessenber matrix. ACM Trans. Math. Software. 2:1976;275-280.
48. Stoica P., Moses R. On the unit circle problem: the Schur-Cohn procedure revisited. Signal Processing. 26:1992;95-118.
49. P. Stoica, R.L. Moses, Introduction to Spectral Analysis, Prentice-Hall, Englewood Cliffs, NJ, 1997.
50. Stoica A., Moses R., Stoica P. Enforcing positiveness on estimated spectral densities. Electron. Lett. 29:1993;2009-2011.
51. Stoica P., Söderström T. Optimization with respect to covariance sequence parameters. Automatica. 21:1985;671-675.
52. The Math Works, Inc., 24 Prime Park Way, Natick, Mass. 01760-1500, MATLAB, 1995.
53. L. Vandenberghe, S. Boyd, SP: software for semidefinite programming, http://www.stanford.edu/ boyd/SP.html.
54. C.F. Van Loan, How near is a stable matrix to an unstable matrix? in: B. N. Datta (Ed.), Linear Algebra and its Role in Systems Theory, Am. Math. Soc., Providence, RI, 1985.
55. P. Van Overschee, B. De Moor. Subspace Identification for Linear Systems - Theory Implementation Applications, Kluwer Academic Publishers, Dordrecht, 1996.
56. Whittle P. On the fitting of multivariable autoregressions and the approximate factorization of a spectral density matrix. Biometrika. 50:1963;129-134.
57. Wiggins R.A., Robinson E.A. Recursive solution to the multichannel filtering problem. J. Geophys. Res. 70:1965;1885-1891.