Abstract
An established way to tackle model nonlinearities in projection-based model reduction is via relying on partial information. This idea is shared by the methods of gappy proper orthogonal decomposition (POD), missing point estimation (MPE), masked projection, hyper reduction, and the (discrete) empirical interpolation method (DEIM). The selected indices of the partial information components are often referred to as “magic points.” The original contribution of the work at hand is a novel randomized greedy magic point selection. It is known that the greedy method is associated with minimizing the norm of an oblique projection operator, which, in turn, is associated with solving a sequence of rank-one SVD update problems. We propose simplification measures so that the resulting greedy point selection has the following main features: (1) The inherent rank-one SVD update problem is tackled in a way, such that its dimension does not grow with the number of selected magic points. (2) The approach is online efficient in the sense that the computational costs are independent from the dimension of the full-scale model. To the best of our knowledge, this is the first greedy magic point selection that features this property. We illustrate the findings by means of numerical examples. We find that the computational cost of the proposed method is orders of magnitude lower than that of its deterministic counterpart. Nevertheless, the prediction accuracy is just as good if not better. When compared to a state-of-the-art randomized method based on leverage scores, the randomized greedy method outperforms its competitor.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Data Availability
With the exception of the 3D-block experiment, all data used in this work is either random or freely available. The links to the code and data are provided in the text body.
References
Benner, P., Gugercin, S., Willcox, K.: A survey of projection-based model reduction methods for parametric dynamical systems. SIAM Rev. 57(4), 483–531 (2015). https://doi.org/10.1137/130932715
Chaturantabut, S., Sorensen, D.: Nonlinear model reduction via discrete empirical interpolation. SIAM J. Sci. Comput. 32(5), 2737–2764 (2010)
Drmač, Z., Gugercin, S.: A new selection operator for the discrete empirical interpolation method–improved a priori error bound and extensions. SIAM J. Sci. Comput. 38(2), 631–648 (2016). https://doi.org/10.1137/15M1019271
Astrid, P., Weiland, S., Willcox, K., Backx, T.: Missing points estimation in models described by proper orthogonal decomposition. IEEE Trans. Autom. Control 53(10), 2237–2251 (2008)
Zimmermann, R., Willcox, K.: An accelerated greedy missing point estimation procedure. SIAM J. Sci. Comput. 38(5), 2827–2850 (2016). https://doi.org/10.1137/15M1042899
Everson, R., Sirovich, L.: Karhunen-Loève procedure for gappy data. J. Opt. Soc. Am. 12(8), 1657–1664 (1995). https://doi.org/10.1364/JOSAA.12.001657
Bui-Thanh, T., Damodaran, M., Willcox, K.: Proper orthogonal decomposition extensions for parametric applications in transonic aerodynamics. AIAA J. 42(8), 1505–1516 (2004)
Galbally, D., Fidkowski, K., Willcox, K., Ghattas, O.: Non-linear model reduction for uncertainty quantification in large-scale inverse problems. Int. J. Numer. Meth. Eng. 81, 1581–1608 (2010)
Barrault, M., Maday, Y., Nguyen, N.C., Patera, A.T.: An empirical interpolation method: application to efficient reduced-basis discretization of partial differential equations. Comptes Rendus Mathématique. Académie des Sciences. Paris. I 339, 667–672 (2004)
Peherstorfer, B., Drmač, Z., Gugercin, S.: Stability of discrete empirical interpolation and gappy proper orthogonal decomposition with randomized and deterministic sampling points. SIAM J. Sci. Comput. 42(5), 2837–2864 (2020). https://doi.org/10.1137/19M1307391
Carlberg, K., Farhat, C., Cortial, J., Amsallem, D.: The GNAT method for nonlinear model reduction: Effective implementation and application to computational fluid dynamics and turbulent flows. J. Comput. Phys. 242, 623–647 (2013). https://doi.org/10.1016/j.jcp.2013.02.028
Amsallem, D., Zahr, M.J., Washabaugh, K.: Fast local reduced basis updates for the efficient reduction of nonlinear systems with hyper-reduction. Adv. Comput. Math. 41(5), 1187–1230 (2015). https://doi.org/10.1007/s10444-015-9409-0
Clark, E., Askham, T., Brunton, S.L., Kutz, J.N.: Greedy sensor placement with cost constraints. ArXiv e-prints. (2018) arXiv:1805.03717 [math.OC]
Sargsyan, S., Brunton, S.L., Kutz, J.N.: Online interpolation point refinement for reduced-order models using a genetic algorithm. SIAM J. Scientific Computing. 40(1), 283–304 (2018). https://doi.org/10.1137/16M1086352
Saibaba, A.K.: Randomized discrete empirical interpolation method for nonlinear model reduction. SIAM J. Sci. Comput. 42(3), 1582–1608 (2020). https://doi.org/10.1137/19M1243270
Mahoney, M.W., Drineas, P.: Cur matrix decompositions for improved data analysis. Proc. Natl. Acad. Sci. 106(3), 697–702 (2009). https://doi.org/10.1073/pnas.0803205106http://www.pnas.org/content/106/3/697.full.pdf+html
Sorensen, D.C., Embree, M.: A DEIM induced CUR factorization. SIAM J. Sci. Comput. 38(3), 1454–1482 (2016). https://doi.org/10.1137/140978430
Bekemeyer, P., Ripepi, M., Heinrich, R., Görtz, S.: Nonlinear unsteady reduced-order modeling for gust-load predictions. AIAA J. 57(5), 1839–1850 (2019). https://doi.org/10.2514/1.J057804
Wentland, C.R., Huang, C., Duraisamy, K.: Investigation of sampling strategies for reduced-order models of rocket combustors. https://doi.org/10.2514/6.2021-1371
Szyld, D.B.: The many proofs of an identity on the norm of oblique projections. Numerical Algorithms. 42, 309–323 (2006)
Wilkinson, J.H.: The algebraic eigenvalue problem. Clarendon Press, Oxford, UK (1965)
Ipsen, I.C.F., Nadler, B.: Refined perturbation bounds for eigenvalues of hermitian and non-hermitian matrices. SIAM Journal on Matrix Analysis Applications. 31, 40–53 (2009)
Gu, M., Eisenstat, S.C.: A stable and efficient algorithm for the rank-one modification of the symmetric eigenproblem. SIAM J. Matrix Anal. Appl. 15, 1266–1276 (1994)
Gu, M., Stanley, Eisenstat, S.C., O, I.: A stable and fast algorithm for updating the singular value decomposition. Technical report (1994)
Candes, E., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9, 717–772 (2009)
Balzano, L., Recht, B., Nowak, R.: High-dimensional matched subspace detection when data are missing. In: International Symposium on Information Theory, pp. 1638–1642 (2010). IEEE
Recht, B.: A simpler approach to matrix completion. J. Mach. Learn. Res. 12, 3413–3430 (2011)
Gross, D.: Recovering low-rank matrices from few coefficients in any basis. IEEE Trans. Inf. Theory 57(3), 1548–1566 (2011)
Jakovčević Stor, N., Slapničar, I., Barlow, J.L.: Forward stable eigenvalue decomposition of rank-one modifications of diagonal matrices. Linear Algebra and its Applications. 487, 301–315 (2015) 10.1016/j.laa.2015.09.025
Kutz, J.N., Brunton, S.L., Brunton, B.W., Proctor, J.L.: Dynamic mode decomposition. Society for Industrial and Applied Mathematics, Philadelphia, PA (2016). 10.1137/1.9781611974508
Pinnau, R.: Model reduction via proper orthogonal decomposition. In: Schilders, W.H.A., Vorst, H.A., Rommes, J. (eds.) Model Order Reduction: Theory, Research Aspects and Applications. Springer Series Mathematics in Industry, vol. 13, pp. 95–109. Springer, ??? (2008)
Afkham, B.M., Hesthaven, J.S.: Structure preserving model reduction of parametric Hamiltonian systems. SIAM J. Sci. Comput. 39(6), 2616–2644 (2017). https://doi.org/10.1137/17M1111991
Zimmermann, R., Bendokat, T.: Geometric optimization for structure-preserving model reduction of Hamiltonian systems. In: MATHMOD: 10th Vienna International Conference on Mathematical Modelling. IFAC-PapersOnLine. Elsevier, Austria (2022)
Hairer, E., Lubich, C., Wanner, G.: Geometric numerical integration: structure-preserving algorithms for ordinary differential equations., 2nd edn. Springer Series in Computational Mathematics, vol. 31, p. 644. Springer, Berlin (2006)
Peng, L., Mohseni, K.: Symplectic model reduction of Hamiltonian systems. SIAM J. Sci. Comput. 38(1), 1–27 (2016). https://doi.org/10.1137/140978922
Brunton, S.L., Kutz, J.N.: Data-driven science and engineering: machine learning. Dynamical Systems and Control. Cambridge University Press, Cambrisge, UK (2019)
Inc., T.M.: MATLAB Version: 9.13.0 (R2022b). https://www.mathworks.com
Funding
Open access funding provided by University of Southern Denmark.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare no competing interests.
Additional information
Communicated by: Anthony Nouy
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix 1: Matlab code
Appendix 1: Matlab code
In this section, we give listings of Matlab codes [37] for the various greedy magic point selection algorithms. Mind that in Matlab, a “%”-sign starts a comment line
1.1 A.1 Simplified fast greedy magic point selection
![figure a](http://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs10444-024-10172-1/MediaObjects/10444_2024_10172_Figa_HTML.png)
1.2 A.2 Randomized greedy magic point selection
![figure b](http://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs10444-024-10172-1/MediaObjects/10444_2024_10172_Figb_HTML.png)
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Zimmermann, R., Cheng, K. Randomized greedy magic point selection schemes for nonlinear model reduction. Adv Comput Math 50, 81 (2024). https://doi.org/10.1007/s10444-024-10172-1
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10444-024-10172-1