Extensions to a procedure for generating locally identifiable reparameterisations of unidentifiable systems (Q1595407)

From MaRDI portal
Revision as of 10:27, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Extensions to a procedure for generating locally identifiable reparameterisations of unidentifiable systems
scientific article

    Statements

    Extensions to a procedure for generating locally identifiable reparameterisations of unidentifiable systems (English)
    0 references
    0 references
    0 references
    3 March 2002
    0 references
    Given a postulated parametrised state space model, structural identifiability is concerned with whether the unknown parameters within the model can be identified uniquely from the experiment considered. A problem that immediately arises is what to do with unidentifiable systems. Some authors have given a methodology for generating locally identifiable reparametrisations of unidentifiable systems. The aim of this paper is to extend such procedures. Symbolic computation, such as Mathematica, facilitates this approach of reparametrisation based on Taylor series. Several concrete examples (biology, pharmacokinetics) are treated. The method generates a reparametrisation that is at least locally identifiable. It is a very interesting paper on models identification.
    0 references
    symbolic computation
    0 references
    biology
    0 references
    structural identifiability
    0 references
    unidentifiable systems
    0 references
    locally identifiable reparametrisations
    0 references
    Taylor series
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers