We investigate the solution of large-scale generalized algebraic Bernoulli equations as those arising in control and systems theory in the context of stabilization of linear dynamical systems, coprime factorization of rational matrix-valued functions, and model reduction. The algorithms we propose, based on a generalization of the Newton iteration for the matrix sign function, are easy to parallelize, yielding an efficient numerical tool to solve large-scale problems. Both the accuracy and the parallel performance of our implementations on a cluster of Intel Xeon processors are reported.
Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa.de:swb:ch1-200601684 |
Date | 11 September 2006 |
Creators | Barrachina, Sergio, Benner, Peter, Quintana-OrtĂ, Enrique S. |
Contributors | TU Chemnitz, SFB 393 |
Publisher | Universitätsbibliothek Chemnitz |
Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
Language | English |
Detected Language | English |
Type | doc-type:preprint |
Format | text/html, text/plain, image/png, image/gif, text/plain, image/gif, application/pdf, application/x-gzip, text/plain, application/zip |
Source | Preprintreihe des Chemnitzer SFB 393, 05-15 |
Page generated in 0.0014 seconds