Search Results for author:
Found 10 papers, 6 papers with code
Algebraic identifiability of partial differential equation models
This problem has been intensively studied for ordinary differential equation models, with theory and several efficient algorithms and software packages developed.
Symbolic-numeric algorithm for parameter estimation in discrete-time models with $\exp$
Determining unknown parameter values in dynamic models is crucial for accurate analysis of the dynamics across the different scientific disciplines.
Algorithm for globally identifiable reparametrizions of ODEs
Structural global parameter identifiability indicates whether one can determine a parameter's value in an ODE model from given inputs and outputs.
Algorithm for finding new identifiable reparametrizations of parametric ODEs
If all of the parameters of a model can be recovered from data, the model is said to be identifiable.
Identifiable specializations for ODE models
The parameter identifiability problem for a dynamical system is to determine whether the parameters of the system can be found from data for the outputs of the system.
More Efficient Identifiability Verification in ODE Models by Reducing Non-Identifiability
Structural global parameter identifiability indicates whether one can determine a parameter's value from given inputs and outputs in the absence of noise.
CLUE: Exact maximal reduction of kinetic models by constrained lumping of differential equations
Model reduction can help tame such complexity by providing a lower-dimensional model in which each macro-variable can be directly related to the original variables.
Computing all identifiable functions of parameters for ODE models
Parameter identifiability is a structural property of an ODE model for recovering the values of parameters from the data (i. e., from the input and output variables).
Effective difference elimination and Nullstellensatz
We prove effective Nullstellensatz and elimination theorems for difference equations in sequence rings.
Algebraic Geometry Logic 12H10, 13P25 (Primary), 14Q20, 03C10, 03C60 (Secondary)
Bounds for elimination of unknowns in systems of differential-algebraic equations
The problem of finding an a priori upper bound for the number of differentiations in elimination of unknowns in a system of differential-algebraic equations (DAEs) is an important challenge, going back to Ritt (1932).
Commutative Algebra Symbolic Computation Algebraic Geometry 12H05, 12H20, 14Q20, 34A09
