AbstractIn Wachspress (1975) [2] rational bases were constructed for convex polyhedra whose vertices were all of order three. The restriction to order three was first removed by Warren (1996) [3] and his analysis was refined subsequently by Warren and Schaefer (2004) [4]. A new algorithm (GADJ) for finding the denominator polynomial common to all the basis functions was exposed in Dasgupta and Wachspress (2007) [1] for convex polyhedra with all vertices of order three. This algorithm is applied here for generating bases for general convex polyhedra
The μ-basis of a rational ruled surface P(s, t) = P0(s +tP1 (s) is defined in Chen et al. (Comput. A...
This thesis combines topics from the field of Algebra and the field of Optimization. It will be disc...
This thesis defines the notion of a μ-basis for an arbitrary number of polynomials in one variable. ...
AbstractIn Wachspress (1975) [2] rational bases were constructed for convex polyhedra whose vertices...
AbstractIn Wachspress (1975) [1], theory was developed for constructing rational basis functions for...
AbstractPolynomials suffice as finite element basis functions for triangles, parallelograms, and som...
The main theme of this dissertation is the study of the lattice points in a rational convex...
Let F ( x ) be a convex function defined in R n , which is symmetric about the origin and homogeneous...
In this thesis, we address problems from two topics of applied mathematics: linear integer programmi...
AbstractA deterrent to application of rational basis functions over algebraic elements has been the ...
Convex cycles play a role e.g. in the context of product graphs. We introduce convex cycle bases and...
34 pages, 2 figuresInternational audienceThis article concerns the computational problem of counting...
The µ-bases of rational curves/surfaces are newly developed tools which play an important role in co...
This three-part volume explores theory for construction of rational interpolation functions for cont...
We investigate the generating sets (“Gröbner bases”) of integer lattices which correspond to the Gr...
The μ-basis of a rational ruled surface P(s, t) = P0(s +tP1 (s) is defined in Chen et al. (Comput. A...
This thesis combines topics from the field of Algebra and the field of Optimization. It will be disc...
This thesis defines the notion of a μ-basis for an arbitrary number of polynomials in one variable. ...
AbstractIn Wachspress (1975) [2] rational bases were constructed for convex polyhedra whose vertices...
AbstractIn Wachspress (1975) [1], theory was developed for constructing rational basis functions for...
AbstractPolynomials suffice as finite element basis functions for triangles, parallelograms, and som...
The main theme of this dissertation is the study of the lattice points in a rational convex...
Let F ( x ) be a convex function defined in R n , which is symmetric about the origin and homogeneous...
In this thesis, we address problems from two topics of applied mathematics: linear integer programmi...
AbstractA deterrent to application of rational basis functions over algebraic elements has been the ...
Convex cycles play a role e.g. in the context of product graphs. We introduce convex cycle bases and...
34 pages, 2 figuresInternational audienceThis article concerns the computational problem of counting...
The µ-bases of rational curves/surfaces are newly developed tools which play an important role in co...
This three-part volume explores theory for construction of rational interpolation functions for cont...
We investigate the generating sets (“Gröbner bases”) of integer lattices which correspond to the Gr...
The μ-basis of a rational ruled surface P(s, t) = P0(s +tP1 (s) is defined in Chen et al. (Comput. A...
This thesis combines topics from the field of Algebra and the field of Optimization. It will be disc...
This thesis defines the notion of a μ-basis for an arbitrary number of polynomials in one variable. ...