: Nvet-2, UUR = [UUR (1: 2 * i); U (: , N +1, i +1)];; = [UUR (1: 2 * Nvet-2); U (:, N +1, Nvet)]; = L * UUL-l; = R * UUR-r ; (k) = norm (WL); (k) = norm (WR);
% *************** move to next step ********************** ******** = U;
% saving results
% for j = 1: Nvet
% OA (k,:, j) = U (1,:, j);
% OQ (k,:, j) = U (2,:, j);
% end; (k) = gamma (5) * ((sqrt (U (1, round (N/2), 5)) - sqrt (A0 (5)))/A0 ( 5));;
% ********** graphing ****************************** ************ i = 1: Kmax (i) = tau * i;;
% F = figure;
% F1 = figure;
% F2 = figure; = figure;
% graphing middle of 2 vessel area and flux
% figure (F); hold;
% plot (mas, p (:, 2), 'red'); hold; pause;
% figure (F1); hold;
% plot (mas, p (:, 3), 'blue'); hold; pause;
% graphing middle of 5 vessel area and flux
% figure (F2); hold;
% plot (mas, p (:, 4), 'red'); hold; pause; (F3);% hold; (mas, p (:), 'blue');% hold; pause;; (max (Lbound)); (max (Rbound)); pause; = 1;
2. Приклад згенерованого Java коду
public class HemodynamicsModelSolver
implements TreeTraversal
{
private int [ ] sign;
protected ArterialBinaryTreeModel atm;
private double [ ] vesselAreas;
private Matrix [] flux;
public double [ ] vesselBeta;
private double [ ] vesselLegths;// static
double [] An, Qn, a, b, c; [] OA, OQ;
final int NumberOfUnknownFunction = 2;
int SegmentationForIntegrating = 10, NumberOfSegmentation = 20, rho = 1;
doubl...