Fast Computations

Activity: Talk or presentationInvited talkunknown

Description

Direct decompositions are an "invitation" to do parallel computing. This applies to the Chinese Remainder Theorem, which yields faster computations in the integers and for polynomials over fields, to eigenvalue computations (via group representations), and in general to the Discrete Fourier Transform (DFT) and its faster version, the Fast Discrete Fourier Transform.
Period25 Feb 2004
Event titleunbekannt/unknown
Event typeOther
LocationRussian FederationShow on map

Fields of science

  • 101001 Algebra