A brief overview of PDEs on graphs
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Matthew Thorpe.
Recent years have seen a lot of interest in partial differential equations discretised on arbitrary network structures. Especially driven by applications in data analysis and image processing, models such as the graph-based Ginzburg-Landau functional and variations on it have been used for processes such as data clustering, image segmentation, and maximum-cut computations. In this talk I will give a brief overview of some of the theory and applications in this area.
This talk is part of the Applied and Computational Analysis series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|