|
Article information
2004 , Volume 9, Special issue, p.72-85
Lebedev V.I.
Numerical integration and interpolation methods and extremal ChMBS-polynomials
Methods of construction of the optimal algorithms for problems of computational mathematics, which are based on the properties of polynomials with the smallest deviation from zero in the product with some weight function, are considered. Usage of the functions dependent on the weight parameters allows to account apriori information about the properties of the class of required solutions.
Classificator Msc2000:- *65D32 Quadrature and cubature formulas
- 41A55 Approximate quadratures
- 41A63 Multidimensional problems (should also be assigned at least one other classification number in this section)
Keywords: Chebychev polynomials, SzegH{o} polynomials, Bernstein polynomials, cubature formula, optimal algorithms, interpolation, Gauss quadrature formulae
Author(s):
Lebedev V.I.
Dr. , Professor
Position: Professor
Office: Institute nuclear reactors
Address: 660074, Russia, Moscow
Phone Office: (495) 196 97 54
E-mail: nucrect@inm.ras.ru
Bibliography link:
Lebedev V.I. Numerical integration and interpolation methods and extremal ChMBS-polynomials // Computational technologies. 2004. V. 9. Special issue. Selected papers presented at VII International workshop “Cubature formulae and their applications”. Krasnoyarsk, August 2003. P. 72-85
|
|
|
|
