No label defined (Q3759290)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4009001
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4009001 |
Statements
1987
0 references
algorithm
0 references
set of vertices
0 references
sample points
0 references
0.8210248947143555
0 references
0.8127910494804382
0 references
[For the entire collection see Zbl 0607.00008.] Let F be a closed polygonal domain in \(R^ 2\). Consider a partition of F in triangular cells which is regular, in the sense that a vertex of a cell does not belong to the interior of an edge of another cell. The space \(S^ 0_ 1\) of all real-valued continuous functions on F whose restrictions to triangular cells are linear, has dimension N, where N is the number of vertices of the given partition. The authors give an algorithm to find the set of vertices (called sample points) \(A=\{x_ i:i=1,2,...,N\}\subset F\), such that for any set \(\{y_ i:i=1,2,...,N\}\subset R\) there exists a unique function \(s\in S^ 0_ 1\) with \(s(x_ i)=y_ i\), \(i=1,2,...,N\).
0 references