Early termination for sparse interpolation of polynomials in Chebyshev bases
From MaRDI portal
Cites work
- A fraction free matrix Berlekamp/Massey algorithm
- Algebraic methods for Toeplitz-like matrices and operators
- Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Early termination in sparse interpolation algorithms
- Error-correcting sparse interpolation in the Chebyshev basis
- Fast computation of GCDs
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- scientific article; zbMATH DE number 3905732 (Why is no real title available?)
- scientific article; zbMATH DE number 1263429 (Why is no real title available?)
- Numerical sparsity determination and early termination
- On fast multiplication of polynomials over arbitrary algebras
- On the matrix Berlekamp-Massey algorithm
- Shift-register synthesis and BCH decoding
- Sparse Interpolation With Errors in Chebyshev Basis Beyond Redundant-Block Decoding
- Sparse Polynomial Interpolation in Nonstandard Bases
- Sparse polynomial interpolation with arbitrary orthogonal polynomial bases
- Sparse polynomial interpolation with error correction: higher error capacity by randomization
- The Computational Complexity of Continued Fractions
This page was built for publication: Early termination for sparse interpolation of polynomials in Chebyshev bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6892758)
