Grant: Alliance Grants
University of Alberta
$25,000.00
Sampling discretization and approximation in high-dimensional spaces
EF 2023-24
Résumé
The primary goal of our research is to investigate sampling discretization, cubature formulas and their connections with quantitative approximation in high-dimensional settings. Sampling discretization refers to the process of transferring continuous objects into their discrete counterparts through function values at a fixed finite set of points, whereas cubature refers to a method for numerically approximating a high-dimensional integral of a function through a weighted sum of function values on a finite set of points. Discretization is an important step in making a continuous problem computationally feasible, while cubature has been playing crucial roles in discretization and practical evaluation of high dimensional integrals. To ensure the problems are accessible by computers, the first step towards discretization is usually the process of approximating continuous operators and high dimensional function spaces by lower dimensional counterparts (e.g. multivariate polynomials, splines, neural networks). In this program, we will focus on quantitative estimates of errors that inevitably arise in the process of approximation and discretization. Many questions of utmost importance to discretization, cubature and approximation theory in High dimensions remain wide open. The questions under investigation in this program include (i) Universal sampling discretization using function values at randomly selected points; (ii) discrepancy estimates and cubature formulas in function spaces; (iii) interplay between high dimensional probability, and approximation theory. Our research will combine powerful probabilistic techniques with various deep results in harmonic analysis and approximation theory. This program is connected to computational mathematics (i.e., the methods of numerical integration), harmonic analysis, probability, statistics, artificial intelligence and other areas of mathematics. The scientific outputs of this program are expected to impact several areas of mathematics, enriching and cross-fertilizing them with new results, ideas, and methods.
Programme
Alliance Grants
Bénéficiaire
Emplacement
Alberta, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
590947-2023
Name nom
Dai, Feng F
Department département
Mathematical and Statistical Sciences
Organization id
9
Institution établissement
University of Alberta
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2023
Competition year année de concours
2023
Award amount
25000
Program id
ALLRP
Program name en
Alliance Grants
Program name fr
Subventions Alliance
Group en
RESEARCH PARTNERSHIPS
Group fr
PARTENARIATS DE RECHERCHE
Committee code
96
Committee name en
RPP Internal Decision Cttee
Committee name fr
Cté de décision interne - PPR
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
Research subject code
2954
Research subject group en
Applied mathematics
Research subject group fr
Asymptotics and applied classical analysis
Research subject en
Mathématiques appliquées
Research subject fr
Asymptotique et analyse classique appliquée
Application title
Sampling discretization and approximation in high-dimensional spaces
Keyword
Function spaces; high dimensional approximation; high dimensional probability; sampling discretization and recovery
Application summary
The primary goal of our research is to investigate sampling discretization, cubature formulas and their connections with quantitative approximation in high-dimensional settings. Sampling discretization refers to the process of transferring continuous objects into their discrete counterparts through function values at a fixed finite set of points, whereas cubature refers to a method for numerically approximating a high-dimensional integral of a function through a weighted sum of function values on a finite set of points. Discretization is an important step in making a continuous problem computationally feasible, while cubature has been playing crucial roles in discretization and practical evaluation of high dimensional integrals. To ensure the problems are accessible by computers, the first step towards discretization is usually the process of approximating continuous operators and high dimensional function spaces by lower dimensional counterparts (e.g. multivariate polynomials, splines, neural networks). In this program, we will focus on quantitative estimates of errors that inevitably arise in the process of approximation and discretization. Many questions of utmost importance to discretization, cubature and approximation theory in High dimensions remain wide open. The questions under investigation in this program include (i) Universal sampling discretization using function values at randomly selected points; (ii) discrepancy estimates and cubature formulas in function spaces; (iii) interplay between high dimensional probability, and approximation theory. Our research will combine powerful probabilistic techniques with various deep results in harmonic analysis and approximation theory. This program is connected to computational mathematics (i.e., the methods of numerical integration), harmonic analysis, probability, statistics, artificial intelligence and other areas of mathematics. The scientific outputs of this program are expected to impact several areas of mathematics, enriching and cross-fertilizing them with new results, ideas, and methods.