New Squaring Method Comparison with Karatsuba and GMP-Enhanced Version

[Krishil]

Hello Intel Developer Community,

I’m excited to share my new squaring algorithm, which I’ve been developing for the last 4 years. It provides significant improvements in terms of performance and efficiency when compared to the widely used Karatsuba method.

In the first phase, I’ve compared my raw method (RPF) against Karatsuba’s algorithm for squaring numbers. The results show how my method outperforms Karatsuba in terms of execution time and scaling, particularly as the input size increases.

In the second phase, I’ve also enhanced both RPF and Karatsuba with GMP (GNU Multiple Precision Arithmetic Library) optimizations. When I apply GMP functions, the performance of both methods significantly improves, but my method still maintains a superior edge.

I’ve attached some charts comparing the execution times and performance metrics for both raw and GMP-enhanced versions of the algorithms. I’d love to get some feedback or thoughts from the community, especially from those involved in high-performance computation or numerical algorithms.

Looking forward to your thoughts and discussions.

Best Regards,
Krishil Rohit Sheth

<personal information removed>

[Aleksandra_K]

Thank you for sharing this information. Please be aware that GMP is no longer part of the oneMKL domain. You might find more relevant feedback from the GMP community.

Regards,

Alex