Application of high-performance computing to solve the cauchy problem with the fractional Riccati equation using an nonlocal implicit finite-difference scheme
Abstract:
The article presents a study of the computational efficiency of a parallel version of a numerical algorithm for solving the Riccati equation with a fractional variable order derivative of the Gerasimov-Caputo type. The numerical algorithm is a nonlocal implicit finite-difference scheme, which reduces to a system of nonlinear algebraic equations and is solved using a modified Newton method. The nonlocality of the numerical scheme creates a high computational load on computing resources, which creates the need to implement efficient parallel algorithms for solving them. The numerical algorithm studied for efficiency is implemented in the C language due to its versatility when working with memory. Parallelization was carried out using OpenMP technology. A series of computational experiments are being carried out on the NVIDIA DGX STATION computing server (Institute of Mathematics named after V.I. Romanovsky, Tashkent, Uzbekistan) and the HP Pavilion Gaming Laptop Z270X, where the Cauchy problem for the fractional Riccati equation with non-constant coefficients was solved. Based on the average computation time, the speedup, efficiency and cost of the algorithm are calculated. From the data analysis it is clear that the OpenMP parallel software implementation of the non-local implicit finite-difference scheme shows an acceleration of 9-12 times, depending on the number of CPU cores involved.
Fulltext:
PDF file (541 kB)