Skip to main content Accessibility help

Introduction: Big data and partial differential equations


Partial differential equations (PDEs) are expressions involving an unknown function in many independent variables and their partial derivatives up to a certain order. Since PDEs express continuous change, they have long been used to formulate a myriad of dynamical physical and biological phenomena: heat flow, optics, electrostatics and -dynamics, elasticity, fluid flow and many more. Many of these PDEs can be derived in a variational way, i.e. via minimization of an ‘energy’ functional. In this globalised and technologically advanced age, PDEs are also extensively used for modelling social situations (e.g. models for opinion formation, mathematical finance, crowd motion) and tasks in engineering (such as models for semiconductors, networks, and signal and image processing tasks). In particular, in recent years, there has been increasing interest from applied analysts in applying the models and techniques from variational methods and PDEs to tackle problems in data science. This issue of the European Journal of Applied Mathematics highlights some recent developments in this young and growing area. It gives a taste of endeavours in this realm in two exemplary contributions on PDEs on graphs [1, 2] and one on probabilistic domain decomposition for numerically solving large-scale PDEs [3].

    • Send article to Kindle

      To send this article to your Kindle, first ensure is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the or variations. ‘’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Introduction: Big data and partial differential equations
      Available formats
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Introduction: Big data and partial differential equations
      Available formats
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Introduction: Big data and partial differential equations
      Available formats
Hide All

CBS acknowledges support from the Leverhulme Trust project Breaking the non-convexity barrier, the EPSRC grant EP/M00483X/1, EPSRC centre EP/N014588/1, the Cantab Capital Institute for the Mathematics of Information, the CHiPS (Horizon 2020 RISE project grant), the Global Alliance project ‘Statistical and Mathematical Theory of Imaging’ and the Alan Turing Institute.

