Journal
JOURNAL OF COMPLEXITY
Volume 81, Issue -, Pages -Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jco.2023.101787
Keywords
Numerical differentiation; Numerical summation; Truncation method; Information complexity; Hyperbolic cross; Minimal radius of Galerkin information
Ask authors/readers for more resources
The problem of numerical differentiation for periodic functions with finite smoothness is examined. Various truncation methods are developed for multivariate functions and their approximation properties are determined. Based on these findings, sharp bounds in terms of power scale are derived for the minimum radius of Galerkin information for the studied problem.
The problem of numerical differentiation for periodic functions with finite smoothness is investigated. For multivariate functions, different variants of the truncation method are constructed and their approximation properties are obtained. Based on these results, sharp bounds (in the power scale) of the minimal radius of Galerkin information for the problem under study are found. (c) 2023 Published by Elsevier Inc.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available