@article {IOPORT.01803316,
    author       = {Huhtanen, Marko and Larsen, Rasmus Munk},
    title        = {On generating discrete orthogonal bivariate polynomials.},
    year         = {2002},
    journal      = {BIT},
    volume       = {42},
    number       = {2},
    issn         = {0006-3835},
    pages        = {393-407},
    publisher    = {Springer, Dordrecht},
    doi          = {10.1023/A:1021907210628},
    abstract     = {This paper is concerned with an algorithm for recursively generating discrete orthogonal bivariate polynomials on a finite set $S\left \lbrace (x_j,y_j) \right \rbrace _{j=1}^n \in \Bbb R ^2 $ with respect to a weight vector $m=(m_1,\dots ,m_n)$ having unit mass. Two commuting symmetric matrices $H$ and $K$, such that the spectrum of $H+iK$ equal $S$, are associated with $S$. Since $H$ and $K$ commute, bivariate orthogonal polynomials can be generated by using an iterative method. The resulting algorithm relies on a recurrence having slowly growing length. The method can be extended to general multivariate orthogonal polynomials. Applications of the proposed algorithm are illustrated with numerical examples,},
    reviewer     = {Luigi Gatteschi (Torino)},
    identifier   = {01803316},
}