A Fast Block-Greedy Algorithm for Quasi-optimal Meshless Trial Subspace Selection
From MaRDI portal
Publication:2804999
DOI10.1137/15M1037627zbMath1338.65041WikidataQ58222834 ScholiaQ58222834MaRDI QIDQ2804999
Publication date: 9 May 2016
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Multidimensional problems (41A63) Algorithms for approximation of functions (65D15)
Related Items (9)
A stochastic extended Rippa's algorithm for LpOCV ⋮ Doubly stochastic radial basis function methods ⋮ Solving 2D parabolic equations by using time parareal coupling with meshless collocation RBFs methods ⋮ On variable and random shape Gaussian interpolations ⋮ Weighted least-squares collocation methods for elliptic PDEs with mixed boundary conditions ⋮ $H^2$-Convergence of Least-Squares Kernel Collocation Methods ⋮ An adaptive sparse kernel technique in greedy algorithm framework to simulate an anomalous solute transport model ⋮ Solving Partial Differential Equations on Surfaces with Fundamental Solutions ⋮ A Dual-Level Method of Fundamental Solutions in Conjunction with Kernel-Independent Fast Multipole Method for Large-Scale Isotropic Heat Conduction Problems
Uses Software
Cites Work
- Unnamed Item
- The golden section search algorithm for finding a good shape parameter for meshless collocation methods
- On the increasingly flat radial basis function and optimal shape parameter for the solution of elliptic PDEs
- Moving-boundary problems solved by adaptive radial basis functions
- Numerical solution to time-dependent 4D inviscid Burgers' equations
- Multiquadrics - a scattered data approximation scheme with applications to computational fluid-dynamics. I: Surface approximations and partial derivative estimates
- An adaptive greedy technique for inverse boundary determination problem
- A note on a lower bound for the smallest singular value
- The role of the multiquadric shape parameters in solving elliptic partial differential equations
- Numerical simulations of 2D fractional subdiffusion problems
- On convergent numerical algorithms for unsymmetric collocation
- On estimating the condition of eigenvalues and eigenvectors
- A lower bound for the smallest singular value
- Improved accuracy of multiquadric interpolation using variable shape parameters
- A comparison of efficiency and error convergence of multiquadric collocation method and finite element method.
- Computing eigenmodes of elliptic operators using radial basis functions
- On unsymmetric collocation by radial basis functions
- An adaptive greedy algorithm for solving large RBF collocation problems
- Results on meshless collocation techniques
- Solving moving-boundary problems with the wavelet adaptive radial basis functions method
- The localized RBFs collocation methods for solving high dimensional PDEs
- On choosing ``optimal shape parameters for RBF approximation
- The Runge phenomenon and spatially variable shape parameters in RBF interpolation
- On choosing a radial basis function and a shape parameter when solving a convective PDE on a sphere
- On the new variable shape parameter strategies for radial basis functions
- On Incremental Condition Estimators in the 2-Norm
- An adaptive-hybrid meshfree approximation method
- Stable Evaluation of Gaussian Radial Basis Function Interpolants
- Kernel-based Approximation Methods using MATLAB
- Stable Computations with Gaussian Radial Basis Functions
- Semi-optimal bases for linear dependencies
- An improved subspace selection algorithm for meshless collocation methods
- Numerical experiments on optimal shape parameters for radial basis functions
- Stable and Convergent Unsymmetric Meshless Collocation Methods
- A Survey of Condition Number Estimation for Triangular Matrices
This page was built for publication: A Fast Block-Greedy Algorithm for Quasi-optimal Meshless Trial Subspace Selection
