About truncated Chebyshev spectral method for solving numerical differentiation and summation
<|reference_start|>About truncated Chebyshev spectral method for solving numerical differentiation and summation: The problems of optimal recovering univariate functions and their derivatives are studied. To solve these problems, two variants of the truncation method are constructed, which are order-optimal both in the sense of accuracy and in terms of the amount of involved Galerkin information. For numerical summation, it has been established how the parameters characterizing the problem being solved affect its stability.<|reference_end|>
@article{semenova2024on,
    title={On Optimal Recovery and Information Complexity in Numerical
  Differentiation and Summation},
    author={Y.V. Semenova, S.G. Solodky},
    journal={arXiv preprint arXiv:2405.20020},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.20020},
    primaryClass={math.NA cs.NA}
}