Efficient realization of the Galerkin method in view of new properties of Chebyshev polynomials

ISSN： 1060-0396

Source： Cybernetics and Systems Analysis, Vol.40, Iss.6, 2004-11, pp. : 908-916

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The Minimality Properties of Chebyshev Polynomials and Their Lacunary Series

By Mason J.C.

Numerical Algorithms, Vol. 38, Iss. 1, 2005-03 ,pp. : 61-78

Springer Publishing Company

Access to resources Recommend Favorite

The Use of Chebyshev Polynomials in the Space–Time Least-Squares Spectral Element Method

By De Maerschalck Bart Gerritsma Marc

Numerical Algorithms, Vol. 38, Iss. 1, 2005-03 ,pp. : 173-196

Springer Publishing Company

Access to resources Recommend Favorite

Chebyshev Polynomials and Spectral Methods

Numerical Algorithms, Vol. 38, Iss. 1, 2005-03 ,pp. : 1-2

Springer Publishing Company

Access to resources Recommend Favorite

Counting on Chebyshev Polynomials

By Benjamin Arthur T. Walton Daniel

Mathematics Magazine, Vol. 82, Iss. 2, 2009-04 ,pp. : 117-126

Mathematical Association of America

Access to resources Recommend Favorite

An Efficient Implicit Discontinuous Spectral Galerkin Method

By Rasetarinera P. Hussaini M.Y.

Journal of Computational Physics, Vol. 172, Iss. 2, 2001-09 ,pp. : 718-738

Academic Press

Access to resources Recommend Favorite