Real-Time Physics Simulation Forum

Re: Parallelizable conjugate gradient-based MLCP solver

2011-11-27T05:08:37+00:00

Here (http://fem.xp3d.net/files/sketch_v102.pdf) you can download quick sketch of part of our recent research. We present a method of solving mixed linear complementarity problem with box constraints applied to a typical formulation of modern constraint-based dynamics simulator, which is easy parallelizable (hence will take benefit of modern GPUs) and has O(N) complexity, while showing better convergence than typical PGS solver.
That's early version of the sketch, so if you will find any errors or inaccuracies, please let us know.

Update #1:
http://code.google.com/p/realtime-deformations-fem/ is our public code repository where you can download the source code of demos presented in this thread. GPU version of the solver is tested on NVIDIA GeForce GTX260.

Update #2:
Example in "Applying the preconditioner" fixed.

Hi XperienS!I am very interested in your work!but I cannot download the paper with link you provided([http://fem.xp3d.net/files/sketch_v102.pdf)! Also with the same problem in another thread(http://bulletphysics.org/Bullet/phpBB3/ ... f=6&t=5468)
Could you fix the link ,Thank you very much!

Statistics: Posted by xiaoQ0903 — Sun Nov 27, 2011 5:08 am

Re: Parallelizable conjugate gradient-based MLCP solver

2011-03-25T16:21:55+00:00

Dirk, sorry, but we didn't implement complex CD in our test framework, so we can't really say anything about stacks now. Although my assumption is that it would need about 15 iterations anyway because of CG nature.

Statistics: Posted by XperienS — Fri Mar 25, 2011 4:21 pm

Re: Parallelizable conjugate gradient-based MLCP solver

2011-03-25T16:00:40+00:00

I have a quick question. How many iterations would need for say a stack of five boxes?

Statistics: Posted by Dirk Gregorius — Fri Mar 25, 2011 4:00 pm

Re: Parallelizable conjugate gradient-based MLCP solver

2011-03-24T21:22:17+00:00

We forgot to attach link to our public code repository, fixing that.. Link is now in the first post of the thread.

Statistics: Posted by XperienS — Thu Mar 24, 2011 9:22 pm

Re: Parallelizable conjugate gradient-based MLCP solver

2011-03-21T22:12:41+00:00

Ah, sorry, forgot to describe such test case. Actually in this forum thread, there is demos of the method described, and on the screenshot there is FEM brick, attached to world via chain of ball-socket joints, lying on the floor (contact joints with friction - here is where limits introduced). Actually, method is surprisingly good even with quite tight box constraints (e.g. low friction) - can't really share the numbers now, but if you want, I'll try to do some measurements on the weekend.
Actually, floor which produces contacts with friction is switchable in FEM stress demo too (long stiff brick), and it touches the floor when bending, also not really affecting convergence vitally.
One more thing I wanted to add in terms of test cases. We also tested arbitrary FEM models (up to 4k tetras) - they were main source of ill-conditioned systems, but having double Jacobi preconditioner, solver is converging quite fast there too. Models were falling onto floor with friction too, btw

Statistics: Posted by XperienS — Mon Mar 21, 2011 10:12 pm

Re: Parallelizable conjugate gradient-based MLCP solver

2011-03-21T21:52:26+00:00

Thanks for sharing. That is really grand of you! I will read it.

First reflection. I don't see any system with complementarity conditions among the test systems. What type of systems that imposes bounds on the multipliers or velocity have you considered? And are the results for that also just as positive as for purely holonomic systems.

Statistics: Posted by nisse — Mon Mar 21, 2011 9:52 pm

Parallelizable conjugate gradient-based MLCP solver

2018-01-02T00:39:17+00:00

Here (https://github.com/avoroshilov/physics_ ... _paper.pdf) you can download quick sketch of part of our recent research. We present a method of solving mixed linear complementarity problem with box constraints applied to a typical formulation of modern constraint-based dynamics simulator, which is easy parallelizable (hence will take benefit of modern GPUs) and has O(N) complexity, while showing better convergence than typical PGS solver.
That's early version of the sketch, so if you will find any errors or inaccuracies, please let us know.

Update #1:
https://github.com/avoroshilov/physics_fem_rbd is our public code repository where you can download the source code of demos presented in this thread.

Update #2:
Example in "Applying the preconditioner" fixed.

Statistics: Posted by XperienS — Mon Mar 21, 2011 11:19 am