AbstractA deterrent to application of rational basis functions over algebraic elements has been the need to compute denominator polynomials (element adjoints) from multiple points of the element boundary. Dasgupta devised a simple algorithm for eliminating this problem for convex polygons. This algorithm is described here and generalized to elements with curved sides
This three-part volume explores theory for construction of rational interpolation functions for cont...
High order finite elements are usually defined by means of certain orthogonal polynomials. The perfo...
AbstractThere is a well-defined construction of rational basis functions for patchwork C0 approximat...
AbstractA deterrent to application of rational basis functions over algebraic elements has been the ...
AbstractPolynomials suffice as finite element basis functions for triangles, parallelograms, and som...
AbstractIn [1] rational basis functions were developed for patchwork C0 approximation over partition...
AbstractIn this paper, construction of rational basis functions for curved elements is reviewed, som...
AbstractA numerical method of calculating all of the polynomial coefficients for Wachspress' rationa...
AbstractThis paper describes an algebraic approach to computing the system of adjoint curves to a gi...
International audienceThe word "adjoint" refers to several definitions which are not all equivalent:...
AbstractA conforming polynomial second order basis for the three sided two-dimensional finite elemen...
AbstractIn the analysis of a finite element method (FEM) we can describe the shape of a given elemen...
This paper presents an algorithm for computing a decomposition of a non- negative real polynomial as...
AbstractIn Wachspress (1975) [2] rational bases were constructed for convex polyhedra whose vertices...
We present an algorithm for lattice basis reduction in function fields. In contrast to integer latti...
This three-part volume explores theory for construction of rational interpolation functions for cont...
High order finite elements are usually defined by means of certain orthogonal polynomials. The perfo...
AbstractThere is a well-defined construction of rational basis functions for patchwork C0 approximat...
AbstractA deterrent to application of rational basis functions over algebraic elements has been the ...
AbstractPolynomials suffice as finite element basis functions for triangles, parallelograms, and som...
AbstractIn [1] rational basis functions were developed for patchwork C0 approximation over partition...
AbstractIn this paper, construction of rational basis functions for curved elements is reviewed, som...
AbstractA numerical method of calculating all of the polynomial coefficients for Wachspress' rationa...
AbstractThis paper describes an algebraic approach to computing the system of adjoint curves to a gi...
International audienceThe word "adjoint" refers to several definitions which are not all equivalent:...
AbstractA conforming polynomial second order basis for the three sided two-dimensional finite elemen...
AbstractIn the analysis of a finite element method (FEM) we can describe the shape of a given elemen...
This paper presents an algorithm for computing a decomposition of a non- negative real polynomial as...
AbstractIn Wachspress (1975) [2] rational bases were constructed for convex polyhedra whose vertices...
We present an algorithm for lattice basis reduction in function fields. In contrast to integer latti...
This three-part volume explores theory for construction of rational interpolation functions for cont...
High order finite elements are usually defined by means of certain orthogonal polynomials. The perfo...
AbstractThere is a well-defined construction of rational basis functions for patchwork C0 approximat...
DOI
Add to ORKG