Abstract
AbstractRecently, a mesh refinement strategy is presented on pseudospectral methods for solving optimal control problems by using the relative curvature of the state approximation to choose the type of discretization change in each iteration. Nevertheless, this criterion requires a large amount of computational cost in terms of CPU time. The main goal of this paper is to draw attention to select a suitable criterion with fewer computational cost. To this end, we use the arc length of the state approximation in the mesh interval based on the relative error estimate that was recently provided. We also update the number of mesh intervals and the location of mesh points according to the behaviour of the arc length. Indeed, by implementing this criterion, we do not need to solve an optimization problem anymore, and so significantly reduce the computational time as well as CPU times. Finally, we illustrate the accuracy, efficiency and ability of the arc length criterion in comparison with the curvature by offering some numerical examples.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IMA Journal of Mathematical Control and Information
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
