### Abstract

The author would like to dedicate this paper to the memory of Ludolph van Ceulen (1540-1610), the famous Dutch mathematician, who spent almost his whole life to calculate the first 35 decimals of p. Now, 400 years later, the known number of digits of p exceeds 200 billion and increasing. Highly efficient and very fast converging methods have been developed in the last decades. Without the number crunching power of digital computers it would never have been possible to calculate the billions of digits of p. Amazingly, the key element in calculating the billions of digits is an efficient multiplication method. And here we can find an unexpected application from signal processing and control theory: the Fast Fourier transform (FFT). The paper presents the most efficient algorithms and describes how the Fourier transform makes fast multiplication possible.

Original language | English |
---|---|

Title of host publication | 9th Mediterranean Conference on Control and Automation: Book of abstracts |

Place of Publication | Zagreb, Croatia |

Publisher | KoREMA Secretariat |

Pages | 186-186 |

Number of pages | 6 |

ISBN (Print) | 953-6037-34-3 |

Publication status | Published - 27 Jun 2001 |

Event | 9th IEEE Mediterranean Conference on Control and Automation, MED 2001 - Hotel Excelsior, Dubrovnik, Croatia Duration: 27 Jun 2001 → 29 Jun 2001 Conference number: 9 |

### Conference

Conference | 9th IEEE Mediterranean Conference on Control and Automation, MED 2001 |
---|---|

Abbreviated title | MED |

Country | Croatia |

City | Dubrovnik |

Period | 27/06/01 → 29/06/01 |

### Keywords

- Elliptic functions
- Approximation theory
- Fourier transform

## Fingerprint Dive into the research topics of 'Fourier transform and Ludolph van Ceulen'. Together they form a unique fingerprint.

## Cite this

Vajta, M. (2001). Fourier transform and Ludolph van Ceulen. In

*9th Mediterranean Conference on Control and Automation: Book of abstracts*(pp. 186-186). Zagreb, Croatia: KoREMA Secretariat.