Massively parallel solution of the Lambert problem

Abstract

Abstract This paper considers the possibility of massively parallel solution to the Lambert problem on graphics processing units. Several of the most popular solution algorithms were used for this problem. Software implementation of algorithms under consideration has been developed using Compute Unified Device Architecture technology that allows performing calculations on graphics processing units. A distinctive feature of this project is an attempt to use parallel programming within an iterative scheme. The developed algorithms have been tested on a number of typical tasks: contouring of Earth – Mars direct flight isolines and solution of the problem of a flight to a group of asteroids for the given start date and flight duration. For such tasks we give estimates of execution time and paralleling efficiency.