A fast block-greedy algorithm for quasi-optimal meshless trial subspace selection
From MaRDI portal
Recommendations
- An improved subspace selection algorithm for meshless collocation methods
- Approximate solutions of partial differential equations by some Meshfree Greedy Algorithms
- Stable and Convergent Unsymmetric Meshless Collocation Methods
- Greedy sparse linear approximations of functionals from nodal data
- Results on meshless collocation techniques
Cites work
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Survey of Condition Number Estimation for Triangular Matrices
- A comparison of efficiency and error convergence of multiquadric collocation method and finite element method.
- A lower bound for the smallest singular value
- A note on a lower bound for the smallest singular value
- An adaptive greedy algorithm for solving large RBF collocation problems
- An adaptive greedy technique for inverse boundary determination problem
- An adaptive-hybrid meshfree approximation method
- An improved subspace selection algorithm for meshless collocation methods
- Computing eigenmodes of elliptic operators using radial basis functions
- Improved accuracy of multiquadric interpolation using variable shape parameters
- Kernel-based approximation methods using MATLAB
- Moving-boundary problems solved by adaptive radial basis functions
- Multiquadrics - a scattered data approximation scheme with applications to computational fluid-dynamics. I: Surface approximations and partial derivative estimates
- Numerical experiments on optimal shape parameters for radial basis functions
- Numerical simulations of 2D fractional subdiffusion problems
- Numerical solution to time-dependent 4D inviscid Burgers' equations
- On choosing ``optimal shape parameters for RBF approximation
- On choosing a radial basis function and a shape parameter when solving a convective PDE on a sphere
- On convergent numerical algorithms for unsymmetric collocation
- On estimating the condition of eigenvalues and eigenvectors
- On incremental condition estimators in the 2-norm
- On the increasingly flat radial basis function and optimal shape parameter for the solution of elliptic PDEs
- On the new variable shape parameter strategies for radial basis functions
- On unsymmetric collocation by radial basis functions
- Results on meshless collocation techniques
- Semi-optimal bases for linear dependencies
- Solving moving-boundary problems with the wavelet adaptive radial basis functions method
- Stable Computations with Gaussian Radial Basis Functions
- Stable and Convergent Unsymmetric Meshless Collocation Methods
- Stable evaluation of Gaussian radial basis function interpolants
- The Runge phenomenon and spatially variable shape parameters in RBF interpolation
- The golden section search algorithm for finding a good shape parameter for meshless collocation methods
- The localized RBFs collocation methods for solving high dimensional PDEs
- The role of the multiquadric shape parameters in solving elliptic partial differential equations
Cited in
(14)- An adaptive sparse kernel technique in greedy algorithm framework to simulate an anomalous solute transport model
- Solving interpolation problems on surfaces stochastically and greedily
- A stochastic extended Rippa's algorithm for LpOCV
- Fully adaptive kernel-based methods
- Greedy trial subspace selection in meshfree time-stepping scheme with applications in coupled bulk-surface pattern formations
- A dual-level method of fundamental solutions in conjunction with kernel-independent fast multipole method for large-scale isotropic heat conduction problems
- Doubly stochastic radial basis function methods
- Exploring oversampling in RBF least-squares collocation method of lines for surface diffusion
- An improved subspace selection algorithm for meshless collocation methods
- Solving 2D parabolic equations by using time parareal coupling with meshless collocation RBFs methods
- On variable and random shape Gaussian interpolations
- Solving partial differential equations on surfaces with fundamental solutions
- $H^2$-Convergence of Least-Squares Kernel Collocation Methods
- Weighted least-squares collocation methods for elliptic PDEs with mixed boundary conditions
This page was built for publication: A fast block-greedy algorithm for quasi-optimal meshless trial subspace selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804999)
