The approximating capability of fast forms

DOI10.1007/BF01200788MaRDI QIDQ1971592zbMATH OpenOpenAlexFDO

Authors William A. Porter, Wei Liu

Publication date 7 February 2001

Published in Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01200788

zbMATH Keywords

fast forms

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• scientific article; zbMATH DE number 3850828
• Faster algorithms via approximation theory
• Fast computation of approximant bases in canonical form
• scientific article; zbMATH DE number 5012790
• Fast approximations of certain number-theoretic constants
• scientific article; zbMATH DE number 3857671
• scientific article; zbMATH DE number 17943
• scientific article; zbMATH DE number 88935
• scientific article; zbMATH DE number 4086860
• scientific article; zbMATH DE number 4192090

Cites work

• scientific article; zbMATH DE number 3783337 (Why is no real title available?)
• A fast recursive algorithm for the discrete sine transform
• Efficient computation of the discrete pseudo-Wigner distribution
• Fast discrete extrapolation via the fast Hartley transform
• Kronecker Products, Unitary Matrices and Signal Processing Applications
• Kronecker products and matrix calculus in system theory
• The Fast Hartley Transform Algorithm

Cited in

(1)

• Fast simplifications for Tarski formulas

This page was built for publication: The approximating capability of fast forms

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