Time-delay polynomial networks and rates of approximation
We consider a large family of finite memory causal time-invariant maps G from an input set S to a set of ℝ-valued functions, with the members of both sets of functions defined on the nonnegative integers, and we give an upper bound on the error in approximating a G using a two-stage structure consi...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
1998-01-01
|
| Series: | Mathematical Problems in Engineering |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S1024123X98000726 |