Many different algorithms have been suggested for computing the matrix exponential. In this paper, we put forward the idea of expanding in either Chebyshev, Legendre or Laguerre orthogonal polynomials. In order for these expansions to converge quickly, we cluster the eigenvalues into diagonal blocks and accelerate using shifting and scaling.

Let K be a global field of char p and let Fq be the algebraic closure of Fp in K. For an elliptic curve E/K with non-constant j-invariant, the L-function L(T,E/K) is a polynomial in 1+T ·Z[T ]. For any N > 1 invertible in K and finite subgroup T ⊂ E(K) of order N , we compute the mod N reduction of L(T,E/K) and determine an upper-bound for the order of vanishing at 1/q, the so-called analytic r...

We apply a simple method to provide explicit expressions for different scaling exponents in intermittent fully developed turbulence, that before were only given through a Legendre transform. This includes predictability exponents for infinitesimal and non infinitesimal perturbations, Lagrangian velocity exponents, and dispersion exponents. We obtain also new results concerning inverse statistic...