I need to implement LU-decomposition in Kaira. In Kaira the programmer writes the "parallel part" as the diagram similar to Petri Nets.

So, could you, please, recommend me some parallel algorithms for LU-decomposition which are really easy to understand and implement? The low difficulty of the implementation has the highest priority for me, because I'm not very familiar with Kaira and I'm in hurry a little.

I looked at a Fined-grained LU-factorization, but I'm curious if some other algorithms are used.


1 Answer 1


Finally I've found some decriptions of these algorithms here.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.