Chebyshev series expansion of inverse polynomials

@article{Mathar2006ChebyshevSE,
  title={Chebyshev series expansion of inverse polynomials},
  author={R. Mathar},
  journal={Journal of Computational and Applied Mathematics},
  year={2006},
  volume={196},
  pages={596-607}
}
  • R. Mathar
  • Published 2006
  • Mathematics
  • Journal of Computational and Applied Mathematics
  • The Chebyshev series expansion Σn=0∞anTn(x) of the inverse of a polynomial Σj=0kbjTj(x) is well defined if the polynomial has no roots in [-1,1]. If the inverse polynomial is decomposed into partial fractions, the an are linear combinations of simple functions of the polynomial roots. Also, if the first k of the coefficients an are known, the others become linear combinations of these derived recursively from the bj's. On a closely related theme, finding a polynomial with minimum relative error… CONTINUE READING
    17 Citations
    Rigorous uniform approximation of D-finite functions using Chebyshev expansions
    • 9
    • PDF
    Rigorous Polynomial Approximations and Applications
    • 24
    • PDF
    Sparse approximate inverses of Gramians and impulse response matrices of large-scale interconnected systems
    • 2
    • PDF
    Sparse solution of the Lyapunov equation for large-scale interconnected systems
    • 24
    • PDF
    A survey on Christoffel–Darboux-type identities of Chebyshev polynomials
    • 2
    • Highly Influenced
    Sparse Interpolation With Errors in Chebyshev Basis Beyond Redundant-Block Decoding
    • PDF
    Distributed dynamic load identification based on shape function method and polynomial selection technique
    • 12
    Nonlinear Blind Compensation for Array Signal Processing Application
    • 2
    • Highly Influenced
    • PDF
    Moving Horizon Estimation for Large-Scale Interconnected Systems
    • 51
    • Highly Influenced

    References

    SHOWING 1-10 OF 60 REFERENCES