Surrogate models for diffusion on graphs via sparse polynomials
From MaRDI portal
Boundary value problems on graphs and networks for ordinary differential equations (34B45) Theoretical approximation in context of PDEs (35A35) PDEs on graphs and networks (ramified or polygonal spaces) (35R02) Approximation by polynomials (41A10) Multidimensional problems (41A63) Numerical approximation of high-dimensional functions; sparse grids (65D40)
Cites work
- A compressed sensing approach for partial differential equations with random input data
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- A mathematical introduction to compressive sensing
- A non-adapted sparse approximation of PDEs with stochastic inputs
- A weighted _1-minimization approach for sparse polynomial chaos expansions
- Adaptive sparse polynomial chaos expansion based on least angle regression
- Analysis of discrete L^2 projection on polynomial spaces with random evaluations
- Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDE's
- Approximation of high-dimensional parametric PDEs
- Bayesian inference for contact networks given epidemic data
- Compressed sensing
- Correcting for unknown errors in sparse high-dimensional function approximation
- Diffusion maps
- Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
- Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace-Beltrami operator
- Geometric diffusions as a tool for harmonic analysis and structure definition of data: diffusion maps
- scientific article; zbMATH DE number 1183917 (Why is no real title available?)
- scientific article; zbMATH DE number 637113 (Why is no real title available?)
- Hyperbolic cross approximation. Lecture notes given at the courses on constructive approximation and harmonic analysis, Barcelona, Spain, May 30 -- June 3, 2016
- Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data
- Interpolation via weighted \(\ell_{1}\) minimization
- Kernels and regularization on graphs.
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Lipschitz regularity of graph Laplacians on random data clouds
- Networks. An introduction.
- Note on the derivatives with respect to a parameter of the solutions of a system of differential equations.
- On the stability and accuracy of least squares approximations
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparse Legendre expansions via _1-minimization
- Sparse Polynomial Approximation of High-Dimensional Functions
- Sparse polynomial chaos expansions: literature survey and benchmark
- Stochastic collocation algorithms using _1-minimization
- The Kuramoto model in complex networks
- Uncertainty quantification. Theory, implementation, and applications
This page was built for publication: Surrogate models for diffusion on graphs via sparse polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7289941)
