Fast Polynomial Transforms

Jens Keiner

ISBN 978-3-8325-2850-8
234 pages, year of publication: 2011
price: 40.00 €
Fast Polynomial Transforms
Classical orthogonal polynomials and the related associated functions are real classics in approximation theory. They share a rich history of research that has uncovered their many relationships to topics of fundamental importance. This text develops a new aspect of the so-called connection problem. This problem asks how a given expansion in a specific sequence of polynomials or functions may be converted into an equivalent one using a different sequence -- often within reason, that is, within the same classical family. A new theory relates this problem to the class of semiseparable matrices. This implies efficient algorithms that have the capacity to cover the connection problem not only numerically efficient, but at the same time, numerically stable. The result has implications for numerical problems whose treatment involves these transformations. One such example, described in more detail, are generalizations of the fast Fourier transform to geometries like the two-sphere or the rotation group SO(3).

cover cover cover cover cover cover cover cover cover
  • approximation theory
  • connection problem
  • orthogonal polynomials


soon available
40.00 €

38.50 €
50.00 €
54.00 €

(D) = Within Germany
(W) = Abroad

*You can purchase the eBook (PDF) alone or combined with the printed book (eBundle). In both cases we use the payment service of PayPal for charging you - nevertheless it is not necessary to have a PayPal-account. With purchasing the eBook or eBundle you accept our licence for eBooks.

For multi-user or campus licences (MyLibrary) please fill in the form or write an email to