Fast algorithms for structured matrices theory and applications: AMS-IMS-SIAM Joint Summer Research Conference on Fast Algorithms in Mathematics, Computer Science, and Engineering, August 5-9, 2001, Mount Holyoke College, South Hadley, Massachusetts

One of the best known fast computational algorithms is the fast Fourier transform method. Its efficiency is based mainly on the special structure of the discrete Fourier transform matrix. Recently, many other algorithms of this type were discovered, and the theory of structured matrices emerged. Thi...

Celý popis

Podrobná bibliografie

Hlavní autor:	Vadim Olshevsky
Médium:	E-kniha Kniha
Jazyk:	angličtina
Vydáno:	Providence, R.I Society for Industrial and Applied Mathematics 2003 Philadelphia, Pa American Mathematical Society
Edice:	Contemporary mathematics
Témata:	Algorithms > Congresses Fourier transformations > Congresses Matrices > Congresses
ISBN:	9780821831779, 9780898715439, 0821831771, 0898715431
ISSN:	0271-4132
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!