The determination of orbits by using Picard iteration is reported. This is a direct extension of the classical method of Picard that has been used in finding approximate solutions of nonlinear differential equations for a variety of problems. The application of the Picard method of successive approximations to the initial value and the two point boundary value problems is given.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    The determination of orbits using Picard iteration


    Contributors:


    Publication date :

    1975-08-01


    Type of media :

    Conference paper


    Type of material :

    No indication


    Language :

    English


    Keywords :


    Picard Iteration, Chebyshev Polynomials and Chebyshev-Picard Methods: Application in Astrodynamics

    Junkins, John L. / Bani Younes, Ahmad / Woollands, Robyn M. et al. | Springer Verlag | 2013


    Picard Iteration, Chebyshev Polynomials and Chebyshev-Picard Methods: Application in Astrodynamics

    Junkins, John L. / Bani Younes, Ahmad / Woollands, Robyn M. et al. | Online Contents | 2013


    Efficient Conjunction Assessment using Modified Chebyshev Picard Iteration

    Probe, Austin | British Library Conference Proceedings | 2015


    Modified Chebyshev-Picard Iteration Methods for Station-Keeping of Translunar Halo Orbits (AAS 12-155)

    Bai, X. / Junkins, J.L. / American Astronautical Society et al. | British Library Conference Proceedings | 2012


    Modified Chebyshev-Picard Iteration Methods for Orbit Propagation

    Bai, Xiaoli / Junkins, John L. | Online Contents | 2011