dbo:abstract
|
- In numerical analysis, transfinite interpolation is a means to construct functions over a planar domain in such a way that they match a given function on the boundary. This method is applied in geometric modelling and in the field of finite element method. The transfinite interpolation method, first introduced by William J. Gordon and Charles A. Hall, receives its name due to how a function belonging to this class is able to match the primitive function at a nondenumerable number of points.In the authors' words: We use the term ‘transfinite’ to describe the general class of interpolation schemes studied herein since, unlike the classical methods of higher dimensional interpolation which match the primitive function F at a finite number of distinct points, these methods match F at a non-denumerable (transfinite) number of points. Transfinite interpolation is similar to the Coons patch, invented in 1967. (en)
|
dbo:wikiPageID
| |
dbo:wikiPageLength
|
- 3140 (xsd:nonNegativeInteger)
|
dbo:wikiPageRevisionID
| |
dbo:wikiPageWikiLink
| |
dbp:wikiPageUsesTemplate
| |
dcterms:subject
| |
gold:hypernym
| |
rdf:type
| |
rdfs:comment
|
- In numerical analysis, transfinite interpolation is a means to construct functions over a planar domain in such a way that they match a given function on the boundary. This method is applied in geometric modelling and in the field of finite element method. The transfinite interpolation method, first introduced by William J. Gordon and Charles A. Hall, receives its name due to how a function belonging to this class is able to match the primitive function at a nondenumerable number of points.In the authors' words: Transfinite interpolation is similar to the Coons patch, invented in 1967. (en)
|
rdfs:label
|
- Transfinite interpolation (en)
|
owl:sameAs
| |
prov:wasDerivedFrom
| |
foaf:isPrimaryTopicOf
| |
is dbo:wikiPageDisambiguates
of | |
is dbo:wikiPageWikiLink
of | |
is foaf:primaryTopic
of | |