Adaptive greedy techniques for approximate solution of large RBF systems
From MaRDI portal
Publication:1587034
DOI10.1023/A:1019105612985zbMath0957.65021MaRDI QIDQ1587034
Holger Wendland, Robert Schaback
Publication date: 22 November 2000
Published in: Numerical Algorithms (Search for Journal in Brave)
interpolationconvergenceiterative methodradial basis functionslarge sparse linear systemsadaptive greedy techniques
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical interpolation (65D05)
Related Items
Radial basis function interpolation in the quantum trajectory method: optimization of the multi-quadric shape parameter. ⋮ Effect of flexibility on flapping wing characteristics in hover and forward flight ⋮ Redistribution of nodes with two constraints in meshless method of line to time-dependent partial differential equations ⋮ Optimal design for kernel interpolation: applications to uncertainty quantification ⋮ Error and stability estimates of a least-squares variational kernel-based method for second order elliptic PDEs ⋮ A greedy non-intrusive reduced order model for shallow water equations ⋮ An adaptive-hybrid meshfree approximation method ⋮ Fast iterative adaptive multi-quadric radial basis function method for edges detection of piecewise functions. I: Uniform mesh ⋮ Efficient mesh motion using radial basis functions with data reduction algorithms ⋮ A shift‐adaptive meshfree method for solving a class of initial‐boundary value problems with moving boundaries in one‐dimensional domain ⋮ Reconstruct multiscale functions using different RBFs in different subdomains ⋮ An adaptive meshless local Petrov-Galerkin method based on a posteriori error estimation for the boundary layer problems ⋮ Multiobjective optimization for node adaptation in the analysis of composite plates using a meshless collocation method ⋮ Coupled groundwater flow and contaminant transport simulation in a confined aquifer using meshfree radial point collocation method (RPCM) ⋮ Convergence of meshless Petrov-Galerkin method using radial basis functions ⋮ Kernel B-splines on general lattices ⋮ Solving partial differential equations by meshless methods using radial basis functions ⋮ An adaptive greedy technique for inverse boundary determination problem ⋮ Adaptive radial basis function interpolation using an error indicator ⋮ On Shape Deformation Techniques for Simulation-Based Design Optimization ⋮ Comparison of data-driven uncertainty quantification methods for a carbon dioxide storage benchmark scenario ⋮ Surrogate modeling of multiscale models using kernel methods ⋮ Generation of point sets by convex optimization for interpolation in reproducing kernel Hilbert spaces ⋮ Data-Driven Kernel Designs for Optimized Greedy Schemes: A Machine Learning Perspective ⋮ Analysis of target data-dependent greedy kernel algorithms: convergence rates for \(f\)-, \(f \cdot P\)- and \(f/P\)-greedy ⋮ A multiresolution prewavelet-based adaptive refinement scheme for RBF approximations of nearly singular problems ⋮ Multiquadric and its shape parameter -- a numerical investigation of error estimate, condition number, and round-off error by arbitrary precision computation ⋮ An adaptive sparse kernel technique in greedy algorithm framework to simulate an anomalous solute transport model ⋮ Node adaptation for global collocation with radial basis functions using direct multisearch for multiobjective optimization ⋮ A mesh-free pseudospectral approach to estimating the fractional Laplacian via radial basis functions ⋮ A novel class of stabilized greedy kernel approximation algorithms: convergence, stability and uniform point distribution ⋮ Recovering functions: a method based on domain decomposition ⋮ An improved subspace selection algorithm for meshless collocation methods ⋮ Adaptive residual subsampling methods for radial basis function interpolation and collocation problems ⋮ Solve partial differential equations by two or more radial basis functions ⋮ Biomechanical Surrogate Modelling Using Stabilized Vectorial Greedy Kernel Methods ⋮ Limit problems for interpolation by analytic radial basis functions ⋮ Polyharmonic splines: an approximation method for noisy scattered data of extra-large size ⋮ Solvability of partial differential equations by meshless kernel methods ⋮ Reduced surface point selection options for efficient mesh deformation using radial basis functions ⋮ Radial basis functions: developments and applications to planetary scale flows ⋮ The Trefftz method using fundamental solutions for biharmonic equations ⋮ Solve partial differential equations by meshless subdomains method combined with RBFs ⋮ Kernel \(B\)-splines and interpolation ⋮ Dimension-splitting data points redistribution for meshless approximation ⋮ Linearly constrained reconstruction of functions by kernels with applications to machine learning ⋮ Kernel-based interpolation at approximate Fekete points ⋮ All well-posed problems have uniformly stable and convergent discretizations ⋮ Dynamic node adaptive strategy for nearly singular problems on large domains ⋮ A greedy meshless local Petrov-Galerkin methodbased on radial basis functions ⋮ Groundwater flow simulation in a confined aquifer using local radial point interpolation meshless method (LRPIM) ⋮ Sparse radial basis function approximation with spatially variable shape parameters ⋮ Stable interpolation with exponential-polynomial splines and node selection via greedy algorithms ⋮ Space-time variograms and a functional form for total air pollution measurements. ⋮ A computational tool for comparing all linear PDE solvers ⋮ Dynamic programming using radial basis functions
