Algorithms for the identifiable parameter combinations and parameter bounds of unidentifiable catenary compartmental models (Q1063557)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Algorithms for the identifiable parameter combinations and parameter bounds of unidentifiable catenary compartmental models
scientific article

    Statements

    Algorithms for the identifiable parameter combinations and parameter bounds of unidentifiable catenary compartmental models (English)
    0 references
    1985
    0 references
    The parameters of catenary compartmental models are not identifiable except in special cases, e.g., where subsets of the rate constants have known values. However, an intrinsic set of parameter combinations is always identifiable, and finite ranges for all parameters can be found from these combinations. An explicit algorithm for computing the uniquely identifiable sums and products of unidentifiable parameters for this class of models is developed for the practical experimental conditions: input into and output from the first pool in the catenary chain. Upper and lower bounds on all parameters also are established algorithmically, in terms of the identifiable parameter combinations, thus permitting comprehensive analysis of any catenary model, identifiable or not, with first-pool input and output.
    0 references
    catenary compartmental models
    0 references
    algorithm
    0 references
    identifiable parameter combinations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references