A fast block-greedy algorithm for quasi-optimal meshless trial subspace selection (Q2804999)
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: A fast block-greedy algorithm for quasi-optimal meshless trial subspace selection |
scientific article; zbMATH DE number 6578094
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast block-greedy algorithm for quasi-optimal meshless trial subspace selection |
scientific article; zbMATH DE number 6578094 |
Statements
9 May 2016
0 references
Kansa method
0 references
kernel collocation
0 references
radial basis function
0 references
adaptive greedy algorithm
0 references
basis selection
0 references
0 references
0 references
0 references
0 references
0 references
0 references
A fast block-greedy algorithm for quasi-optimal meshless trial subspace selection (English)
0 references
