A fast algorithm for the construction of recurrence relations for modified moments
Applicationes Mathematicae, Tome 22 (1993) no. 3, pp. 359-372
Cet article a éte moissonné depuis la source Institute of Mathematics Polish Academy of Sciences
A new approach is presented for constructing recurrence relations for the modified moments of a function with respect to the Gegenbauer polynomials.
DOI :
10.4064/am-22-3-359-372
Keywords:
Gegenbauer polynomials, recurrence relations, modified moments
Affiliations des auteurs :
Stanisław Lewanowicz 1
@article{10_4064_am_22_3_359_372,
author = {Stanis{\l}aw Lewanowicz},
title = {A fast algorithm for the construction of recurrence relations for modified moments},
journal = {Applicationes Mathematicae},
pages = {359--372},
year = {1993},
volume = {22},
number = {3},
doi = {10.4064/am-22-3-359-372},
zbl = {0833.33008},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.4064/am-22-3-359-372/}
}
TY - JOUR AU - Stanisław Lewanowicz TI - A fast algorithm for the construction of recurrence relations for modified moments JO - Applicationes Mathematicae PY - 1993 SP - 359 EP - 372 VL - 22 IS - 3 UR - http://geodesic.mathdoc.fr/articles/10.4064/am-22-3-359-372/ DO - 10.4064/am-22-3-359-372 LA - en ID - 10_4064_am_22_3_359_372 ER -
%0 Journal Article %A Stanisław Lewanowicz %T A fast algorithm for the construction of recurrence relations for modified moments %J Applicationes Mathematicae %D 1993 %P 359-372 %V 22 %N 3 %U http://geodesic.mathdoc.fr/articles/10.4064/am-22-3-359-372/ %R 10.4064/am-22-3-359-372 %G en %F 10_4064_am_22_3_359_372
Stanisław Lewanowicz. A fast algorithm for the construction of recurrence relations for modified moments. Applicationes Mathematicae, Tome 22 (1993) no. 3, pp. 359-372. doi: 10.4064/am-22-3-359-372
Cité par Sources :