On asymptotic accuracy in L 1 of a dynamical algorithm for reconstructing a disturbance

2006 ◽  
Vol 255 (S2) ◽  
pp. S216-S224 ◽  
Author(s):  
A. Yu. Vdovin ◽  
A. V. Kim ◽  
S. S. Rubleva
Keyword(s):  
2005 ◽  
Vol 50 (8) ◽  
pp. 1182-1185 ◽  
Author(s):  
R. Hildebrand ◽  
A. Lecchini ◽  
G. Solari ◽  
M. Gevers

1989 ◽  
Vol 21 (3) ◽  
pp. 661-680 ◽  
Author(s):  
P. J. Hunt

Implied costs in loss networks are measures of the rate of change of an objective function with respect to the parameters of the network. This paper considers these costs and the costs predicted by the Erlang fixed-point approximation. We derive exact expressions for the implied costs and consider the asymptotic accuracy of the approximation. We show that the approximation is asymptotically valid in some cases but is not valid in one important limiting regime. We also show that a linearity approximation for the implied costs is asymptotically correct when taken over suitable subsets of links.


1989 ◽  
Vol 21 (03) ◽  
pp. 661-680 ◽  
Author(s):  
P. J. Hunt

Implied costs in loss networks are measures of the rate of change of an objective function with respect to the parameters of the network. This paper considers these costs and the costs predicted by the Erlang fixed-point approximation. We derive exact expressions for the implied costs and consider the asymptotic accuracy of the approximation. We show that the approximation is asymptotically valid in some cases but is not valid in one important limiting regime. We also show that a linearity approximation for the implied costs is asymptotically correct when taken over suitable subsets of links.


1998 ◽  
Vol 44 (3) ◽  
pp. 999-1009 ◽  
Author(s):  
A. Berlinet ◽  
I. Vajda ◽  
E.C. van der Meulen

1985 ◽  
Vol 41 (5) ◽  
pp. 1175-1188
Author(s):  
PETRE STOICA ◽  
TORSTEN SÖDERSTRÖM
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document