Transfinite interpolation

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

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.[1]

The transfinite interpolation method, first introduced by William J. Gordon and Charles A. Hall,[2] 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.[3] 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. [4]


Formula

[edit | edit source]

With parametrized curves c1(u), c3(u) describing one pair of opposite sides of a domain, and c2(v), c4(v) describing the other pair. the position of point (u,v) in the domain is

S(u,v)=(1v)c1(u)+vc3(u)+(1u)c2(v)+uc4(v)[(1u)(1v)P1,2+uvP3,4+u(1v)P1,4+(1u)vP3,2]

where, e.g., P1,2 is the point where curves c1 and c2 meet.

References

[edit | edit source]
  1. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  2. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  3. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  4. ^ Steven A. Coons, Surfaces for computer-aided design of space forms, Technical Report MAC-TR-41, Project MAC, MIT, June 1967.