Efficient computation of partition of unity interpolants through a block-based searching technique (Q2007296)
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: Efficient computation of partition of unity interpolants through a block-based searching technique |
scientific article; zbMATH DE number 7259809
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient computation of partition of unity interpolants through a block-based searching technique |
scientific article; zbMATH DE number 7259809 |
Statements
Efficient computation of partition of unity interpolants through a block-based searching technique (English)
0 references
12 October 2020
0 references
meshfree approximation
0 references
partition of unity method
0 references
fast algorithms
0 references
searching procedures
0 references
radial basis functions
0 references
scattered data interpolation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8555843234062195
0 references
0.8470999002456665
0 references
0.8315404057502747
0 references
0.8260130286216736
0 references
