Re: GSoC: Fast Linear Algebra over Extension Fields

[Martin Albrecht]

Hey Dávid,

(this should at least also be on lela-users)

It would be very helpful if you could provide a little patch to LELA just to
see whether you find your way round the library etc.

For example, you could take two std::vector of mod p matrices and consider
these vectors as matrices with polynomial entries. Then, you could perform
schoolbook quadratic polynomial multiplication on these polynomials and take
the result modulo some minimal polynomial represented as a std::vector<int>
(or so).

Something like that.

Let me know if this is unclear and ask for help on lela-users if you get
stuck.

On Monday 15 Apr 2013, Dávid Fonyó wrote:
> Hello,
>
> My name is Dávid Fonyó. I'm a third year Mathematics BSc and second year
> Computer Science BSc student in Eötvös Loránd University, Budapest,
> Hungary. I would like to join the Google Summer of Code 2013 program, and
> I'm really interested in the "Fast Linear Algebra over Extension Fields"
> project.
>
> As a prospective mathematician I've learned a lot of things that help me
> understand the mathematical background of algorithms:
> Algebra (4 semesters), Operation research (2 semester), Theory of
> Computation, Numerical methods (2 semester), etc.
> I have a good experience using C++, and I'm familiar with Java, Pascal, Ada
> and Python.
>
> I've already checked the listed algorithms and now I'm reading the
> references. I would like to ask what the next step will be? What kind of
> patch should I have to write?
> Thank you!
>
> Best regards,
> Dávid Fonyó

Cheers,
Martin

--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.wordpress.com/
_jab: martinr...@jabber.ccc.de