Results 11 to 20 of about 50 (49)
Identifiability Implies Robust Identifiability
, 1993 In identification from a deterministic point of view an algorithm is said to be robustly convergent if the true system is regained when the noise level tends to zero. In this paper we introduce a concept close to this performance measure: robust global identifiability. A model structure, i.e.
Ljung, Lennart +2 more
openaire +1 more source