Pseudo-Spectral Method for Finite and Infinite Time Synchronization Problems

Authors

DOI:

https://doi.org/10.37256/cm.7120268462

Keywords:

synchronization problems, lagrange interpolating polynomial, non-linear programming problems, pseudospectral method

Abstract

This paper presents a unified pseudo-spectral framework for solving both finite-time and infinite-time synchronization problems in nonlinear dynamical systems. The core of our approach is the formulation of two novel optimal control problems, where the achievement of synchronization is established as the optimal solution. We rigorously prove that the solution to these optimal control problems guarantees synchronization. The proposed method leverages a Legendre pseudo-spectral technique to transcribe the continuous-time optimal control problems into nonlinear programming problems. The unknown coefficients of the approximating polynomials are then efficiently determined by solving the resulting algebraic system derived from the Karush-Kuhn-Tucker optimality conditions. The efficacy and superiority of the method are demonstrated through several numerical examples, where it is compared against other well-known synchronization techniques. The results confirm that our method offers significant advantages in accuracy and convergence. Finally, we discuss the potential for extending this approach to a broader class of complex synchronization problems.

Downloads

Published

2026-01-04

How to Cite

1.
A. Haji, M. H. Noori Skandari, D. Baleanu. Pseudo-Spectral Method for Finite and Infinite Time Synchronization Problems. Contemp. Math. [Internet]. 2026 Jan. 4 [cited 2026 Jan. 8];7(1):126-50. Available from: https://ojs.wiserpub.com/index.php/CM/article/view/8462