Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds

DOI10.1007/S10092-022-00495-0MaRDI QIDQ2111184zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

kernel methodsvector fieldsgraph LaplacianKolmogorov operators

Mathematics Subject Classification ID

Nonparametric regression and quantile regression (62G08) Probabilistic methods, particle methods, etc. for boundary value problems involving PDEs (65N75) Algorithms for approximation of functions (65D15)

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

Cites work

• scientific article; zbMATH DE number 3162185 (Why is no real title available?)
• scientific article; zbMATH DE number 6776481 (Why is no real title available?)
• A randomized approximate nearest neighbors algorithm
• Accounting for boundary effects in nearest-neighbor searching
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Analysis and geometry of Markov diffusion operators
• Data-driven spectral decomposition and forecasting of ergodic dynamical systems
• Diffusion maps
• Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace-Beltrami operator
• From graph to manifold Laplacian: the convergence rate
• Geometric structures arising from kernel density estimation on Riemannian manifolds
• Graph Laplacian Tomography From Unknown Random Projections
• Graph Laplacians and their convergence on random neighborhood graphs
• Introduction to algorithms.
• Kernel density estimation on Riemannian manifolds
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Multidimensional binary search trees used for associative searching
• On Estimation of a Probability Density Function and Mode
• On Locally Adaptive Density Estimation
• Refinements to nearest-neighbor searching in k-dimensional trees
• Spectral Exterior Calculus
• Uncertainty quantification in graph-based classification of high dimensional data
• Variable bandwidth diffusion kernels
• Variable kernel density estimation

Cited in

(5)

• Particle-Continuum Multiscale Modeling of Sea Ice Floes
• Approximating solutions of linear elliptic PDE's on a smooth manifold using local kernel
• Graph selectors and viscosity solutions on Lagrangian manifolds
• Kernel-based methods for solving time-dependent advection-diffusion equations on manifolds
• Graph-theoretic algorithms for Kolmogorov operators: Approximating solutions and their gradients in elliptic and parabolic problems on manifolds

Describes a project that uses

Uses Software

• GitHub
• nanoflann
• NLopt

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)