Respected mam/sir I am Vidhi Khubchandani, prefinal year B.Tech. student at Indira Gandhi Delhi Technical University for Women, Delhi.
First of all, I would like to address why I want to choose this organization, because SymPy focuses on the usability as a library for numerical calculations in python language. Since the initiative is unique and lies in my area of interest, I would be highly obliged to contribute for this organization. On adding more, I would like to contribute in improving thecalculation of gcd of sparse polynomials. I have gone through the code and found out that heuristic gcd has been used for the domain of the polynomial coefficients to be integers or rational numbers. But according to me a randomized sublinear time parallel gcd algorithm would be better and less time consuming as the algorithm will either give correct answer or reports failure whereas for heuristic gcd algorithm, the loop continues i.e. does not terminate. And the heuristic gcd algorithm works well for small n, whereas a randomized sublinear time parallel gcd algorithm will work efficiently for both small and large n. I am currently working on the issue #24980 and also trying to implement the above stated algorithm. But I want to know the reviews regarding it. Hence, kindly suggest me and provide insights regarding it. Kindly consider and please acknowledge it. I would be grateful to hear from you. Thanking you Yours Sincerely -- 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 on the web visit https://groups.google.com/d/msgid/sympy/ce08334f-77de-4d6b-a793-212485f48f9fn%40googlegroups.com.
