Computational aspects of (persistent) homology. From discrete to continuous and back.
Event details
| Date | 21.03.2014 |
| Hour | 14:15 › 15:30 |
| Speaker | Pawel Dlotko |
| Location |
MA30
|
| Category | Conferences - Seminars |
Computational topology is a branch of a computational mathematics - a new discipline emerging in between mathematics and computer science and aiming in obtaining mathematical rigorous results with a help of computer. Recently computational topology gain a lot of attention in various fields outside mathematics. I will start this talk by summarizing some of those applications. Later the concept of
persistent homology will be explained and the algorithm(s) to compute it for a finite filtered cell complex will be given. Having this knowledge we will consider the problem of rigorous computations of level sets (up to homotopy type) and persistent homology of sufficiently smooth functions f : Rn ---> Rn.
persistent homology will be explained and the algorithm(s) to compute it for a finite filtered cell complex will be given. Having this knowledge we will consider the problem of rigorous computations of level sets (up to homotopy type) and persistent homology of sufficiently smooth functions f : Rn ---> Rn.
Links
Practical information
- Informed public
- Free
Organizer
- Jérôme Scherer
Contact
- Jérôme Scherer