Abstract
We discuss two questions. First, we consider the existence of close to optimal quadrature formulas with a “bad” L2-discrepancy of their grids, and the second is the question of how much explicit quadrature formulas are preferable to sorting algorithms. Also, in the model case, we obtain the solution to the question of approximative possibilities of Smolyak’s grid in the problems of recovery of functions.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
