Some effective approaches to check the identifiability of uncontrolled nonlinear systems (Q5944019): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing representations for radicals of finitely generated differential ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: An easy to check criterion for (un)indentifiability of uncontrolled systems and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifiability of linear and nonlinear dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks about an identifiability result of nonlinear systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On global identifiability for arbitrary model parametrizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: System identifiability based on the power series expansion of the solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results for identifiability of nonlinear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4747970 / rank
 
Normal rank

Latest revision as of 20:03, 3 June 2024

scientific article; zbMATH DE number 1649052
Language Label Description Also known as
English
Some effective approaches to check the identifiability of uncontrolled nonlinear systems
scientific article; zbMATH DE number 1649052

    Statements

    Some effective approaches to check the identifiability of uncontrolled nonlinear systems (English)
    0 references
    0 references
    0 references
    5 May 2002
    0 references
    This paper deals with two procedures to get global identifiability results of uncontrolled nonlinear systems. The first, deriving from an algorithm of Ljung and Glad, is based on differential algebra and its complexity. The second approach is heuristic. It builds a new model from various input datasets. The authors study the identifiability of this new model. The technique has been tested on a system for which the other methods failed and it has given global identifiability results. Application to biological systems is given. The reviewer notes that the heuristic approach is already well-known in compartmental analysis.
    0 references
    0 references
    structural identifiability
    0 references
    power series expansion
    0 references
    nonlinear systems
    0 references
    differential algebra
    0 references
    complexity
    0 references
    global identifiability
    0 references
    heuristic approach
    0 references