From low-rank retractions to dynamical low-rank approximation and back
Abstract
In algorithms for solving optimization problems constrained to a smooth manifold, retractions are a well-established tool to ensure that the iterates stay on the manifold. More recently, it has been demonstrated that retractions are a useful concept for other computational tasks on manifold as well, including interpolation tasks. In this work, we consider the application of retractions to the numerical integration of differential equations on fixed-rank matrix manifolds. This is closely related to dynamical low-rank approximation (DLRA) techniques. In fact, any retraction leads to a numerical integrator and, vice versa, certain DLRA techniques bear a direct relation with retractions. As an example for the latter, we introduce a new retraction, called KLS retraction, that is derived from the so-called unconventional integrator for DLRA. We also illustrate how retractions can be used to recover known DLRA techniques and to design new ones. In particular, this work introduces two novel numerical integration schemes that apply to differential equations on general manifolds: the accelerated forward Euler (AFE) method and the Projected Ralston–Hermite (PRH) method. Both methods build on retractions by using them as a tool for approximating curves on manifolds. The two methods are proven to have local truncation error of order three. Numerical experiments on classical DLRA examples highlight the advantages and shortcomings of these new methods.
References
[1]
Absil PA, Mahony R, and Sepulchre R Optimization Algorithms on Matrix Manifolds 2008 Princeton Princeton University Press
[2]
Absil, P.A., Mahony, R., Trumpf, J.: An extrinsic look at the Riemannian Hessian. In: Geometric science of information, Lecture Notes in Comput. Sci., vol. 8085, pp. 361–368. Springer, Heidelberg (2013).
[3]
Absil PA and Malick J Projection-like retractions on matrix manifolds SIAM J. Optim. 2012 22 1 135-158
[4]
Absil PA and Oseledets IV Low-rank retractions: a survey and new results Comput. Optim. Appl. 2015 62 1 5-29
[5]
Boumal N An Introduction to Optimization on Smooth Manifolds 2023 Cambridge Cambridge University Press
[6]
Boumal N, Mishra B, Absil PA, and Sepulchre R Manopt, a Matlab toolbox for optimization on manifolds J. Mach. Learn. Res. 2014 15 42 1455-1459
[7]
Ceruti, G., Kusch, J., Lubich, C.: A parallel rank-adaptive integrator for dynamical low-rank approximation (2023). ArXiv preprint: arXiv:2304.05660
[8]
Ceruti G and Lubich C An unconventional robust integrator for dynamical low-rank approximation BIT 2022 62 1 23-44
[9]
Charous A and Lermusiaux PFJ Dynamically orthogonal Runge–Kutta schemes with perturbative retractions for the dynamical low-rank approximation SIAM J. Sci. Comput. 2023 45 2 A872-A897
[10]
Einkemmer L and Lubich C A low-rank projector-splitting integrator for the Vlasov-Poisson equation SIAM J. Sci. Comput. 2018 40 5 B1330-B1360
[11]
Feppon F and Lermusiaux PFJ A geometric approach to dynamical model order reduction SIAM J. Matrix Anal. Appl. 2018 39 1 510-538
[12]
Hairer, E., Lubich, C., Wanner, G.: Geometric numerical integration, Springer Series in Computational Mathematics, vol. 31. Springer, Heidelberg (2010). Structure-preserving algorithms for ordinary differential equations, Reprint of the second edition (2006)
[13]
Hairer, E., Nørsett, S.P., Wanner, G.: Solving ordinary differential equations. I, Springer Series in Computational Mathematics, vol. 8, second edition. Springer-Verlag, Berlin (1993)
[14]
Hairer, E., Wanner, G.: Solving ordinary differential equations. II, Springer Series in Computational Mathematics, vol. 14, revised edn. Springer-Verlag, Berlin (2010).
[15]
Helmke, U., Moore, J.B.: Optimization and dynamical systems. Communications and Control Engineering Series. Springer-Verlag London, Ltd., London (1994).
[16]
Jahnke T and Huisinga W A dynamical low-rank approach to the chemical master equation Bull. Math. Biol. 2008 70 8 2283-2302
[17]
Kazashi Y, Nobile F, and Vidličková E Stability properties of a projector-splitting scheme for dynamical low rank approximation of random parabolic equations Numer. Math. 2021 149 4 973-1024
[18]
Kieri E, Lubich C, and Walach H Discretized dynamical low-rank approximation in the presence of small singular values SIAM J. Numer. Anal. 2016 54 2 1020-1038
[19]
Kieri E and Vandereycken B Projection methods for dynamical low-rank approximation of high-dimensional problems Comput. Methods Appl. Math. 2019 19 1 73-92
[20]
Koch O and Lubich C Dynamical low-rank approximation SIAM J. Matrix Anal. Appl. 2007 29 2 434-454
[21]
Kressner D, Steinlechner M, and Vandereycken B Low-rank tensor completion by Riemannian optimization BIT 2014 54 2 447-468
[22]
Kusch J, Ceruti G, Einkemmer L, and Frank M Dynamical low-rank approximation for Burgers’ equation with uncertainty Int. J. Uncertain. Quantif. 2022 12 5 1-21
[23]
Lee JM Introduction to Riemannian manifolds, Graduate Texts in Mathematics 2018 Cham Springer
[24]
Lubich C and Oseledets IV A projector-splitting integrator for dynamical low-rank approximation BIT 2014 54 1 171-188
[25]
Peng Z, McClarren RG, and Frank M A low-rank method for two-dimensional time-dependent radiation transport calculations J. Comput. Phys. 2020 421 109735
[26]
Séguin, A., Kressner, D.: Hermite interpolation with retractions on manifolds (2022). ArXiv preprint: arXiv:2212.12259
[27]
Shub, M.: Some remarks on dynamical systems and numerical analysis. In: Dynamical systems and partial differential equations (Caracas, 1984), pp. 69–91. Univ. Simon Bolivar, Caracas (1986)
[28]
Steinlechner M Riemannian optimization for high-dimensional tensor completion SIAM J. Sci. Comput. 2016 38 5 S461-S484
[29]
Séguin, A.: Retraction-based numerical methods for continuation, interpolation and time integration on manifolds (2023). PhD Thesis, EPFL
[30]
Uschmajew, A., Vandereycken, B.: Geometric methods on low-rank matrix and tensor manifolds. In: Handbook of Variational Methods for Nonlinear Geometric Data, pp. 261–313. Springer, Cham ([2020] 2020).
[31]
Vandereycken B Low-rank matrix completion by Riemannian optimization SIAM J. Optim. 2013 23 2 1214-1236
Index Terms
- From low-rank retractions to dynamical low-rank approximation and back
Index terms have been assigned to the content through auto-classification.
Recommendations
A rank-adaptive robust integrator for dynamical low-rank approximation
AbstractA rank-adaptive integrator for the dynamical low-rank approximation of matrix and tensor differential equations is presented. The fixed-rank integrator recently proposed by two of the authors is extended to allow for an adaptive choice of the rank,...
Time Integration of Rank-Constrained Tucker Tensors
Dynamical low-rank approximation in the Tucker tensor format of given large time-dependent tensors and of tensor differential equations is the subject of this paper. In particular, a discrete time integration method for rank-constrained Tucker tensors ...
Dynamical low-rank approximation: applications and numerical experiments
Dynamical low-rank approximation is a differential-equation-based approach to efficiently compute low-rank approximations to time-dependent large data matrices or to solutions of large matrix differential equations. We illustrate its use in the ...
Comments
Information & Contributors
Information
Published In
© The Author(s) 2024.
Publisher
BIT Computer Science and Numerical Mathematics
United States
Publication History
Published: 17 June 2024
Accepted: 04 June 2024
Received: 12 September 2023
Author Tags
Author Tags
Qualifiers
- Research-article
Funding Sources
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 23 Jan 2025