All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 24 Next

Displaying 461 – 480 of 532

Showing per page

Wavelet compression of anisotropic integrodifferential operators on sparse tensor product spaces

Nils Reich (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

For a class of anisotropic integrodifferential operators ℬ arising as semigroup generators of Markov processes, we present a sparse tensor product wavelet compression scheme for the Galerkin finite element discretization of the corresponding integrodifferential equations ℬ u = f on [0,1]n with possibly large n. Under certain conditions on ℬ , the scheme is of essentially optimal and dimension independent complexity 𝒪 (h-1| log h |2(n-1)) without corrupting the convergence or smoothness requirements...

What is the inverse of repeated square and multiply algorithm?

H. Gopalkrishna Gadiyar, K. M. Sangeeta Maini, R. Padma, Mario Romsy (2009)

Colloquium Mathematicae

It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm and what is its time compexity. The technical hitch is in fixing the right sign of the square root and this is the heart of the discrete logarithm problem over finite fields of characteristic not equal to 2. In this paper a couple of probabilistic algorithms to compute the discrete...

Currently displaying 461 – 480 of 532