Approximate solutions of partial differential equations by some Meshfree Greedy Algorithms
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2247536
- Convergent meshfree approximation schemes of arbitrary order and smoothness
- Solvability of partial differential equations by meshless kernel methods
- scientific article; zbMATH DE number 4155810
- scientific article; zbMATH DE number 3970065
- Accurate approximate solution of partial differential equations at off-mesh points
- scientific article; zbMATH DE number 3856325
- Approximations with piecewise constant fluxes for diffusion equations on polyhedral meshes: algorithms and applications
- Convergence analysis of meshfree approximation schemes
- A Meshfree Method for a PDE-Constrained Optimization Problem
Cited in
(7)- An adaptive greedy algorithm for solving large RBF collocation problems
- Results on meshless collocation techniques
- An adaptive sparse kernel technique in greedy algorithm framework to simulate an anomalous solute transport model
- A fast block-greedy algorithm for quasi-optimal meshless trial subspace selection
- A greedy meshless local Petrov-Galerkin methodbased on radial basis functions
- Stable and Convergent Unsymmetric Meshless Collocation Methods
- Greedy sparse linear approximations of functionals from nodal data
This page was built for publication: Approximate solutions of partial differential equations by some Meshfree Greedy Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4603156)