Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Alberta

$54,000.00

Sampling discretization, cubature formulas and quantitative approximation in multidimensional settings

EF 2024-25

Résumé
The primary goal of my research is to investigate sampling discretization, cubature formulas  and their connections with quantitative approximation theory in higher 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 multidimensional integral of a function through a  weighted sum of function values on a finite set of points, which is called a cubature formula. Discretization is an important step in making a continuous problem computationally feasible, while cubature formulas have 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 higher dimensional function spaces by lower dimensional counterparts (e.g. multivariate polynomials, splines, neural networks). In this program, I 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 formulas and approximation theory in higher dimensions remain wide open. The questions under investigation in this program include (i)  sampling discretizations of Lq norms of functions from a high-dimensional subspace; (ii) discrepancy estimates and cubature formulas in high-dimensional function spaces; (iii) interplay between energy minimization and optimal cubature formulas; (iv) connections between locally supported positive definite functions on spheres and related domains; (v) new constructions of well-distributed point sets (low-discrepancy, cubature, energy-minimizing, lattices); and (vi) dimension-free estimates for approximation on high-dimensional domains.     My research will use a new technique, which combines powerful probabilistic techniques, based on chaining and large deviation inequalities, with various deep results in multidimensional approximation theory (e.g., estimates of entropy numbers and N-widths, various polynomial inequalities,  direct and inverse dimension-free  estimates in polynomial approximation). I also expect that the theory of classical orthogonal polynomial expansions, especially spherical harmonic analysis,  will be a powerful  tool in my research.    This program is connected to computational mathematics (i.e., the methods of numerical integration), 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
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Alberta, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
RGPIN-2020-03909
Name nom
Dai, Feng
Department département
Mathematical and Statistical Sciences - 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
2024
Competition year année de concours
2020
Award amount
54000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
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
Mathématiques appliquées
Research subject en
Asymptotics and applied classical analysis
Research subject fr
Asymptotique et analyse classique appliquée
Field of research list names en
Not available
Field of research list names fr
Non disponible
Socioeconomic objective list names en
Not available
Socioeconomic objective list names fr
Non disponible
Application title
Sampling discretization, cubature formulas and quantitative approximation in multidimensional settings
Keywords
cubature formulas, discrepancy, and energy-minimizing; sampling discretization; high-dimensional approximation; polynomial inequalities; applied functional analysis; orthogonal polynomial expansions
Application summary
The primary goal of my research is to investigate sampling discretization, cubature formulas  and their connections with quantitative approximation theory in higher 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 multidimensional integral of a function through a  weighted sum of function values on a finite set of points, which is called a cubature formula. Discretization is an important step in making a continuous problem computationally feasible, while cubature formulas have 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 higher dimensional function spaces by lower dimensional counterparts (e.g. multivariate polynomials, splines, neural networks). In this program, I 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 formulas and approximation theory in higher dimensions remain wide open. The questions under investigation in this program include (i)  sampling discretizations of Lq norms of functions from a high-dimensional subspace; (ii) discrepancy estimates and cubature formulas in high-dimensional function spaces; (iii) interplay between energy minimization and optimal cubature formulas; (iv) connections between locally supported positive definite functions on spheres and related domains; (v) new constructions of well-distributed point sets (low-discrepancy, cubature, energy-minimizing, lattices); and (vi) dimension-free estimates for approximation on high-dimensional domains.     My research will use a new technique, which combines powerful probabilistic techniques, based on chaining and large deviation inequalities, with various deep results in multidimensional approximation theory (e.g., estimates of entropy numbers and N-widths, various polynomial inequalities,  direct and inverse dimension-free  estimates in polynomial approximation). I also expect that the theory of classical orthogonal polynomial expansions, especially spherical harmonic analysis,  will be a powerful  tool in my research.    This program is connected to computational mathematics (i.e., the methods of numerical integration), 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.