Identification and rational L2 approximation A gradient algorithm
β Scribed by Laurent Baratchart; Michel Cardelli; Martine Olivi
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 471 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0005-1098
No coin nor oath required. For personal study only.
β¦ Synopsis
Al~traet--This paper deals with the identification of linear constant dynamical systems when formalized as a rational approximation problem. The criterion is the 12 norm of the transfer function, which is of interest in a stochastic context. The problem can be expressed as nonlinear optimization in a Hilbert space, but standard algorithms are usually not well adapted. We present a generic recursive procedure to find a local optimum of the criterion in the case of scalar systems. Our methods are borrowed from differential theory mixed with a bit of classical complex analysis. To our knowledge, the algorithm described in this paper is the first that ensures convergence to a local minimum. *
π SIMILAR VOLUMES
This paper presents insertions-only algorithms for maintaining the exact andror approximate size of the minimum edge cut and the minimum vertex cut of a graph. Ε½ . The algorithms output the approximate or exact size k in time O 1 and a cut of size k in time linear in its size. For the minimum edge
## Abstract Exact representation of unbounded soil contains the single outputβsingle input relationship between force and displacement in the physical or transformed space. This relationship is a global convolution integral in the time domain. Rational approximation to its frequency response functi