On non-normal numbers

The worst-case complexity of the steepest-descent algorithm with exact line- searches for unconstrained smooth optimization is analyzed, and it is shown that the number of iterations

— In a series of papers, we constructed large families of normal numbers using the concatenation of the values of the largest prime factor P (n), as n runs through particular

The extension from Bernoulli to multiple Bernoulli polynomials will be done using a generalization of the Hurwitz zeta function: the Hurwitz multiple zeta

(For the definition of the diophantine notions used from now on, see Section 1.3.) One of our results will be that the sequence (G 1,N (α)) N≥1 converges for all irrational numbers

As well, compressed air foam can be used with Class A foam concentrate, which is environmentally friend- ly, rather than Class B foam concentrate, which is used in traditional

The SCOTCH meshOrder routine computes a block ordering of the unknowns of the symmetric sparse matrix the adjacency structure of which is represented by the elements that connect

for the Rademacher setting, the paper [14] by Nourdin, Peccati and Reinert was the first one to carry out the analysis of normal approximation for Rademacher functionals

These kind of diagrams will be called Minimum Distance Diagram of Elements (not of equivalence classes), denoted by MDDE.. Hence, we have now two types of minimum distances