No label defined (Q4463372)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2069441
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2069441 |
Statements
27 May 2004
0 references
discrete-time algebraic Riccati equation
0 references
sign-function method
0 references
Cayley transform
0 references
Hamiltonian matrix
0 references
numerical experiments
0 references
0.91549003
0 references
0.91251314
0 references
0.9117931
0 references
0.9057901
0 references
0.89364254
0 references
0.8924242
0 references
0.8918133
0 references
This paper is concerned with the numerical solution of the discrete-time algebraic Riccati equation (DARE) \[ A^T X A - X - A^T X B (R+B^T X B)^{-1} B^T X A + Q = 0. \] Under some mild conditions, solving (DARE) is equivalent to computing the stable deflating subspace of an associated symplectic pencil \(N-\lambda L\). An application of the Cayley transform turns this problem into computing the stable invariant subspace of the Hamiltonian matrix \(H = (N+L)^{-1}(N-L)\), which can be addressed by the sign-function method in an efficient and parallelizable manner. By exploiting the underlying structure, this paper shows how the sign-function method applied to \(H\) can be reformulated so that the theoretical computational effort is cut by more than half. Preliminary numerical experiments confirm that this advantage can lead to a significant reduction of the required computational time. However, the experiments also indicate that the employed reformulations may affect the numerical accuracy and reliability of the sign-function method.
0 references