About the Project

Mobius transformation

AdvancedHelp

(0.002 seconds)

4 matching pages

1: 27.17 Other Applications
§27.17 Other Applications
Reed et al. (1990, pp. 458–470) describes a number-theoretic approach to Fourier analysis (called the arithmetic Fourier transform) that uses the Möbius inversion (27.5.7) to increase efficiency in computing coefficients of Fourier series. …
2: 1.9 Calculus of a Complex Variable
Bilinear Transformation
Other names for the bilinear transformation are fractional linear transformation, homographic transformation, and Möbius transformation. …
3: 32.2 Differential Equations
They are distinct modulo Möbius (bilinear) transformations
4: Bibliography R
  • I. S. Reed, D. W. Tufts, X. Yu, T. K. Truong, M. T. Shih, and X. Yin (1990) Fourier analysis and signal processing by use of the Möbius inversion formula. IEEE Trans. Acoustics, Speech, Signal Processing 38, pp. 458–470.
  • G. Rota (1964) On the foundations of combinatorial theory. I. Theory of Möbius functions. Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 2, pp. 340–368.
  • K. Rottbrand (2000) Finite-sum rules for Macdonald’s functions and Hankel’s symbols. Integral Transform. Spec. Funct. 10 (2), pp. 115–124.