⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 plus.m

📁 求解线性矩阵不等式简单方便--与LMI工具箱相比
💻 M
字号:
function X = plus(X,Y)
%PLUS Merges two LMI objects to one LMI

% Author Johan L鰂berg
% $Id: plus.m,v 1.10 2006/08/10 13:15:45 joloef Exp $

if isa(X,'constraint')
    X = set(X);
elseif isa(X,'sdpvar')
    X = set(X);
end

if isa(Y,'constraint')
    Y = set(Y);
elseif isa(Y,'sdpvar')
    Y = set(Y);
end

% Support set+ []
if isempty(X)
    X = Y;
    return
elseif isempty(Y)
    X = X;
    return
end

if ~((isa(X,'lmi')) & (isa(Y,'lmi')))
    error('Both arguments must be SET objects')
end

nX = length(X.clauses);
nY = length(Y.clauses);

if nX+nY == 0
    return
end

X.clauses = {X.clauses{:},Y.clauses{:}};
X.LMIid = [X.LMIid Y.LMIid];

% VERY FAST UNIQUE BECAUSE THIS IS CALLED A LOT OF TIMES....
i = sort(X.LMIid);
i = i(diff([i NaN])~=0); 
if length(i)<nX+nY    
    [i,j] = unique(X.LMIid);
    X = subsref(X,struct('type','()','subs',{{j}}));
end

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -