A novel method has been devised where one set of higher order polynomial-based basis functions can be applied over several wire segments, thus permitting to decouple the number of unknowns from the number of segments, and so from the geometrical approximation accuracy. The method extends the current state of art from using the composite piecewise uniform, linear and sinusoidal basis and testing...

We give several characterizations of discrete Sugeno integrals over bounded distributive lattices, as particular cases of lattice polynomial functions, that is functions which can be represented in the language of bounded lattices using variables and constants. We also consider the subclass of term functions as well as the classes of symmetric polynomial functions and weighted minimum and maxim...

• Local polynomial modelling can be seen as a local fit of the data against a polynomial basis. In this paper we extend this method to the power basis, i.e. a basis which consists of the powers of an arbitrary function. Using an extended Taylor theorem, we derive asymptotic expressions for bias and variance of this estimator. We apply this method to a simulated data set for various basis functi...

The P1-nonconforming finite element is introduced for arbitrary triangulations into quadrilaterals and triangles of multiple connected Lipschitz domains. An explicit a priori analysis for the combination of the Park–Sheen and the Crouzeix–Raviart nonconforming finite element methods is given for second-order elliptic PDEs with inhomogeneous Dirichlet boundary conditions.

A new technique for the implementation of cell-centered nite volume schemes is proposed. It is based on a recently found equivalence between these schemes and the non-conforming Crouzeix-Raviart nite element approximation. Though the implementation somewhat increases the number of unknowns, it brings two signiicant advantages that make it attractive. On the one hand the resulting formulation is...

Young’s lattice is a partial order on integer partitions whose saturated chains correspond to standard Young tableaux, one type of combinatorial object that generates the Schur basis for symmetric functions. Generalizing lattice, we introduce new weak compositions call key poset. Saturated in this poset objects generate polynomials, nonsymmetric polynomial generalization basis. skew functions, ...

Multiscale discontinuous Galerkin (DG) methods are established to solve flow and transport problems in porous media. The underlying idea is to construct local DG basis functions at the coarse scale that capture the local properties of the differential operator at the fine scale, and then to solve the DG formulation using the newly constructed local basis functions instead of conventional polyno...

In this paper, we integrate goal programming (GP), Taylor Series, Kuhn-Tucker conditions and Penalty Function approaches to solve linear fractional bi-level programming (LFBLP)problems. As we know, the Taylor Series is having the property of transforming fractional functions to a polynomial. In the present article by Taylor Series we obtain polynomial objective functions which are equivalent...

This paper investigates the number of trace-one elements in a polynomial basis for F2n . A polynomial basis with a small number of trace-one elements is desirable because it results in an efficient and lowcost implementation of the trace function. We focus on the case where the reduction polynomial is a trinomial or a pentanomial, in which case field multiplication can also be efficiently imple...