RUS  ENG
Full version
JOURNALS // Intelligent systems. Theory and applications // Archive

Intelligent systems. Theory and applications, 2018 Volume 22, Issue 4, Pages 99–105 (Mi ista160)

Generation of the ensemble of discrete orthogonal polynomials with a given node set

D. V. Parfenov

Moscow Technological University, Moscow

Abstract: A computationally eficient method for generation the ensemble of discrete orthogonal polynomials of complex variable is motivated and proposed. The ensemble keeps orthogonality at a given arbitrary separate node set with unitary weight function. The detailed algorithm implementation for coefficient computation and polynomial sampling is presented in GNU Octave/Mathworks Matlab language. The complexity estimate is the least attainable.

Keywords: digital signal processing, robust interpolation, orthogonal polynomials of discrete complex variable, arbitrary nodes, coefficient computation, optimal algorithm, computational complexity.



© Steklov Math. Inst. of RAS, 2026