An adaptive greedy algorithm for solving large RBF collocation problems

From MaRDI portal
Revision as of 11:43, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1870261

DOI10.1023/A:1022253303343zbMath1019.65093OpenAlexW1646111283MaRDI QIDQ1870261

Robert Schaback, Benny 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




Related Items (37)

Redistribution of nodes with two constraints in meshless method of line to time-dependent partial differential equationsOptimal design for kernel interpolation: applications to uncertainty quantificationAn adaptive-hybrid meshfree approximation methodFast iterative adaptive multi-quadric radial basis function method for edges detection of piecewise functions. I: Uniform meshA shift‐adaptive meshfree method for solving a class of initial‐boundary value problems with moving boundaries in one‐dimensional domainAn adaptive meshless local Petrov-Galerkin method based on a posteriori error estimation for the boundary layer problemsMultiobjective optimization for node adaptation in the analysis of composite plates using a meshless collocation methodAn alternative local collocation strategy for high-convergence meshless PDE solutions, using radial basis functionsA localized transform-based meshless method for solving time fractional wave-diffusion equationAn adaptive greedy technique for inverse boundary determination problemAdaptive radial basis function interpolation using an error indicatorThe local radial basis function collocation method for elastic wave propagation analysis in 2D composite plateAdaptive residual Refinement in an RBF Finite difference scheme for 2D time-dependent problemsA comparison of three explicit local meshless methods using radial basis functionsA localized approach for the method of approximate particular solutionsA three-dimensional acoustics model using the method of fundamental solutionsA multiresolution prewavelet-based adaptive refinement scheme for RBF approximations of nearly singular problemsNumerical simulation of two-dimensional combustion using mesh-free methodsMultiquadric and its shape parameter -- a numerical investigation of error estimate, condition number, and round-off error by arbitrary precision computationAn adaptive sparse kernel technique in greedy algorithm framework to simulate an anomalous solute transport modelNode adaptation for global collocation with radial basis functions using direct multisearch for multiobjective optimizationAn improved subspace selection algorithm for meshless collocation methodsAdaptive residual subsampling methods for radial basis function interpolation and collocation problemsLimit problems for interpolation by analytic radial basis functionsRBF-based partition of unity methods for elliptic PDEs: adaptivity and stability issues via variably scaled kernelsSolvability of partial differential equations by meshless kernel methodsReduced surface point selection options for efficient mesh deformation using radial basis functionsDimension-splitting data points redistribution for meshless approximationApplication of radial basis functions to the problem of elasto-plastic torsion of prismatic barsAll well-posed problems have uniformly stable and convergent discretizationsA Fast Block-Greedy Algorithm for Quasi-optimal Meshless Trial Subspace SelectionThe adaptive algorithm for the selection of sources of the method of fundamental solutionsDynamic node adaptive strategy for nearly singular problems on large domainsA greedy meshless local Petrov-Galerkin methodbased on radial basis functionsA local mesh-less collocation method for solving a class of time-dependent fractional integral equations: 2D fractional evolution equationUnnamed ItemSparse radial basis function approximation with spatially variable shape parameters






This page was built for publication: An adaptive greedy algorithm for solving large RBF collocation problems