Advertisement

Development of General-Purpose Root-Finding Module for General Mission Analysis Tool

  • Minhee Kim
  • Sang-Young ParkEmail author
  • Steven P. Hughes
Original Paper
  • 2 Downloads

Abstract

A general-purpose root-finding module for designing spacecraft trajectories is developed to have similar accuracy to that of other well-known root-finding modules, and greater speed. Three quasi-Newton root-finding algorithms are implemented: the Newton–Raphson method, the Broyden’s method and the Generalized Broyden’s method. Based on the proposed root-finding module, General Mission Analysis Tool (GMAT) of National Aeronautics and Space Administration’s Goddard Space Flight Center (NASA/GSFC) is functionally extended by integrating the Broyden’s method and the Generalized Broyden’s method into its differential corrector module. Non-trivial spacecraft trajectory design problems, such as Lambert’s problem for trans-lunar trajectory and minimum-time transfer problem to the Mars are solved to analyze the performance of the proposed module. The numerical performances of each root-finding algorithm are quantitatively analyzed by the total number of function evaluations, the total number of iterations, convergence error, mean convergence rate, and running time. The overall comparative analysis shows that the Broyden’s method and the Generalized Broyden’s method are about 20–40% faster than the Newton–Raphson method and solutions from each algorithm have similar numerical accuracy. We also show that for selected test problems, the Generalized Broyden’s method converges in less running time than others with similar numerical accuracy in GMAT. The updated differential corrector module was released in R2014a version of GMAT.

Keywords

Broyden’s method Root-finding methods General mission analysis tool Space trajectory design 

Notes

Acknowledgments

This study was supported by the National Research Foundation of Korea through the Space Core Technology Development Program funded by the Ministry of Science, ICT & Future Planning (project number: 2013M1A3A3A02042448). This research was also supported by Basic Science Research Program through the National Research Foundation of Korea funded by the Ministry of Education (2013R1A1A2013091).

References

  1. 1.
    The GMAT Development Team (2013) General mission analysis tool: GMAT user guide R2013a. National Aeronautical and Space Administration, Goddard Space Flight Center, GreenbeltGoogle Scholar
  2. 2.
    Broyden CG (1965) A class of methods for solving nonlinear simultaneous equations. Math Comput 19(92):577–593MathSciNetCrossRefGoogle Scholar
  3. 3.
    Martinez JM (2000) Practical quasi-newton methods for solving nonlinear systems. J Comput Appl Math 124:97–121MathSciNetCrossRefGoogle Scholar
  4. 4.
    Crittin F, Bierlaire M (2003) A generalization of secant methods for solving nonlinear systems of equation. In: 3rd Swiss transport research conference, Monte Verita/Ascona, 19–21 March 2003Google Scholar
  5. 5.
    Pérez R, Lopes VLR (2004) Recent applications and numerical implementation of quasi-newton methods for solving nonlinear systems of equations. Numer Algorithms 35:261–285MathSciNetCrossRefGoogle Scholar
  6. 6.
    Paprzycki M, Dent D, Kucaba-Piętal A (2002) Solvers for nonlinear algebraic equations; where are we today? In: Wyrzykowski R, Dongarra J, Paprzycki M, Waśniewski J (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg, pp 719–728Google Scholar
  7. 7.
    Kelley CT (1995) Iterative methods for linear and nonlinear equations. SIAM, PhiladelphiaCrossRefGoogle Scholar
  8. 8.
    Kelley CT (2003) Fundamental algorithms solving nonlinear equations with Newton’s method. SIAM, PhiladelphiaCrossRefGoogle Scholar
  9. 9.
    Berry MM (2012) Comparisons between Newton–Raphson and Broyden’s method for trajectory design problems. Adv Astronaut Sci 142:1177–1194Google Scholar
  10. 10.
    Press WH, Teukolsky SA, Vetterling WT, Flannery BT (2007) Numerical recipes: the art of scientific computing, 3rd edn. Cambridge University Press, Cambridge, pp 442–486zbMATHGoogle Scholar
  11. 11.
    Dennis JE Jr, Moré JJ (1977) Quasi–Newton methods, motivation and theory. SIAM Rev 19(1):46–89MathSciNetCrossRefGoogle Scholar
  12. 12.
    van de Rotten BA (2003) A limited memory Broyden method to solve high-dimensional systems of nonlinear equations. Ph. D. Dissertation, Leiden UniversityGoogle Scholar
  13. 13.
    Moré JJ, Garbow BS, Hillstrom KE (1981) Testing unconstrained optimization software. ACM Trans Math Softw (TOMS) 7:17–41MathSciNetCrossRefGoogle Scholar
  14. 14.
    Song YJ, Park SY, Choi KH, Shim ES (2008) Development of Korean preliminary lunar mission design software. J Korean Soc Aeronaut Space Sci 36:357–367 (in Korean) Google Scholar
  15. 15.
    Gedeon GS (1965) A practical note on the use of lambert’s equation. AIAA J 3:149–150CrossRefGoogle Scholar
  16. 16.
    Vallado DA (2007) Fundamentals of astrodynamics and applications, 3rd edn. Springer, New York, pp 464–495zbMATHGoogle Scholar
  17. 17.
    Battin RH (1999) An introduction to the mathematics and methods of astrodynamics, revised edition. AIAA Education Series, New YorkCrossRefGoogle Scholar
  18. 18.
    Bryson AE Jr (1999) Dynamic optimization. Addison-Wesley, BostonGoogle Scholar

Copyright information

© The Korean Society for Aeronautical & Space Sciences 2019

Authors and Affiliations

  • Minhee Kim
    • 1
    • 3
  • Sang-Young Park
    • 1
    Email author
  • Steven P. Hughes
    • 2
  1. 1.Astrodynamics and Control Laboratory, Department of AstronomyYonsei UniversitySeoulSouth Korea
  2. 2.NASA Goddard Space Flight CenterGreenbeltUSA
  3. 3.Satrec InitiativeDaejeonSouth Korea

Personalised recommendations