It is widely recognized that the computation of gap metric is equivalent to a certain two-block H โ problem, i.e., the gap is equal to the norm of a certain two-block operator. However, it can also be characterized as the smallest singular value of a certain Toeplitz operator. This paper derives a s
On the computation of the gap metric
โ Scribed by Tryphon T. Georgiou
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 312 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0167-6911
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A n algorithm is given for computing a metric on piecewise linear curves. A bound for the distance between a piecewise linear approximation and a general curve alia ws the approximate computation of the metric on general curves. The algorithm has been successfully implemented in Fortran. geometry~ m
The notions "recursively enumerable" and "recursive" are the basic notions of e ectivity in classical recursion theory. In computable analysis, these notions are generalized to closed subsets of Euclidean space using their metric distance functions. We study a further generalization of these concept