Hi everyone, First I'd like to thank the contributors to this project.
I'm writing here because there is a question I couldn't find a clear answer neither on the online doc nor in the pdf doc concerning error propagation when using evalf. The doc says that that you can evaluate an expression to arbitrary precision by specifying n, increasing maxn if necessary, and setting strict=True. Even if the required precision is not reached, does evalf ensure that the printed digits are indeed the right digits in the decimal representation of the real number? Also, I wonder whether setting strict=True *guarantees* that the asked precision n is reached if PrecisionExhausted is not raised. If so, the next question is: how does evalf propagates errors? Does it involve interval arithmetic and how does that work with huge expressions involving a large sum of terms with products, irrational constants and special functions? Basically, I'm wondering if sympy can be used to prove/certify inequalities. I'm sorry if this question has already been asked and answered, but I couldn't find it precisely. Thanks! Marc -- You received this message because you are subscribed to the Google Groups "sympy" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion visit https://groups.google.com/d/msgid/sympy/8c226b5d-e2ef-4f62-b3e7-483cb3bf4b25n%40googlegroups.com.
