[ODE] quickstep vs faststep

[Nguyen Binh]

Take a look here:

http://continuousphysics.com/Bullet/phpBB2/viewtopic.php?t=208&sid=abd154067784a2b4dde8fb7f93481653

FastStep = what they called sequencial impulses
QuickStep = PGS

Also, search the archive, you'll find the high level algorithms.

On 1/24/06, Thomas Yeh <tomyeh at cs.ucla.edu> wrote:
>
> I am trying to understand the main differences between the current and the
> old iterative solving method (quickstep vs faststep).
>
> >From the documentation, I thought that the iterative method solves every
> joint separately. I can see this clearly in the code for stepfast.cpp, but
> quickstep.cpp's code looks different.
>
> Can anyone point me to a more detailed description of quickstep.cpp or
> give me a high-level algorithmic description?
>
>
>
> _______________________________________________
> ODE mailing list
> ODE at q12.org
> http://q12.org/mailman/listinfo/ode
>



--
--------------------------------------------------
Binh Nguyen
Computer Science Department
Rensselaer Polytechnic Institute
Troy, NY, 12180
--------------------------------------------------
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://q12.org/pipermail/ode/attachments/20060124/99084706/attachment.htm