Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14587
For citation please use:
Main Title: An inverse-free ADI algorithm for computing Lagrangian invariant subspaces
Author(s): Mehrmann, Volker
Poloni, Federico
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15814
http://dx.doi.org/10.14279/depositonce-14587
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: The numerical computation of Lagrangian invariant subspaces of large scale Hamiltonian matrices is discussed in the context of the solution of Lyapunov and Riccati equations. A new version of the low-rank alternating direction implicit method is introduced, which in order to avoid numerical difficulties with solutions that are of very large norm, uses an inverse-free representation of the subspace and avoids inverses of ill-conditioned matrices. It is shown that this prevents large growth of the elements of the solution which may destroy a low-rank approximation of the solution. A partial error analysis is presented and the behavior of the method is demonstrated via several numerical examples.
Subject(s): Lagrangian subspace
permuted Lagrangian subspace
Lyapunov equation
Riccati equation
low-rank ADI method
inverse-free arithmetic
permuted graph basis
Issue Date: 5-Aug-2014
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: 65F15 Eigenvalues, eigenvectors
65F50 Sparse matrices
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2014, 14
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
MehP14.pdf
Format: Adobe PDF | Size: 502.17 kB
DownloadShow Preview
Thumbnail

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.