An adaptive greedy algorithm for solving large RBF collocation problems
From MaRDI portal
Recommendations
- Adaptive greedy techniques for approximate solution of large RBF systems
- Adaptive procedures for meshfree RBF unsymmetric and symmetric collocation methods
- A greedy meshless local Petrov-Galerkin methodbased on radial basis functions
- Adaptive residual subsampling methods for radial basis function interpolation and collocation problems
- Approximate solutions of partial differential equations by some Meshfree Greedy Algorithms
Cited in
(47)- Adaptive greedy techniques for approximate solution of large RBF systems
- Fast iterative adaptive multi-quadric radial basis function method for edges detection of piecewise functions. I: Uniform mesh
- Multiobjective optimization for node adaptation in the analysis of composite plates using a meshless collocation method
- A localized transform-based meshless method for solving time fractional wave-diffusion equation
- Adaptive radial basis function interpolation using an error indicator
- The adaptive algorithm for the selection of sources of the method of fundamental solutions
- A comparison of three explicit local meshless methods using radial basis functions
- RBF-based partition of unity methods for elliptic PDEs: adaptivity and stability issues via variably scaled kernels
- Optimal design for kernel interpolation: applications to uncertainty quantification
- An adaptive sparse kernel technique in greedy algorithm framework to simulate an anomalous solute transport model
- Application of radial basis functions to the problem of elasto-plastic torsion of prismatic bars
- A local mesh-less collocation method for solving a class of time-dependent fractional integral equations: 2D fractional evolution equation
- Sparse radial basis function approximation with spatially variable shape parameters
- Adaptive residual subsampling methods for radial basis function interpolation and collocation problems
- Limit problems for interpolation by analytic radial basis functions
- Solvability of partial differential equations by meshless kernel methods
- Dynamic node adaptive strategy for nearly singular problems on large domains
- Redistribution of nodes with two constraints in meshless method of line to time-dependent partial differential equations
- A fast block-greedy algorithm for quasi-optimal meshless trial subspace selection
- A greedy meshless local Petrov-Galerkin methodbased on radial basis functions
- An adaptive-hybrid meshfree approximation method
- scientific article; zbMATH DE number 2127858 (Why is no real title available?)
- An adaptive meshless local Petrov-Galerkin method based on a posteriori error estimation for the boundary layer problems
- An alternative local collocation strategy for high-convergence meshless PDE solutions, using radial basis functions
- An improved subspace selection algorithm for meshless collocation methods
- A three-dimensional acoustics model using the method of fundamental solutions
- A multiresolution prewavelet-based adaptive refinement scheme for RBF approximations of nearly singular problems
- Numerical simulation of two-dimensional combustion using mesh-free methods
- Multiquadric and its shape parameter -- a numerical investigation of error estimate, condition number, and round-off error by arbitrary precision computation
- Node adaptation for global collocation with radial basis functions using direct multisearch for multiobjective optimization
- An adaptive algorithm based on RBF-PU collocation for solving 2D Poisson problems
- Adaptive radial basis function for time dependent partial differential equations
- A greedy algorithm for partition of unity collocation method in pricing American options
- A shift-adaptive meshfree method for solving a class of initial-boundary value problems with moving boundaries in one-dimensional domain
- All well-posed problems have uniformly stable and convergent discretizations
- An adaptive greedy technique for inverse boundary determination problem
- The local radial basis function collocation method for elastic wave propagation analysis in 2D composite plate
- Adaptive residual Refinement in an RBF Finite difference scheme for 2D time-dependent problems
- A localized approach for the method of approximate particular solutions
- Solving interpolation problems on surfaces stochastically and greedily
- On the Laplace-transformed-based local meshless method for fractional-order diffusion equation
- Fully adaptive kernel-based methods
- Exploring oversampling in RBF least-squares collocation method of lines for surface diffusion
- Generic preconditioning based on the inverse with respect to the semi-inner product for iterative solvers for radial basis function interpolation
- Greedy trial subspace selection in meshfree time-stepping scheme with applications in coupled bulk-surface pattern formations
- Dimension-splitting data points redistribution for meshless approximation
- Reduced surface point selection options for efficient mesh deformation using radial basis functions
This page was built for publication: An adaptive greedy algorithm for solving large RBF collocation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870261)
