Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Solving the inverse problem for an ordinary differential equation using conjugation (2004.00424v2)

Published 29 Mar 2020 in math.OC, cs.NA, math.DS, math.NA, and nlin.CD

Abstract: We consider the following inverse problem for an ordinary differential equation (ODE): given a set of data points $P={(t_i,x_i),\; i=1,\dots,N}$, find an ODE $x\prime(t) = v (x)$ that admits a solution $x(t)$ such that $x_i \approx x(t_i)$ as closely as possible. The key to the proposed method is to find approximations of the recursive or discrete propagation function $D(x)$ from the given data set. Afterwards, we determine the field $v(x)$, using the conjugate map defined by Schr\"{o}der's equation and the solution of a related Julia's equation. Moreover, our approach also works for the inverse problems where one has to determine an ODE from multiple sets of data points. We also study existence, uniqueness, stability and other properties of the recovered field $v(x)$. Finally, we present several numerical methods for the approximation of the field $v(x)$ and provide some illustrative examples of the application of these methods.

Citations (2)

Summary

We haven't generated a summary for this paper yet.