Comparing the computation of Chebyshev polynomials in computer algebra systems

MaRDI QIDQ2898763zbMATH OpenFDO

Authors Sándor Czirbusz

Publication date 12 July 2012

Published in Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio Computatorica (Search for Journal in Brave)

zbMATH Keywords

Chebyshev polynomialscomputer algebra

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 1297631
• Performance comparison of Maple and Mathematica
• An assessment of the efficiency of computer algebra systems in the solution of scientific computing problems
• scientific article; zbMATH DE number 53894
• Computational mathematics with SageMath. Translated from the 2013 French original by the authors

Cited in

(3)

• An assessment of the efficiency of computer algebra systems in the solution of scientific computing problems
• scientific article; zbMATH DE number 1795736 (Why is no real title available?)
• Beating binary powering for polynomial matrices

Describes a project that uses

Uses Software

• Maple
• SageMath

This page was built for publication: Comparing the computation of Chebyshev polynomials in computer algebra systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898763)