We investigate model reduction of large-scale linear time-invariant systems in
generalized state-space form. We consider sparse state matrix pencils, including
pencils with banded structure. The balancing-based methods employed here are
composed of well-known linear algebra operations and have been recently shown to be
applicable to large models by exploiting the structure of the matrices defining
the dynamics of the system.
In this paper we propose a modification of the LR-ADI iteration to solve
large-scale generalized Lyapunov equations together with a practical
convergence criterion, and several other implementation refinements.
Using kernels from several serial and parallel linear algebra libraries,
we have developed a parallel package for model reduction, SpaRed, extending
the applicability of balanced truncation to sparse systems with up to
$O(10^5)$ states.
Experiments on an SMP parallel architecture consisting of Intel Itanium 2 processors
illustrate the numerical performance of this approach and the potential of the
parallel algorithms for model reduction of large-scale sparse systems.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:18831 |
| Date | 26 November 2007 |
| Creators | Badía, José M., Benner, Peter, Mayo, Rafael, Quintana-Ortí, Enrique S., Quintana-Ortí, Gregorio, Remón, Alfredo |
| Publisher | Technische Universität Chemnitz |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:preprint, info:eu-repo/semantics/preprint, doc-type:Text |
| Source | Chemnitz Scientific Computing Preprints |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0022 seconds