Preprint
Article

This version is not peer-reviewed.

Transfinite Elements Using Bernstein Polynomials

A peer-reviewed article of this preprint also exists.

Submitted:

12 May 2025

Posted:

13 May 2025

You are already at the latest version

Abstract
Transfinite interpolation, originally proposed in the early 1970s as a global interpolation method, was first implemented using Lagrange polynomials and cubic Hermite splines. While initially developed for computer-aided geometric design (CAGD), the method also found application in global finite element analysis. With the advent of isogeometric analysis (IGA), Bernstein-B\'ezier polynomials have increasingly replaced Lagrange polynomials, particularly in conjunction with tensor-product B-splines and non-uniform rational B-splines (NURBS). Despite its early promise, transfinite interpolation has seen limited adoption in modern CAD/CAE workflows, primarily due to its mathematical complexity--especially when blending polynomials of different degrees. In this context, the present study revisits the classical formulation of transfinite interpolation and demonstrates that, in four broad classes, Lagrange polynomials can be systematically replaced by Bernstein polynomials in a one-to-one manner. This replacement yields a robust dual set of basis functions with improved numerical properties. A key advantage of Bernstein polynomials lies in their natural compatibility with weighted formulations, enabling the accurate representation of conic sections and quadrics--scenarios where IGA methods are particularly effective. The proposed methodology is validated through its application to a boundary-value problem governed by the Laplace equation, confirming both its feasibility and accuracy.
Keywords: 
;  ;  ;  ;  ;  ;  

1. Introduction

Engineering analysis of two- and three-dimensional boundary-value (including eigenvalue) problems is usually performed using tensor product expansion of the problem variable, applying either local or global interpolation. In chronological sequence, from older to the most recent, the mostly used univariate functions were Lagrange polynomials, Bernstein polynomials, B-splines and NURBS ([1,2,3], among others). And, since these univariate functions are constituent elements of usual tensor products, they have successively passed from tensor product Lagrange polynomials to tensor product NURBS.
In the advent of isogeometric analysis (IGA), Lagrange polynomials have been progressively substituted by Bernstein polynomials as well as B-splines and NURBS [3]. In some simple cases such as ideal tensor products implemented with Lagrange polynomials, the nodal values U i ’s can be blindly replaced by the generalized coefficients α i ’s and the Lagrange by Bernstein polynomials [4,5], but the range of applicability of this method is still unknown. Regarding two-dimensional problems, it has been shown that Lagrange and non-rational Bernstein polynomials are equivalent, and thus lead to the same numerical results [6]. However, as we will discuss in the paper at hand, this blind replacement is not generally applicable. Note that one practical reason for replacing Lagrange by Bernstein polynomials is because the latter allow for the introduction of weights that may ensure the accurate representation of conics and surfaces such as cylindrical and spherical parts. However, this can be achieved not only for IGA-tensor-products but for transfinite patches as well [4]. Regarding the analysis module, which refers to the numerical solution to a partial differential equation (PDE) with given boundary conditions, the isoparametric concept has been adopted in all cases, which uses the same set of basis functions for the approximation of the geometry x ( ξ , η ) and the primary variable of the problem U ( ξ , η ) .
For the sake of clarity and focus, this paper restricts itself to the use of Bernstein polynomials only, excluding discussions of B-splines and NURBS. Overall, five categories of transfinite elements are investigated, as follows:
  • Tensor product elements.
  • Traditional transfinite elements (fully structured).
  • Distorted tensor products.
  • Elements with different degrees on opposite edges (partially unstructured).
  • Coons elements.
The study opens with a review of the tensor product formulation, leading to the derivation of a general transformation matrix that maps Lagrange polynomials to their Bernstein counterparts. This matrix is subsequently employed to establish the relationship between the nodal values U i ’s and the generalized coefficients a i ’s.
Next, the paper examines classical transfinite elements in a structured setting, where it uncovers the implicit transformation matrix governing the interpolation. It then extends the analysis to tensor product elements with distorted boundaries, identifying the relationship between nodal points and control points for both Lagrange and Bernstein representations.
The fourth part investigates non-tensor-product elements, characterized by variable polynomial interpolation orders along their four edges. For these cases, a robust Bernstein-based basis is proposed, and avenues for future research are discussed. Finally, the paper presents a variation of the transfinite element inspired by the Coons patch, wherein nodal or control points are defined solely along the boundary.
The proposed methodology is validated through two benchmark problems: a boundary-value problem governed by the Laplace equation, and an acoustic eigenvalue problem. Both cases possess known closed-form solutions, allowing for rigorous accuracy assessment.

2. Basic Theory

2.1. Bernstein Polynomials

It is well known that Bézier interpolation of a curve of degree n, or a univariate function has the following form
C ( ξ ) = i = 1 n + 1 B i , n ( ξ ) P i , 0 ξ 1 ,
with the Bernstein polynomials given by
B i , n ( ξ ) = n ! ( i 1 ) ! ( n i + 1 ) ! ξ i 1 ( 1 ξ ) n i + 1 , i = 1 , , n + 1 .
whereas P i are the ( n + 1 ) control points. In case of a univariate function U ( ξ ) , the control points are substituted by the generalized coefficients α i .
Since Bernstein and Lagrange polynomials share the same monomials ξ i , it is concluded that these two sets are equivalent [6]. Therefore, bivariate and trivariate tensor product Lagrange polynomials are equivalent to those of Bernstein polynomials. Nevertheless, Bernstein polynomials are preferable because they can easily be combined with weight factors and thus accurately represent conics and quadric surfaces.

2.2. Relationship Between Bernstein and Lagrange Polynomials

2.2.1. Univariate Approximation

Previously in References [4,5,6], we have shown that univariate uniform Lagrange polynomials and Bernstein polynomials of the same degree are merely interrelated through a transformation matrix. In more detail, if the x-axis ( 0 x a ) is uniformly subdivided into m segments, the ( m + 1 ) associated Lagrange polynomials (of degree m) form a column vector L x , whereas the ( m + 1 ) associated Bernstein polynomials form another column vector B x . These two sets of polynomials of the same degree m, are interrelated by
L x = T x B x , and B x = T x 1 L x ,
where T x is a transformation matrix of size ( m + 1 ) × ( m + 1 ) . Typical values for m = 1 , , 4 may be found in Refs. [4,5,6].

2.2.2. Tensor Products

Similar expressions may be written also for the y-direction, where the corresponding column vectors ( L y , B y ) and the associated transformation matrix T y appear:
L y = T y B y , and B y = T y 1 L y .
In case of a tensor product of degree ( m , n ) , using ( m + 1 ) and ( n + 1 ) nodal points along the axes x and y, respectively (i.e., totally ( m + 1 ) × ( n + 1 ) nodal points), we can write (see [5]):
U ( ξ , η ) = L x T U L y = B x T A B y ,
where the matrix A of generalized coefficients (in tensor product Bernstein polynomials) is related to the matrix U (including all the nodal values) through the two univariate transformation matrices, as follows:
A = T x T U T y ,
and
U = ( T x 1 ) T A ( T y 1 ) .
Implementation to a 9-node tensor product element is demonstrated in Section 3.5.

2.3. Non-Uniform Lagrange Polynomials

The standard expressions for the transformation matrices T , which have been reported in previous papers [5,6], have been derived for uniform (equally spaced) Lagrange polynomials. However, when the intermediate nodes on a line segment (in the parametrc interval [ 0 , 1 ] ) are moved from their initial uniform position, the set of nodal points on which Lagrange polynomials are based changes, merely because the nodal values U i change. In contrast, Bernstein polynomials are of standard form according to Equation 1, and thus they do not depend on the position of the associated control points. In conclusion, the change of nodal points along a segment [ 0 , L ] implies a change of the transformation matrix T (i.e., T x or T y ), and change of the generalized coefficients. The numerical estimation of each one-dimensional transformation matrix (for example, T x ), can be done by collocating Equation 5 at all the nodal points of [ 0 , L ] , which gives U n o d a l = [ C ] a . For each position of internal nodes with value U n o d a l (of size ( m + 1 ) × 1 ), the matrix [ C ] (of size ( m + 1 ) × ( m + 1 ) ) takes a diffenent value, the vector of coefficients becomes a = C 1 U n o d a l , and thus T x = ( C 1 ) T .

3. Transformation Matrices Between Tensor Product Bernstein and Lagrange Functional Sets

In this section we shall derive the general expression for the transformation matrix R which correlates the tensor product Bernstein and Lagrange polynomial sets. To this purpose, as an example, first we start with the quadratic interpolation, and then present the general expression.

3.1. Quadratic Interpolation

Let us consider a quadratic element (1-2-3) shown in Figure 1a. As has been proven previously in Refs. [5,6], the relationship between the three quadratic Lagrange polynomials ( L x = [ L 1 , 2 ( x ) , L 2 , 2 ( x ) , L 3 , 2 ( x ) ] T ) associated with the nodes (1,2,3) and the corresponding Bernstein polynomials ( B x = [ B 1 , 2 ( x ) , B 2 , 2 ( x ) , B 3 , 2 ( x ) ] T ) , is as follows:
L 1 , 2 ( ξ ) L 2 , 2 ( ξ ) L 3 , 2 ( ξ ) = 1 1 2 0 0 2 0 0 1 2 1 B 1 , 3 ( ξ ) B 2 , 3 ( ξ ) B 3 , 3 ( ξ ) .
Note that regarding the subscripts in both polynomials of Equation 8, i.e., L i , j and B i , j , the first index ‘ i ’ refers to the serial number of the node (measured from the left end) whereas the second index ‘ j ’ (after comma) refers to the polynomial degree (here, j = p = 2 ).
Obviously, since each boundary edge of the bi-quadratic quadrilateral element shown in Figure 1b is entirely self-contained, the relationship by Equation 8 is useful for interpolation along the horizontal edges toward ξ -direction (1-2-3 and 7-8-9). Moreover, regarding the vertical η -direction, the independent variable ξ in both parts of Equation 8 must be substituted by the independent variable η .
To derive the bivariate shape functions of the element in Figure 1b, both parts of Equation 8 are multiplied by L 1 , 2 ( η ) , which in turn is further replaced by the same transformation in η , and thus we receive:
L 1 , 2 ( ξ ) L 2 , 2 ( ξ ) L 3 , 2 ( ξ ) L 1 , 2 ( η ) = 1 1 2 0 0 2 0 0 1 2 1 B 1 , 2 ( ξ ) B 2 , 2 ( ξ ) B 3 , 2 ( ξ ) L 1 , 2 ( η ) = 1 1 2 0 0 2 0 0 1 2 1 B 1 , 2 ( ξ ) B 2 , 2 ( ξ ) B 3 , 2 ( ξ ) · 0 1 2 0 B 1 , 2 ( η ) B 2 , 2 ( η ) B 3 , 2 ( η ) .
whence we have:
L 1 , 2 ( ξ ) L 1 , 2 ( η ) L 2 , 2 ( ξ ) L 1 , 2 ( η ) L 3 , 2 ( ξ ) L 1 , 2 ( η ) = 1 1 2 0 1 2 1 4 0 0 2 0 0 1 0 0 1 2 1 0 1 4 1 2 B 1 , 2 ( ξ ) B 1 , 2 ( η ) B 2 , 2 ( ξ ) B 1 , 2 ( η ) B 3 , 2 ( ξ ) B 1 , 2 ( η ) B 1 , 2 ( ξ ) B 2 , 2 ( η ) B 2 , 2 ( ξ ) B 2 , 2 ( η ) B 3 , 2 ( ξ ) B 2 , 2 ( η ) .
In a similar way, multiplying Equation 8 by L 2 , 2 ( η ) , we receive a shorter expression:
L 1 , 2 ( ξ ) L 2 , 2 ( η ) L 2 , 2 ( ξ ) L 2 , 2 ( η ) L 3 , 2 ( ξ ) L 2 , 2 ( η ) = 2 1 0 0 4 0 0 1 2 B 1 , 2 ( ξ ) B 2 , 2 ( η ) B 2 , 2 ( ξ ) B 2 , 2 ( η ) B 3 , 2 ( ξ ) B 2 , 2 ( η ) .
Also, multiplying Equation 8 by L 3 , 2 ( η ) , we receive:
L 1 , 2 ( ξ ) L 3 , 2 ( η ) L 2 , 2 ( ξ ) L 3 , 2 ( η ) L 3 , 2 ( ξ ) L 3 , 2 ( η ) = 1 2 1 4 0 1 1 2 0 0 1 0 0 2 0 0 1 4 1 2 0 1 2 1 B 1 , 2 ( ξ ) B 2 , 2 ( η ) B 2 , 2 ( ξ ) B 2 , 2 ( η ) B 3 , 2 ( ξ ) B 2 , 2 ( η ) B 1 , 2 ( ξ ) B 3 , 2 ( η ) B 2 , 2 ( ξ ) B 3 , 2 ( η ) B 3 , 2 ( ξ ) B 3 , 2 ( η ) .
If all the nine shape functions of each functional set are packed into two column vectors as follows:
Preprints 159269 i001
the combination of Equation 10 to Equation 13 determines a linear relationship between them, i.e.:
n L = R n B ,
with
Preprints 159269 i002

