An adaptive greedy algorithm for solving large RBF collocation problems (Q1870261): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:43, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An adaptive greedy algorithm for solving large RBF collocation problems |
scientific article |
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
