|
3431
|
1 ## Copyright (C) 1996, 1997 Auburn University. All rights reserved. |
|
|
2 ## |
|
|
3 ## This file is part of Octave. |
|
|
4 ## |
|
|
5 ## Octave is free software; you can redistribute it and/or modify it |
|
|
6 ## under the terms of the GNU General Public License as published by |
|
7016
|
7 ## the Free Software Foundation; either version 3 of the License, or (at |
|
|
8 ## your option) any later version. |
|
3431
|
9 ## |
|
|
10 ## Octave is distributed in the hope that it will be useful, but |
|
|
11 ## WITHOUT ANY WARRANTY; without even the implied warranty of |
|
|
12 ## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
|
|
13 ## General Public License for more details. |
|
|
14 ## |
|
|
15 ## You should have received a copy of the GNU General Public License |
|
7016
|
16 ## along with Octave; see the file COPYING. If not, see |
|
|
17 ## <http://www.gnu.org/licenses/>. |
|
3431
|
18 |
|
|
19 ## -*- texinfo -*- |
|
5016
|
20 ## @deftypefn {Function File} {@var{x} =} dare (@var{a}, @var{b}, @var{q}, @var{r}, @var{opt}) |
|
3431
|
21 ## |
|
|
22 ## Return the solution, @var{x} of the discrete-time algebraic Riccati |
|
|
23 ## equation |
|
|
24 ## @iftex |
|
|
25 ## @tex |
|
|
26 ## $$ |
|
5016
|
27 ## A^TXA - X + A^TXB (R + B^TXB)^{-1} B^TXA + Q = 0 |
|
3431
|
28 ## $$ |
|
|
29 ## @end tex |
|
|
30 ## @end iftex |
|
|
31 ## @ifinfo |
|
|
32 ## @example |
|
4611
|
33 ## a' x a - x + a' x b (r + b' x b)^(-1) b' x a + q = 0 |
|
3431
|
34 ## @end example |
|
|
35 ## @end ifinfo |
|
|
36 ## @noindent |
|
|
37 ## |
|
|
38 ## @strong{Inputs} |
|
|
39 ## @table @var |
|
|
40 ## @item a |
|
5016
|
41 ## @var{n} by @var{n} matrix; |
|
3431
|
42 ## |
|
|
43 ## @item b |
|
5016
|
44 ## @var{n} by @var{m} matrix; |
|
3431
|
45 ## |
|
4611
|
46 ## @item q |
|
5016
|
47 ## @var{n} by @var{n} matrix, symmetric positive semidefinite, or a @var{p} by @var{n} matrix, |
|
|
48 ## In the latter case @math{q:=q'*q} is used; |
|
3431
|
49 ## |
|
|
50 ## @item r |
|
5016
|
51 ## @var{m} by @var{m}, symmetric positive definite (invertible); |
|
3431
|
52 ## |
|
|
53 ## @item opt |
|
|
54 ## (optional argument; default = @code{"B"}): |
|
|
55 ## String option passed to @code{balance} prior to ordered @var{QZ} decomposition. |
|
|
56 ## @end table |
|
|
57 ## |
|
5016
|
58 ## @strong{Output} |
|
|
59 ## @table @var |
|
|
60 ## @item x |
|
|
61 ## solution of @acronym{DARE}. |
|
|
62 ## @end table |
|
3431
|
63 ## |
|
|
64 ## @strong{Method} |
|
5016
|
65 ## Generalized eigenvalue approach (Van Dooren; @acronym{SIAM} J. |
|
3431
|
66 ## Sci. Stat. Comput., Vol 2) applied to the appropriate symplectic pencil. |
|
|
67 ## |
|
5016
|
68 ## See also: Ran and Rodman, @cite{Stable Hermitian Solutions of Discrete |
|
|
69 ## Algebraic Riccati Equations}, Mathematics of Control, Signals and |
|
|
70 ## Systems, Vol 5, no 2 (1992), pp 165--194. |
|
5642
|
71 ## @seealso{balance, are} |
|
3431
|
72 ## @end deftypefn |
|
|
73 |
|
|
74 ## Author: A. S. Hodel <a.s.hodel@eng.auburn.edu> |
|
|
75 ## Created: August 1993 |
|
|
76 ## Adapted-By: jwe |
|
|
77 |
|
4611
|
78 function x = dare (a, b, q, r, opt) |
|
3431
|
79 |
|
|
80 if (nargin == 4 | nargin == 5) |
|
|
81 if (nargin == 5) |
|
|
82 if (opt != "N" || opt != "P" || opt != "S" || opt != "B") |
|
|
83 warning ("dare: opt has an invalid value -- setting to B"); |
|
|
84 opt = "B"; |
|
|
85 endif |
|
|
86 else |
|
|
87 opt = "B"; |
|
|
88 endif |
|
|
89 |
|
4611
|
90 |
|
|
91 if ((p = issquare (q)) == 0) |
|
|
92 q = q'*q; |
|
3431
|
93 endif |
|
|
94 |
|
4611
|
95 ##Checking positive definiteness |
|
|
96 if (isdefinite(r)<=0) |
|
|
97 error("dare: r not positive definite"); |
|
|
98 end |
|
|
99 if (isdefinite(q)<0) |
|
|
100 error("dare: q not positive semidefinite"); |
|
|
101 end |
|
|
102 |
|
3431
|
103 |
|
|
104 ## Check r dimensions. |
|
4611
|
105 [n,m] = size(b); |
|
4030
|
106 if ((m1 = issquare (r)) == 0) |
|
4611
|
107 error ("dare: r is not square"); |
|
3431
|
108 elseif (m1 != m) |
|
4611
|
109 error ("b,r are not conformable"); |
|
3431
|
110 endif |
|
|
111 |
|
4611
|
112 s1 = [a, zeros(n) ; -q, eye(n)]; |
|
3431
|
113 s2 = [eye(n), (b/r)*b' ; zeros(n), a']; |
|
|
114 [c,d,s1,s2] = balance(s1,s2,opt); |
|
|
115 [aa,bb,u,lam] = qz(s1,s2,"S"); |
|
|
116 u = d*u; |
|
|
117 n1 = n+1; |
|
|
118 n2 = 2*n; |
|
|
119 x = u (n1:n2, 1:n)/u(1:n, 1:n); |
|
|
120 else |
|
6046
|
121 print_usage (); |
|
3431
|
122 endif |
|
|
123 |
|
|
124 endfunction |