3.2. Generalization

It is worth mentioning that in the general case of a ‘square’ tensor product p × p associated with a univariate transformation matrix T = T x = T y :
T = t 1 , 1 t 1 , p + 1 t p + 1 , 1 t p + 1 , p + 1 ,
the transformation matrix R may be written as follows:
Preprints 159269 i003
Moreover, in the most general case of a ‘rectangular’ tensor product of degree ( p , q ) associated with univariate transformation matrices T x ( p × p ) and T y ( q × q ) , the transformation matrix R may be written as follows:
Preprints 159269 i004

3.3. Transformation of Structural Engineering Matrices (K, M)

When the stiffness (and mass) matrix is known in the functional system of Lagrange polynomials, it is also known in terms Bernstein polynomials. In this context, omitting the corresponding factor (e.g., the density ρ in elastodynamics, or the inverse of speed squared 1 / c 2 in acoustics), the mass matrix ( M L in the Lagrangian basis and M B in the Bézierian one) will be interrelated through the abovementioned transformation matrix R , one being a quadratic form of the other, as follows:
M L = Ω n L n L T d Ω = Ω ( R n B ) ( R n B ) T d Ω = Ω ( R n B ) n B T R T d Ω = R Ω n B n B T d Ω R T = R M B R T .
In a similar way, the stiffness matrices in the two systems will be interrelated by:
K L = R K B R T ,
whereas, by virtue of Equation 14, the force vectors will be interrelated by:
f L = n L U n d Γ = R n B U n d Γ = R n B U n d Γ = R f B .
Considering a static problem, for the functional set including Lagrange polynomials, the equilibrium equation becomes:
K L u L = f L ,
and by virtue of Equation 20 and Equation 21 becomes:
R K B R T u L = R f B .
After simplification of matrix R in both parts of Equation 23, we receive:
K B R T u L = f B .
Moreover, since the displacement field does not depend on the functional basis but is the same in both of them, we have:
U ( ξ , η ) = n L T u L = n B T a B .
Substitution of Equation 14 into Equation 25 gives:
R n B T u L = n B T a B n B T R T u L = n B T a B R T u L = a B .
Substituting Equation 26 into Equation 24, we receive:
K B a B = f B , Q . E . D . .
Preprints 159269 i005

3.4. Numerical Verification

In addition to the above theoretical presentation, we also demonstrate the numerical coincidence (and a small difference regarding the condition number) in the following BVP (Example 1) that is characterized by different polynomial degrees in each direction and a non-polynomial exact solution.
Example 1 : Heat-flow in rectangular sheet
Let us consider a square sheet of dimensions ( a = b = 1 ) in which Laplace equation dominates ( 2 U = 0 ) . The boundary conditions are partially Dirichlet and Neumann type, as shown in Figure 2a. The temperature along the top edge is given as
U ( x , y = b ) = U m cos π x 2 a , 0 x a .
The exact solution is given as:
U ( x , y ) = U m sinh π y 2 a sinh π b 2 a cos π x 2 a , 0 x a , 0 y b ;
whereas the error norm L 2 , is defined (in percent %) as:
L 2 = Ω ( u c a l c u l a t e d u e x a c t ) 2 d Ω Ω ( u e x a c t ) 2 d Ω 1 / 2 × 100 ( % ) .
Solution: The entire patch A B C D was discretized as a single tensor product element of 20 degrees of freedom (DOFs) shown in Figure 2b (with polynomial degrees p x = 3 and p y = 4 ), of which only nine DOFs are unrestrained. Using either Lagrange or Bernstein polynomials, the calculated error was found to be the same, equal to L 2 = 0.2035 % (coincidence until the 14th decimal point). The only difference in the two numerical solutions was the condition number of the equations’ matrix (of size 9 × 9 ), which was found equal to 41.8 and 55.3 for Lagrange and Bernstein polynomials, respectively. To further investigate the relationship between equivalent Lagrange and Bernstein polynomials, in the tensor product we used non-uniform Lagrange polynomials toward the y-direction, with nodal points at y = 0.0 , 0.3 , 0.6 , 0.8 (or 0.85 ) , 1.0 (i.e., slightly refined close to the top edge DC). It was found that, in the formulation using nonuniform Lagrange polynomials, the L 2 -norm was insensitive (it changed with respect to the above uniform solution only after the 13rd decimal point). In contrast, the condition number was sensitive, since it varied between 37.7 and 53.2 for the ordinate of the nodal point 13 below the corner D shown in Figure 2b, with y 13 = 0.85 and y 13 = 0.80 , respectively. Despite the non-uniform location of nodal points in the y-direction, the linear mapping was preserved (i.e., y ( ξ , η ) = η ) and (closely related) the determinant of the Jacobian was always constant, equal to unity. Moreover, in the formulation using Bernstein polynomials, it is critical to preserve the control points at their initial uniform positions to ensure this linear mapping (and not to move them at the nonuniform nodal points of the Lagrange-based model), and then (obviously) the L 2 -norm is preserved the same as in Lagrange polynomials formulation (since nothing changes), otherwise the Jacobian becomes variable and the L 2 error norm substantially increases.
Comparing the two column-vectrs in Equation 13, one may observe that in tensor products Bernstein polynomials, it is merely necessary to substitute Lagrange polynomials with Bernstein polynomials of the same degree. Nevertheless, it is still unknown whether this receipe can be extended to other classes of non-tensor product macroelements. One of this class refers to the traditional transfinite elements which are similar to the tensor product, thus of structured form, but many nodes of the ideal tensor-prduct are missing. This case is fully studied in Section 4.

3.5. Cross-Check

The same result with Equation 15 can be obtained performing the operations in Equation 6. For the 9-node element with node numbering according to Figure 1b, each of the transformation matrices T x = T y is equal to the 3 × 3 matrix shown in the right-hand side of Equation 8. The matrices A and U include the following entries:
A = a 1 a 4 a 7 a 2 a 5 a 8 a 3 a 6 a 9 and U = U 1 U 4 U 7 U 2 U 5 U 8 U 3 U 6 U 9 .
The interested reader may also consult a MATLAB script given in Appendix A, which performs the comparison between the matrix A (of size 3 × 3 ) with the column-vector A ˜ (of size 9 × 1 ), which is calculated through Equation 15 and is defined as
A ˜ = a 1 a 2 a 3 a 4 a 5 a 6 a 7 a 8 a 9 T .

4. Traditional Transfinite Elements

Traditional transfinite elements cover the entire or a large portion of a parametric quadrilateral patch A B C D . They consist of nodes ordered along horizontal and vertical stations (cuts) which are perpendicular to the ξ and η parametric axes, and are very similar to the 21-node element shown in Figure 3. Traditionlly, the transfinite elements are characterized by the following two functional sets:
  • Blending functions. For each direction ( ξ or η ), the number of blending functions equals to the number n s t of corresponding sections, and thus their polynomial degree ( p ξ or p η , accordingly) equals to ( n s t 1 ) . For example, in the 21-node element shown in Figure 3, there are three stations per direction and thus p ξ = p η = 2 . Perpendicularly to the ξ -direction (toward η -axis), the first vertical station is the edge AD (with nodes 1-6-9-14-17), the second vertical station consists of the nodes (3-7-11-15-19) and the third one includes the nodes along edge BC (with nodes 5-8-13-16-21). Similarly, perpendicularly to η -direction (toward ξ -axis), there are also three horizontal stations, i.e., the edge AB (with nodes 1-to-5), the isoline made of nodes (9-10-11-12-13), and eventually the edge DC (with nodes 17-to-21).
  • Trial functions. These refer to the interpolation along the stations. In this example, each station consists of 5 nodes (4 node spans), and thus the polynomial degree will be p ξ = 4 (e.g. along the horizontal edge A B ), and similarly p η = 4 (e.g. along the vertical edge A D ). In general (for other discretizations), we may have p ξ p η .
One may observe that this specific 21-node element may be produced from a tensor product of size 5 × 5 (25 nodes), from which 4 nodes (i.e., the centers of the four cells: 1-3-11-9, 3-5-13-11, etc.) are missing. Elements of this type have been extensively studied by their originators [7] as well as by later researchers (the reader is addressed to a specific monograph [8] and a later paper [9]). At this point, we must point out that the utilization of Lagrange polynomials in transfinite formulation is very clear and reasonable (however heuristic), as follows. The blending functions interpolate the quantity U ( ξ , η ) along the horizontal and vertical stations independently (thus forming the projectors P ξ and P η ), and then perform a bivariate correction by subtracting the projector P ξ η .
While the utilization of Lagrange polynomials in traditional transfinite elements is very clear, the same is not the case for the Bernstein ones. It has been previously discussed that Bernstein and Lagrange polynomials are mathematically equivalent for the same degree, in the sense that the first set is a linear transformation of the second, and vice versa [4,5]. While this fact holds for a tensor product, it is not yet clear whether it is also valid in other situations. For example, a previous intuitive study has shown that non-tensor-product traditional transfinite elements based on Lagrange polynomials may be easily treated by Bernstein polynomials, merely substituting the former by the latter polynomials of the same degree in the final expression of shape functions, for both the blending and trial functions [4]. Nevertheless, not a rigorous explanation has been provided so far.
In the paper at hand, we shall investigate in detail the deeper reasons for the numerical coincidence in the reported accuracy between Lagrange and Bernstein polynomials, and whether it is only a matter of substituting polynomials of the same degree.

4.1. General Relationships Between Initial and Transformed Bases

