Patrick Kürschner

Efficient Low-Rank Solution of Large-Scale Matrix Equations

ISBN:

978-3-8440-4385-3

Series:

Forschungsberichte aus dem Max-Planck-Institut für Dynamik komplexer technischer Systeme
Herausgeber: Prof. Dr. Peter Benner, Prof. Dr.-Ing. Udo Reichl, Prof. Dr.-Ing. Andreas Seidel-Morgenstern and Prof. Dr.-Ing. Kai Sundmacher
Magdeburg

Volume:

Keywords:

Numerical Linear Algebra; Matrix Equations; Model Order Reduction

Type of publication:

Thesis

Language:

English

Pages:

250 pages

Figures:

17 figures

Weight:

371 g

Format:

21 x 14,8 cm

Bindung:

Paperback

Price:

49,80 € / 62,30 SFr

Published:

April 2016

Buy:

Download:

Available PDF-Files for this title:

You need the Adobe Reader, to open the files. Here you get help and information, for the download.

These files are not printable.


	Document		Document
	Type		PDF
	Costs		12,45 EUR
	Action		Purchase in obligation and display of file - 1,8 MB (1864918 Byte)
	Action		Purchase in obligation and download of file - 1,8 MB (1864918 Byte)


	Document		Table of contents
	Type		PDF
	Costs		free
	Action		Diplay of file - 93 kB (95609 Byte)
	Action		Download of file - 93 kB (95609 Byte)

User settings for registered users

You can change your address here or download your paid documents again.

User:	Not logged in.
Actions:	Login / Register Forgotten your password?

Recommendation:

You want to recommend this title?

Review copy

Here you can order a review copy.

Link

You want to link this page? Click here.

Abstract

In this thesis, we investigate the numerical solution of large-scale, algebraic matrix equations.
The focus lies on numerical methods based on the alternating directions implicit (ADI) iteration, which can be formulated to compute approximate solutions of matrix equations in form of low-rank factorizations. These low-rank versions of the ADI iteration can be used to deal with large-scale Lyapunov and Sylvester equations.
The major part of this thesis is devoted to improving the performance of these iterative methods. At first, we develop algorithmic enhancements that aim at reducing the computational effort of certain stages in each iteration step. This includes novel low-rank expressions of the residual matrix, which allows an efficient computation of the residual norm, and approaches for the reduction of the amount of occurring complex arithmetic operations.
ADI based methods rely on shift parameters, which influence how fast the iteration generates an approximate solution. For this, we propose novel shift generation strategies which improve the convergence speed of the low-rank ADI iteration and, at the same time, can be performed in an automatic and cost efficient numerical way.
Later on, the improved low-rank ADI methods for Lyapunov and Sylvester equations are used in Newton type methods for finding approximate solutions of quadratic matrix equations in the form of symmetric and nonsymmetric algebraic Riccati equations. In the last part of this thesis, the methods for solving large-scale Lyapunov equations are applied in order to execute balanced truncation model order reduction for linear control systems in a numerically feasible way.
For frequency-limited balanced truncation, a novel and efficient algorithmic framework is developed.