Arithmetic complexity of the Stirling transforms

DOI10.1515/DMA-2015-0008zbMATH Open1348.65046OpenAlexW2318849896MaRDI QIDQ314124FDOQ314124

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

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

zbMATH Keywords

Lagrange interpolationVandermonde matricesaddition vector chainscircuits in arithmetic basescomplexity of computationGauss \(q\)-binomial coefficientNewton interpolationStirling transforms of the first and second kinds

Mathematics Subject Classification ID

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

Cited In (2)

• 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)