Before going on, it is worth mentioning that on any change of basis there are some standard relationships between the quantities of the two sets. A special discussion on the symmetric eigenvalue problem may be found in Ref. [2](pp. 51-60). In more detail, let { ϕ } be the column-vector of all the shape functions, { x } the vector of the Cartesian coordinates of nodal points, and { U } the nodal displacements (potentials) in the system of Lagrange polynomials. Moreover, in the Bernstein set the corresponding shape functions are { ψ } , the control points are { x c } , and the coefficients (generalized coordinates) are { a } . Between Lagrange and Bernstein-based systems, we have the following linear relationships:
For the shape functions we have:
{ ϕ ( ξ , η ) } = R { ψ ( ξ , η ) } .
For the degrees of freedom (DOF) we have:
{ a } = R T { U } .
One may observe that the above matrix formulations are consistent to the expressions of the dependent variable U ( ξ , η ) in the two systems, as follows:
U ( ξ , η ) = { ϕ } T { U } = { ψ } T { a } .
To determine the control points which define the same parameterization in both systems, we adopt the isoparametric concept (very similar to Equation 35):
x ( ξ , η ) = { ϕ } T { x n o d a l } = { ψ } T { x c } ,
and thus, the analogous expression with Equation 34 for the control points is:
{ x c } = R T { x } .

4.2. Structured Transfinite Elements

In this subsection we focus on the traditional structured transfinite elements, which are characterized by some horizontal and vertical stations that are subdivided by several nodes as the 21-node element shown in Figure 3. The characteristic of this element, and similar ones, is the same number and the same location of nodal points along all parallel stations to one direction, separately. It has been discussed in [4] that, taking into consideration that the blending functions are quadratic Lagrange polynomials (because there are three parallel stations per direction) whereas the trial functions are quintic Lagrange polynomials (because there are five nodes per station), the three projectors ( P ξ , P η , P ξ η ) of the Boolean sum can be constructed. To shorten their presentation, here we prefer an alternative, that is the following robust matrix formulation:
P ξ = L 1 , 4 ( η ) L 2 , 4 ( η ) L 3 , 4 ( η ) L 4 , 4 ( η ) L 5 , 4 ( η ) L 5 , y T U 1 U 3 U 5 U 6 U 7 U 8 U 9 U 11 U 13 U 14 U 15 U 16 U 17 U 19 U 21 U ξ L 1 , 2 ( ξ ) L 2 , 2 ( ξ ) L 3 , 2 ( ξ ) L 3 , x
P η = L 1 , 4 ( ξ ) L 2 , 4 ( ξ ) L 3 , 4 ( ξ ) L 4 , 4 ( ξ ) L 5 , 4 ( ξ ) L 5 , x T U 1 U 9 U 17 U 2 U 10 U 18 U 3 U 11 U 19 U 4 U 12 U 20 U 5 U 13 U 21 U η L 1 , 2 ( η ) L 2 , 2 ( η ) L 3 , 2 ( η ) L 3 , y
and
P ξ η = L 1 , 2 ( ξ ) L 2 , 2 ( ξ ) L 3 , 2 ( ξ ) L 3 , x T U 1 U 9 U 17 U 3 U 11 U 19 U 5 U 13 U 21 U ξ η L 1 , 2 ( η ) L 2 , 2 ( η ) L 3 , 2 ( η ) L 3 , y
According to the standard theory [9], the transfinite interpolation of the bivariate dependent variable U ( ξ , η ) is given, in terms of three projectors, as:
U ( ξ , η ) = P ξ + P η P ξ η .
Substituting the three projectors, i.e., Equations 38 to 40 into Equation 41, extraction of coefficients gives the expression:
U ( ξ , η ) = j = 1 21 ϕ j ( ξ , η ) U j ,
where the global bivariate shape functions ϕ j are given in terms of Lagrange polynomials by:
ϕ 1 ( ξ , η ) = L 1 , 2 ( ξ ) L 1 , 4 ( η ) + L 1 , 4 ( ξ ) L 1 , 2 ( η ) L 1 , 2 ( ξ ) L 1 , 2 ( η ) , ϕ 2 ( ξ , η ) = L 2 , 4 ( ξ ) L 1 , 2 ( η ) , ϕ 3 ( ξ , η ) = L 2 , 2 ( ξ ) L 1 , 4 ( η ) + L 3 , 4 ( ξ ) L 1 , 2 ( η ) L 2 , 2 ξ ) L 1 , 2 ( η ) , ϕ 4 ( ξ , η ) = L 4 , 4 ( ξ ) L 1 , 2 ( η ) , ϕ 5 ( ξ , η ) = L 3 , 2 ( ξ ) L 1 , 4 ( η ) + L 5 , 4 ( ξ ) L 1 , 2 ( η ) L 3 , 2 ( ξ ) L 1 , 2 ( η ) , ϕ 6 ( ξ , η ) = L 1 , 2 ( ξ ) L 2 , 4 ( η ) , ϕ 7 ( ξ , η ) = L 2 , 2 ( ξ ) L 2 , 4 ( η ) , ϕ 8 ( ξ , η ) = L 3 , 2 ( ξ ) L 2 , 4 ( η ) , ϕ 9 ( ξ , η ) = L 1 , 2 ( ξ ) L 3 , 4 ( η ) + L 1 , 4 ( ξ ) L 2 , 2 ( η ) L 1 , 2 ( ξ ) L 2 , 2 ( η ) , ϕ 10 ( ξ , η ) = L 2 , 4 ( ξ ) L 2 , 2 ( η ) , ϕ 11 ( ξ , η ) = L 2 , 2 ( ξ ) L 3 , 4 ( η ) + L 3 , 4 ( ξ ) L 2 , 2 ( η ) L 2 , 2 ( ξ ) L 2 , 2 ( η ) , ϕ 12 ( ξ , η ) = L 4 , 4 ( ξ ) L 2 , 2 ( η ) , ϕ 13 ( ξ , η ) = L 3 , 2 ( ξ ) L 3 , 4 ( η ) + L 5 , 4 ( ξ ) L 2 , 2 ( η ) L 3 , 2 ( ξ ) L 2 , 2 ( η ) , ϕ 14 ( ξ , η ) = L 1 , 2 ( ξ ) L 4 , 4 ( η ) , ϕ 15 ( ξ , η ) = L 2 , 2 ( ξ ) L 4 , 4 ( η ) , ϕ 16 ( ξ , η ) = L 3 , 2 ( ξ ) L 4 , 4 ( η ) , ϕ 17 ( ξ , η ) = L 1 , 2 ( ξ ) L 5 , 4 ( η ) + L 1 , 4 ( ξ ) L 3 , 2 ( η ) L 1 , 2 ( ξ ) L 3 , 2 ( η ) , ϕ 18 ( ξ , η ) = L 2 , 4 ( ξ ) L 3 , 2 ( η ) , ϕ 19 ( ξ , η ) = L 2 , 2 ( ξ ) L 5 , 4 ( η ) + L 3 , 4 ( ξ ) L 3 , 2 ( η ) L 2 , 2 ( ξ ) L 3 , 2 ( η ) , ϕ 20 ( ξ , η ) = L 4 , 4 ( ξ ) L 3 , 2 ( η ) , ϕ 21 ( ξ , η ) = L 3 , 2 ( ξ ) L 5 , 4 ( η ) + L 5 , 4 ( ξ ) L 3 , 2 ( η ) L 3 , 2 ( ξ ) L 3 , 2 ( η ) .
If we return to Equations 38 to 40, we can easily replace the univariate row and column vectors of the Lagrange polynomials ( L x or L y ) by the equal products of the transformation matrices ( T x or T y ) times the corresponding vector of Bernstein polynomials ( B x or B y ) according to Equations 3 and 4. Then, in short notation, Equation 41 becomes:
U ( ξ , η ) = ( L 5 , y T ) [ U ξ ] ( L 3 , x ) + ( L 5 , x T ) [ U η ] ( L 3 , y ) ( L 3 , x T ) [ U ξ η ] ( L 3 , y ) = ( B 5 , y T ) ( T 5 , y T ) [ U ξ ] ( T ˜ 3 , x ) [ A ξ ] ( B 3 , x ) + ( B 5 , x T ) ( T 5 , x T ) [ U η ] ( T ˜ 3 , y ) [ A η ] ( B 3 , y ) ( B 3 , x T ) ( T 3 , x T ) [ U ξ η ] ( T ˜ 3 , y ) [ A ξ η ] ( B 3 , y ) .
One may observe that the right-hand side of Equation 44 includes three matrices, of which the entries are linear combinations of the U i ’s (obviously, they represent generalized coefficients), i.e.:
[ A ξ ] = ( T 5 , y T ) [ U ξ ] ( T ˜ 3 , x )
A η ] = ( T 5 , x T ) [ U η ] ( T ˜ 3 , y )
A ξ η ] = ( T 3 , x T ) [ U ξ η ] ( T ˜ 3 , y ) ,
and thus Equation 44 can be written as:
U ( ξ , η ) = ( B 5 , y T ) [ A ξ ] ( B 3 , x ) + ( B 5 , x T ) [ A η ] ( B 3 , y ) ( B 3 , x T ) [ A ξ η ] ( B 3 , y ) .
From the two equalities of Equation 44, which are very similar, the first in terms of Lagrange and the second in terms of Bernstein polynomials, one may easily understand that the two sets of Lagrange polynomials in Equation 43, i.e., those of degree p x = p y = 2 and p x = p y = 4 , are replaced by Bernstein polynomials of the same degree, one-by-one. Therefore, the second equality of Equation 44 eventually leads to the expression:
U ( ξ , η ) = j = 1 21 ψ j ( ξ , η ) a j ,
where a j are the generalized coordinates (DOF in Bernstein system). Moreover, the produced functional set is quite equivalent, given by:
ψ 1 ( ξ , η ) = B 1 , 2 ( ξ ) B 1 , 4 ( η ) + B 1 , 4 ( ξ ) B 1 , 2 ( η ) B 1 , 2 ( ξ ) B 1 , 2 ( η ) , ψ 2 ( ξ , η ) = B 2 , 4 ( ξ ) B 1 , 2 ( η ) , ψ 3 ( ξ , η ) = B 2 , 2 ( ξ ) B 1 , 4 ( η ) + B 3 , 4 ( ξ ) B 1 , 2 ( η ) B 2 , 2 ξ ) B 1 , 2 ( η ) , ψ 4 ( ξ , η ) = B 4 , 4 ( ξ ) B 1 , 2 ( η ) , ψ 5 ( ξ , η ) = B 3 , 2 ( ξ ) B 1 , 4 ( η ) + B 5 , 4 ( ξ ) B 1 , 2 ( η ) B 3 , 2 ( ξ ) B 1 , 2 ( η ) , ψ 6 ( ξ , η ) = B 1 , 2 ( ξ ) B 2 , 4 ( η ) , ψ 7 ( ξ , η ) = B 2 , 2 ( ξ ) B 2 , 4 ( η ) , ψ 8 ( ξ , η ) = B 3 , 2 ( ξ ) B 2 , 4 ( η ) , ψ 9 ( ξ , η ) = B 1 , 2 ( ξ ) B 3 , 4 ( η ) + B 1 , 4 ( ξ ) B 2 , 2 ( η ) B 1 , 2 ( ξ ) B 2 , 2 ( η ) , ψ 10 ( ξ , η ) = B 2 , 4 ( ξ ) B 2 , 2 ( η ) , ψ 11 ( ξ , η ) = B 2 , 2 ( ξ ) B 3 , 4 ( η ) + B 3 , 4 ( ξ ) B 2 , 2 ( η ) B 2 , 2 ( ξ ) B 2 , 2 ( η ) , ψ 12 ( ξ , η ) = B 4 , 4 ( ξ ) B 2 , 2 ( η ) , ψ 13 ( ξ , η ) = B 3 , 2 ( ξ ) B 3 , 4 ( η ) + B 5 , 4 ( ξ ) B 2 , 2 ( η ) B 3 , 2 ( ξ ) B 2 , 2 ( η ) , ψ 14 ( ξ , η ) = B 1 , 2 ( ξ ) B 4 , 4 ( η ) , ψ 15 ( ξ , η ) = B 2 , 2 ( ξ ) B 4 , 4 ( η ) , ψ 16 ( ξ , η ) = B 3 , 2 ( ξ ) B 4 , 4 ( η ) , ψ 17 ( ξ , η ) = B 1 , 2 ( ξ ) B 5 , 4 ( η ) + B 1 , 4 ( ξ ) B 3 , 2 ( η ) B 1 , 2 ( ξ ) B 3 , 2 ( η ) , ψ 18 ( ξ , η ) = B 2 , 4 ( ξ ) B 3 , 2 ( η ) , ψ 19 ( ξ , η ) = B 2 , 2 ( ξ ) B 5 , 4 ( η ) + B 3 , 4 ( ξ ) B 3 , 2 ( η ) B 2 , 2 ( ξ ) B 3 , 2 ( η ) , ψ 20 ( ξ , η ) = B 4 , 4 ( ξ ) B 3 , 2 ( η ) , ψ 21 ( ξ , η ) = B 3 , 2 ( ξ ) B 5 , 4 ( η ) + B 5 , 4 ( ξ ) B 3 , 2 ( η ) B 3 , 2 ( ξ ) B 3 , 2 ( η ) .
Interestingly, the three matrices, i.e., ( [ A ξ ] , [ A η ] and [ A ξ η ] ), do not have the structured form of ( [ U ξ ] , [ U η ] and [ U ξ η ] ) shown in Equation 38 to 40, but are influenced by all the coefficients a i ’s ( i = 1 , , 21 ) in a rather complicated way. This in turn means that the three projectors do not preserve their form in the two functional systems separately, but the totality in their Boolean sum (Equation 41) does so.
Furthermore, using their actual binomial forms and equating the coefficients of the same monomials in both systems (Lagrange, Bernstein), it can be shown (and is easily validated) that the two functional sets, i.e., { ϕ } = [ ϕ 1 , , ϕ 21 ] T and { ψ } = [ ψ 1 , , ψ 21 ] T are linearly interrelated according to Equation 33, where the transformation matrix is given as:
R = 1 13 / 12 13 / 18 1 / 4 0 13 / 12 1 0 13 / 18 1 13 / 36 1 / 36 0 1 / 4 1 / 36 0 0 0 0 0 0 0 4 32 / 9 4 / 3 0 0 2 / 3 0 0 8 / 3 8 / 9 4 / 3 0 0 10 / 9 0 0 0 0 0 0 0 3 20 / 3 3 0 0 7 / 4 0 0 15 / 4 1 / 3 15 / 4 0 0 29 / 12 0 0 0 0 0 0 0 1 / 4 13 / 18 13 / 12 1 0 1 13 / 12 0 1 / 36 13 / 36 1 13 / 18 0 1 / 36 1 / 4 0 0 0 0 0 0 0 0 0 0 4 8 / 3 0 0 32 / 9 2 / 3 8 / 9 10 / 9 0 4 / 3 4 / 3 0 0 0 0 0 0 0 0 0 0 0 28 / 3 0 0 4 16 / 3 4 0 0 4 0 0 0 0 0 0 0 0 0 0 0 0 8 / 3 4 0 10 / 9 8 / 9 2 / 3 32 / 9 0 4 / 3 4 / 3 0 0 0 0 0 0 0 0 0 0 3 15 / 4 0 20 / 3 7 / 4 1 / 3 29 / 12 0 3 15 / 4 0 0 0 0 0 0 0 0 0 0 0 0 4 0 0 28 / 3 16 / 3 4 0 0 4 0 0 0 0 0 0 0 0 0 0 0 0 5 / 2 0 0 5 / 2 18 5 / 2 0 0 5 / 2 0 0 0 0 0 0 0 0 0 0 0 0 4 0 0 4 16 / 3 28 / 3 0 0 4 0 0 0 0 0 0 0 0 0 0 0 0 15 / 4 3 0 29 / 12 1 / 3 7 / 4 20 / 3 0 15 / 4 3 0 0 0 0 0 0 0 0 0 0 4 / 3 4 / 3 0 32 / 9 2 / 3 8 / 9 10 / 9 0 4 8 / 3 0 0 0 0 0 0 0 0 0 0 0 0 4 0 0 4 16 / 3 4 0 0 28 / 3 0 0 0 0 0 0 0 0 0 0 0 0 4 / 3 4 / 3 0 10 / 9 8 / 9 2 / 3 32 / 9 0 8 / 3 0 0 0 0 0 0 0 0 0 0 0 1 / 4 1 / 36 0 13 / 18 1 13 / 36 1 / 36 0 13 / 12 1 0 1 13 / 12 13 / 18 1 / 4 0 0 0 0 0 0 0 10 / 9 0 0 8 / 3 8 / 9 4 / 3 0 0 2 / 3 0 0 4 32 / 9 4 / 3 0 0 0 0 0 0 0 29 / 12 0 0 15 / 4 1 / 3 15 / 4 0 0 7 / 4 0 0 3 20 / 3 3 0 0 0 0 0 0 0 10 / 9 0 0 4 / 3 8 / 9 8 / 3 0 0 2 / 3 0 0 4 / 3 32 / 9 4 0 0 0 0 0 0 0 1 / 36 1 / 4 0 1 / 36 13 / 36 1 13 / 18 0 1 13 / 12 0 1 / 4 13 / 18 13 / 12 1 .

4.3. Numerical Verification of 21-Node Traditional Transfinite Element

The 21-node transfinite element is one of the elements studied by the GMRL team in mid-1970s [9]. The nodal points are arranged along three stations per direction, in such a way that one node is missing for each of the four cells of this patch, to form the associated ideal tensor product.
We solved again the same problem (Laplace equation) with the same boundary conditions as in Example 1, but now using a single 21-node macroelement (Figure 3). In both formulations (Lagrange, Bernstein), the error norm was found to be L 2 = 0.0526 % . Obviously, this finding is consistent to the existence of the transformation matrix R (given by Equation 51) between these two functional sets, as discussed in Section 4.2.
Important remark: From the above discussion, it becomes obvious that, in tensor products and for traditional (structured) transfinite elements, the expressions of the basis functions using Bernstein polynomials are the same with those of shape functions using Lagrange polynomials, where the same degree is considered.

5. Distorted Tensor Products of Partially Unstructured Transfinite Elements

The meaning of this section is to investigate whether the same expression between Lagrange polynomials and Bernstein polynomials remains, for other transfinite configurations as well. So far, in addition to the tensor product (Figure 4a) and the structured transfinite elements (Figure 4b), partially unstructured elements like those illustrated in Figure 4c have been studied. The characteristic issues of these elements is that (i) the internal nodes form a tensor product (uniform or not) and (ii) the normal projection of the nodal points on all the four edges of the quadrilateral patch do not necessarily match with the nodal points on the boundary. In this class of elements, not only a deviation may occur in the position of the internal nodes compared to the boundary nodes, but also a different number may exist between the nodes of an edge and the internal ones parallel to it (for example, Figure 4d shows a standard of 3 nodes per direction whereas the intermidiate ones are 2 for edge B C , 5 for edge D C and 4 for edge A D ).
An older study [6] which dealt with six boundary-value problems, but also a recent one [5] concerning the approximation quality of a given function using its nodal values, have shown that:
  • Tensor product Lagrange and tensor product non-rational Bernstein polynomials lead to the same error norm, although the condition number of equationes system is generally different [6].
  • Traditional (structured) transfinite elements lead to the same error norm, either Lagrange or Bernstein polynomials are used [4,5].
We recall that in the first two categories regarding tensor product and traditional structured transfinite elements (Figure 4a,b), the paper at hand has theoretically shown (see, in Section 3 and Section 4, respectively), that Lagrange polynomials may merely be substituted by Bernstein polynomials of the same degree, and then the numerical resuts remain unchanged except of the condition number of equations system.
Regarding distorted tensor products of 25-node elements (Figure 4c), a very recent paper [5](p.22) has reported coincidence of the results, while a minor difference between Lagrange and Bernstein polynomials was reported for a 27-node element (Figure 4d). However, but the latter report is not reasonable, and therefore, the same example was studied again and the reason for the supposed difference is clarified below.

5.1. Simple Distortion

This section refers to elements of which the internal nodes are uniformly arranged, for example in the form of a tensor product, but the position of boundary nodes does not fully match to them (see, Figure 4c). In this case, Lagrange polynomials are used as uniform blending functions ( E i ( ξ ) and E j ( η ) , here of degree 4), whereas the trial functions ( L i ( ξ ) and L j ( η ) )) are uniform or non-uniform polynomials of also fourth degree. Clearly, the difference between blending and trial functions, both of degree p = 4 , is that the former are uniform whereas the latter are based on generally non-uniform node sequence along the four edges.

5.1.1. Closed-Form Expressions

It has been shown elsewhere (one of the most recent is [10] and papers therein), that despite the geometric distortion of the element, transfinite interpolation is applicable although it requires the use of auxiliary (artificial) nodes, which eventually are eliminated (the procedure is also shown in Sect.Section 5.2.1). Therefore, the analogue of Equation 43, based on the implementation of transfinite interpolation in conjunction with Lagrange polynomials only, is the following set of basis functions (we restrict the presentation to those associated with the bottom edge A B ):
ϕ 1 ( ξ , η ) = E 1 , 4 ( ξ ) L 1 , 4 A D ( η ) + L 1 , 4 A B ( ξ ) E 1 , 4 ( η ) E 1 , 4 ( ξ ) E 1 , 4 ( η ) , ϕ 2 ( ξ , η ) = L 2 , 4 A B ( ξ ) E 1 , 4 ( η ) , ϕ 3 ( ξ , η ) = L 3 , 4 A B ( ξ ) E 1 , 4 ( η ) , ϕ 4 ( ξ , η ) = L 4 , 4 A B ( ξ ) E 1 , 4 ( η ) , ϕ 5 ( ξ , η ) = E 5 , 4 ( ξ ) L 1 , 4 B C ( η ) + L 5 , 4 A B ( ξ ) E 1 , 4 ( η ) E 5 , 4 ( ξ ) L 1 , 4 ( η ) , .
In Equation 52, the superscripts ( A B ) and ( A D ) were set to denote the edges along which the non-uniform Lagrange polynomials operate. Clearly, Lagrange polynomials require uniform (evenly) and non-uniform (non equally spaced) sets of nodal points.
The utilization of Bernstein polynomials for the same element (Figure 4c) is not very obvious at a first glance. For example, with the exception of the four edges of the patch, interpolation along any isoline depends on all the coefficients a, thus not only on the degrees of freedom (or the coordinates) of the isoline under consideration. In contrast, the cardinality of Lagrange polynomials allows us for the abovementioned treatment through artifical nodes. In any case, in [5] it has been conjectured that Bernstein polynomals may operate for both the blending and trial functions, and thus the (uniform and non-uniform) Lagrange polynomials involved in Equation 50 are replaced by Bernstein polynomials of the same degree. Then, the analogue of Equation 50 will be:
ψ 1 ( ξ , η ) = B 1 , 4 ( ξ ) B 1 , 4 ( η ) + B 1 , 4 ( ξ ) B 1 , 4 ( η ) B 1 , 4 ( ξ ) B 1 , 4 ( η ) , ψ 2 ( ξ , η ) = B 2 , 4 ( ξ ) B 1 , 4 ( η ) , ψ 3 ( ξ , η ) = B 3 , 4 ( ξ ) B 1 , 4 ( η ) , ψ 4 ( ξ , η ) = B 4 , 4 ( ξ ) B 1 , 4 ( η ) , ψ 5 ( ξ , η ) = B 5 , 4 ( ξ ) B 1 , 4 ( η ) + B 5 , 4 ( ξ ) B 1 , 4 ( η ) B 5 , 4 ( ξ ) B 1 , 4 ( η ) , .
A careful inspection on Equation 53 reveals that the bivariate basis functions associated to the element shown in Figure 4c are merely the tensor products of Bernstein polynomials. In other words, and regarding distrorted tensor products, while the shape functions (associated with Lagrange polynomials) depend on the position of nodal points, the basis functions (associated with Bernstein polynomials) are constant (see Figure 5). Therefore, in case of Bernstein polynomials the distortion (symmetry break) is ‘absorbed’ by the generalized coefficients a i , i = 1 , , 25 . Not only that, but to derive the same results with those using Lagrange polynomials, it is necessary to put the control points x i j c at specific positions which are not the same with the Cartesian coordinates of the nodal points, but are interreleted with them through the well known expression:
x ( ξ , η ) = i = 1 5 j = 1 5 B i ( ξ ) B j ( η ) x i j c .
Collocating Equation 54 at the 25 nodal points involved in the Lagrange set, their coordinates x are included in the left-hand side, whereas the right-hand side includes the unknown control points for which we solve a system of 25 equations with 25 unknowns.

5.1.2. Numerical Verification

It is worth mentioning that, when Example 1 was solved using the two functional sets for the 25-node element, the error-norm was found to be identically equal to L 2 = 0.0232 % . The same error was found when we varied the position of the nodes along the three edges ( A B , B C , and A D ). A minor change was observed when we varied the position of three intermediate nodes along the top edge D C on which the non-homogeneous boundary conditions of Dirichlet type are imposed (e.g., for Cartesian coordinates x 22 = 0.2 , x 23 = 0.60 , x 24 = 0.8 in Lagrange model, and associated change in Bernstein model, in both formulations the error became L 2 = 0.0238 % ). Again, these findings were anticipated because the two functional systems are interrelated through an inherent transformation matrix R , according to Equation 14.

5.2. Distortion Combined with Node Refinement or Removal on Edges

In the previous section we discussed simple distortion of the patch A B C D , in which the boundary nodes had been moved from their initial position associated with the ideal tensor product. In this section we consider the same distortion, and in addition we modify the number of nodes on one or more edges. For example, in Figure 4d one may see that the edge A B is intact, one node has been subtracted from edge B C , two nodes have been added to edge D C , and one node has been added to edge A D . As a result, the ideal 25-node of Section 5.1 has been transformed to a 27-node transfinite element having 18 boundary and 9 internal nodes.
In the set of Lagrange polynomials, the shape functions have the form of those involved in Equation 43, which means that:
  • Shape functions associated with corner nodes, consist of three terms (influenced by all the three projectors P ξ , P η , P ξ η ).
  • Shape functions associated with intermediate nodes on the edges, consist of one term, which is related to the projector having as subscript the axis perpendicular to the current edge. For example, the shape functions of nodes along edge A B are influenced by only the projector P η .
  • Shape functions associated with internal nodes equal to the tensor product of the blending functions only.
Typical expressions, one for each category are given in Equation 55 below:
Corner node : ϕ 1 ( ξ , η ) = E 1 ( ξ ) L 1 ( η ) + E 1 ( η ) L 1 ( ξ ) E 1 ( ξ ) E 1 ( η ) Intermediate to A B : ϕ 2 ( ξ , η ) = E 1 ( η ) L 2 ( ξ ) Internal node : ϕ 19 ( ξ , η ) = E 1 ( ξ ) E 1 ( η ) .
Not still having a rigorous mathematical foundation but only the previous numerical experience, a reasonable choice is to replace the blending functions, from Lagrange polynomials of fourth degree by Bernstein polynomials of the same degree, i.e.:
E 1 = ( 1 s ) 4 , E 2 = 4 ( 1 s ) 3 s , E 3 = 6 ( 1 s ) 2 s 2 , E 4 = 4 ( 1 s ) s 3 , E 5 = s 4 ,
where s represents either of the parameters ξ or η . Similarly, the trial functions along the edges A B to D A which are Lagrange polynomials of degree 4,3,6, and 5, respectively, are substituted by Bernstein polynomials of the same degree, as shown in Equation 57 below:
Corner DOF : ψ 1 ( ξ , η ) = B 1 , 4 ( ξ ) B 1 , 5 ( η ) + B 1 , 4 ( η ) B 1 , 4 ( ξ ) B 1 , 4 ( ξ ) B 1 , 4 ( η ) Intermediate to A B : ψ 2 ( ξ , η ) = B 1 , 4 ( η ) B 2 , 4 ( ξ ) Internal DOF : ψ 19 ( ξ , η ) = B 1 , 4 ( ξ ) B 1 , 4 ( η ) .
In both cases, the shape (bivariate Lagrange) and basis (bivariate Bernstein) functions fulfil the partition of unity (rigid-body) and the constant strain property, as shown in Equation 58 below:
i = 1 27 ϕ i ( ξ , η ) = 1 , i = 1 27 ψ i ( ξ , η ) = 1 , i = 1 27 ϕ i ( ξ , η ) ξ = 0 , i = 1 27 ψ i ( ξ , η ) ξ = 0 , i = 1 27 ϕ i ( ξ , η ) η = 0 , i = 1 27 ψ i ( ξ , η ) η = 0 .
Moreover, in bot cases the determinant of the Jacobian equals to unity (det ( J ) = 0 ), which implies that the mapping from the parametric space to the physical space is affine (or identity-like in behavior) over a square.

5.2.1. Justification

An explanation for the above discrepancy is provided below. When working in conjunction with Lagrange polynomials (which directly refer to the nodal values U i ), the mechanism to derive the bivariate interpolation is the transfinite interpolation [9]. In this context, the blending functions E i ( ξ ) interpolate functions U ( ξ ¯ , η ) along isolines which are perpendicular to ξ -axis at positions ξ ¯ , and this interpolation is the projector P ξ . Similarly, the blending functions E j ( η ) interpolate functions U ( ξ , η ¯ ) along isolines which are perpendicular to η -axis at positions η ¯ , and this interpolation is the projector P η . Moreover, to avoid repetion of values when the sum P ξ + P η is performed, a corrective term P ξ η is considered as well. The final interpolation follows the Boolean sum shown in Equation 41 (i.e., P ξ P η = P ξ + P η P ξ η ).
In the example of the 27-node transfinite element shown again in Figure 6, a characteristic is that the orthogonal projections of some internal nodes onto the edges do not coincide with existing nodes (here all internal nodes suffer at least in one direction). Thus, ‘artificial nodes’ ( E , F , G , H , I , J , K , L ) are introduced to make up the missing starting or/and ending nodal points of relevant sequence of Lagrange polynomials, so that the expression of the abovementioned functions U ( ξ ¯ , η ) and U ( ξ , η ¯ ) becomes possible.
We recall that the corrective projector P ξ η includes all the ( 5 × 5 ) intersections between five stations per direction, and thus may be written in terms of primary and artificial (red-colored) nodes as
P ξ η = E 1 , 4 ( ξ ) E 2 , 4 ( ξ ) E 3 , 4 ( ξ ) E 4 , 4 ( ξ ) E 5 , 4 ( ξ ) E 5 T ( ξ ) U 1 U E U G U I U 14 U 2 U 19 U 22 U 25 U K U 3 U 20 U 23 U 26 U 11 U 4 U 21 U 24 U 27 U L U 5 U F U H U J U 8 U i n t E 1 , 4 ( η ) E 2 , 4 ( η ) E 3 , 4 ( η ) E 4 , 4 ( η ) E 5 , 4 ( η ) E 5 ( η )
Obviously, each vector including blending functions (Lagrange polynomials of degree 5) can be substituted by Bernstein polynomials of degree 5 as well, where
E 5 = T 5 B 5 , .
with
T 5 = 1 77 / 60 269 / 240 77 / 120 1 / 5 0 0 5 145 / 24 185 / 48 5 / 4 0 0 5 295 / 24 115 / 12 10 / 3 0 0 10 / 3 115 / 12 295 / 24 5 0 0 5 / 4 185 / 48 145 / 24 5 0 0 1 / 5 77 / 120 269 / 240 77 / 60 1
This in turn means that the projector P ξ η preserves its form after transformation, of Lagrange by Bernstein polynomials, which then becomes:
P ξ η = B 5 T ( ξ ) ( T 5 T U i n t T 5 ) B 5 ( η ) .
On the other hand, the projector P ξ includes some of the primary nodes (1 to 27) and some of the artificial nodes. In more detail:
  • The function U ( 0 , η ) consists of six nodal values ( U 1 , U 18 , U 17 , U 16 , U 15 , U 14 ) , which define 5 node spans and fully define a polynomial of degree 5. Note that the artificial nodes ( E , J , I ) are not included because they are not needed.
  • The function U ( 1 4 , η ) consists of 5 nodal values ( U 2 , U 19 , U 22 , U 25 , U K ) (4 node spans), and thus fully define a polynomial of degree 4. Note that the artificial node K, on the boundary, is required to determine the missing end of nodal sequence.
  • The function U ( 1 2 , η ) consists of 5 nodal values ( U 3 , U 20 , U 23 , U 26 , U 11 ) (4 node spans), and thus fully define a polynomial of degree 4. All entries of nodal sequance are primary nodes which belong to the 27-node element.
  • The function U ( 3 4 , η ) consists of 5 nodal values ( U 4 , U 21 , U 24 , U 27 , U L ) (4 node spans), and thus fully define a polynomial of degree 4. Note that the artificial node L is required to determine the missing end of nodal sequence.
  • The function U ( 1 , η ) consists of four nodal values ( U 5 , U 6 , U 7 , U 8 ) , which define 3 node spans and fully define a polynomial of degree 3. Note that the artificial nodes ( F , H , J ) , on the boundary, are not included because they are not needed.
The abovementioned different number of nodes along the isolines at ( ξ = 0 , 1 4 , 1 2 , 3 4 , 1 ) , does not allow for an elegant mathematical form as that in Equation 59. This means that neither a row vector of the Lagrange polynomials in η can be extracted as a common factor, nor the next matrix of the nodal values is fully populated. Therefore, we write P ξ in a conventional manner as follows:
P ξ = L 1 , 5 ( η ) L 2 , 5 ( η ) L 3 , 5 ( η ) L 4 , 5 ( η ) L 5 , 5 ( η ) L 6 , 5 ( η ) E 5 T ( η ) U 1 U 18 U 17 U 16 U 15 U 14 E 1 , 4 ( ξ ) + L 1 , 4 ( η ) L 2 , 4 ( η ) L 3 , 4 ( η ) L 4 , 4 ( η ) L 5 , 4 ( η ) E 4 T ( η ) U 2 U 19 U 22 U 25 U K E 2 , 4 ( ξ ) + L 1 , 4 ( η ) L 2 , 4 ( η ) L 3 , 4 ( η ) L 4 , 4 ( η ) L 5 , 4 ( η ) E 4 T ( η ) U 3 U 20 U 23 U 26 U 11 E 3 , 4 ( ξ ) + L 1 , 4 ( η ) L 2 , 4 ( η ) L 3 , 4 ( η ) L 4 , 4 ( η ) L 5 , 4 ( η ) E 4 T ( η ) U 4 U 21 U 24 U 27 U K E 4 , 4 ( ξ ) + L 1 , 3 ( η ) L 2 , 3 ( η ) L 3 , 3 ( η ) L 4 , 3 ( η ) E 3 T ( η ) U 5 U 6 U 7 U 8 E 5 , 4 ( ξ ) .
One may observe in Equation 63 that only two out of the eight artificial nodes ( U K , U L ) are included in P ξ .
Similar observations may be made for projector P η , which can be written as follows:
P η = L 1 , 4 ( ξ ) L 2 , 4 ( ξ ) L 3 , 4 ( ξ ) L 4 , 4 ( ξ ) L 5 , 4 ( ξ ) E 4 T ( ξ ) U 1 U 2 U 3 U 4 U 5 E 1 , 4 ( η ) + L 1 , 4 ( ξ ) L 2 , 4 ( ξ ) L 3 , 4 ( ξ ) L 4 , 4 ( ξ ) L 5 , 4 ( ξ ) E 4 T ( ξ ) U E U 19 U 20 U 21 U F E 2 , 4 ( η ) + U G L 2 , 4 ( ξ ) L 3 , 4 ( ξ ) L 4 , 4 ( ξ ) L 5 , 4 ( ξ ) E 4 T ( ξ ) U G U 22 U 23 U 24 U H E 3 , 4 ( η ) + L 1 , 4 ( ξ ) L 2 , 4 ( ξ ) L 3 , 4 ( ξ ) L 4 , 4 ( ξ ) L 5 , 4 ( ξ ) E 4 T ( ξ ) U I U 25 U 26 U 27 U J E 4 , 4 ( η ) + L 1 , 6 ( ξ ) L 2 , 6 ( ξ ) L 3 , 6 ( ξ ) L 4 , 6 ( ξ ) L 5 , 6 ( ξ ) L 6 , 6 ( ξ ) L 7 , 6 ( ξ ) E 6 T ( ξ ) U 14 U 13 U 12 U 11 U 10 U 9 U 8 E 5 , 4 ( η ) .
One may observe in Equation 64 that six out of the eight artificial nodes ( U E , U F , U G , U H , U I , U J ) are included in P η .
In summary:
  • The projector P ξ includes 2 out of the 8 artificial nodal values.
  • The projector P η includes the rest 6 out of the 8 artificial nodal values.
  • The subtractive corrective projector P ξ η includes all the 8 artificial nodes.
Interestingly, for every chosen artificial nodal value, for example for U E , the unique associated term E 1 , 4 ( ξ ) U E E 2 , 4 ( η ) in P η is cancelled by the corresponding opposite term cited in P ξ η . Totally, one may verify that two terms of P ξ and six terms of P η , which include artficial DOFs, are cancelled by the corresponding eight terms in P ξ η , and thus are eventually eliminated. As a result, the Boolean sum P ξ P η = P ξ + P η P ξ η will contain only the 27 primary DOFs which define the 27-node transfinite element. In more details, the terms related to the eight auxiliary (artificial) points vanish, as follows:
  • We notice the terms: U E E 1 , 4 ( ξ ) E 2 , 4 ( η ) E 1 , 4 ( ξ ) E 2 , 4 ( η ) , coming from P η and P ξ η .
  • We notice the terms: U F [ E 5 , 4 ( ξ ) E 2 , 4 ( η ) E 5 , 4 ( ξ ) E 2 , 4 ( η ) ] , coming from P η and P ξ η .
  • We notice the terms: U G E 1 , 4 ( ξ ) E 3 , 4 ( η ) E 1 , 4 ( ξ ) E 3 , 4 ( η ) , coming from P η and P ξ η .
  • We notice the terms: U H [ E 5 , 4 ( ξ ) E 3 , 4 ( η ) E 5 , 4 ( ξ ) E 3 , 4 ( η ) ] , coming from P η and P ξ η .
  • We notice the terms: U I E 1 , 4 ( ξ ) E 4 , 4 ( η ) E 1 , 4 ( ξ ) E 4 , 4 ( η ) , coming from P η and P ξ η .
  • We notice the terms: U J [ E 5 , 4 ( ξ ) E 4 , 4 ( η ) E 5 , 4 ( ξ ) E 4 , 4 ( η ) ] , coming from P η and P ξ η .
  • We notice the terms: U K [ E 2 , 4 ( ξ ) E 5 , 4 ( η ) E 2 , 4 ( ξ ) E 5 , 4 ( η ) ] , coming from P ξ and P ξ η .
  • We notice the terms: U L [ E 4 , 4 ( ξ ) E 5 , 4 ( η ) E 4 , 4 ( ξ ) E 5 , 4 ( η ) ] , coming from P ξ and P ξ η .
Substituting Equations 59, 63 and 64 into the Boolean sum U = P ξ + P η + P ξ η , for the Lagrange based system, the latter gives the following shape functions (see also in Figure 7a):
ϕ 1 ( ξ , η ) = L 1 , 4 ( ξ ) L 1 , 5 ( η ) , ϕ 2 ( ξ , η ) = L 2 , 4 ( ξ ) L 1 , 4 ( η ) , ϕ 3 ( ξ , η ) = L 3 , 4 ( ξ ) L 1 , 4 ( η ) , ϕ 4 ( ξ , η ) = L 4 , 4 ( ξ ) L 1 , 4 ( η ) , ϕ 5 ( ξ , η ) = L 5 , 4 ( ξ ) L 1 , 3 ( η ) , ϕ 6 ( ξ , η ) = L 5 , 4 ( ξ ) L 2 , 3 ( η ) , ϕ 7 ( ξ , η ) = L 5 , 4 ( ξ ) L 3 , 3 ( η ) , ϕ 8 ( ξ , η ) = L 4 , 3 ( η ) L 5 , 4 ( ξ ) L 5 , 4 ( ξ ) L 5 , 4 ( η ) + L 5 , 4 ( η ) L 7 , 6 ( ξ ) , ϕ 9 ( ξ , η ) = L 5 4 ( η ) L 6 , 6 ( ξ ) , ϕ 10 ( ξ , η ) = L 5 4 ( η ) L 5 , 6 ( ξ ) , ϕ 11 ( ξ , η ) = L 4 6 ( ξ ) L 5 , 4 ( η ) , ϕ 12 ( ξ , η ) = L 3 6 ( ξ ) L 5 , 4 ( η ) , ϕ 13 ( ξ , η ) = L 2 , 6 ( ξ ) L 5 , 4 ( η ) , ϕ 14 ( ξ , η ) = L 1 , 6 ( ξ ) L 5 , 4 ( η ) L 1 , 4 ( ξ ) L 5 , 4 ( η ) + L 1 , 4 ( ξ ) L 6 , 5 ( η ) , ϕ 15 ( ξ , η ) = L 1 , 4 ( ξ ) L 5 , 5 ( η ) , ϕ 16 ( ξ , η ) = L 1 , 4 ( ξ ) L 4 , 5 ( η ) , ϕ 17 ( ξ , η ) = L 1 , 4 ( ξ ) L 3 , 5 ( η ) , ϕ 18 ( ξ , η ) = L 1 , 4 ( ξ ) L 2 , 5 ( η ) , ϕ 19 ( ξ , η ) = L 2 , 4 ( ξ ) L 2 , 4 ( η ) , ϕ 20 ( ξ , η ) = L 2 , 4 ( η ) L 3 , 4 ( ξ ) , ϕ 21 ( ξ , η ) = L 2 , 4 ( η ) L 4 , 4 ( ξ ) , ϕ 22 ( ξ , η ) = L 2 , 4 ( ξ ) L 3 , 4 ( η ) , ϕ 23 ( ξ , η ) = L 3 , 4 ( ξ ) L 3 , 4 ( η ) , ϕ 24 ( ξ , η ) = L 3 , 4 ( η ) L 4 , 4 ( ξ ) , ϕ 25 ( ξ , η ) = L 2 , 4 ( ξ ) L 4 , 4 ( η ) , ϕ 26 ( ξ , η ) = L 3 , 4 ( ξ ) L 4 , 4 ( η ) , ϕ 27 ( ξ , η ) = L 4 , 4 ( ξ ) L 4 , 4 ( η ) .
Interestingly, the shape functions ϕ 1 ( ξ , η ) and ϕ 2 ( ξ , η ) , although are associated with corner nodes, they consist of only one term (i.e., eventually influenced by only the projector P ξ ), because the trial functions along their common edge A B are exactly equal to the corresponding blending functions (uniform of degree 4).
We recall that the origin of transfinite interpolation is heuristic, and thus any extension of that will be heuristic as well. In this context, by intuition, one could conjecture that transfinite interpolation is also applicable using Bernstein polynomials in the position of blending and trial functions as well. Then, Equation 65 would take the form (see, Figure 7):
ψ 1 ( ξ , η ) = B 1 , 4 ( ξ ) B 1 , 5 ( η ) , ψ 2 ( ξ , η ) = B 2 , 4 ( ξ ) B 1 , 4 ( η ) , ψ 3 ( ξ , η ) = B 3 , 4 ( ξ ) B 1 , 4 ( η ) , ψ 4 ( ξ , η ) = B 4 , 4 ( ξ ) B 1 , 4 ( η ) , ψ 5 ( ξ , η ) = B 5 , 4 ( ξ ) B 1 , 3 ( η ) , ψ 6 ( ξ , η ) = B 5 , 4 ( ξ ) B 2 , 3 ( η ) , ψ 7 ( ξ , η ) = B 5 , 4 ( ξ ) B 3 , 3 ( η ) , ψ 8 ( ξ , η ) = B 4 , 3 ( η ) B 5 , 4 ( ξ ) B 5 , 4 ( ξ ) B 5 , 4 ( η ) + B 5 , 4 ( η ) B 7 , 6 ( ξ ) , ψ 9 ( ξ , η ) = B 5 4 ( η ) B 6 , 6 ( ξ ) , ψ 10 ( ξ , η ) = B 5 4 ( η ) B 5 , 6 ( ξ ) , ψ 11 ( ξ , η ) = B 4 6 ( ξ ) B 5 , 4 ( η ) , ψ 12 ( ξ , η ) = B 3 6 ( ξ ) B 5 , 4 ( η ) , ψ 13 ( ξ , η ) = B 2 , 6 ( ξ ) B 5 , 4 ( η ) , ψ 14 ( ξ , η ) = B 1 , 6 ( ξ ) B 5 , 4 ( η ) B 1 , 4 ( ξ ) B 5 , 4 ( η ) + B 1 , 4 ( ξ ) B 6 , 5 ( η ) , ψ 15 ( ξ , η ) = B 1 , 4 ( ξ ) B 5 , 5 ( η ) , ψ 16 ( ξ , η ) = B 1 , 4 ( ξ ) B 4 , 5 ( η ) , ψ 17 ( ξ , η ) = B 1 , 4 ( ξ ) B 3 , 5 ( η ) , ψ 18 ( ξ , η ) = B 1 , 4 ( ξ ) B 2 , 5 ( η ) , ψ 19 ( ξ , η ) = B 2 , 4 ( ξ ) B 2 , 4 ( η ) , ψ 20 ( ξ , η ) = B 2 , 4 ( η ) B 3 , 4 ( ξ ) , ψ 21 ( ξ , η ) = B 2 , 4 ( η ) B 4 , 4 ( ξ ) , ψ 22 ( ξ , η ) = B 2 , 4 ( ξ ) B 3 , 4 ( η ) , ψ 23 ( ξ , η ) = B 3 , 4 ( ξ ) B 3 , 4 ( η ) , ψ 24 ( ξ , η ) = B 3 , 4 ( η ) B 4 , 4 ( ξ ) , ψ 25 ( ξ , η ) = B 2 , 4 ( ξ ) B 4 , 4 ( η ) , ψ 26 ( ξ , η ) = B 3 , 4 ( ξ ) B 4 , 4 ( η ) , ψ 27 ( ξ , η ) = B 4 , 4 ( ξ ) B 4 , 4 ( η ) .
It can be verified that both sets of shape and basis functions, respectively, fulfil the partition of unity property:
i = 1 27 ϕ i ( ξ , η ) = 1 , and i = 1 27 ψ i ( ξ , η ) = 1 , .
Nevertheless, there is no guarantee that these two bases are completely equivalent (see Section 5.2.2). One may observe that due to the non-symmetric form of the terms involved in Equation 63 and Equation 64, the direct substitution of Lagrange by Bernstein polynomials does not achieve the same expression exactly. In more detail, each of the row vectors in Equation 63 can be replaced by a matrix equation like that of Equation 60. For degree p = 5 we have the transformation matrix given by Equation 61, whereas for degrees 3, 4 and 6, we have:
T 3 = 1 5 / 6 1 / 3 0 0 3 3 / 2 0 0 3 / 2 3 0 0 1 / 3 5 / 6 1
T 4 = 1 13 / 12 13 / 18 1 / 4 0 0 4 32 / 9 4 / 3 0 0 3 20 / 3 3 0 0 4 / 3 32 / 9 4 0 0 1 / 4 13 / 18 13 / 12 1
T 6 = 1 29 / 20 227 / 150 227 / 200 29 / 50 1 / 6 0 0 6 222 / 25 189 / 25 102 / 25 6 / 5 0 0 15 / 2 201 / 10 837 / 40 123 / 10 15 / 4 0 0 20 / 3 308 / 15 30 308 / 15 20 / 3 0 0 15 / 4 123 / 10 837 / 40 201 / 10 15 / 2 0 0 6 / 5 102 / 25 189 / 25 222 / 25 6 0 0 1 / 6 29 / 50 227 / 200 227 / 150 29 / 20 1
Applying the transformation matrix T 4 (see Equation ) to the Bernstein-based basis functions ψ 1 ( ξ , 0 ) through ψ 5 ( ξ , 0 ) along edge A B yields an accurate reconstruction of the corresponding Lagrange-based shape functions ϕ 1 ( ξ , 0 ) through ϕ 5 ( ξ , 0 ) . Similar results are observed for the remaining three edges as well.
One would anticipate that replacing all Lagrange polynomials involved in the three projectors (Equation 59, Equation 63 and Equation 64), through transformation matrices, would lead to an expression of the bivariate function U ( ξ , η ) in terms of Berntein polynomials. Nevertheless, such an approach would lead to a high number of products in the form B i ( ξ ) B j ( η ) . A rough estimation gives 180 terms while we need only 27, plus a few more for the basis functions ψ 1 , ψ 5 , ψ 8 , ψ 14 associated with the corners. Theoretically, such a functional set probably exists, but the paper at hand has not achieved to tackle this topic, which still remains open. Some initial observations may be useful for future research:
  • It the transformation matrix R which fulfils the relationship a = R T U is determined by applying it to all the 27 nodal points of the element, we receive that det ( R ) 0 .
  • The recalculation of the Lagrange based bivariate shape functions ϕ i ( ξ , η ) in terms of the Bernstein based ones ψ i ( ξ , η ) , using the relation ϕ i = R ψ i , shows a large error (about ± 0.67 ) in the interior of the element, whereas on the boundary and at the nodal points it vanishes.
  • A similar discrepancy was obseved when the relationship a = R T U was applied to more points, and this least-squares scheme led again to a similar deviation between the initial and the recalculted ϕ i ’s.

