![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Multiple Rank-1 Lattices as Sampling Schemes for Approximation
![]() Multiple Rank-1 Lattices as Sampling Schemes for ApproximationAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact info@newton.ac.uk. ASCW01 - Challenges in optimal recovery and hyperbolic cross approximation The approximation of functions using sampling values along single rank-1 lattices leads to convergence rates of the approximation errors that are far away from optimal ones in spaces of dominating mixed smoothness. A recently published idea that uses sampling values along several rank-1 lattices in order to reconstruct multivariate trigonometric polynomials accompanied by fast methods for the construction of these sampling schemes as well as available fast Fourier transform algorithms motivates investigations on the approximation properties of the arising sampling operators applied on functions of specific smoothness, in particular functions of dominating mixed smoothness which naturally leads to hyperbolic cross approximations. This talk is part of the Isaac Newton Institute Seminar Series series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsCambridge Graphene Centre talks Statistical Laboratory info aggregator Early Detection Special Lecture SeriesOther talksTwo questions of shape The computational physiology of the basal ganglia and of their disorders and therapy Climate Change: Nonlinear Problem = Nonlinear Response Intestinal Absorption of Food Additive Nanoparticles and Microparticles by Human Volunteers Annual LGBT HM Lecture: Trans People: Flashback and Backlash |