Parallel methods for computating the matrix sign function with applications to the algebraic Riccati equation

Mohammed A Hasan, Ali A. Hasan, Khaled Ben Ejaz

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper several methods of solving the algebraic Riccati equation (ARE) are presented. Functional iterations with acceleration techniques are introduced. Also variations of Newton method, the subspace iteration, and Krylov sequence are proposed for solving the ARE. The relation between the matrix sign function and the solution of the algebraic Riccati equation is stated, and several iterative schemes for the matrix sign function are described. Specifically, higher order rational functions for computing the matrix sign function of complex matrices has been developed, where parallel implementation of the matrix sign function is developed through partial fractions expansion. A QR inverse free method for computing the matrix sign function for symmetric matrices is derived, the matrix sign function is then used to solve the algebraic Riccati equation. The performance of these methods is demonstrated by several examples.

Original languageEnglish (US)
Pages (from-to)4063-4068
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
Volume5
StatePublished - Dec 1 2001

Fingerprint Dive into the research topics of 'Parallel methods for computating the matrix sign function with applications to the algebraic Riccati equation'. Together they form a unique fingerprint.

Cite this