Arithmetic complexity of the Stirling transforms

DOI10.1515/DMA-2015-0008MaRDI QIDQ314124zbMATH OpenOpenAlexFDO

Authors S. B. Gashkov

Publication date 13 September 2016

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma-2015-0008

zbMATH Keywords

addition vector chainscircuits in arithmetic basescomplexity of computationGauss \(q\)-binomial coefficientLagrange interpolationNewton interpolationStirling transforms of the first and second kindsVandermonde matrices

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Numerical interpolation (65D05) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Arithmetic complexity of certain linear transformations
• The arithmetic computational complexity of linear transforms
• Generalized Stirling transform
• Polynomial evaluation and interpolation on special sets of points
• The complexity of evaluating interpolation polynomials

Cited in

(4)

• Arithmetic complexity of certain linear transformations
• The arithmetic computational complexity of linear transforms
• On the additive complexity of GCD and LCM matrices
• Return time complexity of Sturmian sequences

This page was built for publication: Arithmetic complexity of the Stirling transforms

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