Nehodí se? Vůbec nevadí! U nás můžete do 30 dní vrátit
S dárkovým poukazem nešlápnete vedle. Obdarovaný si za dárkový poukaz může vybrat cokoliv z naší nabídky.
30 dní na vrácení zboží
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. This volume contains 22 survey and research papers devoted to a variety of theoretical and practical aspects of the design of fast algorithms for structured matrices and related issues. Included are several papers containing various affirmative and negative results in this direction.
Ahoj! Jsem Libroamiko, tvůj knižní rádce.
Jak ti můžu pomoct?