Hi all, from the documentation on QRsolve:
This method is slower (approximately by a factor of 2) but more stable for floating-point arithmetic than the LUsolve method. However, LUsolve usually uses an exact arithmetic, so you don’t need to use QRsolve. I would be interested in using the LUsolve with floating-point arithmetic (which I guess is faster) but I am unable to find documentation on how to do it. Anyone has any ideas? Best regards -- You received this message because you are subscribed to the Google Groups "sympy" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/sympy?hl=en.
