Often I wish to simplify an expression f(x,y,z) with constraint g(x,y,z) = 0. That is to say f(x,y,z)+lamda*g(x,y,z) is a simplified expression (sort of looks like lagrange multipliers). Many times just looking at the expressions tell you what lamda should be, but is there any way to automate the process in a more general way?
On simplification in general. I have noticed that artificial intelligence modules exist for python. Have any symbolic algebra programs used artificial intelligence for the simplification of expressions or is everything alway hardwired into the code? --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
