2015
DOI: 10.1007/s10915-015-0077-5
|View full text |Cite
|
Sign up to set email alerts
|

An Adaptive Rational Block Lanczos-Type Algorithm for Model Reduction of Large Scale Dynamical Systems

Abstract: Mathematical modeling of complex electrical systems, has led us to linear mathematical models of higher order. Consequently, it is difficult to analyse and to design a control strategy of these systems. The order reduction is an important and effective tool to facilitate the handling and designing of a control strategy. In this paper we present, firstly, a reduction method which is based on the Krylov subspace and Lyapunov techniques, that we call Lyapunov-Global-Lanczos. This method minimizes the H∞ norm erro… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
20
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 12 publications
(20 citation statements)
references
References 24 publications
0
20
0
Order By: Relevance
“…Where m and n are the order of reduced and original system, respectively. In table 2, we report the computational complexity of the proposed algorithm Lyapunov-Global-Lanczos (Lyap-GL) compared to selected state-of-art algorithms (Global Lanczos (GL) [18], [21], Lanczos [9], [15], [22], Rational Lanczos (RL) [21], [23], Arnodli (Ar) [9], [24], Rational Arnoldi (RA) [9], [14], [19], Balanced Truncation (BTR) [9], [25]):…”
Section: Computational Complexity Of Lyapunov-globallanczos Algorithmmentioning
confidence: 99%
“…Where m and n are the order of reduced and original system, respectively. In table 2, we report the computational complexity of the proposed algorithm Lyapunov-Global-Lanczos (Lyap-GL) compared to selected state-of-art algorithms (Global Lanczos (GL) [18], [21], Lanczos [9], [15], [22], Rational Lanczos (RL) [21], [23], Arnodli (Ar) [9], [24], Rational Arnoldi (RA) [9], [14], [19], Balanced Truncation (BTR) [9], [25]):…”
Section: Computational Complexity Of Lyapunov-globallanczos Algorithmmentioning
confidence: 99%
“…Moreover, the output ŷ should be close to the output y of the original system, which means that the error should be small for an appropriate norm. The associated low‐order transfer function is denoted by F^(s)=Ĉ(sIrÂ)1B^. There exist various model reduction approaches for MIMO state space systems such as balanced truncation, moment matching approximations, and the optimal Hankel norm approximation . A popular model reduction technique for large‐scale systems is the moment matching method considered first in Gallivan et al The main idea of this approach is to project the original system onto Krylov subspaces computed by Arnoldi or Lanczos processes for SISO and MIMO systems; see other works and the references therein.…”
Section: Introductionmentioning
confidence: 99%
“…Unfortunately, model reduction methods using a single frequency such as partial realization and Padé approximation tend to create reduced‐order models that poorly approximate low‐frequency dynamics. To overcome this problem, multipoint Padé approximants (denoted also multipoint rational interpolants) are proposed for approximating Equation using rational (or block rational) Krylov methods for SISO and MIMO systems; see other works . By multi‐point Padé approximation, we mean that the reduced system matches the moments of the original system at multiple interpolation points, these shifts have to be appropriately chosen to guarantee a good convergence of the process; see or works …”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations