An adaptive greedy algorithm for solving large RBF collocation problems
From MaRDI portal
Publication:1870261
DOI10.1023/A:1022253303343zbMATH Open1019.65093OpenAlexW1646111283MaRDI QIDQ1870261FDOQ1870261
Authors: Robert Schaback, Y. C. Hon, Xu Zhou 
Publication date: 11 May 2003
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022253303343
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
convergencenumerical examplesPoisson equationradial basis functionscollocationlarge scale problemsadaptive greedy method
Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35)
Cited In (46)
- An adaptive greedy technique for inverse boundary determination problem
- Solving interpolation problems on surfaces stochastically and greedily
- An adaptive sparse kernel technique in greedy algorithm framework to simulate an anomalous solute transport model
- A local mesh-less collocation method for solving a class of time-dependent fractional integral equations: 2D fractional evolution equation
- On the Laplace-transformed-based local meshless method for fractional-order diffusion equation
- Fully adaptive kernel-based methods
- Redistribution of nodes with two constraints in meshless method of line to time-dependent partial differential equations
- 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
- RBF-based partition of unity methods for elliptic PDEs: adaptivity and stability issues via variably scaled kernels
- Adaptive residual Refinement in an RBF Finite difference scheme for 2D time-dependent problems
- Dimension-splitting data points redistribution for meshless approximation
- A greedy meshless local Petrov-Galerkin methodbased on radial basis functions
- Optimal design for kernel interpolation: applications to uncertainty quantification
- Multiquadric and its shape parameter -- a numerical investigation of error estimate, condition number, and round-off error by arbitrary precision computation
- Application of radial basis functions to the problem of elasto-plastic torsion of prismatic bars
- Reduced surface point selection options for efficient mesh deformation using radial basis functions
- 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
- Sparse radial basis function approximation with spatially variable shape parameters
- 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
- Limit problems for interpolation by analytic radial basis functions
- 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
- Exploring oversampling in RBF least-squares collocation method of lines for surface diffusion
- A localized approach for the method of approximate particular solutions
- Numerical simulation of two-dimensional combustion using mesh-free methods
- An adaptive meshless local Petrov-Galerkin method based on a posteriori error estimation for the boundary layer problems
- An improved subspace selection algorithm for meshless collocation methods
- Adaptive radial basis function interpolation using an error indicator
- Adaptive residual subsampling methods for radial basis function interpolation and collocation problems
- The adaptive algorithm for the selection of sources of the method of fundamental solutions
- An alternative local collocation strategy for high-convergence meshless PDE solutions, using radial basis functions
- The local radial basis function collocation method for elastic wave propagation analysis in 2D composite plate
- Multiobjective optimization for node adaptation in the analysis of composite plates using a meshless collocation method
- A fast block-greedy algorithm for quasi-optimal meshless trial subspace selection
- A localized transform-based meshless method for solving time fractional wave-diffusion equation
- A comparison of three explicit local meshless methods using radial basis functions
- Title not available (Why is that?)
- Adaptive radial basis function for time dependent partial differential equations
- A greedy algorithm for partition of unity collocation method in pricing American options
- Dynamic node adaptive strategy for nearly singular problems on large domains
- Generic preconditioning based on the inverse with respect to the semi-inner product for iterative solvers for radial basis function interpolation
- Solvability of partial differential equations by meshless kernel methods
- An adaptive-hybrid meshfree approximation method
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)
