Statistics – Computation
Scientific paper
May 1997
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1997aj....113.1909f&link_type=abstract
Astronomical Journal v.113, p. 1909-1914 (1997)
Statistics
Computation
5
Scientific paper
The Picard iteration method and the Chebyshev polynomial approximation were combined to obtain numerically a global solution of ordinary differential equations. The method solves both the initial and boundary value problems. The method directly provides not the tabulated values of the solution but the polynomials interpolating the solution in the integration interval given. In the case of scalar computation, the method is a few to several times as fast as the multistep method when (1) a good approximation of the solution is known beforehand, (2) the right hand members of differential equations are weakly dependent on the solution, and/or (3) the magnitude of the right hand members are small. Thus the method is suitable for (1) orbital improvements, (2) the integration of almost uniform rotations, and (3) perturbed dynamics in general. The method will be greatly accelerated by using vector/parallel computers since its main part is the numerical quadrature of known function of time.
No associations
LandOfFree
Picard Iteration method, Chebyshev Polynomial Approximation, and Global Numerical Integration of Dynamical Motions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Picard Iteration method, Chebyshev Polynomial Approximation, and Global Numerical Integration of Dynamical Motions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Picard Iteration method, Chebyshev Polynomial Approximation, and Global Numerical Integration of Dynamical Motions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-835743