1981
DOI: 10.1137/0902010
|View full text |Cite|
|
Sign up to set email alerts
|

A Generalized Eigenvalue Approach for Solving Riccati Equations

Abstract: A numerically stable algorithm is derived to compute orthonormal bases for any deflating subspace of a regular pencil hB-A. The method is based on an update of the OZ-algorithm, in order to obtain any desired ordering of eigenvalues in the quasitriangular forms constructed by this algorithm. As applications we discuss a new approach to solve Riccati equations arising in linear system theory. The computation of deflating subspaces with specified spectrum is shown to be of crucial importance here.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
139
0

Year Published

1988
1988
2017
2017

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 345 publications
(141 citation statements)
references
References 17 publications
2
139
0
Order By: Relevance
“…Note that (6) is a generalised Riccati equation, which can be solved by a numerically stabilised version of the MacFarlane-Potter algorithm (Laub, 1979;van Dooren, 1981). Its solution is not unique, but it is shown in that the corresponding optimal controller is unique, providing that the solution T is chosen so as to satisfy a standard regularity condition on the H 2 problem represented by (5).…”
Section: The Cross Standard Formmentioning
confidence: 99%
“…Note that (6) is a generalised Riccati equation, which can be solved by a numerically stabilised version of the MacFarlane-Potter algorithm (Laub, 1979;van Dooren, 1981). Its solution is not unique, but it is shown in that the corresponding optimal controller is unique, providing that the solution T is chosen so as to satisfy a standard regularity condition on the H 2 problem represented by (5).…”
Section: The Cross Standard Formmentioning
confidence: 99%
“…We then reorder the diagonal blocks ofT andŴ so that the generalized eigenvalues are partitioned in the manner required by (3.3.20). This partitioning can be done using the algorithms described in Van Dooren (1981 or in Kågström and Poromaa (1994). Thus the steps for implementing a generalized Schur algorithm are…”
Section: Definitionmentioning
confidence: 99%
“…Another technique is the deflating subspace approach of Van Dooren [34]. Suppose (E c , A c ) has an n-dimensional deflating subspace associated with eigenvalues in the lefthalf plane.…”
Section: Linear-quadratic Controlmentioning
confidence: 99%