Multi-level factorial designs are useful in experiments but their aliasing structure are complex compare to two-level fractional factorial designs. A new framework is proposed to study the complex aliasing of those designs. Geometric aliasing is deened for factorial designs. It generalize of the aliasing relation of regular two level fractional fac-torial designs to all factorial designs. Based...

In this study, a new and efficient approach is presented for numerical solution of Fredholm integro-differential equations (FIDEs) of the second kind on unbounded domain with degenerate kernel based on operational matrices with respect to generalized Laguerre polynomials(GLPs). Properties of these polynomials and operational matrices of integration, differentiation are introduced and are ultili...

‎In this paper‎, ‎we present a numerical method based on Bernstein polynomials to solve optimal control systems with constant and pantograph delays‎. ‎Constant or pantograph delays may appear in state-control or both‎. ‎We derive delay operational matrix and pantograph operational matrix for Bernstein polynomials then‎, ‎these are utilized to reduce the solution of optimal control with constant...

The concept of sums nonnegative circuit (SONC) polynomials was recently introduced as a new certificate nonnegativity especially for sparse polynomials. In this paper, we explore the relationship between and SONCs. As first result, provide sufficient conditions with general Newton polytopes to be SONC, which generalizes previous result on simplex polytopes. Second, prove that every SONC admits ...

K e y w o r d s B e r n o u l l i polynomials, Euler polynomials, Generating functions, Bernoulli numbers, Euler numbers, Addition theorem, Multiplication theorem~ Generalized Bernoulli polynomials and numbers, Generalized Euler polynomials and numbers. 1. I N T R O D U C T I O N T h e classical Bernoulli polynomials Bn(x) and the classical Euler polynomials En(x) are usual ly def ined by m e a...

It is shown that the zeros of the Faber polynomials generated by a regular m-star are located on the m-star. This proves a recent conjecture of J. Bartolomeo and M. He. The proof uses the connection between zeros of Faber polynomials and Chebyshev quadrature formulas.

This proceeding is intended to be a first introduction to spectral methods. It is written around some simple problems that are solved explicitly and in details and that aim at demonstrating the power of those methods. The mathematical foundation of the spectral approximation is first introduced, based on the Gauss quadratures. The two usual basis of Legendre and Chebyshev polynomials are then p...

Orthogonal polynomials on the real line always satisfy a three-term recurrence relation. The recurrence coefficients determine a tridiagonal semi-infinite matrix (Jacobi matrix) which uniquely characterizes the orthogonal polynomials. We investigate new orthogonal polynomials by adding to the Jacobi matrix r new rows and columns, so that the original Jacobi matrix is shifted downward. The r new...

It is often the case that the exact moments of a statistic of the continuous type can be explicitly determined, while its density function either does not lend itself to numerical evaluation or proves to be mathematically intractable. The density approximants discussed in this article are based on the first n exact moments of the corresponding distributions. A unified semiparametric approach to...