Multisegment Scheme Applications to Modified Chebyshev Picard Iteration Method for Highly Elliptical Orbits Academic Article

abstract

• A modified Chebyshev Picard iteration method is proposed for solving orbit propagation initial/boundary value problems. Cosine sampling techniques, known as Chebyshev-Gauss-Lobatto (CGL) nodes, are used to reduce Runges phenomenon that plagues many series approximations. The key benefit of using the CGL data sampling is that the nodal points are distributed nonuniformly, with dense sampling at the beginning and ending times. This problem can be addressed by a nonlinear time transformation and/or by utilizing multiple time segments over an orbit. This paper suggests a method, called a multisegment method, to obtain accurate solutions overall regardless of initial states and albeit eccentricity by dividing the given orbit into two or more segments based on the true anomaly.

authors

• Junkins, John

published proceedings

• MATHEMATICAL PROBLEMS IN ENGINEERING

author list (cited authors)

• Kim, D., Junkins, J. L., & Turner, J. D.

citation count

• 3

complete list of authors

• Kim, Donghoon||Junkins, John L||Turner, James D

publication date

• January 2015

publisher

• Hindawi  Publisher

published in

• Mathematical Problems in Engineering  Journal

Digital Object Identifier (DOI)

• 10.1155/2015/290781

URI

• https://hdl.handle.net/1969.1/182410

start page

• 1

end page

• 7

volume

• 2015

URL

• http%3A%2F%2Fdx.doi.org%2F10.1155%2F2015%2F290781