We are excited to take on the challenge of developing the two phases of your polynomial root and global minimum calculation project. Our team of skilled developers is well-versed in C, C++, and C# programming, and we have a strong background in algorithms and software architecture.
For the first phase, we will implement the recursive solution method to accurately calculate all roots, including complex ones, of the given polynomial Pn(x). Our expertise in numerical methods, such as the bisection method, regula falsi, and Newton's method, will ensure precise results.
In the second phase, we will efficiently find the global minimum of the even degree polynomial using the derived polynomial, real root extraction, and evaluation techniques.
With a thorough understanding of polynomials, roots, and recursion, we are confident in delivering a robust and accurate solution for your project. We look forward to collaborating with you on this exciting endeavor.
Please feel free to contact us if you would like more information or if you have any questions regarding our services.
Best Regards,
Surya Prakash