Abstract
The Modified Chebyshev Picard Iteration (MCPI) method has recently proven to be highly efficient for a given accuracy compared to several commonly adopted numerical integration methods, as a means to solve for perturbed orbital motion. This method utilizes Picard iteration, which generates a sequence of path approximations, and Chebyshev Polynomials, which are orthogonal and also enable both efficient and accurate function approximation. The nodes consistent with discrete Chebyshev orthogonality are generated using cosine sampling; this strategy also reduces the Runge effect and as a consequence of orthogonality, there is no matrix inversion required to find the basis function coefficients. The MCPI algorithms considered herein are parallel-structured so that they are immediately well-suited for massively parallel implementation with additional speedup. MCPI has a wide range of applications beyond ephemeris propagation, including the propagation of the State Transition Matrix (STM) for perturbed two-body motion. A solution is achieved for a spherical harmonic series representation of earth gravity (EGM2008), although the methodology is suitable for application to any gravity model. Included in this representation the normalized, Associated Legendre Functions are given and verified numerically. Modifications of the classical algorithm techniques, such as rewriting the STM equations in a second-order cascade formulation, gives rise to additional speedup. Timing results for the baseline formulation and this second-order formulation are given.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Introduction
The Modified Chebyshev-Picard Iteration (MCPI) method is used to solve both linear and nonlinear, high precision, long-term orbit propagation problems through iteratively finding an orthogonal function approximation for the entire state trajectory. At each iteration, MCPI finds an entire path integral solution (over a large finite interval, converges over intervals up to three orbits), as opposed to the conventional, incremental step-by-step solution strategy of more familiar numerical integration strategies, i.e., those based on explicit numerical methods. While very long path segments are convergent, computationally optimal path segments are typically a large fraction of an orbit. A major advantage of the MCPI approach is that the use of cosine sampling reduces the well-known Runge Effect, whereby the largest errors are encountered near the boundary of piecewise approximation segments [1]. This algorithm has recently proven to be a powerful tool for solving nonlinear differential equations for both initial value problems (IVP) and boundary value problems (BVP) [1–5]. Comparisons with traditional step-by-step methods [6, 7] have shown that MCPI is more efficient for a prescribed solution accuracy. Significantly, however, unlike conventional integration approaches, it is ideally suited for massive parallel implementations that provide further boosts in the computational performance. Algorithm tests are currently under development for massive parallel implementations, where the performance results will be presented in future papers.
Here we consider the MCPI method to compute the State Transition Matrix (STM) for the case of perturbed motion, which has applications in many areas including celestial mechanics and control systems. Propagation of the STM is useful in determining the sensitivity of the IVP solution to the initial conditions; for instance, the STM predicts how deviations from the desired initial conditions will cause the trajectory of a spacecraft to stray from a nominal path. The STM may be used to approximate the time evolution of a state vector even for highly nonlinear systems, such as the two-body problem perturbed by an arbitrary degree spherical harmonic gravity. In cases where the initial deviation is small at time t 0, a linear approximation may be used to determine the locally linear state deviation at time t. This linear approximation is generated using the STM, a matrix of partial derivatives for the instantaneous position and velocity with respect to the initial position and velocity; this means that the STM is initially equal to the identity matrix [8, 9]. These deviations can be approximated, to a problem-dependent accuracy, by using the unperturbed Keplerian STM; however, it is desirable to be able to include a prescribed number of the high order harmonics, and in general, other perturbations. The present paper provides an efficient algorithm to include these higher order gravitational perturbations, as desired/required in the STM.
The present computation of the STM for the spherical harmonic gravity model requires second partials of the gravity potential with respect to spherical geocentric coordinates: radius, latitude, and longitude. These required partial derivatives include second partials of the normalized, Associated Legendre Functions (ALFs), and these functions (used often in science and engineering applications) are related to the Legendre polynomials. A full description and derivation are given in Appendix B, and the equations that require the ALfs are given in the section “State Transition Matrix Using Spherical Harmonic Gravity.” The normalized version of the ALFs is the preferred formulation for the associated recursion used to compute these functions. Without the normalization, the ALFs tend toward weak numerical instability as a higher degree and order gravity model is used. Once the normalized ALFs are computed, the gravity and associated derivatives are computed in part by introducing the appropriate scale factor to generate the un-normalized version of the ALFs. Since a spherical harmonic model is used and this gravity potential is a rigorous solution of the Laplace equation, the ALFs’ second partial expression for an arbitrary order spherical harmonic series is verified using the Laplace equation. Both the trajectory and the STM are computed in a rotating, Earth-centered, Earth-fixed frame, which is transformed into an Earth-centered inertial frame (for subsequent integration) at each iteration. The rotating ECEF frame is used to avoid the explicit time dependence of the potential and the associated Jacobi integral (which is also a constant Hamiltonian for the perturbed motion). Though enforcement of the differential equation is inherent in the present study, we also check to confirm that the STM accurately satisfies (with maximum relative errors of < 10−14 in a Matlab implementation and up to one orbit, for the most precise tuning) the theoretical STM group properties as well as the STM symplectic property associated with natural conservative dynamical systems [8]. The present development of the STM is also verified using finite difference methods.
Modified Chebyshev Picard Iteration
MCPI is a fusion of Picard iteration with approximation via orthogonal Chebyshev polynomials. A few papers were published on the topic prior to the development of parallel computing capabilities [10–12], but it was not until recent years that this literature was significantly expanded by the research group (Junkins, et al.) at Texas A&M University. MCPI is an iterative, path approximation method for solving smoothly nonlinear systems of ordinary differential equations. The entire state trajectory over a long time arc is approximated at every iteration until a specified tolerance is met [2]. Emile Picard stated that, given an initial condition x(t 0) = x 0, any first order differential equation [1]
with an integrable right hand side may be rearranged without approximation into an integral:
Then, given a suitable starting approximation x 0(t), a unique solution to the initial value problem may be found using an iterative sequence of path approximations through Picard iteration as
where the integrand of the Picard iteration sequence is approximated using Chebyshev polynomials. For further details on the basics of this novel integration technique and its convergence properties, refer to References [1] and [2]. Since the Chebyshev polynomials are orthogonal, a matrix inverse is avoided when finding basis function coefficients. Because cosine sampling is employed for MCPI, the Runge Effect seen at trajectory boundaries is significantly reduced. Also, initial efforts to implement MCPI using parallel computation have shown additional speedup [13, 14].
The present study considers the gravity-perturbed acceleration \(\boldsymbol {\ddot {r}}=\boldsymbol {g}(t, \boldsymbol {r})\), which may be represented in state space notation for the MCPI algorithm as
Basic Equations for State Transition Matrix
The differential equation we wish to integrate for the STM is [8]
where
The STM is computed as partials of the linear approximation of the instantaneous departure X(t) from the state vector x(t). For the present work, the state consists of position and velocity for an Earth-orbiting satellite:
Then we can write the G matrix in terms of the partials of the generally perturbed gravitational acceleration case; for example the partial of the first component of acceleration with respect to the first component in a body-fixed frame is written with respect to geocentric radius, latitude, and longitude:
Many of the intermediate partials are computed once and re-used as they appear elsewhere. The individual components of the matrix G are written explicitly as follows in the next section.
State Transition Matrix Using Spherical Harmonic Gravity
A spherical harmonic gravity model is used for this development. The Jacobian of the acceleration, needed for Eq. 6, is computed in the body frame but transformed into the inertial frame prior to each integration step; this method is presented in the following section. The full gravitational potential function is defined as [15]
where r is the radial distance to the object, ϕ is the geocentric latitude of the object, λ is the longitude of the object, Re is the magnitude of Earth’s equatorial radius, and P n m are the Associated Legendre Functions. The spherical harmonic acceleration due to gravity in a body-fixed reference frame may then be represented as
The expressions comprising the acceleration function are written explicitly as
Next we find expressions needed to compute the Jacobian of the acceleration in Eq. 7. The individual components of the gravity perturbed acceleration in the Earth-centered inertial frame are
For the partial fraction expansions of the components of G, we use the general formula:
The individual components of G then follow a pattern. The first few expressions are given here, where \(U_{r}=\frac {\partial U}{\partial r}\), \(U_{\phi }=\frac {\partial U}{\partial \phi }\), and \(U_{\lambda }=\frac {\partial U}{\partial \lambda }\) as given in Eqs. 12 – 14, and all G components are given in Appendix A.
The spherical coordinate partials with respect to Cartesian coordinates are given by
Then, the second partials of the gravity potential are found, where the partials of the ALFs are described in the following section. The matrix of second partials is symmetric, and the six expressions for the distinct elements are as follows:
Computation of Associated Legendre Functions
A key component of the spherical harmonic gravity calculations is the set of Associated Legendre Functions, P n m . These functions are related to the Legendre polynomials, P n (u) [16].
The equation for the gravity potential only contains a singularity at r = 0, but the gravity force in spherical coordinates, given below, contains a singularity at the poles \(\phi =+\frac {\pi }{2},-\frac {\pi }{2}\). This special case at the poles is addressed by setting the g x and g y components of acceleration to zero and computing g z as a function of \(\frac {\partial U}{\partial r}\) only (zeroing out the \(\frac {\partial U}{\partial \phi }\) term).
In many applications the potential function is represented using the so-called derived Associated Legendre Functions. The derived ALFs are defined as follows [17, 18]:
Following the usual patterns, we can avoid weak numerical instability of the typical recursions used to compute the A n m (see Table 1 of Reference [16]). To overcome this problem, the derived Associated Legendre Functions and spherical harmonic coefficients are normalized to improve accuracy for high degree and order gravity models. First, define A n m as an un-normalized, derived Associated Legendre Function and \(\bar {A}_{nm}\) as a normalized, derived Associated Legendre Function as given in Reference [17]. Similarly, P n m is an un-normalized, Associated Legendre Function, while \(\bar {P}_{nm}\) is a normalized, Associated Legendre Function. Since the spherical harmonics correspond to a linear subspace of 2-D Fourier Series, a typical normalization factor is found; from Ch. 3, formula (7) of Reference [18], the derived ALF may be expanded, giving rise to a coefficient that generates numerically stable recursive calculations. This coefficient is often used in geodesy applications [16, 19–23]. Then, the normalized and un-normalized, derived ALFs are related by this normalization, written generally for n ≠ m ≠ 0 as [16]
where N n m is a scaling factor and the Kronecker delta function is defined to be
The recursion formula chosen for the current work is the normalized, derived Associated Legendre Functions from Table 2, option I of Reference [16] for u = sinϕ:
Note that the specific cases of n = m and m = 0 may each use a more specific formula for efficiency.
Since a normalized version of the ALFs is used, the final un-normalized result may be obtained by applying the appropriate scale factor. For efficiency, the scale factor S n m for three cases are computed separately:
Computation of the STM for the spherical harmonic gravity case requires the partial derivative of P n m with respect to ϕ, where C n m and S n m are the normalized Stokes coefficients determined from satellite motion observations, and N n m is the scale factor given in Eq. 33. In Appendix B, the equations for the first and second partials of P n m with respect to ϕ are derived in detail. For more information, these partials are also given in Reference [24].
The first and second partials of the ALFs are incorporated in the calculations for the partials of the gravity potential, U, through the computation of the corresponding ALFs and the appropriate scale factors. In the code, the term P n, m+1(sinϕ) is multiplied by the scale factor S n m , and the term P n, m+2(sinϕ) is multiplied by the scale factor S n, m+1to compensate for the original normalization of the ALFs.
Verification for Second Partials of the Associated Legendre Functions with Respect to Latitude
The second partial of the gravity potential with respect to geocentric latitude is checked since it is a rigorous solution of Laplace’s equation [23]:
which is simplified as
This equation is also compared numerically with Eq. 26 to further confirm that the expression for the second partial of the ALF with respect to latitude is correct [25]. See the next section for resulting plots.
Baseline Model Simulation Results
All simulation results presented here are computed on a Windows 8 machine using Matlab R2013a. First, to show that the second partial of the normalized ALFs is computed correctly in MCPI, a finite difference approximation method is incorporated into the simulation. Since the present STM study gives efficient and accurate results for all elliptical orbits, the user may specify initial conditions and also the desired tolerance. MCPI may also be tuned based on the number of segments per orbit, relative segment length, and order of approximation [26, 27]. Here, we focus on a Low-Earth Orbit (LEO) example for the following results with one segment per orbit. The user may specify initial conditions and also the desired tolerance. The chosen initial conditions for this orbit are given to be r 0 = [2.865408457 5.191131097 2.848416876] × 106 m, v 0 = [−5.386247766 − 0.3867151905 6.123151881] × 103 m/s, with a period of 6.218728118 × 103 s. All solutions are obtained for one orbit period using a 10th degree and order gravity, Earth rotation of ω = 7.2921e−5 rad/s, and 100 sample points (using a cosine sampling scheme). The RMS error between the initial and final position is found to be [1.225 2.054 4.925] × 10−3 m, and the RMS error between the initial and final velocity is [3.515 2.690 3.267] × 10−6 m/s.
As can be seen in Fig. 1, the first and second partials of the Legendre Functions match closely with the finite difference check approximations (the partials use a normalization scheme as described in the present paper). The ALFs and the first and second partials of the ALFs are computed as lower triangular matrices that depend on n and m, which are the upper summation limits of Eq. 10. Therefore, the size of these matrices are defined by user inputs.
Similarly, to verify that the formulation developed here for the STM is correct using MCPI, a finite difference check of both the second partials of the gravity potential and the STM matrix are completed and give results comparable in accuracy to the figure above.
An additional verification of the second partial with respect to latitude, ϕ, uses the Laplace Equation as described in the previous section. The second partial \(\frac {{\partial }^{2}\mathrm {U}}{\partial {\upphi }^{2}}\) obtained using this method is compared with the second partial computed using the expression derived in Eq. 26, which is directly a function of the ALFs. The result of this comparison is shown in Figs. 2 and 3. The relative error plot shows spikes that are due to the second partial \(\frac {{\partial }^{\mathrm {2}}\mathrm {U}} {{\partial } {\phi }^{\mathrm {2}}}\) approaching zero as a result of the normalization factor in the denominator.
The symplectic check [9] reveals an accuracy of at least 10−10 for all error components, as is seen in Fig. 4. Note that each component of the 6 × 6 matrix of error components is plotted here. A final finite difference check for the STM shows that it is very accurate. Each column of ϕ is checked using a two-sided finite difference check. The difference between the first column of the STM and the corresponding finite difference check is shown in Fig. 5, though all 6 columns show comparable accuracy for this check. The top half of Fig. 5 gives the finite difference check components on the STM’s top half of the first column, while the bottom half of the figure gives the components on the STM’s bottom half of the first column.
To verify that the STM differential equation holds for arbitrary perturbations, the group properties of the STM are rigorously verified. A representative set of intermediate points are checked using the chain rule and are satisfied with an accuracy of at least 10−9 tolerance. The inverse property of the STM is also verified to high precision. The max error over 1000 tests for the residual error \(\left \| \dot {\phi }-A\phi \right \|\) is 1 × 10−15, while the other group properties are spot checked for accuracy:
It should not be surprising that MCPI can capture the solution accurately over a larger time interval than, for example, the Gauss Jackson 8th order method, since the typical order of the MCPI approximation is 40 instead of 8.
Optimization of State Transition Matrix Calculations
The baseline STM algorithm, given in detail in the present work, may be further optimized and enhanced. Because the STM requires only as input the position vector at every sample node, the trajectory may first be integrated. Next, the STM may be propagated using the converged trajectory solution. This method is more efficient, as is shown by the comparison in Fig. 6.
This approach to have the trajectory converge a priori does not require that the same nodal pattern or time segment length be used for the STM.
Cascade Method
The MCPI method may solve either first- or second-order differential equations. However, some numerical integrators, such as RKN12(10), require a second-order formulation. To increase efficiency of STM calculations, a second-order differential equation may be used in place of Eq. 1; this method is called the MCPI Cascade Method [2]. The STM differential equation for the conservative case is rearranged to solve a pair of second-order equations as follows. Since \(\boldsymbol {\dot {\phi }}=\boldsymbol {A\phi }\), or
we write the individual components using the G matrix from Eq. 7 as
Taking the time derivative of Eqs. 44 and 45 gives
Substituting Eq. 46 into Eq. 48 and Eq. 47 into Eq. 49 gives the only two second-order differential equations required for integration:
The other two sub-matrices of the STM, ϕ 21 and ϕ 22, are obtained by taking the time derivative of the two sub-matrices that are obtained from the converged solution, \(\ddot {\phi }_{21}\) and \(\ddot {\phi }_{22}\):
The initial condition for the STM is known to be
so for the second-order formulation, the initial conditions are
The initial conditions automatically satisfied are ϕ 21 = 03×3 and ϕ 22 = I 3×3. We mention that the above results for the cascade method can be readily generalized to accommodate velocity dependence in the force model (e.g., drag). In this case of velocity dependence, Eq. 5 generalizes as
And the resulting formulation is the same except for two additional terms of the form
Cascade Method Simulation Results
As shown in Figs. 7 and 8, using the Cascade Method to compute the STM gives additional speedup when compared with the baseline method. Figure 7 compares the standard, baseline MCPI model with the MCPI cascade method for computing the trajectory and STM. The results of the cascade method are verified using the RKN12(10) propagator [28], and the resulting timing comparison is given in Fig. 8. Both MCPI and RKN12(10) are tuned such that best performance is achieved for an energy check that gives machine precision.
Conclusion
This paper describes how to compute the gravitational potential and associated derivatives necessary for propagation of the State Transition Matrix using the Modified Picard Chebyshev Iteration method. Though the present work focuses on the spherical harmonic gravity model to address gravity perturbations, the STM computation using MCPI may be generally implemented using any other gravity model, and extensions to include other perturbations such as drag are straightforward. Results verifying the accuracy of the baseline solution are presented.
Optimizations, including a second-order formulation for the STM, are presented. This formulation is readily solved using the cascade form of the MCPI formulation, and this is the method adopted for the present study. Matlab timing comparisons of this so-called cascade method are shown to be more efficient than the baseline algorithm for computing the STM. Because a different nodal pattern and precision requirement may be used for the a priori converged trajectory than the STM, extensive computational tests indicate that tuning for the optimal state computation invariably gives conservative STM computation.
C code for the method presented here is currently being developed, which will give additional insight into the runtimes. More importantly, techniques for further accelerating the computations, such as using parallel processing, are expected to exploit the inherent parallel structure of the MCPI method if many simultaneous orbits and their associated STM are required. This class of problems will likely be encountered when these methods are used to propagate space objects and use the STM to approximate the associated covariance matrix evolution [29].
References
Bai, X., Junkins, J.L.: Modified Chebyhev-Picard iteration methods for orbit propagation. J. Astronaut. Sci. 58(4), 583–613 (2011)
Bai, X: Modified chebyshev-picard iteration methods for solution of initial value and boundary value problems. PhD Dissertation, Texas A&M University, College Station, TX (2010)
Woollands, R., Junkins, J.L.: A new solution for the General Lambert problem. In: Proceeding of 2015 AAS GN&C Conference, Breckenridge, CO (2014)
Macomber, B., Wollands, R., et al.: Modified Chebyshev Picard iteration for efficient numerical integration of ordinary differential equations. In: Proceeding of 2013 AAS GN&C Conference, Breckenridge, CO (2013)
Kim, D., Junkins, J.L.: Multi-segment adaptive modified Chebyshev Picard iteration method. In: Proceeding of 2014 AAS/AIAA Space Flight Mechanics Conference, Santa Fe, NM (2014)
Woollands, R., et al.: Validation of accuracy and efficiency of long-arc orbit propagation using the method of manufactured solutions and the round-trip-closure method. In: Proceeding of Advanced Maui Optical and Space Surveillance Technologies Conference (2014)
Probe, A., et al.: Terminal convergence approximation modified Chebyshev Picard iteration for efficient orbit propagation. In: Proceedings of Advanced Maui Optical and Space Surveillance Technologies Conference (2014)
Battin, R.: An Introduction to the Mathematics and Methods of Astrodynamics, Revised Edition. CRC Press - Taylor and Francis, New York, NY (1990)
Schaub, H., Junkins, J.L.: Analytical Mechanics of Space Systems, 3rd edn. AIAA Education Series, Reston, VA (2009)
Clenshaw, C.W., Norton, H.J.: The solution of nonlinear ordinary differential equations in Chebyshev series. Comput. J. 6, 88–92 (1983)
Feagin, T., Nacozy, P.: Matrix formulation of the Picard method for parallel computation. Celest. Mech. Dyn. Astron. 29, 107–115 (1983)
Shaver, J.: Formulation and Evaluation of Parallel Algorithms for the Orbit Determination Problem. PhD Dissertation, Massachusetts Institute of Technology (1980)
Bai, X., Junkins, J.L.: Solving Initial Value Problems by the Picard-Chebyshev Method with Nvidia GPUs. In: AAS 10-197, Proceedings of 20th Spaceflight Mechanics Meeting, San Diego, CA (2010)
Macomber, B., Probe, A., et al.: Parallel Modified-Chebyshev Picard Iteration for Orbit Catalog Propagation and Monte Carlo Analysis. In: 38th Annual AAS/AIAA Guidance and Control Conference, Breckenridge, CO. Jan 30 - Feb 4 (2015)
Hofmann-Wellenhof, B., Moritz, H.: Physical Geodesy. Springer-Verlag Wien (2005)
Lundberg, J.B., Schutz, B.: Recursion formulas of legendre functions for use with nonsingular geopotential models. J. Guid. Control. 11(1), 31–38 (1988)
Pines, S.: Uniform Representation of the Gravitational Potential and its Derivatives. AIAA J. 11, 1508–1511 (1973)
Hobson, E.: Theory of Spherical and Ellipsoidal Harmonics. Cambridge University Press (1931)
Colombo, O.L.: Numerical methods for harmonic analyses on the sphere. Air Force Geophysics Laboratory; Air Force Systems Command (1981)
Rapp, R.H.: A fortran program for the computation of gravimetric quantities from high degree spherical harmonic expansions. Reports of the Department of Geodetic Science and Surveying, Report No. 334 (1973)
Gottlieb, R.G.: Fast gravity, gravity partials, normalized gravity, gravity gradient torque and magnetic field: Derivation, code, and data. Lyndon B. Johnson Space Center (February 1993)
Vallado, D.A.: Fundamentals of Astrodynamics and Applications, 3rd edn. Microcosm Press and Springer (2007)
Kaula, W.M.: Theory of Satellite Geodesy: Applications of Satellites to Geodesy. Blaisdell Publishing Company (2000)
Reed, G.B.: Application of Kinematical Geodesy for Determining the Short Wave Length Components of the Gravity Field by Satellite Gradiometry. Reports of the Department of Geodetic Science, Report No. 201 (1973)
Schutz, B.: Discussion of normalized associated legendre functions, Austin, TX, May 30 (2014)
Macomber, B., Probe, A., Woollands, R., Junkins, J.L.: Automated Tuning Parameter Selection for Orbit Propagation with Modified Chebyshev Picard Iteration.” AAS/AIAA Space Flight Mechanics Meeting, Williamsburg, VA (2015)
Macomber, B.: Enhancements of Chebyshev Picard Iteration Efficiency for Generally Perturbed Orbits and Constrained Dynamical Systems. PhD Dissertation, Texas A&M University (2015)
RKN1210 - A 12th/10th order Runge-Kutta-Nystrom integrator. Matlab Central Web Site. http://www.mathworks.com/matlabcentral/fileexchange/25291-rkn1210-a-12th-10th-order-runge-kutta-nystr%C3%B6m-integrator
Sabol, C., Schumacher, P., et al.: Linearized Orbit Covariance Generation and Propagation Analysis via Simple Monte Carlo Simulations. In: Proceedings of the AAS/AIAA Space Flight Mechanics Meeting (Advances in the Astronautical Sciences, 2010, 136:509–525)
Acknowledgments
The sponsors for the present work are AFOSR (Julie Moses) and AFRL (Alok Das).
Thanks to members of the Texas A&M MCPI research team: Donghoon Kim, Robyn Woollands, Austin Probe, and Abhay Masher.
Thanks to Dr. Bob Gottlieb (Odyssey Space Research) and Dr. Terry Feagin (UHCL) for their discussions of numerical propagators, normalized gravity, and STM calculations.
Author information
Authors and Affiliations
Corresponding author
Appendices
Appendix A: Components of Jacobian Matrix G
Appendix B: Partials of Associated Legendre Functions
Computation of the STM for the spherical harmonic gravity case requires the partial derivative of P n m with respect to ϕ, where C n m and S n m are the normalized Stokes coefficients determined from satellite motion observations, and N n m is a scale factor. The first and second partials of the ALFs are incorporated in the calculations for the partials of the gravity potential, U, through the computation of the corresponding ALFs and the appropriate scale factors. The following known relationships are used for these derivations [16].
It is known that the derived ALFs are related to the conventional Legendre functions in terms of latitude ϕ through [16]
Starting with the above equation and using the product rule,
This equation is rewritten using Eq. 73 as
Using Eqs. 70 and 73, the final equation becomes
Similarly, an expression for \(\frac {\partial ^{2}P_{nm}}{\partial \phi ^{2}}\) is derived.
Substituting Eq. 76 into this expression gives
Equation 76 is used to write
Therefore, the final expression for the second partial is
In the code, the term P n, m+1(sinϕ) is multiplied by the scale factor S n m , and the term P n, m+2(sinϕ) is multiplied by the scale factor S n, m+1 to compensate for the original normalization of the ALFs. The final, normalized equations are then
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (https://creativecommons.org/licenses/by/4.0), which permits use, duplication, adaptation, distribution, and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Read, J.L., Younes, A.B., Macomber, B. et al. State Transition Matrix for Perturbed Orbital Motion Using Modified Chebyshev Picard Iteration. J of Astronaut Sci 62, 148–167 (2015). https://doi.org/10.1007/s40295-015-0051-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40295-015-0051-3