Matrix equations, sparse solvers: \texttt{M-M.E.S.S.}-2.0.1 -- philosophy, features, and application for (parametric) model order reduction

From MaRDI portal
Publication:5014035

DOI10.1007/978-3-030-72983-7_18zbMATH Open1480.93048arXiv2003.02088OpenAlexW3012350807MaRDI QIDQ5014035FDOQ5014035


Authors: P. Benner, Martin Köhler, J. Saak Edit this on Wikidata


Publication date: 3 December 2021

Published in: Model Reduction of Complex Dynamical Systems (Search for Journal in Brave)

Abstract: Matrix equations are omnipresent in (numerical) linear algebra and systems theory. Especially in model order reduction (MOR) they play a key role in many balancing based reduction methods for linear dynamical systems. When these systems arise from spatial discretizations of evolutionary partial differential equations, their coefficient matrices are typically large and sparse. Moreover, the numbers of inputs and outputs of these systems are typically far smaller than the number of spatial degrees of freedom. Then, in many situations the solutions of the corresponding large-scale matrix equations are observed to have low (numerical) rank. This feature is exploited by M-M.E.S.S. to find successively larger low-rank factorizations approximating the solutions. This contribution describes the basic philosophy behind the implementation and the features of the package, as well as its application in the model order reduction of large-scale linear time-invariant (LTI) systems and parametric LTI systems.


Full work available at URL: https://arxiv.org/abs/2003.02088




Recommendations



Cites Work


Cited In (6)

Uses Software





This page was built for publication: Matrix equations, sparse solvers: \texttt{M-M.E.S.S.}-2.0.1 -- philosophy, features, and application for (parametric) model order reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014035)