Location of Repository

Efficiency improving implementation techniques for large scale matrix equation solvers

By Martin Köhler and Jens Saak


We address the important field of large scale matrix based algorithms in control and model order reduction. Many important tools from theory and applications in systems theory have been widely ignored during the recent decades in the context of PDE constraint optimal control problems and simulation of electric circuits. Often this is due to the fact that large scale matrices are suspected to be unsolvable in large scale applications. Since around 2000 efficient low rank theory for matrix equation solvers exists for sparse and also data sparse systems. Unfortunately upto now only incomplete or experimental Matlab implementations of most of these solvers have existed. Here we aim on the implementation of these algorithms in a higher programming language (in our case C) that allows for a high performance solver for many matrix equations arising in the context of large scale standard and generalized state space systems. We especially focus on efficient memory saving data structures and implementation techniques as well as the shared memory parallelization of the underlying algorithms

Topics: ddc:510, Implementierung, Ljapunov-Gleichung, Numerische Mathematik, Optimale Kontrolle, Parallelisierung, Systemtheorie
Publisher: Universitätsbibliothek Chemnitz
Year: 2010
OAI identifier: oai:qucosa.de:bsz:ch1-201000843

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.