Description of t

0001 function t_jacobian(quiet)
0002 %T_JACOBIAN  Numerical tests of partial derivative code.
0003 
0004 %   MATPOWER
0005 %   $Id: t_jacobian.m 2229 2013-12-11 01:28:09Z ray $
0006 %   by Ray Zimmerman, PSERC Cornell
0007 %   Copyright (c) 2004-2010 by Power System Engineering Research Center (PSERC)
0008 %
0009 %   This file is part of MATPOWER.
0010 %   See http://www.pserc.cornell.edu/matpower/ for more info.
0011 %
0012 %   MATPOWER is free software: you can redistribute it and/or modify
0013 %   it under the terms of the GNU General Public License as published
0014 %   by the Free Software Foundation, either version 3 of the License,
0015 %   or (at your option) any later version.
0016 %
0017 %   MATPOWER is distributed in the hope that it will be useful,
0018 %   but WITHOUT ANY WARRANTY; without even the implied warranty of
0019 %   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
0020 %   GNU General Public License for more details.
0021 %
0022 %   You should have received a copy of the GNU General Public License
0023 %   along with MATPOWER. If not, see <http://www.gnu.org/licenses/>.
0024 %
0025 %   Additional permission under GNU GPL version 3 section 7
0026 %
0027 %   If you modify MATPOWER, or any covered work, to interface with
0028 %   other modules (such as MATLAB code and MEX-files) available in a
0029 %   MATLAB(R) or comparable environment containing parts covered
0030 %   under other licensing terms, the licensors of MATPOWER grant
0031 %   you additional permission to convey the resulting work.
0032 
0033 if nargin < 1
0034     quiet = 0;
0035 end
0036 
0037 t_begin(28, quiet);
0038 
0039 casefile = 'case30';
0040 
0041 %% define named indices into bus, gen, branch matrices
0042 [PQ, PV, REF, NONE, BUS_I, BUS_TYPE, PD, QD, GS, BS, BUS_AREA, VM, ...
0043     VA, BASE_KV, ZONE, VMAX, VMIN, LAM_P, LAM_Q, MU_VMAX, MU_VMIN] = idx_bus;
0044 [F_BUS, T_BUS, BR_R, BR_X, BR_B, RATE_A, RATE_B, RATE_C, ...
0045     TAP, SHIFT, BR_STATUS, PF, QF, PT, QT, MU_SF, MU_ST, ...
0046     ANGMIN, ANGMAX, MU_ANGMIN, MU_ANGMAX] = idx_brch;
0047 
0048 %% run powerflow to get solved case
0049 mpopt = mpoption('verbose', 0, 'out.all', 0);
0050 mpc = loadcase(casefile);
0051 [baseMVA, bus, gen, branch, success, et] = runpf(mpc, mpopt);
0052 
0053 %% switch to internal bus numbering and build admittance matrices
0054 [i2e, bus, gen, branch] = ext2int(bus, gen, branch);
0055 [Ybus, Yf, Yt] = makeYbus(baseMVA, bus, branch);
0056 Ybus_full   = full(Ybus);
0057 Yf_full     = full(Yf);
0058 Yt_full     = full(Yt);
0059 Vm = bus(:, VM);
0060 Va = bus(:, VA) * pi/180;
0061 V = Vm .* exp(1j * Va);
0062 f = branch(:, F_BUS);       %% list of "from" buses
0063 t = branch(:, T_BUS);       %% list of "to" buses
0064 nl = length(f);
0065 nb = length(V);
0066 pert = 1e-8;
0067 
0068 %%-----  check dSbus_dV code  -----
0069 %% full matrices
0070 [dSbus_dVm_full, dSbus_dVa_full] = dSbus_dV(Ybus_full, V);
0071 
0072 %% sparse matrices
0073 [dSbus_dVm, dSbus_dVa] = dSbus_dV(Ybus, V);
0074 dSbus_dVm_sp = full(dSbus_dVm);
0075 dSbus_dVa_sp = full(dSbus_dVa);
0076 
0077 %% compute numerically to compare
0078 Vmp = (Vm*ones(1,nb) + pert*eye(nb,nb)) .* (exp(1j * Va) * ones(1,nb));
0079 Vap = (Vm*ones(1,nb)) .* (exp(1j * (Va*ones(1,nb) + pert*eye(nb,nb))));
0080 num_dSbus_dVm = full( (Vmp .* conj(Ybus * Vmp) - V*ones(1,nb) .* conj(Ybus * V*ones(1,nb))) / pert );
0081 num_dSbus_dVa = full( (Vap .* conj(Ybus * Vap) - V*ones(1,nb) .* conj(Ybus * V*ones(1,nb))) / pert );
0082 
0083 t_is(dSbus_dVm_sp, num_dSbus_dVm, 5, 'dSbus_dVm (sparse)');
0084 t_is(dSbus_dVa_sp, num_dSbus_dVa, 5, 'dSbus_dVa (sparse)');
0085 t_is(dSbus_dVm_full, num_dSbus_dVm, 5, 'dSbus_dVm (full)');
0086 t_is(dSbus_dVa_full, num_dSbus_dVa, 5, 'dSbus_dVa (full)');
0087 
0088 %%-----  check dSbr_dV code  -----
0089 %% full matrices
0090 [dSf_dVa_full, dSf_dVm_full, dSt_dVa_full, dSt_dVm_full, Sf, St] = dSbr_dV(branch, Yf_full, Yt_full, V);
0091 
0092 %% sparse matrices
0093 [dSf_dVa, dSf_dVm, dSt_dVa, dSt_dVm, Sf, St] = dSbr_dV(branch, Yf, Yt, V);
0094 dSf_dVa_sp = full(dSf_dVa);
0095 dSf_dVm_sp = full(dSf_dVm);
0096 dSt_dVa_sp = full(dSt_dVa);
0097 dSt_dVm_sp = full(dSt_dVm);
0098 
0099 %% compute numerically to compare
0100 Vmpf = Vmp(f,:);
0101 Vapf = Vap(f,:);
0102 Vmpt = Vmp(t,:);
0103 Vapt = Vap(t,:);
0104 Sf2 = (V(f)*ones(1,nb)) .* conj(Yf * V*ones(1,nb));
0105 St2 = (V(t)*ones(1,nb)) .* conj(Yt * V*ones(1,nb));
0106 Smpf = Vmpf .* conj(Yf * Vmp);
0107 Sapf = Vapf .* conj(Yf * Vap);
0108 Smpt = Vmpt .* conj(Yt * Vmp);
0109 Sapt = Vapt .* conj(Yt * Vap);
0110 
0111 num_dSf_dVm = full( (Smpf - Sf2) / pert );
0112 num_dSf_dVa = full( (Sapf - Sf2) / pert );
0113 num_dSt_dVm = full( (Smpt - St2) / pert );
0114 num_dSt_dVa = full( (Sapt - St2) / pert );
0115 
0116 t_is(dSf_dVm_sp, num_dSf_dVm, 5, 'dSf_dVm (sparse)');
0117 t_is(dSf_dVa_sp, num_dSf_dVa, 5, 'dSf_dVa (sparse)');
0118 t_is(dSt_dVm_sp, num_dSt_dVm, 5, 'dSt_dVm (sparse)');
0119 t_is(dSt_dVa_sp, num_dSt_dVa, 5, 'dSt_dVa (sparse)');
0120 t_is(dSf_dVm_full, num_dSf_dVm, 5, 'dSf_dVm (full)');
0121 t_is(dSf_dVa_full, num_dSf_dVa, 5, 'dSf_dVa (full)');
0122 t_is(dSt_dVm_full, num_dSt_dVm, 5, 'dSt_dVm (full)');
0123 t_is(dSt_dVa_full, num_dSt_dVa, 5, 'dSt_dVa (full)');
0124 
0125 %%-----  check dAbr_dV code  -----
0126 %% full matrices
0127 [dAf_dVa_full, dAf_dVm_full, dAt_dVa_full, dAt_dVm_full] = ...
0128                         dAbr_dV(dSf_dVa_full, dSf_dVm_full, dSt_dVa_full, dSt_dVm_full, Sf, St);
0129 %% sparse matrices
0130 [dAf_dVa, dAf_dVm, dAt_dVa, dAt_dVm] = ...
0131                         dAbr_dV(dSf_dVa, dSf_dVm, dSt_dVa, dSt_dVm, Sf, St);
0132 dAf_dVa_sp = full(dAf_dVa);
0133 dAf_dVm_sp = full(dAf_dVm);
0134 dAt_dVa_sp = full(dAt_dVa);
0135 dAt_dVm_sp = full(dAt_dVm);
0136 
0137 %% compute numerically to compare
0138 num_dAf_dVm = full( (abs(Smpf).^2 - abs(Sf2).^2) / pert );
0139 num_dAf_dVa = full( (abs(Sapf).^2 - abs(Sf2).^2) / pert );
0140 num_dAt_dVm = full( (abs(Smpt).^2 - abs(St2).^2) / pert );
0141 num_dAt_dVa = full( (abs(Sapt).^2 - abs(St2).^2) / pert );
0142 
0143 t_is(dAf_dVm_sp, num_dAf_dVm, 4, 'dAf_dVm (sparse)');
0144 t_is(dAf_dVa_sp, num_dAf_dVa, 4, 'dAf_dVa (sparse)');
0145 t_is(dAt_dVm_sp, num_dAt_dVm, 4, 'dAt_dVm (sparse)');
0146 t_is(dAt_dVa_sp, num_dAt_dVa, 4, 'dAt_dVa (sparse)');
0147 t_is(dAf_dVm_full, num_dAf_dVm, 4, 'dAf_dVm (full)');
0148 t_is(dAf_dVa_full, num_dAf_dVa, 4, 'dAf_dVa (full)');
0149 t_is(dAt_dVm_full, num_dAt_dVm, 4, 'dAt_dVm (full)');
0150 t_is(dAt_dVa_full, num_dAt_dVa, 4, 'dAt_dVa (full)');
0151 
0152 %%-----  check dIbr_dV code  -----
0153 %% full matrices
0154 [dIf_dVa_full, dIf_dVm_full, dIt_dVa_full, dIt_dVm_full, If, It] = dIbr_dV(branch, Yf_full, Yt_full, V);
0155 
0156 %% sparse matrices
0157 [dIf_dVa, dIf_dVm, dIt_dVa, dIt_dVm, If, It] = dIbr_dV(branch, Yf, Yt, V);
0158 dIf_dVa_sp = full(dIf_dVa);
0159 dIf_dVm_sp = full(dIf_dVm);
0160 dIt_dVa_sp = full(dIt_dVa);
0161 dIt_dVm_sp = full(dIt_dVm);
0162 
0163 %% compute numerically to compare
0164 num_dIf_dVm = full( (Yf * Vmp - Yf * V*ones(1,nb)) / pert );
0165 num_dIf_dVa = full( (Yf * Vap - Yf * V*ones(1,nb)) / pert );
0166 num_dIt_dVm = full( (Yt * Vmp - Yt * V*ones(1,nb)) / pert );
0167 num_dIt_dVa = full( (Yt * Vap - Yt * V*ones(1,nb)) / pert );
0168 
0169 t_is(dIf_dVm_sp, num_dIf_dVm, 5, 'dIf_dVm (sparse)');
0170 t_is(dIf_dVa_sp, num_dIf_dVa, 5, 'dIf_dVa (sparse)');
0171 t_is(dIt_dVm_sp, num_dIt_dVm, 5, 'dIt_dVm (sparse)');
0172 t_is(dIt_dVa_sp, num_dIt_dVa, 5, 'dIt_dVa (sparse)');
0173 t_is(dIf_dVm_full, num_dIf_dVm, 5, 'dIf_dVm (full)');
0174 t_is(dIf_dVa_full, num_dIf_dVa, 5, 'dIf_dVa (full)');
0175 t_is(dIt_dVm_full, num_dIt_dVm, 5, 'dIt_dVm (full)');
0176 t_is(dIt_dVa_full, num_dIt_dVa, 5, 'dIt_dVa (full)');
0177 
0178 t_end;
t_jacobian

PURPOSE

SYNOPSIS

DESCRIPTION

CROSS-REFERENCE INFORMATION

SOURCE CODE
