The arithmetic computational complexity of linear transforms

DOI10.3103/S0027132214060047MaRDI QIDQ2356497zbMATH OpenOpenAlexFDO

Authors S. B. Gashkov

Publication date 30 July 2015

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/s0027132214060047

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Arithmetic complexity of certain linear transformations
• scientific article; zbMATH DE number 3934403
• Arithmetic complexity of the Stirling transforms
• scientific article; zbMATH DE number 6004867
• scientific article; zbMATH DE number 3988701

Cites work

• An Algorithm for the Machine Calculation of Complex Fourier Series
• Fast multiplication of polynomials over fields of characteristic 2
• scientific article; zbMATH DE number 2123132 (Why is no real title available?)
• scientific article; zbMATH DE number 4070302 (Why is no real title available?)
• scientific article; zbMATH DE number 3679828 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 609921 (Why is no real title available?)
• scientific article; zbMATH DE number 1099195 (Why is no real title available?)
• scientific article; zbMATH DE number 1144309 (Why is no real title available?)
• scientific article; zbMATH DE number 3795355 (Why is no real title available?)
• scientific article; zbMATH DE number 3202585 (Why is no real title available?)
• Linear Circuits over $\operatorname{GF}(2)$
• Modern computer algebra
• Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
• On fast multiplication of polynomials over arbitrary algebras

Cited in

(10)

• On complexity of round transformations
• The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms
• Arithmetic complexity of certain linear transformations
• scientific article; zbMATH DE number 6004867 (Why is no real title available?)
• Arithmetic complexity of the Stirling transforms
• scientific article; zbMATH DE number 4209552 (Why is no real title available?)
• scientific article; zbMATH DE number 3934403 (Why is no real title available?)
• Calcul de la dynamique de transformations linéaires contractantes mod 1 et arbre de Farey
• On the complexity of unitary transformations
• Computing Linear Transformations With Unreliable Components

This page was built for publication: The arithmetic computational complexity of linear transforms

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