Fast parallelizable galerkin method for initial and boundary value problems
File(s)ISSFD_Galerkin_submitted.pdf (1.3 MB)
Published version
Author(s)
Anton, Sabin
Amato, Davide
Type
Conference Paper
Abstract
Efficient numerical methods for the solution
of Initial and Boundary Value Problems is of continued
importance in astrodynamics are of continued import-
ance in astrodynamics. This paper proposes a novel
Galerkin method for the solution of IVPs and BVPs. The
method works by projecting the solution onto a Cheby-
shev basis, and by finding the projection coefficients that
zero the ODE residual through Newton-Rhapson iter-
ations. The method is tested against classical Runge-
Kutta methods and Modified Chebyshev-Picard Itera-
tions (MCPI), which is a similar pseudo-spectral method
for the solution of IVPs and BVPs. The Galerkin method
is up to 300 times faster than state-of-the-art Runge-Kutta
solvers for IVPs, and up to 80 times faster than MCPI in
the solution of BVPs.
of Initial and Boundary Value Problems is of continued
importance in astrodynamics are of continued import-
ance in astrodynamics. This paper proposes a novel
Galerkin method for the solution of IVPs and BVPs. The
method works by projecting the solution onto a Cheby-
shev basis, and by finding the projection coefficients that
zero the ODE residual through Newton-Rhapson iter-
ations. The method is tested against classical Runge-
Kutta methods and Modified Chebyshev-Picard Itera-
tions (MCPI), which is a similar pseudo-spectral method
for the solution of IVPs and BVPs. The Galerkin method
is up to 300 times faster than state-of-the-art Runge-Kutta
solvers for IVPs, and up to 80 times faster than MCPI in
the solution of BVPs.
Date Acceptance
2024-01-30
Copyright Statement
© 2024 The Author(s).
Source
29th International Symposium on Spaceflight Dynamics (ISSFD)
Publication Status
Published
Start Date
2024-04-22
Finish Date
2024-04-26
Coverage Spatial
Darmstadt, Germany