Use this URL to cite or link to this record in EThOS: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.485411
Title: Adaptive Krylov subspace methods for model reduction of large scale systems
Author: Frangos, Michalis
ISNI:       0000 0001 3482 265X
Awarding Body: Imperial College London
Current Institution: Imperial College London
Date of Award: 2008
Availability of Full Text:
Full text unavailable from EThOS. Please contact the current institution’s library for further details.
Abstract:
The ultimate goal of every theory according to Albert Einstein, is as follows: "It is the grand object of all theory to make these irreducible elements (axioms/assumptions) as simple and as few in number as possible, without having to renounce the adequate representation of any empirical content whatever" (Albert Einstein, 1954). The main goal of this dissertation falls in the above definition which is focused on model reduction of large-scale linear systems, to derive small and accurate linear systems based on efficient Krylov subspace projection techniques. The rational Arnoldi algorithm which belongs to the class of Krylov subspace projection methods has been applied for deriving reduced order models that are rational interpolating approximations of the original system. The rational Arnoldi algorithm is known in the literature and it is used extensively for the approximation of large scale linear systems due to its numerical stability and efficiency. However there are some outstanding issues which can affect and improve its performance which are investigated in this thesis. The first issue is in the development of a set of simple equations, the Arnoldi-like equations, to describe the rational Arnoldi-algorithm. This set of equations is of the same form as in the case of the well-known standard Arnoldi algorithm, an algorithm based on which many techniques for model reduction have emerged. The reduced order models developed by the rational Arnoldi algorithm interpolate the original system at multiple interpolation points, while the standard Arnoldi algorithm interpolates the original system around infinity. The second issue is in the development of adaptive schemes for the selection of the interpolation points which result in significantly improved approximations, without a priori knowledge of the system's transfer function characteristics. The information about the interpolation points rises from simple error expressions and error approximation expressions derived posing the Arnoldi-like equations. The third issue concerned in this work is in the development of a simple and easy to understand modified version of the rational Arnoldi algorithm which is suitable for adaptive interpolation. A breakdown analysis and an error analysis, essential for the adaptive schemes, are provided. Based on the modified Arnoldi algorithm an efficient restart technique for the algorithm is also developed to improve the approximation further while the order of the approximation remains fixed. The performance of the reduced order approximations is based on updates of some of the interpolation points of the approximations. A drawback of the rational interpolating methods is that they do not guarantee stability for the reduced order models. The fourth issue addressed in the thesis is the parameterisation of a set of interpolating approximations in terms of a free parameter. As a post-processing step of the rational Arnoldi algorithm any unstable reduced order models can be stabilised by a proper selection of the free parameter. Future research directions are provided at the conclusions of the thesis.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.485411  DOI: Not available
Share: