Complete Pascal Interpolation Scheme For Approximating The Geometry Of A Quadrilateral Element

by   Sulaiman Y. Abo Diab, et al.

This paper applies a complete parametric set for approximating the geometry of a quadrilateral element. The approximation basis used is a complete Pascal polynomial of second order with six free parameters. The interpolation procedure is a natural interpolation scheme. The six free parameters are determined using the natural coordinates of the four nodal points (vertices) of the quadrilateral element and the two intersections points of the lines crossing every two opposite edges (poles). The presented scheme recovers the well known Lagrangian interpolation scheme, when every two opposite edges are parallel. A third order Pascal interpolation scheme is also presented. The four midpoints of the four edges in addition to the six nodal point from the second order case are used as significant nodal points. It is expected to reflect the geometry properties better since the shape functions are complete


page 1

page 2

page 3

page 4


Geometry Mapping, Complete Pascal Scheme versus Standard Bilinear Approach

This paper presents a complete Pascal interpolation scheme for use in th...

Tesselating a Pascal-like tetrahedron for the subdivision of high order tetrahedral finite elements

Three-dimensional N^th order nodal Lagrangian tetrahedral finite element...

A Virtual Element Method for the wave equation on curved edges in two dimensions

In this work we present an extension of the Virtual Element Method with ...

Data Assimilation with Higher Order Finite Element Interpolants

The efficacy of a nudging data assimilation algorithm using higher order...

Optimal design for kernel interpolation: applications to uncertainty quantification

The paper is concerned with classic kernel interpolation methods, in add...

Supercloseness of the NIPG method for a singularly perturbed convection diffusion problem on Shishkin mesh in 2D

As a popular stabilization technique, the nonsymmetric interior penalty ...

A Radial Basis Function based Optimization Algorithm with Regular Simplex set geometry in Ellipsoidal Trust-Regions

We present a novel derivative-free interpolation based optimization algo...

Please sign up or login with your details

Forgot password? Click here to reset