34,659 research outputs found
Moment and SDP relaxation techniques for smooth approximations of problems involving nonlinear differential equations
Combining recent moment and sparse semidefinite programming (SDP) relaxation
techniques, we propose an approach to find smooth approximations for solutions
of problems involving nonlinear differential equations. Given a system of
nonlinear differential equations, we apply a technique based on finite
differences and sparse SDP relaxations for polynomial optimization problems
(POP) to obtain a discrete approximation of its solution. In a second step we
apply maximum entropy estimation (using moments of a Borel measure associated
with the discrete solution) to obtain a smooth closed-form approximation. The
approach is illustrated on a variety of linear and nonlinear ordinary
differential equations (ODE), partial differential equations (PDE) and optimal
control problems (OCP), and preliminary numerical results are reported
Sieve estimation of constant and time-varying coefficients in nonlinear ordinary differential equation models by considering both numerical error and measurement error
This article considers estimation of constant and time-varying coefficients
in nonlinear ordinary differential equation (ODE) models where analytic
closed-form solutions are not available. The numerical solution-based nonlinear
least squares (NLS) estimator is investigated in this study. A numerical
algorithm such as the Runge--Kutta method is used to approximate the ODE
solution. The asymptotic properties are established for the proposed estimators
considering both numerical error and measurement error. The B-spline is used to
approximate the time-varying coefficients, and the corresponding asymptotic
theories in this case are investigated under the framework of the sieve
approach. Our results show that if the maximum step size of the -order
numerical algorithm goes to zero at a rate faster than , the
numerical error is negligible compared to the measurement error. This result
provides a theoretical guidance in selection of the step size for numerical
evaluations of ODEs. Moreover, we have shown that the numerical solution-based
NLS estimator and the sieve NLS estimator are strongly consistent. The sieve
estimator of constant parameters is asymptotically normal with the same
asymptotic co-variance as that of the case where the true ODE solution is
exactly known, while the estimator of the time-varying parameter has the
optimal convergence rate under some regularity conditions. The theoretical
results are also developed for the case when the step size of the ODE numerical
solver does not go to zero fast enough or the numerical error is comparable to
the measurement error. We illustrate our approach with both simulation studies
and clinical data on HIV viral dynamics.Comment: Published in at http://dx.doi.org/10.1214/09-AOS784 the Annals of
Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical
Statistics (http://www.imstat.org
- âŠ