# Interpolation methods for two points and three derivates?

Hi everyone,

I have a question about interpolation methods. I am given two particles and I know their positions, velocities, accelerations, and jerks (time derivative of acceleration) at some initial and final time-values (t0 and t1, respectively). I want to find the minimum distance between them in the range [t0,t1]; thus I need to do an interpolation. I have seen a method of Piecewise Cubic Hermite Interpolation used; however, it only uses the positions and velocities of the particles and is, therefore, not the most accurate predictor of the minimum distance. Is there an interpolation method that can be applied to two points and the three derivatives at those points that is better than the above method?

Thank you for all of your help.

HallsofIvy
Homework Helper
You are essentially saying that you know 8 3-vector quantities at two different times. That means that you know 48 values for the two particles or 24 for each one. You can fit a 23rd degree polynomial to those.

Hurkyl
Staff Emeritus
Gold Member
Well, you can't know the minimum possible, because anything could have happened in-between the start and final points.

If you just want to estimate the path of each particle, why not just assume the higher derivatives are all constant?

There are two concerns I have about that, though:

first, I thought that in order to fit a nth order polynomial, you need n-1 points?

second, polynomial interpolation of such a high order gives horrible artifacts; is there some way to keep order of the polynomial (in terms of the time variable) low, but to include the higher-order derivatives? One thing that doesn't make sense to me is that if I have more constraints on the initial and final state of the particles (because I am including the initial and final accelerations and jerks), shouldn't the interpolated path (remember I am interpolating the separation distance between the two particles) fit more accurately to the actual path?