Mathelogo
Universität zu Lübeck
Institut für Mathematik
Mathelogo

Start Mitarbeiter Studium/Lehre Forschung Publikationen Vorträge Sonstiges Impressum
Institute of Mathematics - Jens Keiner
  Jens Keiner
 
  Contact
  Research
  Publications
  Teaching
  Miscellaneous
   You need a MathML capable browser (e.g. Mozilla Firefox 1.5 or better) to display this page properly.

Research

Nonuniform Fast Spherical Fourier Transforms

One of my primary research projects is the fast Fourier transform on the unit sphere S2 in R3. This is a generalisation of the well-known fast Fourier transform (FFT) to a different geometry, in this case the sphere (see Figure 1 below). A convenient basis for functions defined on the sphere are spherical harmonics which are solutions to Laplace's equation in three dimensions. Figure 2 below shows a spherical harmonic basis function on the sphere. More precisely, any function f from the Hilbert space of square integrable functions on the unit sphere admits a representation in spherical coordinates θ and φ,

fθφ= l = 0 m = - l l alm Ylm θφ .

The alm are the spherical Fourier coefficients. Usually, the function f admits a finite expansion or can be approximated by a finite expansion, hence

fθφ= l = 0 L m = - l l alm Ylm θφ . (1)

This is of course a prerequisite for practical computations. The two basic tasks are to evaluate a sum like (1) at points θm φm for m=1,2,...,M, given the Fourier coefficients alm, or to compute the Fourier coefficients alm given function values fθm φm at these points and suitable quadrature weights wm,

alm= m = 1 m = - l l wm fθm φm Ylm θm φm . (2)

In most cases, the number of points M is of the same order of magnitude as the number of Fourier coefficients L+1 2 (we assume this from here on). The rationale is that the degrees of freedom for both transformations must be comparable if they are inverses of each other. Straightforward algorithms to compute the transformations have a typical arithmetical operation count proportional to L4. This is way to slow for large-scale computations. The ultimate goal (which has been reached by some algorithms) is a cost proportional to L2logL matching the cost of a usual two-dimensional fast Fourier transform of same degree. In recent years, different approaches to these fast algorithms have been proposed. My research here is to develop new fast and stable algorithms, techniques and a good implementation for the transforms. This is also a numerical challenge as the functions involved can cause severe numerical instabilities if the wrong path is taken. Besides these implementation issues, my work also includes bringing these algorithms to the applications.

Sphere Spherical Harmonic Voronoi Partition on the Sphere
Figure1: Unit sphere S2 Figure 2: Spherical Harmonic on S2 Figure 3: Voronoi partition of a point set on S2

Institut für Mathematik
Mathelogo
Universität zu Lübeck
Institut für Mathematik
Mathelogo

Start Mitarbeiter Studium/Lehre Forschung Publikationen Vorträge Sonstiges Volltextsuche
  

Aufgrund technischer Probleme stehen zur Zeit nicht alle Seiten des Institutes zur Verfügung !

© 01/2004 | Letzte Änderung am: 24.5.2005 | webmaster@math.uni-luebeck.de
©MATH 01/2004 | Letzte Änderung am: [an error occurred while processing this directive] | webmaster@math.uni-luebeck.de