Compression of almost-periodic data.

DOI10.1016/S0096-3003(01)00292-2zbMath1034.68035OpenAlexW2090896773MaRDI QIDQ1855942

Roberto Barrio

Publication date: 28 January 2003

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(01)00292-2

zbMATH Keywords

Chebyshev polynomialsminimax approximation

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (1)

Algorithms for the integration and derivation of Chebyshev series.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Surface compression
• Reliable determination of interpolating polynomials
• Iterative polynomial interpolation and data compression
• Parallel evaluation of Chebyshev and trigonometric series
• Mesh Selection in Collocation for Boundary Value Problems
• Image compression through wavelet transform coding
• Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4]
• On Cline’s Direct Method for Solving Overdetermined Linear Systems in the $L_\infty $ Sense
• A Parallel Algorithm to Evaluate Chebyshev Series on a Message Passing Environment
• An Algorithm for Summing Orthogonal Polynomial Series and their Derivatives with Applications to Curve-Fitting and Interpolation
• Implementing Clenshaw-Curtis quadrature, I methodology and experience

This page was built for publication: Compression of almost-periodic data.