This paper introduces a sparse matrix discrete interpolation method to effectively compute matrix approximations in the reduced order modeling framework. The sparse algorithm developed herein relies on the discrete empirical interpolation method and uses only samples of the nonzero entries of the matrix series. The proposed approach can approximate very large matrices, unlike the current matrix discrete empirical interpolation method which is limited by its large computational memory requirements. The empirical interpolation indexes obtained by the sparse algorithm slightly differ from the ones computed by the matrix discrete empirical interpolation method as a consequence of the singular vectors round-off errors introduced by the economy or full singular value decomposition (SVD) algorithms when applied to the full matrix snapshots. When appropriately padded with zeros the economy SVD factorization of the nonzero elements of the snapshots matrix is a valid economy SVD for the full snapshots matrix. Numerical experiments are performed with the 1D Burgers and 2D Shallow Water Equations test problems where the quadratic reduced nonlinearities are computed via tensorial calculus. The sparse matrix approximation strategy is compared against five existing methods for computing reduced Jacobians: a) matrix discrete empirical interpolation method, b) discrete empirical interpolation method, c) tensorial calculus, d) full Jacobian projection onto the reduced basis subspace, and e) directional derivatives of the model along the reduced basis functions. The sparse matrix method outperforms all other algorithms. The use of traditional matrix discrete empirical interpolation method is not possible for very large instances due to its excessive memory requirements.
On the Convergence of Jacobian-Free Backpropagation for Optimal Control Problems with Implicit Hamiltonians
Department of Applied Mathematics and Statistics, Colorado School of Mines(应用数学与统计学系,科罗拉多矿业学院);Department of Mathematical Sciences, Clemson University(数学科学系,克莱姆森大学);Department of Mathematics, University of Tennessee Knoxville(数学系,田纳西大学肯尼思维尔分校);Department of Mathematics, University of California Los Angeles(数学系,加州大学洛杉矶分校)
Greedy Gauss-Newton algorithm for finding sparse solutions to nonlinear underdetermined systems of equations
School of Science and Technology, Örebro University(欧勒布鲁大学理学院与技术学院);Department of Mathematical Sciences and Technology, Norwegian University of Life Sciences(挪威生命科学大学数学科学与技术系)
BIFOLD – Berlin Institute for the Foundations of Learning and Data(柏林学习与数据基础研究所);LVMT, ENPC, Institut Polytechnique de Paris, Univ Gustave Eiffel(法国国立路桥学校,巴黎理工学院,古斯塔夫·埃菲尔大学);Machine Learning Group, Technical University of Berlin(柏林工业大学机器学习组)
Second-order consistency for learning chaotic dynamics via randomized Jacobian matching
Department of Computer Science and Software Engineering, Korea University(韩国大学计算机科学与软件工程系);Department of Aerospace Engineering and Engineering Mechanics, The Oden Institute for Computational Engineering and Sciences, The University of Texas at Austin(德克萨斯大学奥斯汀分校航空航天工程与工程力学系,奥登计算工程与科学研究所)
GPU-Accelerated Nested Schur-Complement Solvers for Atmospheric Flow Simulations Using Horizontally-Explicit, Vertically-Implicit Schemes and Discontinuous Galerkin Methods
Johannes Gutenberg University Mainz(约翰内斯·古腾堡美因茨大学);Universidad Politécnica de Madrid(马德里理工大学);Leibniz Institute for Tropospheric Research (TROPOS)(莱布尼茨对流层研究所);University of Cologne(科隆大学)
Computing log-likelihood and its derivatives for restricted maximum likelihood methods
Laboratory of Computational Physics, Institute of Applied Physics and Computational Mathematics(应用物理与计算数学研究所计算物理实验室);Oxford Center for Collaborative and Applied Mathematics & Numerical Analysis Group, Mathematical Institute, The University of Oxford(牛津大学数学学院合作与应用数学中心及数值分析组)