The geometry of Darlington synthesis (in memory of W. Cauer)
Dewilde, Patrick
International Journal of Applied Mathematics and Computer Science, Tome 11 (2001), p. 1379-1386 / Harvested from The Polish Digital Mathematics Library

We revisit the classical problem of 'Darlington synthesis', or Darlington embedding. Although traditionally it is solved using analytic means, a more natural way to approach it is to use the geometric properties of a well-chosen Hankel map. The method yields surprising results. In the first place, it allows us to formulate necessary and sufficient conditions for the existence of the embedding in terms of systems properties of the transfer operation to be embedded. In addition, the approach allows us to extend the solution to situations where no analytical transform is available. The paper has a high review content, as all the results presented have been obtained during the last twenty years and have been published. However, we make a systematic attempt at formulating them in a geometric way, independent of an accidental parametrization. The benefit is clarity and generality.

Publié le : 2001-01-01
EUDML-ID : urn:eudml:doc:207560
@article{bwmeta1.element.bwnjournal-article-amcv11i6p1379bwm,
     author = {Dewilde, Patrick},
     title = {The geometry of Darlington synthesis (in memory of W. Cauer)},
     journal = {International Journal of Applied Mathematics and Computer Science},
     volume = {11},
     year = {2001},
     pages = {1379-1386},
     zbl = {0995.93013},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-amcv11i6p1379bwm}
}
Dewilde, Patrick. The geometry of Darlington synthesis (in memory of W. Cauer). International Journal of Applied Mathematics and Computer Science, Tome 11 (2001) pp. 1379-1386. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-amcv11i6p1379bwm/

[000] Anderson B.D.O. and Vongpanitlerd S. (1973): Network Analysis and Synthesis. — Englewood Cliffs: Prentice Hall.

[001] Arov D.Z. (1971): On the Darlington method in the theory of dissipative systems. — Dokl. Akad. Nauk USSR, Vol.201, No.3, pp.559–562.

[002] Belevitch V. (1968): Classical Network Theory. — San Francisco: Holden Day. | Zbl 0172.20404

[003] Cauer W. (1932): New theory and design of wave filters. — Physics, Vol.2, pp.242–267. | Zbl 58.1323.04

[004] Delsarte P. and Genin Y. (1986): The split Levinson algorithm. — IEEE Trans. Acoust. Speech Sign. Process., Vol.34, No.19863, pp.470–478. | Zbl 0675.62067

[005] Dewilde P. (1971): Roomy scattering matrix synthesis. — Tech. Rep., Dept. of Mathematics, Univ. of California, Berkeley.

[006] Dewilde P. (1976): Input-output description of roomy systems. — SIAM J. Contr. Optim., Vol.14, No.4, pp.712–736. | Zbl 0334.93015

[007] Dewilde P. (1999): Generalized Darlington synthesis. — IEEE Trans. Circ. Syst. – I: Fund. Theory Appl., Vol.45, No.1, pp.41–58.

[008] Dewilde P. and van der Veen A.-J. (1998): Time-Varying Systems and Computations. — Dordrecht: Kluwer.

[009] Fuhrmann P.A. (1981): Linear Systems and Operators in Hilbert Space. — New York: McGraw-Hill. | Zbl 0456.47001

[010] Helson H. (1964): Lectures on Invariant Subspaces. — New York: Academic Press. | Zbl 0119.11303

[011] Newcomb R. (1966): Linear Multiport Synthesis. — New York: McGraw Hill.

[012] Masani P. and Wiener N. (1957): The prediction theory of multivariable stochastic processes. — Acta Math., Vol.98, No.1, pp.111–150. | Zbl 0080.13002

[013] Szegö G. (1920): Beitrage zur theorie der toeplitzen formen (ersten mitteilung). — Math. Zeit, Vol.6, No.2, pp.167–202. | Zbl 47.0391.04