Hide All
[1] Trillos, N. G. & Murray, R. (2017) A new analytical approach to consistency and overfitting in regularized empirical risk minimization. EJAM. 28 (6), 886921.
[2] Elmoataz, A., Desquesnes, X. & Toutain, M. (2017) On the game p-Laplacian on weighted graphs with applications in image processing and data clustering. EJAM. 28 (6), 922948.
[3] Bernal, F., dos Reis, G. & Smith, G. (2017) Hybrid PDE solver for data-driven problems and modern branching. EJAM. 28 (6), 949972.
[4] Bertozzi, A. L. & Flenner, A. (2012) Diffuse interface models on graphs for analysis of high dimensional data. Multiscale Model. Simul. 10 (3), 10901118.
[5] van Gennip, Y. & Bertozzi, A. L. (2012) Γ-convergence of graph Ginzburg–Landau functionals. Adv. Differ. Equ. 17 (11/12), 11151180.
[6] Dal Maso, G. (1993) An Introduction to Γ-Convergence, Birkhäuser, Boston, USA.
[7] Braides, A. (2002) Γ-Convergence for Beginners, Oxford University
[8] Modica, L. & Mortola, S. (1977) Un esempio di Γ-convergenza. Boll. dell'Unione Mat. Ital. 5 (14-B), 285299.
[9] Modica, L. (1987) The gradient theory of phase transitions and the minimal interface criterion. Arch. Ration. Mech. Anal. 98 (2), 123142.
[10] von Luxburg, U. (2007) A tutorial on spectral clustering. Stat. Comput. 17 (4), 395416.
[11] Garcia Trillos, N. & Slepčev, D. (2016) Continuum limit of total variation on point clouds. Arch. Ration. Mech. Anal. 220 (1), 193241.
[12] Garcia, Trillos, N., Slepčev, D., von Brecht, J., Laurent, T. & Bresson, X. (2016) Consistency of cheeger and ratio graph cuts. J. Mach. Learn. Res. 17, 146.
[13] Thorpe, M. & Theil, F. Asymptotic analysis of the Ginzburg–Landau functional on point clouds. to appear, arXiv preprint arXiv:1604.04930
[14] Merriman, B., Bence, J. K. & Osher, S. J. (1994) Motion of multiple functions: A level set approach. J. Comput. Phys. 112 (2), 334363.
[15] Chung, F. (1997) Spectral Graph Theory, American Mathematical Society, Providence, Rhode Island, USA.
[16] Merkurjev, E., Kostic, T. & Bertozzi, A. L. (2013) An MBO scheme on graphs for segmentation and image processing. SIAM J. Imaging Sci. 6 (4), 19031930.
[17] Nyström, E. J. (1928) Über die Praktische Auflösung von Linearen Integralgleichungen mit Anwendungen auf Randwertaufgaben der Potentialtheorie. Comment. Phys.-Math. 4 (15), 152.
[18] Fowlkes, C., Belongie, S., Chung, F. & Malik, J. (2004) Spectral grouping using the Nystrom method. IEEE Trans. Pattern Anal. Mach. Intell. 26 (2), 214225.
[19] Anderson, C. R. (2010) A Rayleigh–Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices. J. Comput. Phys. 229 (19), 74777487.
[20] Calatroni, L., van Gennip, Y., Schönlieb, C.-B., Rowland, H. & Flenner, A. (2017) Graph clustering, variational image segmentation methods and Hough transform scale detection for object measurement in images. J. Math. Imaging Vis. 57 (2), 269291.
[21] Garcia-Cardona, C., Flenner, A. & Percus, A. G. (2013) Multiclass diffuse interface models for semi-supervised learning on graphs. In: Proceedings of the 2nd International Conference on Pattern Recognition Applications and Methods (ICPRAM 2013), pp. 78–86.
[22] Merkurjev, E., Garcia-Cardona, C., Bertozzi, A. L., Flenner, A. & Percus, A. G. (2014) Diffuse interface methods for multiclass segmentation of high-dimensional data. Appl. Math. Lett. 33, 2934.
[23] Garcia-Cardona, C., Merkurjev, E., Bertozzi, A. L., Flenner, A. & Percus, A. G. (2014) Multiclass data segmentation using diffuse interface methods on graphs. IEEE Trans. Pattern Anal. Mach. Intell. 36, 16001613.
[24] Garcia-Cardona, C., Flenner, A. & Percus, A. G. (2015) Multiclass semi-supervised learning on graphs using Ginzburg–Landau functional minimization. Adv. Intell. Syst. Comput. 318 (2015), 119135.
[25] Meng, Z., Merkurjev, E., Koniges, A. & Bertozzi, A. L. (2017) Hyperspectral image classification using graph clustering methods. Image Process. Line 7, 218245.
[26] Luo, X. & Bertozzi, A. L. (2017) Convergence of the graph Allen–Cahn scheme. J. Stat. Phys. 167 (3), 934958.
[27] Bosch, J., Klamt, S. & Stoll, M. Generalizing diffuse interface methods on graphs: non-smooth potentials and hypergraphs. arXiv preprint arXiv:1611.06094.
[28] Keetch, B. & van Gennip, Y. A Max-Cut approximation using a graph based MBO scheme, in preparation
[29] Brakke, K. A. (1978) The Motion of a Surface by its Mean Curvature, Princeton University.
[30] Bronsard, L. & Kohn, R. V. (1991) Motion by mean curvature as the singular limit of Ginzburg–Landau dynamics. J. Differ. Equ. 90 (2), 211237.
[31] Evans, L. C. (1993) Convergence of an algorithm for mean curvature motion. Indiana Univ. Math. J. 42 (2), 533557.
[32] Barles, G., Soner, H. M. & Souganidis, P. E. (1993) Front propagation and phase field theory. SIAM J. Control Optim. 31 (2), 439469.
[33] Barles, G. & Georgelin, C. (1995) A simple proof of convergence for an approximation scheme for computing motions by mean curvature. SIAM J. Numer. Anal. 32 (2), 484500.
[34] van Gennip, Y., Guillen, N., Osting, B. & Bertozzi, A. L. (2014) Mean curvature, threshold dynamics, and phase field theory on finite graphs. Milan J. Math. 82 (1), 365.
[35] Almgren, F., Taylor, J. E. & Wang, L. (1993) Curvature-driven flows: A variational approach. SIAM J. Control Optim. 31 (2), 387438.
[36] Luckhaus, S. & Sturzenhecker, T. (1995) Implicit time discretization for the mean curvature flow equation. Calc. Var. Partial Differ. Equ. 3 (2), 253271.
[37] Taylor, J. E. (1996) Anisotropic interface motion. Math. Microstruct. Evol. 4, 135148.
[38] Ohta, T. & Kawasaki, K. (1986) Equilibrium morphology of block copolymer melts. Macromolecules 19, 26212632.
[39] van Gennip, Y. An MBO scheme for minimizing the graph Ohta–Kawasaki functional. in preparation
[40] Peres, Y. & Sheffield, S. (2008) Tug-of-war with noise: A game-theoretic view of the p-Laplacian. Duke Math. J. 145 (1), 91120.
[41] Lions, P. L. (1988) On the Schwarz alternating method, I. In: Proceedings of the 1st International Symposium on Domain Decomposition Methods for Partial Differential Equations, pp. 1–42.
[42] Bramble, J. H., Pasciak, J. E., Wang, J. P. & Xu, J. (1991) Convergence estimates for product iterative methods with applications to domain decomposition. Math. Comput. 57 (195), 121.
[43] Xu, J. (1992) Iterative methods by space decomposition and subspace correction. SIAM Rev. 34 (4), 581613.
[44] Chan, T. F. & Mathew, T. P. (1994) Domain decomposition algorithms. Acta Numer. 3, 61143.
[45] Quarteroni, A. & Valli, A. (1999) Domain Decomposition Methods for Partial Differential Equations, Numerical Mathematics and Scientific Computation, Clarendon Press/Oxford University, New York, Oxford Science Publications.
[46] Smith, B., Bjorstad, P., , P. & Gropp, W. (2004) Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations, Cambridge University.
[47] Nesterov, Y. (2012) Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22 (2), 341362.
[48] Acebron, J. A., Busico, M. P., Lanucara, P. & Spigler, R. (2005) Domain decomposition solution of elliptic boundary-value problems via Monte Carlo and quasi-Monte Carlo methods. SIAM J. Sci. Comput. 27 (2).
[49] van Gennip, Y. (2017) Using evolving interface techniques to solve network problems. In: Mathematisches Forschungsinstitut Oberwolfach Report: Emerging Developments in Interfaces and Free Boundaries, Vol. 6, pp. 2429.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

European Journal of Applied Mathematics
  • ISSN: 0956-7925
  • EISSN: 1469-4425
  • URL: /core/journals/european-journal-of-applied-mathematics
Please enter your name
Please enter a valid email address
Who would you like to send this to? *



Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed