An adaptive greedy algorithm for solving large RBF collocation problems (Q1870261)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An adaptive greedy algorithm for solving large RBF collocation problems |
scientific article; zbMATH DE number 1908558
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An adaptive greedy algorithm for solving large RBF collocation problems |
scientific article; zbMATH DE number 1908558 |
Statements
An adaptive greedy algorithm for solving large RBF collocation problems (English)
0 references
11 May 2003
0 references
The authors consider an adaptive greedy method, with slow linear convergence, in order to solve very large and at the same time, very general collocation problems. The method is a nonstandard one not directly aimed at a solution of the partial differential equation problems. In spite of this, the authors carry out some numerical results corresponding to the Dirichlet boundary value problem for the Poisson equation.
0 references
radial basis functions
0 references
adaptive greedy method
0 references
collocation
0 references
large scale problems
0 references
numerical examples
0 references
convergence
0 references
Poisson equation
0 references
0.8619371056556702
0 references
0.8038133382797241
0 references
0.8016031384468079
0 references
0.7942479252815247
0 references
0.7827572226524353
0 references
