Equivalence problems in structural identifiability

G.A. Bekey and F.Y. Hadaegh

Mathematics and Computers in Simulation (MATCOM), 1982, vol. 24, issue 6, 460-465

Abstract: This paper presents a reformulation of the identifiability problem, on the basis of equivalence between a model and the process it represents. Following a brief review of the major definitions in the literature, the concept of “near-equivalence” is introduced for both theoretical and real world identification problems. This concept is illustrated with a general block diagram and two examples. It is concluded that the theory of identifiability needs to be reformulated if it is be broadly applicable to the real world situations.

Date: 1982
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0378475482906437
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:24:y:1982:i:6:p:460-465

DOI: 10.1016/0378-4754(82)90643-7

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().