Least-squares proper generalised decompositions for weakly coercive elliptic problems

Article English OPEN
Croft, Thomas L. D. ; Phillips, Timothy Nigel (2017)
  • Publisher: Society for Industrial and Applied Mathematics
  • Related identifiers: doi: 10.1137/15M1049269
  • Subject: QA
    arxiv: Mathematics::Numerical Analysis

Proper generalised decompositions (PGDs) are a family of methods for efficiently solving high-dimensional PDEs which seek to find a low-rank approximation to the solution of the PDE a priori. Convergence of PGD algorithms can only be proven for problems which are continuous, symmetric and strongly coercive. In the\ud particular case of problems which are only weakly coercive we have the additional issue that weak coercivity estimates are not guaranteed to be inherited by the low-rank PGD approximation. This can cause stability issues when employing a Galerkin PGD approximation of weakly coercive problems. In this paper we propose the use of PGD algorithms based on least-squares formulations which always lead to symmetric and strongly coercive problems and hence provide stable and provably convergent algorithms. Taking the Stokes problem\ud as a prototypical example of a weakly coercive problem, we develop and compare rigorous least-squares PGD algorithms based on continuous least-squares estimates for two different reformulations of the problem. We show that these least-squares PGD provide a much stabler algorithm than an equivalent Galerkin PGD and provide proofs of convergence of the algorithms.
  • References (31)
    31 references, page 1 of 4

    [1] Y. Achdou and O. Pironneau, Computational Methods for Option Pricing, Frontiers in Appl. Math. 30, SIAM, Philadelphia, 2005.

    [2] S. Agmon, A. Douglis, and L. Nirenberg, Estimates near the boundary for solutions of elliptic partial differential equations satisfying general boundary conditions I, Commun. Pur. Appl. Math., 12 (1959), pp. 623-727.

    [3] S. Agmon, A. Douglis, and L. Nirenberg, Estimates near the boundary for solutions of elliptic partial differential equations satisfying general boundary conditions II, Commun. Pur. Appl. Math., 17 (1964), pp. 35-92.

    [4] A. Ammar, B. Mokdad, F. Chinesta, and R. Keunings, A new family of solvers for some classes of multidimensional partial differential equations encountered in kinetic theory modeling of complex fluids, J. Non-Newton. Fluid Mech., 139 (2006), pp. 153-176, https:// doi.org/10.1016/j.jnnfm.2006.07.007.

    [5] A. K. Aziz, R. B. Kellogg, and A. B. Stephens, Least squares methods for elliptic systems, Math. Comput., 44 (1985), pp. 53-70.

    [6] I. Babuˇska, Error bounds for finite element method, Numer. Math., 16 (1971), pp. 322-333.

    [7] G. Beylkin and M. J. Mohlenkamp, Numerical operator calculus in higher dimensions, Proc. Natl. Acad. Sci. USA, 99 (2002), pp. 10246-10251, https://doi.org/10.1073/pnas. 112329799.

    [8] M. Billaud-Friess, A. Nouy, and O. Zahm, A tensor approximation method based on ideal minimal residual formulations for the solution of high-dimensional problems, ESAIMMath. Model. Numer., 48 (2014), pp. 1777-1806, https://doi.org/10.1051/m2an/2014019.

    [9] P. B. Bochev and M. D. Gunzburger, Analysis of least-squares finite element methods for the Stokes equations, Math. Comput., 63 (1994), pp. 479-506.

    [10] P. B. Bochev and M. D. Gunzburger, Least-Squares Finite Element Methods, SpringerVerlag, New York, 2009.

  • Metrics
    No metrics available
Share - Bookmark