Abstract
We investigate, using numerical methods, the convergence dynamics of the Sitnikov problem with non-spherical primaries, by applying the Newton-Raphson (NR) iterative scheme. In particular, we examine how the oblateness parameter $A$ influences several aspects of the method, such as its speed and efficiency. Color-coded diagrams are used for revealing the convergence basins on the plane of complex numbers. Moreover, we compute the degree of fractality of the convergence basins on the complex space, as a relation of the oblateness, by using different computational tools, such the fractal dimension as well as the (boundary) basin entropy.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Applied and Computational Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
