1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052
|
//$$ newmat7.cpp Invert, solve, binary operations
// Copyright (C) 1991,2,3,4: R B Davies
#include "include.h"
#include "newmat.h"
#include "newmatrc.h"
#ifdef use_namespace
namespace NEWMAT {
#endif
#ifdef DO_REPORT
#define REPORT { static ExeCounter ExeCount(__LINE__,7); ++ExeCount; }
#else
#define REPORT {}
#endif
//***************************** solve routines ******************************/
GeneralMatrix* GeneralMatrix::MakeSolver()
{
REPORT
GeneralMatrix* gm = new CroutMatrix(*this);
MatrixErrorNoSpace(gm); gm->ReleaseAndDelete(); return gm;
}
GeneralMatrix* Matrix::MakeSolver()
{
REPORT
GeneralMatrix* gm = new CroutMatrix(*this);
MatrixErrorNoSpace(gm); gm->ReleaseAndDelete(); return gm;
}
void CroutMatrix::Solver(MatrixColX& mcout, const MatrixColX& mcin)
{
REPORT
int i = mcin.skip; Real* el = mcin.data-i; Real* el1 = el;
while (i--) *el++ = 0.0;
el += mcin.storage; i = nrows - mcin.skip - mcin.storage;
while (i--) *el++ = 0.0;
lubksb(el1, mcout.skip);
}
// Do we need check for entirely zero output?
void UpperTriangularMatrix::Solver(MatrixColX& mcout,
const MatrixColX& mcin)
{
REPORT
int i = mcin.skip-mcout.skip; Real* elx = mcin.data-i;
while (i-- > 0) *elx++ = 0.0;
int nr = mcin.skip+mcin.storage;
elx = mcin.data+mcin.storage; Real* el = elx;
int j = mcout.skip+mcout.storage-nr; int nc = ncols-nr; i = nr-mcout.skip;
while (j-- > 0) *elx++ = 0.0;
Real* Ael = store + (nr*(2*ncols-nr+1))/2; j = 0;
while (i-- > 0)
{
elx = el; Real sum = 0.0; int jx = j++; Ael -= nc;
while (jx--) sum += *(--Ael) * *(--elx);
elx--; *elx = (*elx - sum) / *(--Ael);
}
}
void LowerTriangularMatrix::Solver(MatrixColX& mcout,
const MatrixColX& mcin)
{
REPORT
int i = mcin.skip-mcout.skip; Real* elx = mcin.data-i;
while (i-- > 0) *elx++ = 0.0;
int nc = mcin.skip; i = nc+mcin.storage; elx = mcin.data+mcin.storage;
int nr = mcout.skip+mcout.storage; int j = nr-i; i = nr-nc;
while (j-- > 0) *elx++ = 0.0;
Real* el = mcin.data; Real* Ael = store + (nc*(nc+1))/2; j = 0;
while (i-- > 0)
{
elx = el; Real sum = 0.0; int jx = j++; Ael += nc;
while (jx--) sum += *Ael++ * *elx++;
*elx = (*elx - sum) / *Ael++;
}
}
//******************* carry out binary operations *************************/
static GeneralMatrix*
GeneralMult(GeneralMatrix*,GeneralMatrix*,MultipliedMatrix*,MatrixType);
static GeneralMatrix*
GeneralSolv(GeneralMatrix*,GeneralMatrix*,BaseMatrix*,MatrixType);
static GeneralMatrix*
GeneralSolvI(GeneralMatrix*,BaseMatrix*,MatrixType);
static GeneralMatrix*
GeneralKP(GeneralMatrix*,GeneralMatrix*,KPMatrix*,MatrixType);
GeneralMatrix* MultipliedMatrix::Evaluate(MatrixType mt)
{
REPORT
gm2 = ((BaseMatrix*&)bm2)->Evaluate();
gm2 = gm2->Evaluate(gm2->Type().MultRHS()); // no symmetric on RHS
gm1=((BaseMatrix*&)bm1)->Evaluate();
#ifdef TEMPS_DESTROYED_QUICKLY
GeneralMatrix* gmx;
Try { gmx = GeneralMult(gm1, gm2, this, mt); }
CatchAll { delete this; ReThrow; }
delete this; return gmx;
#else
return GeneralMult(gm1, gm2, this, mt);
#endif
}
GeneralMatrix* SolvedMatrix::Evaluate(MatrixType mt)
{
REPORT
gm1=((BaseMatrix*&)bm1)->Evaluate();
gm2=((BaseMatrix*&)bm2)->Evaluate();
#ifdef TEMPS_DESTROYED_QUICKLY
GeneralMatrix* gmx;
Try { gmx = GeneralSolv(gm1,gm2,this,mt); }
CatchAll { delete this; ReThrow; }
delete this; return gmx;
#else
return GeneralSolv(gm1,gm2,this,mt);
#endif
}
GeneralMatrix* KPMatrix::Evaluate(MatrixType mt)
{
REPORT
gm1=((BaseMatrix*&)bm1)->Evaluate();
gm2=((BaseMatrix*&)bm2)->Evaluate();
#ifdef TEMPS_DESTROYED_QUICKLY
GeneralMatrix* gmx;
Try { gmx = GeneralKP(gm1,gm2,this,mt); }
CatchAll { delete this; ReThrow; }
delete this; return gmx;
#else
return GeneralKP(gm1,gm2,this,mt);
#endif
}
// routines for adding or subtracting matrices of identical storage structure
static void Add(GeneralMatrix* gm, GeneralMatrix* gm1, GeneralMatrix* gm2)
{
REPORT
Real* s1=gm1->Store(); Real* s2=gm2->Store();
Real* s=gm->Store(); int i=gm->Storage() >> 2;
while (i--)
{
*s++ = *s1++ + *s2++; *s++ = *s1++ + *s2++;
*s++ = *s1++ + *s2++; *s++ = *s1++ + *s2++;
}
i=gm->Storage() & 3; while (i--) *s++ = *s1++ + *s2++;
}
static void Add(GeneralMatrix* gm, GeneralMatrix* gm2)
{
REPORT
Real* s2=gm2->Store(); Real* s=gm->Store(); int i=gm->Storage() >> 2;
while (i--)
{ *s++ += *s2++; *s++ += *s2++; *s++ += *s2++; *s++ += *s2++; }
i=gm->Storage() & 3; while (i--) *s++ += *s2++;
}
static void Subtract(GeneralMatrix* gm, GeneralMatrix* gm1, GeneralMatrix* gm2)
{
REPORT
Real* s1=gm1->Store(); Real* s2=gm2->Store();
Real* s=gm->Store(); int i=gm->Storage() >> 2;
while (i--)
{
*s++ = *s1++ - *s2++; *s++ = *s1++ - *s2++;
*s++ = *s1++ - *s2++; *s++ = *s1++ - *s2++;
}
i=gm->Storage() & 3; while (i--) *s++ = *s1++ - *s2++;
}
static void Subtract(GeneralMatrix* gm, GeneralMatrix* gm2)
{
REPORT
Real* s2=gm2->Store(); Real* s=gm->Store(); int i=gm->Storage() >> 2;
while (i--)
{ *s++ -= *s2++; *s++ -= *s2++; *s++ -= *s2++; *s++ -= *s2++; }
i=gm->Storage() & 3; while (i--) *s++ -= *s2++;
}
static void ReverseSubtract(GeneralMatrix* gm, GeneralMatrix* gm2)
{
REPORT
Real* s2=gm2->Store(); Real* s=gm->Store(); int i=gm->Storage() >> 2;
while (i--)
{
*s = *s2++ - *s; s++; *s = *s2++ - *s; s++;
*s = *s2++ - *s; s++; *s = *s2++ - *s; s++;
}
i=gm->Storage() & 3; while (i--) { *s = *s2++ - *s; s++; }
}
static void SP(GeneralMatrix* gm, GeneralMatrix* gm1, GeneralMatrix* gm2)
{
REPORT
Real* s1=gm1->Store(); Real* s2=gm2->Store();
Real* s=gm->Store(); int i=gm->Storage() >> 2;
while (i--)
{
*s++ = *s1++ * *s2++; *s++ = *s1++ * *s2++;
*s++ = *s1++ * *s2++; *s++ = *s1++ * *s2++;
}
i=gm->Storage() & 3; while (i--) *s++ = *s1++ * *s2++;
}
static void SP(GeneralMatrix* gm, GeneralMatrix* gm2)
{
REPORT
Real* s2=gm2->Store(); Real* s=gm->Store(); int i=gm->Storage() >> 2;
while (i--)
{ *s++ *= *s2++; *s++ *= *s2++; *s++ *= *s2++; *s++ *= *s2++; }
i=gm->Storage() & 3; while (i--) *s++ *= *s2++;
}
// routines for adding or subtracting matrices of different storage structure
static void AddDS(GeneralMatrix* gm, GeneralMatrix* gm1, GeneralMatrix* gm2)
{
REPORT
int nr = gm->Nrows();
MatrixRow mr1(gm1, LoadOnEntry); MatrixRow mr2(gm2, LoadOnEntry);
MatrixRow mr(gm, StoreOnExit+DirectPart);
while (nr--) { mr.Add(mr1,mr2); mr1.Next(); mr2.Next(); mr.Next(); }
}
static void AddDS(GeneralMatrix* gm, GeneralMatrix* gm2)
// Add into first argument
{
REPORT
int nr = gm->Nrows();
MatrixRow mr(gm, StoreOnExit+LoadOnEntry+DirectPart);
MatrixRow mr2(gm2, LoadOnEntry);
while (nr--) { mr.Add(mr2); mr.Next(); mr2.Next(); }
}
static void SubtractDS
(GeneralMatrix* gm, GeneralMatrix* gm1, GeneralMatrix* gm2)
{
REPORT
int nr = gm->Nrows();
MatrixRow mr1(gm1, LoadOnEntry); MatrixRow mr2(gm2, LoadOnEntry);
MatrixRow mr(gm, StoreOnExit+DirectPart);
while (nr--) { mr.Sub(mr1,mr2); mr1.Next(); mr2.Next(); mr.Next(); }
}
static void SubtractDS(GeneralMatrix* gm, GeneralMatrix* gm2)
{
REPORT
int nr = gm->Nrows();
MatrixRow mr(gm, LoadOnEntry+StoreOnExit+DirectPart);
MatrixRow mr2(gm2, LoadOnEntry);
while (nr--) { mr.Sub(mr2); mr.Next(); mr2.Next(); }
}
static void ReverseSubtractDS(GeneralMatrix* gm, GeneralMatrix* gm2)
{
REPORT
int nr = gm->Nrows();
MatrixRow mr(gm, LoadOnEntry+StoreOnExit+DirectPart);
MatrixRow mr2(gm2, LoadOnEntry);
while (nr--) { mr.RevSub(mr2); mr2.Next(); mr.Next(); }
}
static void SPDS(GeneralMatrix* gm, GeneralMatrix* gm1, GeneralMatrix* gm2)
{
REPORT
int nr = gm->Nrows();
MatrixRow mr1(gm1, LoadOnEntry); MatrixRow mr2(gm2, LoadOnEntry);
MatrixRow mr(gm, StoreOnExit+DirectPart);
while (nr--) { mr.Multiply(mr1,mr2); mr1.Next(); mr2.Next(); mr.Next(); }
}
static void SPDS(GeneralMatrix* gm, GeneralMatrix* gm2)
// SP into first argument
{
REPORT
int nr = gm->Nrows();
MatrixRow mr(gm, StoreOnExit+LoadOnEntry+DirectPart);
MatrixRow mr2(gm2, LoadOnEntry);
while (nr--) { mr.Multiply(mr2); mr.Next(); mr2.Next(); }
}
static GeneralMatrix* GeneralMult1(GeneralMatrix* gm1, GeneralMatrix* gm2,
MultipliedMatrix* mm, MatrixType mtx)
{
REPORT
Tracer tr("GeneralMult1");
int nr=gm1->Nrows(); int nc=gm2->Ncols();
if (gm1->Ncols() !=gm2->Nrows())
Throw(IncompatibleDimensionsException(*gm1, *gm2));
GeneralMatrix* gmx = mtx.New(nr,nc,mm);
MatrixCol mcx(gmx, StoreOnExit+DirectPart);
MatrixCol mc2(gm2, LoadOnEntry);
while (nc--)
{
MatrixRow mr1(gm1, LoadOnEntry, mcx.Skip());
Real* el = mcx.Data(); // pointer to an element
int n = mcx.Storage();
while (n--) { *(el++) = DotProd(mr1,mc2); mr1.Next(); }
mc2.Next(); mcx.Next();
}
gmx->ReleaseAndDelete(); gm1->tDelete(); gm2->tDelete(); return gmx;
}
static GeneralMatrix* GeneralMult2(GeneralMatrix* gm1, GeneralMatrix* gm2,
MultipliedMatrix* mm, MatrixType mtx)
{
// version that accesses by row only - not good for thin matrices
// or column vectors in right hand term.
REPORT
Tracer tr("GeneralMult2");
int nr=gm1->Nrows(); int nc=gm2->Ncols();
if (gm1->Ncols() !=gm2->Nrows())
Throw(IncompatibleDimensionsException(*gm1, *gm2));
GeneralMatrix* gmx = mtx.New(nr,nc,mm);
MatrixRow mrx(gmx, LoadOnEntry+StoreOnExit+DirectPart);
MatrixRow mr1(gm1, LoadOnEntry);
while (nr--)
{
MatrixRow mr2(gm2, LoadOnEntry, mr1.Skip());
Real* el = mr1.Data(); // pointer to an element
int n = mr1.Storage();
mrx.Zero();
while (n--) { mrx.AddScaled(mr2, *el++); mr2.Next(); }
mr1.Next(); mrx.Next();
}
gmx->ReleaseAndDelete(); gm1->tDelete(); gm2->tDelete(); return gmx;
}
static GeneralMatrix* mmMult(GeneralMatrix* gm1, GeneralMatrix* gm2)
{
// matrix multiplication for type Matrix only
REPORT
Tracer tr("MatrixMult");
int nr=gm1->Nrows(); int ncr=gm1->Ncols(); int nc=gm2->Ncols();
if (ncr != gm2->Nrows()) Throw(IncompatibleDimensionsException(*gm1,*gm2));
Matrix* gm = new Matrix(nr,nc); MatrixErrorNoSpace(gm);
Real* s1=gm1->Store(); Real* s2=gm2->Store(); Real* s=gm->Store();
if (ncr)
{
while (nr--)
{
Real* s2x = s2; int j = ncr;
Real* sx = s; Real f = *s1++; int k = nc;
while (k--) *sx++ = f * *s2x++;
while (--j)
{ sx = s; f = *s1++; k = nc; while (k--) *sx++ += f * *s2x++; }
s = sx;
}
}
else *gm = 0.0;
gm->ReleaseAndDelete(); gm1->tDelete(); gm2->tDelete(); return gm;
}
static GeneralMatrix* GeneralMult(GeneralMatrix* gm1, GeneralMatrix* gm2,
MultipliedMatrix* mm, MatrixType mtx)
{
if ( Rectangular(gm1->Type(), gm2->Type(), mtx))
{
REPORT
return mmMult(gm1, gm2);
}
else
{
REPORT
Compare(gm1->Type() * gm2->Type(),mtx);
int nr = gm2->Nrows(); int nc = gm2->Ncols();
if (nc <= 5 && nr > nc) { REPORT return GeneralMult1(gm1, gm2, mm, mtx); }
else { REPORT return GeneralMult2(gm1, gm2, mm, mtx); }
}
}
static GeneralMatrix* GeneralKP(GeneralMatrix* gm1, GeneralMatrix* gm2,
KPMatrix* kp, MatrixType mtx)
{
REPORT
Tracer tr("GeneralKP");
int nr1 = gm1->Nrows(); int nc1 = gm1->Ncols();
int nr2 = gm2->Nrows(); int nc2 = gm2->Ncols();
Compare((gm1->Type()).KP(gm2->Type()),mtx);
GeneralMatrix* gmx = mtx.New(nr1*nr2, nc1*nc2, kp);
MatrixRow mrx(gmx, LoadOnEntry+StoreOnExit+DirectPart);
MatrixRow mr1(gm1, LoadOnEntry);
for (int i = 1; i <= nr1; ++i)
{
MatrixRow mr2(gm2, LoadOnEntry);
for (int j = 1; j <= nr2; ++j)
{ mrx.KP(mr1,mr2); mr2.Next(); mrx.Next(); }
mr1.Next();
}
gmx->ReleaseAndDelete(); gm1->tDelete(); gm2->tDelete(); return gmx;
}
static GeneralMatrix* GeneralSolv(GeneralMatrix* gm1, GeneralMatrix* gm2,
BaseMatrix* sm, MatrixType mtx)
{
REPORT
Tracer tr("GeneralSolv");
Compare(gm1->Type().i() * gm2->Type(),mtx);
int nr = gm1->Nrows();
if (nr != gm1->Ncols()) Throw(NotSquareException(*gm1));
int nc = gm2->Ncols();
if (gm1->Ncols() != gm2->Nrows())
Throw(IncompatibleDimensionsException(*gm1, *gm2));
GeneralMatrix* gmx = mtx.New(nr,nc,sm); MatrixErrorNoSpace(gmx);
Real* r = new Real [nr]; MatrixErrorNoSpace(r);
MONITOR_REAL_NEW("Make (GenSolv)",nr,r)
GeneralMatrix* gms = gm1->MakeSolver();
Try
{
MatrixColX mcx(gmx, r, StoreOnExit+DirectPart); // copy to and from r
// this must be inside Try so mcx is destroyed before gmx
MatrixColX mc2(gm2, r, LoadOnEntry);
while (nc--) { gms->Solver(mcx, mc2); mcx.Next(); mc2.Next(); }
}
CatchAll
{
if (gms) gms->tDelete();
delete gmx; // <--------------------
gm2->tDelete();
MONITOR_REAL_DELETE("Delete (GenSolv)",nr,r)
// ATandT version 2.1 gives an internal error
delete [] r;
ReThrow;
}
gms->tDelete(); gmx->ReleaseAndDelete(); gm2->tDelete();
MONITOR_REAL_DELETE("Delete (GenSolv)",nr,r)
// ATandT version 2.1 gives an internal error
delete [] r;
return gmx;
}
// version for inverses - gm2 is identity
static GeneralMatrix* GeneralSolvI(GeneralMatrix* gm1, BaseMatrix* sm,
MatrixType mtx)
{
REPORT
Tracer tr("GeneralSolvI");
Compare(gm1->Type().i(),mtx);
int nr = gm1->Nrows();
if (nr != gm1->Ncols()) Throw(NotSquareException(*gm1));
int nc = nr;
// DiagonalMatrix I(nr); I = 1;
IdentityMatrix I(nr);
GeneralMatrix* gmx = mtx.New(nr,nc,sm); MatrixErrorNoSpace(gmx);
Real* r = new Real [nr]; MatrixErrorNoSpace(r);
MONITOR_REAL_NEW("Make (GenSolvI)",nr,r)
GeneralMatrix* gms = gm1->MakeSolver();
Try
{
MatrixColX mcx(gmx, r, StoreOnExit+DirectPart); // copy to and from r
// this must be inside Try so mcx is destroyed before gmx
MatrixColX mc2(&I, r, LoadOnEntry);
while (nc--) { gms->Solver(mcx, mc2); mcx.Next(); mc2.Next(); }
}
CatchAll
{
if (gms) gms->tDelete();
delete gmx;
MONITOR_REAL_DELETE("Delete (GenSolvI)",nr,r)
// ATandT version 2.1 gives an internal error
delete [] r;
ReThrow;
}
gms->tDelete(); gmx->ReleaseAndDelete();
MONITOR_REAL_DELETE("Delete (GenSolvI)",nr,r)
// ATandT version 2.1 gives an internal error
delete [] r;
return gmx;
}
GeneralMatrix* InvertedMatrix::Evaluate(MatrixType mtx)
{
// Matrix Inversion - use solve routines
Tracer tr("InvertedMatrix::Evaluate");
REPORT
gm=((BaseMatrix*&)bm)->Evaluate();
#ifdef TEMPS_DESTROYED_QUICKLY
GeneralMatrix* gmx;
Try { gmx = GeneralSolvI(gm,this,mtx); }
CatchAll { delete this; ReThrow; }
delete this; return gmx;
#else
return GeneralSolvI(gm,this,mtx);
#endif
}
//*************************** New versions ************************
GeneralMatrix* AddedMatrix::Evaluate(MatrixType mtd)
{
REPORT
Tracer tr("AddedMatrix::Evaluate");
gm1=((BaseMatrix*&)bm1)->Evaluate(); gm2=((BaseMatrix*&)bm2)->Evaluate();
int nr=gm1->Nrows(); int nc=gm1->Ncols();
if (nr!=gm2->Nrows() || nc!=gm2->Ncols())
{
Try { Throw(IncompatibleDimensionsException(*gm1, *gm2)); }
CatchAll
{
gm1->tDelete(); gm2->tDelete();
#ifdef TEMPS_DESTROYED_QUICKLY
delete this;
#endif
ReThrow;
}
}
MatrixType mt1 = gm1->Type(), mt2 = gm2->Type(); MatrixType mts = mt1 + mt2;
if (!mtd) { REPORT mtd = mts; }
else if (!(mtd.DataLossOK || mtd >= mts))
{
REPORT
gm1->tDelete(); gm2->tDelete();
#ifdef TEMPS_DESTROYED_QUICKLY
delete this;
#endif
Throw(ProgramException("Illegal Conversion", mts, mtd));
}
GeneralMatrix* gmx;
bool c1 = (mtd == mt1), c2 = (mtd == mt2);
if ( c1 && c2 && (gm1->SimpleAddOK(gm2) == 0) )
{
if (gm1->reuse()) { REPORT Add(gm1,gm2); gm2->tDelete(); gmx = gm1; }
else if (gm2->reuse()) { REPORT Add(gm2,gm1); gmx = gm2; }
else
{
REPORT
// what if new throws an exception
Try { gmx = mt1.New(nr,nc,this); }
CatchAll
{
#ifdef TEMPS_DESTROYED_QUICKLY
delete this;
#endif
ReThrow;
}
gmx->ReleaseAndDelete(); Add(gmx,gm1,gm2);
}
}
else
{
if (c1 && c2)
{
short SAO = gm1->SimpleAddOK(gm2);
if (SAO & 1) { REPORT c1 = false; }
if (SAO & 2) { REPORT c2 = false; }
}
if (c1 && gm1->reuse() ) // must have type test first
{ REPORT AddDS(gm1,gm2); gm2->tDelete(); gmx = gm1; }
else if (c2 && gm2->reuse() )
{ REPORT AddDS(gm2,gm1); if (!c1) gm1->tDelete(); gmx = gm2; }
else
{
REPORT
Try { gmx = mtd.New(nr,nc,this); }
CatchAll
{
if (!c1) gm1->tDelete(); if (!c2) gm2->tDelete();
#ifdef TEMPS_DESTROYED_QUICKLY
delete this;
#endif
ReThrow;
}
AddDS(gmx,gm1,gm2);
if (!c1) gm1->tDelete(); if (!c2) gm2->tDelete();
gmx->ReleaseAndDelete();
}
}
#ifdef TEMPS_DESTROYED_QUICKLY
delete this;
#endif
return gmx;
}
GeneralMatrix* SubtractedMatrix::Evaluate(MatrixType mtd)
{
REPORT
Tracer tr("SubtractedMatrix::Evaluate");
gm1=((BaseMatrix*&)bm1)->Evaluate(); gm2=((BaseMatrix*&)bm2)->Evaluate();
int nr=gm1->Nrows(); int nc=gm1->Ncols();
if (nr!=gm2->Nrows() || nc!=gm2->Ncols())
{
Try { Throw(IncompatibleDimensionsException(*gm1, *gm2)); }
CatchAll
{
gm1->tDelete(); gm2->tDelete();
#ifdef TEMPS_DESTROYED_QUICKLY
delete this;
#endif
ReThrow;
}
}
MatrixType mt1 = gm1->Type(), mt2 = gm2->Type(); MatrixType mts = mt1 + mt2;
if (!mtd) { REPORT mtd = mts; }
else if (!(mtd.DataLossOK || mtd >= mts))
{
gm1->tDelete(); gm2->tDelete();
#ifdef TEMPS_DESTROYED_QUICKLY
delete this;
#endif
Throw(ProgramException("Illegal Conversion", mts, mtd));
}
GeneralMatrix* gmx;
bool c1 = (mtd == mt1), c2 = (mtd == mt2);
if ( c1 && c2 && (gm1->SimpleAddOK(gm2) == 0) )
{
if (gm1->reuse()) { REPORT Subtract(gm1,gm2); gm2->tDelete(); gmx = gm1; }
else if (gm2->reuse()) { REPORT ReverseSubtract(gm2,gm1); gmx = gm2; }
else
{
REPORT
Try { gmx = mt1.New(nr,nc,this); }
CatchAll
{
#ifdef TEMPS_DESTROYED_QUICKLY
delete this;
#endif
ReThrow;
}
gmx->ReleaseAndDelete(); Subtract(gmx,gm1,gm2);
}
}
else
{
if (c1 && c2)
{
short SAO = gm1->SimpleAddOK(gm2);
if (SAO & 1) { REPORT c1 = false; }
if (SAO & 2) { REPORT c2 = false; }
}
if (c1 && gm1->reuse() ) // must have type test first
{ REPORT SubtractDS(gm1,gm2); gm2->tDelete(); gmx = gm1; }
else if (c2 && gm2->reuse() )
{
REPORT ReverseSubtractDS(gm2,gm1);
if (!c1) gm1->tDelete(); gmx = gm2;
}
else
{
REPORT
// what if New throws and exception
Try { gmx = mtd.New(nr,nc,this); }
CatchAll
{
if (!c1) gm1->tDelete(); if (!c2) gm2->tDelete();
#ifdef TEMPS_DESTROYED_QUICKLY
delete this;
#endif
ReThrow;
}
SubtractDS(gmx,gm1,gm2);
if (!c1) gm1->tDelete(); if (!c2) gm2->tDelete();
gmx->ReleaseAndDelete();
}
}
#ifdef TEMPS_DESTROYED_QUICKLY
delete this;
#endif
return gmx;
}
GeneralMatrix* SPMatrix::Evaluate(MatrixType mtd)
{
REPORT
Tracer tr("SPMatrix::Evaluate");
gm1=((BaseMatrix*&)bm1)->Evaluate(); gm2=((BaseMatrix*&)bm2)->Evaluate();
int nr=gm1->Nrows(); int nc=gm1->Ncols();
if (nr!=gm2->Nrows() || nc!=gm2->Ncols())
{
Try { Throw(IncompatibleDimensionsException(*gm1, *gm2)); }
CatchAll
{
gm1->tDelete(); gm2->tDelete();
#ifdef TEMPS_DESTROYED_QUICKLY
delete this;
#endif
ReThrow;
}
}
MatrixType mt1 = gm1->Type(), mt2 = gm2->Type();
MatrixType mts = mt1.SP(mt2);
if (!mtd) { REPORT mtd = mts; }
else if (!(mtd.DataLossOK || mtd >= mts))
{
gm1->tDelete(); gm2->tDelete();
#ifdef TEMPS_DESTROYED_QUICKLY
delete this;
#endif
Throw(ProgramException("Illegal Conversion", mts, mtd));
}
GeneralMatrix* gmx;
bool c1 = (mtd == mt1), c2 = (mtd == mt2);
if ( c1 && c2 && (gm1->SimpleAddOK(gm2) == 0) )
{
if (gm1->reuse()) { REPORT SP(gm1,gm2); gm2->tDelete(); gmx = gm1; }
else if (gm2->reuse()) { REPORT SP(gm2,gm1); gmx = gm2; }
else
{
REPORT
Try { gmx = mt1.New(nr,nc,this); }
CatchAll
{
#ifdef TEMPS_DESTROYED_QUICKLY
delete this;
#endif
ReThrow;
}
gmx->ReleaseAndDelete(); SP(gmx,gm1,gm2);
}
}
else
{
if (c1 && c2)
{
short SAO = gm1->SimpleAddOK(gm2);
if (SAO & 1) { REPORT c2 = false; } // c1 and c2 swapped
if (SAO & 2) { REPORT c1 = false; }
}
if (c1 && gm1->reuse() ) // must have type test first
{ REPORT SPDS(gm1,gm2); gm2->tDelete(); gmx = gm1; }
else if (c2 && gm2->reuse() )
{ REPORT SPDS(gm2,gm1); if (!c1) gm1->tDelete(); gmx = gm2; }
else
{
REPORT
// what if New throws and exception
Try { gmx = mtd.New(nr,nc,this); }
CatchAll
{
if (!c1) gm1->tDelete(); if (!c2) gm2->tDelete();
#ifdef TEMPS_DESTROYED_QUICKLY
delete this;
#endif
ReThrow;
}
SPDS(gmx,gm1,gm2);
if (!c1) gm1->tDelete(); if (!c2) gm2->tDelete();
gmx->ReleaseAndDelete();
}
}
#ifdef TEMPS_DESTROYED_QUICKLY
delete this;
#endif
return gmx;
}
//*************************** norm functions ****************************/
Real BaseMatrix::Norm1() const
{
// maximum of sum of absolute values of a column
REPORT
GeneralMatrix* gm = ((BaseMatrix&)*this).Evaluate();
int nc = gm->Ncols(); Real value = 0.0;
MatrixCol mc(gm, LoadOnEntry);
while (nc--)
{ Real v = mc.SumAbsoluteValue(); if (value < v) value = v; mc.Next(); }
gm->tDelete(); return value;
}
Real BaseMatrix::NormInfinity() const
{
// maximum of sum of absolute values of a row
REPORT
GeneralMatrix* gm = ((BaseMatrix&)*this).Evaluate();
int nr = gm->Nrows(); Real value = 0.0;
MatrixRow mr(gm, LoadOnEntry);
while (nr--)
{ Real v = mr.SumAbsoluteValue(); if (value < v) value = v; mr.Next(); }
gm->tDelete(); return value;
}
//********************** Concatenation and stacking *************************/
GeneralMatrix* ConcatenatedMatrix::Evaluate(MatrixType mtx)
{
REPORT
Tracer tr("Concatenate");
#ifdef TEMPS_DESTROYED_QUICKLY
Try
{
gm2 = ((BaseMatrix*&)bm2)->Evaluate();
gm1 = ((BaseMatrix*&)bm1)->Evaluate();
Compare(gm1->Type() | gm2->Type(),mtx);
int nr=gm1->Nrows(); int nc = gm1->Ncols() + gm2->Ncols();
if (nr != gm2->Nrows())
Throw(IncompatibleDimensionsException(*gm1, *gm2));
GeneralMatrix* gmx = mtx.New(nr,nc,this);
MatrixRow mr1(gm1, LoadOnEntry); MatrixRow mr2(gm2, LoadOnEntry);
MatrixRow mr(gmx, StoreOnExit+DirectPart);
while (nr--) { mr.ConCat(mr1,mr2); mr1.Next(); mr2.Next(); mr.Next(); }
gmx->ReleaseAndDelete(); gm1->tDelete(); gm2->tDelete(); delete this;
return gmx;
}
CatchAll { delete this; ReThrow; }
#ifndef UseExceptions
return 0;
#endif
#else
gm2 = ((BaseMatrix*&)bm2)->Evaluate();
gm1 = ((BaseMatrix*&)bm1)->Evaluate();
Compare(gm1->Type() | gm2->Type(),mtx);
int nr=gm1->Nrows(); int nc = gm1->Ncols() + gm2->Ncols();
if (nr != gm2->Nrows())
Throw(IncompatibleDimensionsException(*gm1, *gm2));
GeneralMatrix* gmx = mtx.New(nr,nc,this);
MatrixRow mr1(gm1, LoadOnEntry); MatrixRow mr2(gm2, LoadOnEntry);
MatrixRow mr(gmx, StoreOnExit+DirectPart);
while (nr--) { mr.ConCat(mr1,mr2); mr1.Next(); mr2.Next(); mr.Next(); }
gmx->ReleaseAndDelete(); gm1->tDelete(); gm2->tDelete(); return gmx;
#endif
}
GeneralMatrix* StackedMatrix::Evaluate(MatrixType mtx)
{
REPORT
Tracer tr("Stack");
#ifdef TEMPS_DESTROYED_QUICKLY
Try
{
gm2 = ((BaseMatrix*&)bm2)->Evaluate();
gm1 = ((BaseMatrix*&)bm1)->Evaluate();
Compare(gm1->Type() & gm2->Type(),mtx);
int nc=gm1->Ncols();
int nr1 = gm1->Nrows(); int nr2 = gm2->Nrows();
if (nc != gm2->Ncols())
Throw(IncompatibleDimensionsException(*gm1, *gm2));
GeneralMatrix* gmx = mtx.New(nr1+nr2,nc,this);
MatrixRow mr1(gm1, LoadOnEntry); MatrixRow mr2(gm2, LoadOnEntry);
MatrixRow mr(gmx, StoreOnExit+DirectPart);
while (nr1--) { mr.Copy(mr1); mr1.Next(); mr.Next(); }
while (nr2--) { mr.Copy(mr2); mr2.Next(); mr.Next(); }
gmx->ReleaseAndDelete(); gm1->tDelete(); gm2->tDelete(); delete this;
return gmx;
}
CatchAll { delete this; ReThrow; }
#ifndef UseExceptions
return 0;
#endif
#else
gm2 = ((BaseMatrix*&)bm2)->Evaluate();
gm1 = ((BaseMatrix*&)bm1)->Evaluate();
Compare(gm1->Type() & gm2->Type(),mtx);
int nc=gm1->Ncols();
int nr1 = gm1->Nrows(); int nr2 = gm2->Nrows();
if (nc != gm2->Ncols())
Throw(IncompatibleDimensionsException(*gm1, *gm2));
GeneralMatrix* gmx = mtx.New(nr1+nr2,nc,this);
MatrixRow mr1(gm1, LoadOnEntry); MatrixRow mr2(gm2, LoadOnEntry);
MatrixRow mr(gmx, StoreOnExit+DirectPart);
while (nr1--) { mr.Copy(mr1); mr1.Next(); mr.Next(); }
while (nr2--) { mr.Copy(mr2); mr2.Next(); mr.Next(); }
gmx->ReleaseAndDelete(); gm1->tDelete(); gm2->tDelete(); return gmx;
#endif
}
// ************************* equality of matrices ******************** //
static bool RealEqual(Real* s1, Real* s2, int n)
{
int i = n >> 2;
while (i--)
{
if (*s1++ != *s2++) return false; if (*s1++ != *s2++) return false;
if (*s1++ != *s2++) return false; if (*s1++ != *s2++) return false;
}
i = n & 3; while (i--) if (*s1++ != *s2++) return false;
return true;
}
static bool intEqual(int* s1, int* s2, int n)
{
int i = n >> 2;
while (i--)
{
if (*s1++ != *s2++) return false; if (*s1++ != *s2++) return false;
if (*s1++ != *s2++) return false; if (*s1++ != *s2++) return false;
}
i = n & 3; while (i--) if (*s1++ != *s2++) return false;
return true;
}
bool operator==(const BaseMatrix& A, const BaseMatrix& B)
{
Tracer tr("BaseMatrix ==");
REPORT
GeneralMatrix* gmA = ((BaseMatrix&)A).Evaluate();
GeneralMatrix* gmB = ((BaseMatrix&)B).Evaluate();
if (gmA == gmB) // same matrix
{ REPORT gmA->tDelete(); return true; }
if ( gmA->Nrows() != gmB->Nrows() || gmA->Ncols() != gmB->Ncols() )
// different dimensions
{ REPORT gmA->tDelete(); gmB->tDelete(); return false; }
// check for CroutMatrix or BandLUMatrix
MatrixType AType = gmA->Type(); MatrixType BType = gmB->Type();
if (AType.CannotConvert() || BType.CannotConvert() )
{
REPORT
bool bx = gmA->IsEqual(*gmB);
gmA->tDelete(); gmB->tDelete();
return bx;
}
// is matrix storage the same
// will need to modify if further matrix structures are introduced
if (AType == BType && gmA->BandWidth() == gmB->BandWidth())
{ // compare store
REPORT
bool bx = RealEqual(gmA->Store(),gmB->Store(),gmA->Storage());
gmA->tDelete(); gmB->tDelete();
return bx;
}
// matrix storage different - just subtract
REPORT return IsZero(*gmA-*gmB);
}
bool operator==(const GeneralMatrix& A, const GeneralMatrix& B)
{
Tracer tr("GeneralMatrix ==");
// May or may not call tDeletes
REPORT
if (&A == &B) // same matrix
{ REPORT return true; }
if ( A.Nrows() != B.Nrows() || A.Ncols() != B.Ncols() )
{ REPORT return false; } // different dimensions
// check for CroutMatrix or BandLUMatrix
MatrixType AType = A.Type(); MatrixType BType = B.Type();
if (AType.CannotConvert() || BType.CannotConvert() )
{ REPORT return A.IsEqual(B); }
// is matrix storage the same
// will need to modify if further matrix structures are introduced
if (AType == BType && A.BandWidth() == B.BandWidth())
{ REPORT return RealEqual(A.Store(),B.Store(),A.Storage()); }
// matrix storage different - just subtract
REPORT return IsZero(A-B);
}
bool GeneralMatrix::IsZero() const
{
REPORT
Real* s=store; int i = storage >> 2;
while (i--)
{
if (*s++) return false; if (*s++) return false;
if (*s++) return false; if (*s++) return false;
}
i = storage & 3; while (i--) if (*s++) return false;
return true;
}
bool IsZero(const BaseMatrix& A)
{
Tracer tr("BaseMatrix::IsZero");
REPORT
GeneralMatrix* gm1 = 0; bool bx;
Try { gm1=((BaseMatrix&)A).Evaluate(); bx = gm1->IsZero(); }
CatchAll { if (gm1) gm1->tDelete(); ReThrow; }
gm1->tDelete();
return bx;
}
// IsEqual functions - insist matrices are of same type
// as well as equal values to be equal
bool GeneralMatrix::IsEqual(const GeneralMatrix& A) const
{
Tracer tr("GeneralMatrix IsEqual");
if (A.Type() != Type()) // not same types
{ REPORT return false; }
if (&A == this) // same matrix
{ REPORT return true; }
if (A.nrows != nrows || A.ncols != ncols)
// different dimensions
{ REPORT return false; }
// is matrix storage the same - compare store
REPORT
return RealEqual(A.store,store,storage);
}
bool CroutMatrix::IsEqual(const GeneralMatrix& A) const
{
Tracer tr("CroutMatrix IsEqual");
if (A.Type() != Type()) // not same types
{ REPORT return false; }
if (&A == this) // same matrix
{ REPORT return true; }
if (A.nrows != nrows || A.ncols != ncols)
// different dimensions
{ REPORT return false; }
// is matrix storage the same - compare store
REPORT
return RealEqual(A.store,store,storage)
&& intEqual(((CroutMatrix&)A).indx, indx, nrows);
}
bool BandLUMatrix::IsEqual(const GeneralMatrix& A) const
{
Tracer tr("BandLUMatrix IsEqual");
if (A.Type() != Type()) // not same types
{ REPORT return false; }
if (&A == this) // same matrix
{ REPORT return true; }
if ( A.Nrows() != nrows || A.Ncols() != ncols
|| ((BandLUMatrix&)A).m1 != m1 || ((BandLUMatrix&)A).m2 != m2 )
// different dimensions
{ REPORT return false; }
// matrix storage the same - compare store
REPORT
return RealEqual(A.Store(),store,storage)
&& RealEqual(((BandLUMatrix&)A).store2,store2,storage2)
&& intEqual(((BandLUMatrix&)A).indx, indx, nrows);
}
#ifdef use_namespace
}
#endif
|