IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v269y2015icp279-287.html
   My bibliography  Save this article

Simplified existence and uniqueness conditions for the zeros and the concavity of the F and G functions of improved Gauss orbit determination from two position vectors

Author

Listed:
  • Danchick, Roy

Abstract

In our first paper we showed how Gauss's method for determining the initial position and velocity vectors from two inertial position vectors at two times in an idealized Keplerian two-body elliptical orbit can be made more robust and efficient by replacing functional iteration with Newton–Raphson iteration. To do this we split the orbit determination algorithm into two sub-algorithms, the x-iteration to find the zero of the fixed-point function F(x) when the true anomaly angular difference between the two vectors is large and the y-iteration to find the zero of the fixed-point function G(y) when the angular difference is small.

Suggested Citation

  • Danchick, Roy, 2015. "Simplified existence and uniqueness conditions for the zeros and the concavity of the F and G functions of improved Gauss orbit determination from two position vectors," Applied Mathematics and Computation, Elsevier, vol. 269(C), pages 279-287.
    • Handle: RePEc:eee:apmaco:v:269:y:2015:i:c:p:279-287
    DOI: 10.1016/j.amc.2015.07.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315009194
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2015.07.008?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Andreu, Carlos & Cambil, Noelia & Cordero, Alicia & Torregrosa, Juan R., 2014. "A class of optimal eighth-order derivative-free methods for solving the Danchick–Gauss problem," Applied Mathematics and Computation, Elsevier, vol. 232(C), pages 237-246.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Geum, Young Hee & Kim, Young Ik & Neta, Beny, 2016. "A sixth-order family of three-point modified Newton-like multiple-root finders and the dynamics behind their extraneous fixed points," Applied Mathematics and Computation, Elsevier, vol. 283(C), pages 120-140.
    2. Geum, Young Hee & Kim, Young Ik & Neta, Beny, 2015. "On developing a higher-order family of double-Newton methods with a bivariate weighting function," Applied Mathematics and Computation, Elsevier, vol. 254(C), pages 277-290.
    3. Argyros, Ioannis K. & Kansal, Munish & Kanwar, Vinay & Bajaj, Sugandha, 2017. "Higher-order derivative-free families of Chebyshev–Halley type methods with or without memory for solving nonlinear equations," Applied Mathematics and Computation, Elsevier, vol. 315(C), pages 224-245.
    4. Young Hee Geum & Young Ik Kim & Beny Neta, 2018. "Developing an Optimal Class of Generic Sixteenth-Order Simple-Root Finders and Investigating Their Dynamics," Mathematics, MDPI, vol. 7(1), pages 1-32, December.
    5. Geum, Young Hee & Kim, Young Ik & Neta, Beny, 2015. "A class of two-point sixth-order multiple-zero finders of modified double-Newton type and their dynamics," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 387-400.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:269:y:2015:i:c:p:279-287. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.