You can obtain them by least square approximation methods.
Example:
If you have doubts: Calculate some points from a known DE. Input them to the program and prove the result.
I'm not concerned with identifying the derivatives, but with computing them in real time.
Have you accomplished that with real quantized signals and some inevitable noise? How much time delay do the least squares approximation methods impose? How many degrees of lag at Fs/2 is that?
Jerry
Sorry, what is Fs/2?
In my view a bad approximation is better than having nothing. An example should explain what I mean. You have just 6 extreme noisy points (red points) and you know they are circle data.
Find the center point (Mittelpunkt x_m, y_m) and radius (Radius r):
Have something to add? Share your thoughts — no account required.
Ask the community — no account required