Premium
A modified adaptive‐order rational Arnoldi method for model order reduction
Author(s) -
Bodendiek André,
Bollhöfer Matthias
Publication year - 2013
Publication title -
pamm
Language(s) - English
Resource type - Journals
ISSN - 1617-7061
DOI - 10.1002/pamm.201310203
Subject(s) - orthonormal basis , model order reduction , arnoldi iteration , computation , mathematical optimization , projection (relational algebra) , reduction (mathematics) , order (exchange) , mathematics , extension (predicate logic) , computer science , generalized minimal residual method , algorithm , iterative method , physics , geometry , finance , quantum mechanics , economics , programming language
A Greedy‐type expansion point selection for moment‐matching methods in model order reduction mainly depends on the computation of a sequence of reduced order models. Typically, the adaptive‐order rational Arnoldi (AORA) method resembles an efficient way for the computation of a Galerkin projection corresponding to a set of expansion points. We will provide an extension of the AORA method, in order to reuse the orthonormal basis from previous calls of the AORA method. (© 2013 Wiley‐VCH Verlag GmbH & Co. KGaA, Weinheim)