A special recursive algorithm is built by a three-term recursive formula with coefficients evaluated by the moments method. A new functional c(·) is studied over any function space that contains the polynomial space and it is shown that such a functional is positive definite, enabling us to use the advantages of such a property on the zeros of orthogonal polynomials for such a functional. A comparison is presented of the numerical advantages of such a method with respect to the Laguerre polynomials.
A Recursive algorithm by the moments method to evaluate a class of numerical integrals over an infinite interval / M., MORANDI CECCHI; Pirozzi, Enrica. - In: NUMERICAL ALGORITHMS. - ISSN 1017-1398. - STAMPA. - 10:(1995), pp. 155-165. [10.1007/BF02198301]
A Recursive algorithm by the moments method to evaluate a class of numerical integrals over an infinite interval
PIROZZI, ENRICA
1995
Abstract
A special recursive algorithm is built by a three-term recursive formula with coefficients evaluated by the moments method. A new functional c(·) is studied over any function space that contains the polynomial space and it is shown that such a functional is positive definite, enabling us to use the advantages of such a property on the zeros of orthogonal polynomials for such a functional. A comparison is presented of the numerical advantages of such a method with respect to the Laguerre polynomials.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.