Abstract
In this paper, a detailed theoretical and experimental study on some computational aspects of high order discrete orthogonal Racah polynomials (RPs) and their corresponding moments is carried out. Initially, the numerical overflow problem related to RPs computation is solved by using modified recurrence relations of RPs with respect to the polynomial order n and the variable s. Moreover, the recursive nature of the resulting relations considerably accelerates the computation of RPs. Then, the problem of numerical errors propagation that occurs during the recursive computation of RPs is solved. Indeed, the proposed solution relies on the use of a new numerical method that detects unstable values and sets them to zero. This ensures the numerical stability of high-order RPs. Next, a fast method is presented to significantly reduce the required time for reconstructing large-size 1D signal. This method involves the transformation of a 1D signal into a 2D array, then using matrix reconstruction formulas in the 2D domain. The simulation and comparison results clearly show that the proposed computation methods are very useful for the fast and stable analysis of large-size signals and 2D/3D images by Racah moments (RMs). (c) 2021 Elsevier B.V. All rights reserved.
NSTL
Elsevier