Shohat-Favard and Chebyshev’s methods in d-orthogonality
被引:0
|
作者:
Zélia da Rocha
论文数: 0引用数: 0
h-index: 0
Zélia da Rocha
机构:
来源:
Numerical Algorithms
|
1999年
/
20卷
关键词:
orthogonal polynomials;
Shohat-Favard;
Chebyshev and Modified Chebyshev methods;
42C05;
33A65;
D O I:
暂无
中图分类号:
学科分类号:
摘要:
This paper is concerned with the Shohat-Favard, Chebyshev and Modified Chebyshev methods for d-orthogonal polynomial sequences d∈ℕ. Shohat-Favard’s method is presented from the concept of dual sequence of a sequence of polynomials. We deduce the recurrence relations for the Chebyshev and the Modified Chebyshev methods for every d∈ℕ. The three methods are implemented in the Mathematica programming language. We show several formal and numerical tests realized with the software developed.
机构:
Univ Sci & Tech Lille Flandres Artois, Lab Paul Painleve, UMR CNRS 8524, UFR Math Pures & Appl, F-59655 Villeneuve Dascq, FranceUniv Sci & Tech Lille Flandres Artois, Lab Paul Painleve, UMR CNRS 8524, UFR Math Pures & Appl, F-59655 Villeneuve Dascq, France