Parameter estimation of ordinary differential equations

Z. Li
2005 IMA Journal of Numerical Analysis  
This paper addresses the development of a new algorithm for parameter estimation of ordinary differential equations. Here, we show that (1) the simultaneous approach combined with orthogonal cyclic reduction can be used to reduce the estimation problem to an optimization problem subject to a fixed number of equality constraints without the need for structural information to devise a stable embedding in the case of non-trivial dichotomy and (2) the Newton approximation of the Hessian information
more » ... Hessian information of the Lagrangian function of the estimation problem should be used in cases where hypothesized models are incorrect or only a limited amount of sample data is available. A new algorithm is proposed which includes the use of the sequential quadratic programming (SQP) Gauss-Newton approximation but also encompasses the SQP Newton approximation along with tests of when to use this approximation. This composite approach relaxes the restrictions on the SQP Gauss-Newton approximation that the hypothesized model should be correct and the sample data set large enough. This new algorithm has been tested on two standard problems. where t denotes the independent variable, usually referred to as time, θ is a p-dimensional vector of unknown parameters, x = x(t, θ) is an n-dimensional state variable vector depending on t and θ, and the function f (t, x, θ) maps × n × p into n . In addition, side constraints are often given to specify †
doi:10.1093/imanum/drh016 fatcat:g2fe4rbbdrdudi6cpiavfxnvvi