5.2.2. Numerical Verification

The same BVP was solved using the 27-node transfinite element, with uniform discretization per edge, in conjunction with both formulations. The results are as follows:
  • The requirement to use the parameters ( ξ , η ) defined by the nodal points of the Lagrange model, and then map the control points to the nodal points ( x ( ξ , η ) = i = 1 27 ψ i ( ξ , η ) x i c ) , leads to coincidence between them.
  • In both systems the determinant of the Jacobian all over the rectangular domain equals to unity.
  • The L 2 error norm was found to be slightly different in each system: 0.0191 % for the Lagrange polynomials and 0.0126 % for the Bernstein ones.
Although the Bernstein basis is robust, the discrepancy between the two polynomial systems (Lagrange and Bernstein) depicts that the simple replacement of Lagrange by Bernstein polynomials is not the best case for this kind of transfinite elements. Further theoretical analysis is required to provide full explanations, similar to those provided in Section 4.2.

6. Coons Interpolation

Coons interpolation [11] is probably the oldest interpolaton formula in computer-aided geometric design (CAGD) [12], which later inspired the transfinite interpolation [9]. It refers to a quadrilateral patch A B C D , of which the four edges are of given geometry x or of given function U. Given the linear blending functions, and the four univariate functions associated with the four edges, at each pair ( ξ , η ) the variable U is interpolated by:
U ( ξ , η ) = E 0 ( ξ ) U ( 0 , η ) + E 1 ( ξ ) U ( 1 , η ) + E 0 ( η ) U ( ξ , 0 ) + E 1 ( η ) U ( ξ , 1 ) E 0 ( ξ ) E 0 ( η ) E 1 ( ξ ) E 0 ( η ) E 1 ( ξ ) E 1 ( η ) E 0 ( ξ ) E 1 ( η ) .
Now, we test whether Lagrange polynomials in Equation 71 may be substituted by Bernstein ones while the result remains the same. It is trivial to notice that linear Bernstein polynomials are identical with linear Lagrange polynomials, and therefore no question about the replacement of E 0 and E 1 by B 1 , 1 and B 1 , 2 , respectively. Moreover, since each edge is equivalently described by either a set of Lagrange or a set of (non-rational) Bernstein polynomials, because both sets are unitary (take unit value) at the corners, it is obvious that the four univariate functions U ( 0 , η ) , U ( 1 , η ) , U ( ξ , 0 ) and U ( ξ , 1 ) may be equivalently represented in these two ways. Consequently, we have proven that all terms in Coons interpolation formula described by Equation 71 can be represented either in terms of Lagrange or in terms of Bernstein polynomials. In other words, every expression -such as the set of shape functions- has been derived from Coons’ interpolation and has been expressed by Lagrange polynomials, can be also expressed in terms of Bernstein polynomials, merely replacing the Lagrange polynomials, one-by-one, with a Berstein polynomial of the same degree.
Typical shape functions in terms of Lagrange polynomials are given below:
Corner node : ϕ 1 ( ξ , η ) = ( 1 ξ ) L 1 , p A D ( η ) + ( 1 η ) L 1 , p A B ( ξ ) ( 1 ξ ) ( 1 η ) Intermediate to A B : ϕ 2 ( ξ , η ) = ( 1 η ) L 2 , p ( ξ ) ,
where p A D and p A B are the polynomial degrees along the edges A D and A B , respectively.
Moreover, typical basis functions in terms of Bernstein polynomials are given below:
Corner node : ψ 1 ( ξ , η ) = ( 1 ξ ) B 1 , p A D ( η ) + ( 1 η ) B 1 , p A B ( ξ ) ( 1 ξ ) ( 1 η ) Intermediate to A B : ψ 2 ( ξ , η ) = ( 1 η ) B 2 , p A B ( ξ ) .

6.1. Numerical Verification

The same BVP (Laplace equation in square domain) was solved for a single Coons element made of 18 DOFs, as shown in Figure 8b (note that this Coons element is the same as the 27-node element shown in Figure 4d, without the 9 internal nodes). This was chosen to cover one of the most general cases, because the polynomial degrees in the trial functions along the four edges equal to 4, 3, 6, and 5, respectively. Using either of the polynomial sets, i.e., Lagrange or Bernstein, the error norm L 2 was found equal to 2.3013%.
Working in a similar way as in Section 4.2, the transformation matrix ( R ) between the Lagrange and Bernstein basis (see Equation 33), for the 18-node Coons element, is:
R = 1 13 / 12 13 / 18 1 / 4 0 0 0 0 0 0 0 0 0 0 1 / 5 77 / 120 269 / 240 77 / 60 0 4 32 / 9 4 / 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 20 / 3 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 4 / 3 32 / 9 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 / 4 13 / 18 13 / 12 1 5 / 6 1 / 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 3 / 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 / 2 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 / 3 5 / 6 1 29 / 20 227 / 150 227 / 200 29 / 50 1 / 6 0 0 0 0 0 0 0 0 0 0 0 0 0 6 222 / 25 189 / 25 102 / 25 6 / 5 0 0 0 0 0 0 0 0 0 0 0 0 0 15 / 2 201 / 10 837 / 40 123 / 10 15 / 4 0 0 0 0 0 0 0 0 0 0 0 0 0 20 / 3 308 / 15 30 308 / 15 20 / 3 0 0 0 0 0 0 0 0 0 0 0 0 0 15 / 4 123 / 10 837 / 40 201 / 10 15 / 2 0 0 0 0 0 0 0 0 0 0 0 0 0 6 / 5 102 / 25 189 / 25 222 / 25 6 0 0 0 0 0 0 0 0 0 0 0 0 0 1 / 6 29 / 50 227 / 200 227 / 150 29 / 20 1 77 / 60 269 / 240 77 / 120 1 / 5 0 0 0 0 0 0 0 0 0 0 0 0 0 0 5 145 / 24 185 / 48 5 / 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 5 295 / 24 115 / 12 10 / 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 10 / 3 115 / 12 295 / 24 5 0 0 0 0 0 0 0 0 0 0 0 0 0 0 5 / 4 185 / 48 145 / 24 5 .

7. Numerical Solution of an Eigenvalue Problem

In addition to Laplace equation which was the first example in the previous sections of the paper at hand, in this section we deal with a second problem, as follows.
Example-2: Eigenvalue analysis of rectangle acoustic cavity:
A rectangular acoustic cavity of dimensions a × b = 2.5 × 1.1 and normalized wave velocity c = 1 m / s , is under Neumann boundary conditions ( U n = 0 ) which represent hard walls (i.e., full reflection). The exact solution is given as (see Ref. [13]):
ω m n 2 = π 2 c 2 m 2 a 2 + n 2 b 2 , m , n = 0 , 1 , , .
For each eigenvalue, the error (in %) is calculated by the formula:
E m n = ω m n c a l c u l a t e d 2 ω m n e x a c t 2 ω m n e x a c t 2 × 100 ( % ) .
This problem was solved using the following four models:
  • Coons interpolation (18 DOFs).
  • Tensor product uniform (25 DOFs).
  • Tensor product distorted (25 DOFs).
  • Transfinite non-uniform (27 DOFs, as shown in Figure 2a).
