Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.compilers > #1467 > unrolled thread

Automatic algorithm optimisation via fast matrix exponentiation

Back to article view | Back to comp.compilers

Contents

  Automatic algorithm optimisation via fast matrix exponentiation willvarfar@gmail.com - 2015-01-11 07:18 -0800
    Re: Automatic algorithm optimisation via fast matrix exponentiation "Nuno Lopes" <nuno.lopes@ist.utl.pt> - 2015-01-11 19:22 +0000

#1467 — Automatic algorithm optimisation via fast matrix exponentiation

Lovely article:

http://kukuruku.co/hub/algorithms/automatic-algorithms-optimization-via-fast-matrix-exponentiation

Do any compilers do this kind of thing?

[toc] | [next] | [standalone]

#1468

> Lovely article:
>
> http://kukuruku.co/hub/algorithms/automatic-algorithms-optimization-via-fast-matrix-exponentiation
>
> Do any compilers do this kind of thing?

Partially, yes.

For example, LLVM has a quadratic recurrence solver (named SCEV --
scalar evolution).  For this purpose, matrix exponentiation is pretty
much equivalent to recurrence solving.  So, if LLVM manages to rewrite
an induction variable as a recurrence, and if it manages to compute
its closed-form, then LLVM may replace a loop with straight-line code.

I believe GCC and MSVC can do similar things, since it's a somehow required
piece of technology for automatic vectorization, which all compilers can do
to some extent these days..

Nuno

[toc] | [prev] | [standalone]

Back to top | Article view | comp.compilers

csiph-web