Further results on the accuracy of the SSpj algorithms
โ Scribed by Wood, W. L.
- Publisher
- Wiley (John Wiley & Sons)
- Year
- 1987
- Tongue
- English
- Weight
- 315 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0748-8025
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper, we consider the rate of convergence of the parameter estimation error and the cost function for the stochastic gradient-type algorithm. The problem is solved in the case of the minimum-variance stochastic adaptive control. It is proven that the cost function has the rate of convergenc
Let G be a graph with n vertices. The mean color number of G, denoted by (G), is the average number of colors used in all n-colorings of G. This paper proves that (G) ! (Q), where Q is any 2-tree with n vertices and G is any graph whose vertex set has an ordering x 1 ,x 2 , . . . ,x n such that x i
This paper has two purposes. One is to establish new stability criteria for linear systems with multiple time-varying/constant delays, and the other is to point out the limitations of the author's previous results. The stability criteria, including delaydependent and delay-independent ones, are deri