Using either Lagrange polynomials or Bernstein polynomials, for the above first three models (18-node and 25-node elements), for all natural modes the results are the same, as selectively shown in Table 1.
Moreover, for the 27-node element the results differ, as shown in Table 2. One may observe that now the two models (Lagrange and Bernstein) do not coincide, but the quality of the results is similar, if not slightly better for the Bézier-based element.

8. Discussion

In this paper five classes of transfinite elements were investigated, as described in Introduction section (Section 1). Below, we summarize our findings for each of them.
Coons Element. The simplest transfinite element is Coons element, which consists of boundary nodes only. It was theoretically explained and numerically verified that, if either Lagrange or Bernstein polynomials are implemented to Coons interpolation formula, the result in the numerical solution of a PDE is the same (see Section 6.1). Moreover, for a 18-node Coons element, the transformation matrix between the Lagrange-based and Bernstein-based bivariate shape functions was determined.
Tensor Product Element. It was well known that tensor product Lagrange polynomials is equivalent to non-rational tensor product Bernstein polynomials (see [6], among others). In the paper at hand, it was demonstrated that there is an inherent transformation matrix between these two bivariate functional sets, which can be systematically determined in terms of two one-dimensional matrices, i.e., one per direction.
Traditional Transfinite Element (Structured). It was also known, by numerical experience, that traditional transfinite elements with structured horizontal and vertical stations (such that of 21-node shown in Figure 3) can be equally treated substituting both the blending and trial functions one-by-one, from Lagrange polynomials to Bernstein polynomials of the same degree [4]. The paper at hand shows that when mathematically replacing univariate Lagrange polynomials by univariate Bernstein polynomials within the transfinite interpolation formula, we receive the same expression in which the Lagrange-based bivariate shape functions have been merely substituted by Bernstein-based bivariate basis functions. Moreover, the nature of associated generalized coefficients (in terms of nodal values U i ) has been revealed. Eventually, the inherent transformation matrix between the two bivariate sets of shape and basis functions was explicitely determined (see Equation 51).
Distorted Tensor Product Element. It was also known that, even elements in which the boundary nodes do not match to the orthogonal projections of internal nodes onto the edges, can be treated using the transfinite interpolation formula [9]. This issue has been reported at least since 1995 (see details in [2]) by introducing ‘artificial’ nodes which eventually disappear, while a recent survey on this issue may be found in [10]. In brief, the shape functions associated with the interior of edges and the interior of the domain are local tensor products of blending and trial functions, whereas those associated with the four corners of the patch are influenced by all the three projectors ( P ξ , P η , P ξ η ) . The paper at hand shows that, the same numerical result with the aforementined ‘distorted’ transfinite element based on Lagrange polynomials is also obtained when using tensor product Bernstein polynomials with properly chosen control points. The required condition is that the ‘images’ of the control points (see Equation 37) must be exactly that of the distrorted element nodes in the Lagrange based formulation.
Partially Unstructured Element. Beyond the aforementioned simple distortion of tensor-product elements with respect to node placement, there exists a case where a given edge of the patch A B C D contains a different number of nodal points than its opposite (and parallel, in the parametric ξ η space) edge. For instance, the 27-node element depicted in Fig.Figure 4d (as well as in Fig.Figure 6) can be treated as a transfinite element, similarly to the previously discussed 25-node distorted configuration. However, when Bernstein polynomials are directly substituted for Lagrange polynomials of the same degree, a prior study reported only a slight difference in average interpolation error—specifically, 0.6408% for the Lagrange system versus 0.6154% for the Bernstein system—when interpolating the bivariate function U ( x , y ) = e x cos ( π y ) [2]. To further investigate this discrepancy, the present work revisits the topic within the framework of a boundary value problem (BVP), where a similar trend was observed: the L 2 error norm of the numerical solution differed only slightly (0.0191% for Lagrange vs. 0.0126% for Bernstein), as shown in Sect.Section 5.2.1. It was also found that a standard transformation matrix R between Lagrange and Bernstein basis functions does not exist in a general sense, as it depends on the specific test points at which the two bases are related. A second example, presented in Section 7, confirmed a comparable behavior. Interestingly, in all three test cases, the Bézier-based model marginally outperformed the corresponding Lagrange-based formulation.
In summary, the findings of this study indicate that:
(1)
For four broad classes—namely, (i) Coons elements, (ii) tensor-product elements, (iii) traditional transfinite elements with a structured pattern of internal nodes, and (iv) distorted tensor-product elements—Bernstein polynomials can serve as a direct replacement for Lagrange polynomials of the same degree, with identical accuracy.
(2)
In a fifth class, involving transfinite elements with arbitrary boundary nodes combined with a tensor-product distribution of internal nodes, Bernstein polynomials may also replace Lagrange polynomials of the same degree. However, this substitution does not guarantee identical results. While the overall performance of such arbitrarily-noded transfinite elements remains sufficient for practical use, further investigation is warranted, particularly in cases involving non-uniform polynomial degrees.

9. Conclusions

This study demonstrates that transfinite finite elements can be effectively combined with Bernstein–Bézier polynomials by replacing Lagrange polynomials with their Bernstein counterparts. This substitution is mathematically valid and computationally robust across four major classes of elements: Coons-based, tensor-product, structured-node transfinite elements, and distorted tensor-product elements. In all these cases, the method preserves essential properties such as the partition of unity. However, when applied to a fifth category—elements with arbitrarily placed nodes and differing polynomial degrees along opposite edges—minor discrepancies were observed. While the substitution remains practically successful, the question of full mathematical equivalence in this general case remains open and warrants further investigation.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Data are available upon request.

Conflicts of Interest

“The authors declare no conflicts of interest.”.

Appendix A. MATLAB Script for Matrix Comparison

The MATLAB code used for calculating the matrix comparison is given in Table A1.
This code symbolically deals with the nine entries of the matrix A . In the beginning, the 1D transformation matrix T x is explicitely given. The variable Aexact1 represents the exact multiplication A = T x T U T y (cf. Equation 6), the variable R represents Equation 15, and the former matrix is reconstructed into the vector Areconstructed. Moreover, the vector Aexact2 represents to product A ˜ = R U v e c t o r , where U v e c t o r is the same with the matrix U (of size 3 × 3 ), but written as a column vector of size 9 × 1 (cf. Equation 32). At the end, the code checks that the reconstructed vector of generalized coefficients Areconstructed is the same with Aexact2.
Table A1. Auxiliary MATLAB®  code to experiment with the matrix A as a matrix of size 3 × 3 or as a column-vector of size 9 × 1 , for quadratic interpolation ( p = 2 ).
Table A1. Auxiliary MATLAB®  code to experiment with the matrix A as a matrix of size 3 × 3 or as a column-vector of size 9 × 1 , for quadratic interpolation ( p = 2 ).
Preprints 159269 i006

References

  1. Zienkiewicz, O.C. The Finite Element Method, 3rd ed.; McGraw-Hill: London, UK, 1977; pp. 154–196. [Google Scholar]
  2. Bathe, K.J. Finite Element Procedures, 2nd ed.; Prentice-Hall: New Jersey, USA, 1996; pp. 154–196. [Google Scholar]
  3. Cottrell, J.A.; Hughes, T.J.R.; Bazilevs, Y. Isogeometric analysis: towards integration of CAD and FEA, 1st ed.; Wiley: Chichester, USA, 2009; pp. 154–196. [Google Scholar]
  4. Provatidis, C.G. Non-rational and rational transfinite interpolation using Bernstein polynomials. International Journal of Computational Geometry and Applications 2022, 32, 55–89. [Google Scholar] [CrossRef]
  5. Provatidis, C. Transfinite patches for isogeometric analysis. Mathematics 2025, 13, 35. [Google Scholar] [CrossRef]
  6. Provatidis, C. Bézier versus Lagrange polynomials-based finite element analysis of 2-D potential problems. Advances in Engineering Software 2014, 73, 22–34. [Google Scholar] [CrossRef]
  7. Provatidis, C.; Eisenträger, S. Macroelement analysis in T-patches using Lagrange polynomials. Preprint. [CrossRef]
  8. Provatidis, C.G. Precursors of Isogeometric Analysis: Finite Elements, Boundary Elements, and Collocation Methods. Springer: Cham, 2019. [Google Scholar]
  9. Gordon, W.J.; Hall, C.A. Transfinite element methods: Blending-function interpolation over arbitrary curved element domains. Numerische Mathematik 1973, 21, 109–129. [Google Scholar] [CrossRef]
  10. Eisenträger S, Eisenträger J, Gravenkamp H, Provatidis CG. High order transition elements: The xNy-element concept, Part II: Dynamics. Computer Methods in Applied Mechanics and Engineering 2021, 387, 114145. [CrossRef]
  11. Coons, S.A. Surfaces for computer-aided design of space forms. MIT 1967. [Google Scholar]
  12. Farin, G. Curves and Surfaces for CAGD; Morgan Kaufmann-Elsevier: USA. [CrossRef]
  13. Courant, R.; Hilbert, D. Methods of mathematical physics (1st English ed., Vol. I).; InterScience: New York, USA, 1966; (translated and revised from the German original). [Google Scholar]
Figure 1. (a) Quadratic and (b) bi-quadratic uniform elements.
Figure 1. (a) Quadratic and (b) bi-quadratic uniform elements.
Preprints 159269 g001
Figure 2. Square domain: (a) Dimensions and boundary conditions, (b) Tensor-product discretization.
Figure 2. Square domain: (a) Dimensions and boundary conditions, (b) Tensor-product discretization.
Preprints 159269 g002
Figure 3. The traditional 21-node transfinite element.
Figure 3. The traditional 21-node transfinite element.
Preprints 159269 g003
Figure 4. Basic categories of transfinite elements: (a) tensor product, (b) traditional structured, (c) distorted tensor product, (d) partially unstructured.
Figure 4. Basic categories of transfinite elements: (a) tensor product, (b) traditional structured, (c) distorted tensor product, (d) partially unstructured.
Preprints 159269 g004
Figure 5. 25-node distorted tensor product element.
Figure 5. 25-node distorted tensor product element.
Preprints 159269 g005
Figure 6. The 27-node transfinite element.
Figure 6. The 27-node transfinite element.
Preprints 159269 g006
Figure 7. Shape and basis functions of 27-node transfinite element.
Figure 7. Shape and basis functions of 27-node transfinite element.
Preprints 159269 g007
Figure 8. (a) Geometry and boundary conditions, (b) Discretization.
Figure 8. (a) Geometry and boundary conditions, (b) Discretization.
Preprints 159269 g008
Table 1. Calculated eigenvalues (errors in %).
Table 1. Calculated eigenvalues (errors in %).
Mode Coons (18 DOFs) Tensor Product Uniform (25 DOFs) Tensor Product Distorted (25 DOFs)
1
2 0.0175 0.0557 0.0557
3 0.2229 0.7256 0.7256
4 0.0141 0.0557 0.0557
5 0.3117 0.0557 0.0557
6 13.9526 2.1910 2.1910
Table 2. Calculated eigenvalues (errors in %) for the 27-node transfinite element.
Table 2. Calculated eigenvalues (errors in %) for the 27-node transfinite element.
Mode Lagrange-Based (27 DOFs) Bézier-Based (27 DOFs)
1
2 0.0534 0.0420
3 0.6940 0.5404
4 0.0498 0.0361
5 0.0422 0.0309
6 2.1458 2.0581
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated