This is a collection of definite integrals involving the logarithmic and polynomial functions in terms special fundamental constants. All results this work are new.

In this paper we study strictly positive definite functions on the unit sphere of the m-dimensional Euclidean space. Such functions can be used for solving a scattered data interpolation problem on spheres. Since positive definite functions on the sphere were already characterized by Schoenberg some fifty years ago, the issue here is to determine what kind of positive definite functions are act...

In this paper, we study polynomial norms, i.e. norms that are the dth root of a degree-d homogeneous polynomial f . We first show that a necessary and sufficient condition for f to be a norm is for f to be strictly convex, or equivalently, convex and positive definite. Though not all norms come from dth roots of polynomials, we prove that any norm can be approximated arbitrarily well by a polyn...

In this paper we study strictly positive definite functions on the unit sphere of the m-dimensional Euclidean space. Such functions can be used for solving a scattered data interpolation problem on spheres. Since positive definite functions on the sphere were already characterized by Schoenberg some fifty years ago, the issue here is to determine what kind of positive definite functions are act...

The conjugate gradient algorithm for solving Hermitian positive definite linear systems is usually combined with preconditioning in order to speed up convergence. In recent years, there has been a revival of polynomial preconditioning, motivated by the attractive features of the method on modern architectures. Standard techniques for choosing the preconditioning polynomial are based only on bou...

A whole variety of robust analysis and synthesis problems can be formulated as robust Semi-Definite Programs (SDPs), i.e. SDPs with data matrices that are functions of an uncertain parameter which is only known to be contained in some set. We consider uncertainty sets described by general polynomial semi-definite constraints, which allows to represent norm-bounded and structured uncertainties a...

We present an algorithm which, given a linear recurrence operator L with polynomial coefficients, m ∈ N \ {0}, a1, a2, . . . , am ∈ N \ {0} and b1, b2, . . . , bm ∈ K, returns a linear recurrence operator L ′ with rational coefficients such that for every sequence h,

In this paper Kharitonov's t h e o m for the robust stability of interval polynomials is proved using the second method of Lyapunov. The Hermite matrix is taken as the matrix of the quadratic form which is used as a Lyapunov function to prove Hurwitz stability. It is shown that if the four Hemite matrices correspondii to the four Kharitonov extreme polynomials are positive definite, the Hermite...