Code covered by the BSD License
-
[f,k,l,sigp,sigs,spr,pt,st,ph...
DPROTIN: Deterministic Parameter Reduced-Order Time-Invariant iNfinite horizon LQG compensation.
-
[f,k,l,sigp,sigs,spr,pt,st,ph...
DPROTINO: Erroneous Deterministic Parameter Reduced-Order Time-Invariant iNfinite horizon LQG compensation.
-
[ggipsd]=gginv(psd,r,tol)
GGINV: Group generalized inverse of matrix psd
-
[nx,ny,nu,q,mc,v,me]=pgcchk(p...
PGCCHK: Check and generate dimensions
-
[osc,endc,conver,bb,nocon,tps...
ROCOCHK: Check reduced-order algorithm convergence
-
[osc,ldif,sdif]=detosc(osc,tr...
DETOSC : detect oscillation during iteration
-
[ph,p12,p2]=iniphsh(ic,nx,nc)
INIPHSH : Function generates initial values ph, sh
-
[psd]=psdrn(nx,nc)
PSDRN: Generate a random positive semi-definite
-
[pt,ph,st,sh,psi1,psi2]=dproe...
DPROEQ : one iteration of the SDOPE (Strengthened Discrete-time Optimal
-
[pt,ph,st,sh,psi1,psi2]=dproe...
DPROEQO: one iteration of the CDOPE (Conventional Discrete-time Optimal
-
[tau,ga,ha,ma]=gmhfac(ph,sh,n...
-
pinvf(A,r,tol)
PINVF: Pseudoinverse based on r singular values of A.
-
pinvrd(A,tol)
PINVRD pseudo inverse with rank deficiency detection.
-
plconv(trt,trr,epsl,endloop,t...
PLCONV: Plot convergence results
-
sr=sperad(mat);
SPERAD: spectral radius of a square matrix
-
examp2.m
-
examp3.m
-
readme.m
-
scdope.m
-
View all files
from
Optimal reduced-order discrete-time LQG design
by Gerard Van Willigenburg
Solution of the SDOPE by repeated forward and backward iteration
|
| [psd]=psdrn(nx,nc)
|
% PSDRN: Generate a random positive semi-definite
% nx x nx matrix of rank nc.
%
% function [psd]=psdrn(nx,nc)
%
% optional input: nc (nc=nx is assumed otherwise).
%
% L.G. Van Willigenburg, W.L. De Koning, 28-11-95.
%
function [psd]=psdrn(nx,nc)
if nx<0 | rem(nx,1)~=0;
error('nx must be an integer > 0'); end;
if nargin>1
if nc<0 | nc>nx | rem(nc,1)~=0;
error('nc must be an integer 0<=nc<=nx'); end;
else; nc=nx; end;
if nc==0; psd=zeros(nx);
else;
psd=randn(nx,nx); d=diag([abs(randn(1,nc)) zeros(1,nx-nc)]);
psd=psd*d*psd';
end
|
|
Contact us at files@mathworks.com