In this pc~per we diacuas the realization of Volterra series by finite and in$nite dimensional bilinear systems. W e o serve b that realizing a given Volterra series with various weights leada naturally to a particularly interesting class of bilinear syeteme with a rich mathematical structure. We ar
Computing finite-dimensional realizations
β Scribed by S. G. Pushkov
- Publisher
- Springer US
- Year
- 1991
- Tongue
- English
- Weight
- 357 KB
- Volume
- 27
- Category
- Article
- ISSN
- 1573-8337
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
It is shown that a real-valued functionf(x), defined for strings x over a finite alphabet, is of the form (fig(x) + y) exp (3[ x ]) for constants fi, y, 3, and the acceptance probability function g for a probabilistic automaton, if and only iff is of finite rank, where the latter external criterion
A new numerical scheme for computing balancing coordinate transformations in linear systems theory is presented. The method is closely related to the Jacobi method for diagonalizing symmetric matrices. Here the minimization of the sum of traces of the Gramians by orthogonal and nonorthogonal Jacobi-