Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds
DOI10.1007/S10092-022-00495-0OpenAlexW3157279470MaRDI QIDQ2111184FDOQ2111184
Andrew D. Davis, Dimitrios Giannakis
Publication date: 28 December 2022
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.15124
Recommendations
- Approximating solutions of linear elliptic PDE's on a smooth manifold using local kernel
- Kernel-based methods for solving time-dependent advection-diffusion equations on manifolds
- Kernel Methods for Bayesian Elliptic Inverse Problems on Manifolds
- Kernel-based approximation methods for partial differential equations: deterministic or stochastic problems?
- Solving partial differential equations on point clouds
Nonparametric regression and quantile regression (62G08) Probabilistic methods, particle methods, etc. for boundary value problems involving PDEs (65N75) Algorithms for approximation of functions (65D15)
Cites Work
- Diffusion maps
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Variable kernel density estimation
- Introduction to algorithms.
- On Locally Adaptive Density Estimation
- On Estimation of a Probability Density Function and Mode
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- Title not available (Why is that?)
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Geometric structures arising from kernel density estimation on Riemannian manifolds
- From graph to manifold Laplacian: the convergence rate
- Variable bandwidth diffusion kernels
- Accounting for boundary effects in nearest-neighbor searching
- Title not available (Why is that?)
- Analysis and Geometry of Markov Diffusion Operators
- Multidimensional binary search trees used for associative searching
- Title not available (Why is that?)
- Kernel density estimation on Riemannian manifolds
- A randomized approximate nearest neighbors algorithm
- Graph Laplacian Tomography From Unknown Random Projections
- Refinements to nearest-neighbor searching in k-dimensional trees
- Data-driven spectral decomposition and forecasting of ergodic dynamical systems
- Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace-Beltrami operator
- Uncertainty Quantification in Graph-Based Classification of High Dimensional Data
- Spectral Exterior Calculus
Cited In (4)
- Particle-Continuum Multiscale Modeling of Sea Ice Floes
- Graph-theoretic algorithms for Kolmogorov operators: Approximating solutions and their gradients in elliptic and parabolic problems on manifolds
- Graph selectors and viscosity solutions on Lagrangian manifolds
- Kernel-based methods for solving time-dependent advection-diffusion equations on manifolds
Uses Software
This page was built for publication: Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111184)
