/usr/share/axiom-20170501/src/algebra/GUESS.spad is in axiom-source 20170501-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 | )abbrev package GUESS Guess
++ Author: Martin Rubey, Timothy Daly
++ References:
++ Rube06 Extended rate, more GFUN
++ Hebi10 Extended Rate, more GFUN
++ Description:
++ This package implements guessing of sequences. Packages for the
++ most common cases are provided as \spadtype{GuessInteger},
++ \spadtype{GuessPolynomial}, etc.
Guess(F, S, EXPRR, R, retract, coerce) : SIG == CODE where
F : Field -- zB.: FRAC POLY PF 5
-- in F we interpolate und check
S : GcdDomain
-- in guessExpRat I would like to determine the roots of polynomials in F. When
-- F is a quotientfield, I can get rid of the denominator. In this case F is
-- roughly QFCAT S
R : Join(OrderedSet, IntegralDomain) -- zB.: FRAC POLY INT
-- results are given as elements of EXPRR
EXPRR : Join(FunctionSpace Integer, IntegralDomain,
RetractableTo R, RetractableTo Symbol,
RetractableTo Integer, CombinatorialOpsCategory,
PartialDifferentialRing Symbol) with
_* : (%,%) -> %
_/ : (%,%) -> %
_*_* : (%,%) -> %
numerator : % -> %
denominator : % -> %
ground? : % -> Boolean
-- zB.: EXPR INT
-- EXPR FRAC POLY INT is forbidden. Thus i cannot just use EXPR R
-- EXPRR exists, in case at some point there is support for EXPR PF 5.
-- the following I really would like to get rid of
retract : R -> F -- zB.: i+->i
coerce : F -> EXPRR -- zB.: i+->i
-- attention: EXPRR ~= EXPR R
LGOPT ==> List GuessOption
GOPT0 ==> GuessOptionFunctions0
NNI ==> NonNegativeInteger
PI ==> PositiveInteger
EXPRI ==> Expression Integer
GUESSRESULT ==> List Record(function: EXPRR, order: NNI)
UFPSF ==> UnivariateFormalPowerSeries F
UFPS1 ==> UnivariateFormalPowerSeriesFunctions
UFPSS ==> UnivariateFormalPowerSeries S
SUP ==> SparseUnivariatePolynomial
UFPSSUPF ==> UnivariateFormalPowerSeries SUP F
FFFG ==> FractionFreeFastGaussian
FFFGF ==> FractionFreeFastGaussianFractions
-- CoeffAction
DIFFSPECA ==> (NNI, NNI, SUP S) -> S
DIFFSPECAF ==> (NNI, NNI, UFPSSUPF) -> SUP F
DIFFSPECAX ==> (NNI, Symbol, EXPRR) -> EXPRR
-- the diagonal of the C-matrix
DIFFSPECC ==> NNI -> List S
HPSPEC ==> Record(guessStream: UFPSF -> Stream UFPSF,
degreeStream: Stream NNI,
testStream: UFPSSUPF -> Stream UFPSSUPF,
exprStream: (EXPRR, Symbol) -> Stream EXPRR,
A: DIFFSPECA,
AF: DIFFSPECAF,
AX: DIFFSPECAX,
C: DIFFSPECC)
-- note that empty?(guessStream.o) has to return always. In other words, if the
-- stream is finite, empty? should recognize it.
DIFFSPECN ==> EXPRR -> EXPRR -- eg.: i+->q^i
GUESSER ==> (List F, LGOPT) -> GUESSRESULT
FSUPS ==> Fraction SUP S
FSUPF ==> Fraction SUP F
V ==> OrderedVariableList(['a1, 'A])
POLYF ==> SparseMultivariatePolynomial(F, V)
FPOLYF ==> Fraction POLYF
FSUPFPOLYF ==> Fraction SUP FPOLYF
POLYS ==> SparseMultivariatePolynomial(S, V)
FPOLYS ==> Fraction POLYS
FSUPFPOLYS ==> Fraction SUP FPOLYS
--@<<implementation: Guess - Hermite-Pade - Types for Operators>>
-- EXT ==> (Integer, V, V) -> FPOLYS
-- EXTEXPR ==> (Symbol, F, F) -> EXPRR
SIG ==> with
guess : List F -> GUESSRESULT
++ \spad{guess l} applies recursively \spadfun{guessRec} and
++ \spadfun{guessADE} to the successive differences and quotients of
++ the list. Default options as described in
++ \spadtype{GuessOptionFunctions0} are used.
guess : (List F, LGOPT) -> GUESSRESULT
++ \spad{guess(l, options)} applies recursively \spadfun{guessRec}
++ and \spadfun{guessADE} to the successive differences and quotients
++ of the list. The given options are used.
guess : (List F, List GUESSER, List Symbol) -> GUESSRESULT
++ \spad{guess(l, guessers, ops)} applies recursively the given
++ guessers to the successive differences if ops contains the symbol
++ guessSum and quotients if ops contains the symbol guessProduct to
++ the list. Default options as described in
++ \spadtype{GuessOptionFunctions0} are used.
guess : (List F, List GUESSER, List Symbol, LGOPT) -> GUESSRESULT
++ \spad{guess(l, guessers, ops)} applies recursively the given
++ guessers to the successive differences if ops contains the symbol
++ \spad{guessSum} and quotients if ops contains the symbol
++ \spad{guessProduct} to the list. The given options are used.
guessExpRat : List F -> GUESSRESULT
++ \spad{guessExpRat l} tries to find a function of the form
++ n+->(a+b n)^n r(n), where r(n) is a rational function, that fits
++ l.
guessExpRat : (List F, LGOPT) -> GUESSRESULT
++ \spad{guessExpRat(l, options)} tries to find a function of the
++ form n+->(a+b n)^n r(n), where r(n) is a rational function, that
++ fits l.
guessBinRat : List F -> GUESSRESULT
++ \spad{guessBinRat(l, options)} tries to find a function of the
++ form n+->binomial(a+b n, n) r(n), where r(n) is a rational
++ function, that fits l.
guessBinRat : (List F, LGOPT) -> GUESSRESULT
++ \spad{guessBinRat(l, options)} tries to find a function of the
++ form n+->binomial(a+b n, n) r(n), where r(n) is a rational
++ function, that fits l.
if F has RetractableTo Symbol and S has RetractableTo Symbol then
guessExpRat : Symbol -> GUESSER
++ \spad{guessExpRat q} returns a guesser that tries to find a
++ function of the form n+->(a+b q^n)^n r(q^n), where r(q^n) is a
++ q-rational function, that fits l.
guessBinRat : Symbol -> GUESSER
++ \spad{guessBinRat q} returns a guesser that tries to find a
++ function of the form n+->qbinomial(a+b n, n) r(n), where r(q^n) is a
++ q-rational function, that fits l.
guessHP : (LGOPT -> HPSPEC) -> GUESSER
++ \spad{guessHP f} constructs an operation that applies Hermite-Pade
++ approximation to the series generated by the given function f.
guessADE : List F -> GUESSRESULT
++ \spad{guessADE l} tries to find an algebraic differential equation
++ for a generating function whose first Taylor coefficients are
++ given by l, using the default options described in
++ \spadtype{GuessOptionFunctions0}.
guessADE : (List F, LGOPT) -> GUESSRESULT
++ \spad{guessADE(l, options)} tries to find an algebraic
++ differential equation for a generating function whose first Taylor
++ coefficients are given by l, using the given options.
guessAlg : List F -> GUESSRESULT
++ \spad{guessAlg l} tries to find an algebraic equation for a
++ generating function whose first Taylor coefficients are given by
++ l, using the default options described in
++ \spadtype{GuessOptionFunctions0}. It is equivalent to
++ \spadfun{guessADE}(l, maxDerivative == 0).
guessAlg : (List F, LGOPT) -> GUESSRESULT
++ \spad{guessAlg(l, options)} tries to find an algebraic equation
++ for a generating function whose first Taylor coefficients are
++ given by l, using the given options. It is equivalent to
++ \spadfun{guessADE}(l, options) with \spad{maxDerivative == 0}.
guessHolo : List F -> GUESSRESULT
++ \spad{guessHolo l} tries to find an ordinary linear differential
++ equation for a generating function whose first Taylor coefficients
++ are given by l, using the default options described in
++ \spadtype{GuessOptionFunctions0}. It is equivalent to
++ \spadfun{guessADE}\spad{(l, maxPower == 1)}.
guessHolo : (List F, LGOPT) -> GUESSRESULT
++ \spad{guessHolo(l, options)} tries to find an ordinary linear
++ differential equation for a generating function whose first Taylor
++ coefficients are given by l, using the given options. It is
++ equivalent to \spadfun{guessADE}\spad{(l, options)} with
++ \spad{maxPower == 1}.
guessPade : (List F, LGOPT) -> GUESSRESULT
++ \spad{guessPade(l, options)} tries to find a rational function
++ whose first Taylor coefficients are given by l, using the given
++ options. It is equivalent to \spadfun{guessADE}\spad{(l,
++ maxDerivative == 0, maxPower == 1, allDegrees == true)}.
guessPade : List F -> GUESSRESULT
++ \spad{guessPade(l, options)} tries to find a rational function
++ whose first Taylor coefficients are given by l, using the default
++ options described in \spadtype{GuessOptionFunctions0}. It is
++ equivalent to \spadfun{guessADE}\spad{(l, options)} with
++ \spad{maxDerivative == 0, maxPower == 1, allDegrees == true}.
guessRec : List F -> GUESSRESULT
++ \spad{guessRec l} tries to find an ordinary difference equation
++ whose first values are given by l, using the default options
++ described in \spadtype{GuessOptionFunctions0}.
guessRec : (List F, LGOPT) -> GUESSRESULT
++ \spad{guessRec(l, options)} tries to find an ordinary difference
++ equation whose first values are given by l, using the given
++ options.
guessPRec : (List F, LGOPT) -> GUESSRESULT
++ \spad{guessPRec(l, options)} tries to find a linear recurrence
++ with polynomial coefficients whose first values are given by l,
++ using the given options. It is equivalent to
++ \spadfun{guessRec}\spad{(l, options)} with \spad{maxPower == 1}.
guessPRec : List F -> GUESSRESULT
++ \spad{guessPRec l} tries to find a linear recurrence with
++ polynomial coefficients whose first values are given by l, using
++ the default options described in
++ \spadtype{GuessOptionFunctions0}. It is equivalent to
++ \spadfun{guessRec}\spad{(l, maxPower == 1)}.
guessRat : (List F, LGOPT) -> GUESSRESULT
++ \spad{guessRat(l, options)} tries to find a rational function
++ whose first values are given by l, using the given options. It is
++ equivalent to \spadfun{guessRec}\spad{(l, maxShift == 0, maxPower
++ == 1, allDegrees == true)}.
guessRat : List F -> GUESSRESULT
++ \spad{guessRat l} tries to find a rational function whose first
++ values are given by l, using the default options described in
++ \spadtype{GuessOptionFunctions0}. It is equivalent to
++ \spadfun{guessRec}\spad{(l, maxShift == 0, maxPower == 1,
++ allDegrees == true)}.
diffHP : LGOPT -> HPSPEC
++ \spad{diffHP options} returns a specification for Hermite-Pade
++ approximation with the differential operator
shiftHP : LGOPT -> HPSPEC
++ \spad{shiftHP options} returns a specification for Hermite-Pade
++ approximation with the shift operator
if F has RetractableTo Symbol and S has RetractableTo Symbol then
shiftHP : Symbol -> (LGOPT -> HPSPEC)
++ \spad{shiftHP options} returns a specification for
++ Hermite-Pade approximation with the $q$-shift operator
diffHP : Symbol -> (LGOPT -> HPSPEC)
++ \spad{diffHP options} returns a specification for Hermite-Pade
++ approximation with the $q$-dilation operator
guessRec : Symbol -> GUESSER
++ \spad{guessRec q} returns a guesser that finds an ordinary
++ q-difference equation whose first values are given by l, using
++ the given options.
guessPRec : Symbol -> GUESSER
++ \spad{guessPRec q} returns a guesser that tries to find
++ a linear q-recurrence with polynomial coefficients whose first
++ values are given by l, using the given options. It is
++ equivalent to \spadfun{guessRec}\spad{(q)} with
++ \spad{maxPower == 1}.
guessRat : Symbol -> GUESSER
++ \spad{guessRat q} returns a guesser that tries to find a
++ q-rational function whose first values are given by l, using
++ the given options. It is equivalent to \spadfun{guessRec} with
++ \spad{(l, maxShift == 0, maxPower == 1, allDegrees == true)}.
guessADE : Symbol -> GUESSER
++ \spad{guessADE q} returns a guesser that tries to find an
++ algebraic differential equation for a generating function whose
++ first Taylor coefficients are given by l, using the given
++ options.
--@<<debug exports: Guess>>
CODE ==> add
-- We have to put this chunk at the beginning, because otherwise it will take
-- very long to compile.
ord1(x: List Integer, i: Integer): Integer ==
n := #x - 3 - i
x.(n+1)*reduce(_+, [x.j for j in 1..n], 0) + _
2*reduce(_+, [reduce(_+, [x.k*x.j for k in 1..j-1], 0) _
for j in 1..n], 0)
ord2(x: List Integer, i: Integer): Integer ==
if zero? i then
n := #x - 3 - i
ord1(x, i) + reduce(_+, [x.j for j in 1..n], 0)*(x.(n+2)-x.(n+1))
else
ord1(x, i)
deg1(x: List Integer, i: Integer): Integer ==
m := #x - 3
(x.(m+3)+x.(m+1)+x.(1+i))*reduce(_+, [x.j for j in 2+i..m], 0) + _
x.(m+3)*x.(m+1) + _
2*reduce(_+, [reduce(_+, [x.k*x.j for k in 2+i..j-1], 0) _
for j in 2+i..m], 0)
deg2(x: List Integer, i: Integer): Integer ==
m := #x - 3
deg1(x, i) + _
(x.(m+3) + reduce(_+, [x.j for j in 2+i..m], 0)) * _
(x.(m+2)-x.(m+1))
checkResult(res: EXPRR, n: Symbol, l: Integer, list: List F,
options: LGOPT): NNI ==
for i in l..1 by -1 repeat
den := eval(denominator res, n::EXPRR, (i-1)::EXPRR)
if den = 0 then return i::NNI
num := eval(numerator res, n::EXPRR, (i-1)::EXPRR)
if list.i ~= retract(retract(num/den)@R)
then return i::NNI
0$NNI
SUPS2SUPF(p: SUP S): SUP F ==
if F is S then
p pretend SUP(F)
else if F is Fraction S then
map(coerce(#1)$Fraction(S), p)
$SparseUnivariatePolynomialFunctions2(S, F)
else error "Type parameter F should be either equal to S or equal _
to Fraction S"
F2FPOLYS(p: F): FPOLYS ==
if F is S then
p::POLYF::FPOLYF pretend FPOLYS
else if F is Fraction S then
numer(p)$Fraction(S)::POLYS/denom(p)$Fraction(S)::POLYS
else error "Type parameter F should be either equal to S or equal _
to Fraction S"
MPCSF ==> MPolyCatFunctions2(V, IndexedExponents V,
IndexedExponents V, S, F,
POLYS, POLYF)
SUPF2EXPRR(xx: Symbol, p: SUP F): EXPRR ==
zero? p => 0
(coerce(leadingCoefficient p))::EXPRR * (xx::EXPRR)**degree p
+ SUPF2EXPRR(xx, reductum p)
FSUPF2EXPRR(xx: Symbol, p: FSUPF): EXPRR ==
(SUPF2EXPRR(xx, numer p)) / (SUPF2EXPRR(xx, denom p))
POLYS2POLYF(p: POLYS): POLYF ==
if F is S then
p pretend POLYF
else if F is Fraction S then
map(coerce(#1)$Fraction(S), p)$MPCSF
else error "Type parameter F should be either equal to S or equal _
to Fraction S"
SUPPOLYS2SUPF(p: SUP POLYS, a1v: F, Av: F): SUP F ==
zero? p => 0
lc: POLYF := POLYS2POLYF leadingCoefficient(p)
monomial(retract(eval(lc, [index(1)$V, index(2)$V]::List V,
[a1v, Av])),
degree p)
+ SUPPOLYS2SUPF(reductum p, a1v, Av)
SUPFPOLYS2FSUPPOLYS(p: SUP FPOLYS): Fraction SUP POLYS ==
cden := splitDenominator(p)
$UnivariatePolynomialCommonDenominator(POLYS, FPOLYS,SUP FPOLYS)
pnum: SUP POLYS
:= map(retract(#1 * cden.den)$FPOLYS, p)
$SparseUnivariatePolynomialFunctions2(FPOLYS, POLYS)
pden: SUP POLYS := (cden.den)::SUP POLYS
pnum/pden
POLYF2EXPRR(p: POLYF): EXPRR ==
map(convert(#1)@Symbol::EXPRR, coerce(#1)@EXPRR, p)
$PolynomialCategoryLifting(IndexedExponents V, V,
F, POLYF, EXPRR)
-- this needs documentation. In particular, why is V appearing here?
GF ==> GeneralizedMultivariateFactorize(SingletonAsOrderedSet,
IndexedExponents V, F, F,
SUP F)
-- does not work:
-- 6
-- WARNING (genufact): No known algorithm to factor ? , trying square-free.
-- GF ==> GenUFactorize F
defaultD: DIFFSPECN
defaultD(expr: EXPRR): EXPRR == expr
-- applies n+->q^n or whatever DN is to i
DN2DL: (DIFFSPECN, Integer) -> F
DN2DL(DN, i) == retract(retract(DN(i::EXPRR))@R)
evalResultant(p1: POLYS, p2: POLYS, o: Integer, d: Integer, va1: V, vA: V)_
: List S ==
res: List S := []
d1 := degree(p1, va1)
d2 := degree(p2, va1)
lead: S
for k in 1..d-o+1 repeat
p1atk := univariate eval(p1, vA, k::S)
p2atk := univariate eval(p2, vA, k::S)
d1atk := degree p1atk
d2atk := degree p2atk
-- output("k: " string(k))$OutputPackage
-- output("d1: " string(d1) " d1atk: " string(d1atk))$OutputPackage
-- output("d2: " string(d2) " d2atk: " string(d2atk))$OutputPackage
if d2atk < d2 then
if d1atk < d1
then lead := 0$S
else lead := (leadingCoefficient p1atk)**((d2-d2atk)::NNI)
else
if d1atk < d1
then lead := (-1$S)**d2 * (leadingCoefficient p2atk)**((d1-d1atk)::NNI)
else lead := 1$S
if zero? lead
then res := cons(0, res)
else res := cons(lead * (resultant(p1atk, p2atk)$SUP(S) exquo _
(k::S)**(o::NNI))::S,
res)
reverse res
p(xm: Integer, i: Integer, va1: V, vA: V, basis: DIFFSPECN): FPOLYS ==
vA::POLYS::FPOLYS + va1::POLYS::FPOLYS _
* F2FPOLYS(DN2DL(basis, i) - DN2DL(basis, xm))
p2(xm: Integer, i: Symbol, a1v: F, Av: F, basis: DIFFSPECN): EXPRR ==
coerce(Av) + coerce(a1v)*(basis(i::EXPRR) - basis(xm::EXPRR))
guessExpRatAux(xx: Symbol, list: List F, basis: DIFFSPECN,
xValues: List Integer, options: LGOPT): List EXPRR ==
a1: V := index(1)$V
A: V := index(2)$V
len: NNI := #list
if len < 4 then return []
else len := (len-3)::NNI
xlist := [F2FPOLYS DN2DL(basis, xValues.i) for i in 1..len]
x1 := F2FPOLYS DN2DL(basis, xValues.(len+1))
x2 := F2FPOLYS DN2DL(basis, xValues.(len+2))
x3 := F2FPOLYS DN2DL(basis, xValues.(len+3))
y: NNI -> FPOLYS :=
F2FPOLYS(list.#1) * _
p(last xValues, (xValues.#1)::Integer, a1, A, basis)**_
(-(xValues.#1)::Integer)
ylist: List FPOLYS := [y i for i in 1..len]
y1 := y(len+1)
y2 := y(len+2)
y3 := y(len+3)
res := []::List EXPRR
-- tpd: this is undefined since maxDegree is always nonnegative
-- if maxDegree(options)$GOPT0 = -1
-- then maxDeg := len-1
-- else maxDeg := min(maxDegree(options)$GOPT0, len-1)
-- maxDeg := min(maxDegree(options)$GOPT0, len-1)
tpd:Integer := (maxDegree(options)$GOPT0)::NNI::Integer
maxDeg:Integer:=min(tpd,len-1)
for i in 0..maxDeg repeat
if debug(options)$GOPT0 then
output(hconcat("degree ExpRat "::OutputForm, i::OutputForm))
$OutputPackage
if debug(options)$GOPT0 then
systemCommand("sys date +%s")$MoreSystemCommands
output("interpolating..."::OutputForm)$OutputPackage
ri: FSUPFPOLYS
:= interpolate(xlist, ylist, (len-1-i)::NNI) _
$FFFG(FPOLYS, SUP FPOLYS)
-- for experimental fraction free interpolation
-- ri: Fraction SUP POLYS
-- := interpolate(xlist, ylist, (len-1-i)::NNI) _
-- $FFFG(POLYS, SUP POLYS)
if debug(options)$GOPT0 then
-- output(hconcat("xlist: ", xlist::OutputForm))$OutputPackage
-- output(hconcat("ylist: ", ylist::OutputForm))$OutputPackage
-- output(hconcat("ri: ", ri::OutputForm))$OutputPackage
systemCommand("sys date +%s")$MoreSystemCommands
output("polynomials..."::OutputForm)$OutputPackage
poly1: POLYS := numer(elt(ri, x1)$SUP(FPOLYS) - y1)
poly2: POLYS := numer(elt(ri, x2)$SUP(FPOLYS) - y2)
poly3: POLYS := numer(elt(ri, x3)$SUP(FPOLYS) - y3)
-- for experimental fraction free interpolation
-- ri2: FSUPFPOLYS := map(#1::FPOLYS, numer ri) _
-- $SparseUnivariatePolynomialFunctions2(POLYS, FPOLYS)_
-- /map(#1::FPOLYS, denom ri) _
-- $SparseUnivariatePolynomialFunctions2(POLYS, FPOLYS)
--
-- poly1: POLYS := numer(elt(ri2, x1)$SUP(FPOLYS) - y1)
-- poly2: POLYS := numer(elt(ri2, x2)$SUP(FPOLYS) - y2)
-- poly3: POLYS := numer(elt(ri2, x3)$SUP(FPOLYS) - y3)
n:Integer := len - i
o1: Integer := ord1(xValues, i)
d1: Integer := deg1(xValues, i)
o2: Integer := ord2(xValues, i)
d2: Integer := deg2(xValues, i)
-- another compiler bug: using i as iterator here makes the loop break
if debug(options)$GOPT0 then
systemCommand("sys date +%s")$MoreSystemCommands
output("interpolating resultants..."::OutputForm)$OutputPackage
res1: SUP S
:= newton(evalResultant(poly1, poly3, o1, d1, a1, A))
$NewtonInterpolation(S)
res2: SUP S
:= newton(evalResultant(poly2, poly3, o2, d2, a1, A))
$NewtonInterpolation(S)
if debug(options)$GOPT0 then
-- res1: SUP S := univariate(resultant(poly1, poly3, a1))
-- res2: SUP S := univariate(resultant(poly2, poly3, a1))
-- if res1 ~= res1res or res2 ~= res2res then
-- output(hconcat("poly1 ", poly1::OutputForm))$OutputPackage
-- output(hconcat("poly2 ", poly2::OutputForm))$OutputPackage
-- output(hconcat("poly3 ", poly3::OutputForm))$OutputPackage
-- output(hconcat("res1 ", res1::OutputForm))$OutputPackage
-- output(hconcat("res2 ", res2::OutputForm))$OutputPackage
output("n/i: " string(n) " " string(i))$OutputPackage
output("res1 ord: " string(o1) " " string(minimumDegree res1))
$OutputPackage
output("res1 deg: " string(d1) " " string(degree res1))
$OutputPackage
output("res2 ord: " string(o2) " " string(minimumDegree res2))
$OutputPackage
output("res2 deg: " string(d2) " " string(degree res2))
$OutputPackage
if debug(options)$GOPT0 then
systemCommand("sys date +%s")$MoreSystemCommands
output("computing gcd..."::OutputForm)$OutputPackage
-- we want to solve over F
-- for polynomial domains S this seems to be very costly!
res3: SUP F := SUPS2SUPF(primitivePart(gcd(res1, res2)))
if debug(options)$GOPT0 then
systemCommand("sys date +%s")$MoreSystemCommands
output("solving..."::OutputForm)$OutputPackage
-- res3 is a polynomial in A=a0+(len+3)*a1
-- now we have to find the roots of res3
for f in factors factor(res3)$GF | degree f.factor = 1 repeat
-- we are only interested in the linear factors
if debug(options)$GOPT0 then
output(hconcat("f: ", f::OutputForm))$OutputPackage
Av: F := -coefficient(f.factor, 0)
/ leadingCoefficient f.factor
-- FIXME: in an earlier version, we disregarded vanishing Av
-- maybe we intended to disregard vanishing a1v? Either doesn't really
-- make sense to me right now.
evalPoly := eval(POLYS2POLYF poly3, A, Av)
if zero? evalPoly
then evalPoly := eval(POLYS2POLYF poly1, A, Av)
-- Note that it really may happen that poly3 vanishes when specializing
-- A. Consider for example guessExpRat([1,1,1,1]).
-- FIXME: We check poly1 below, too. I should work out in what cases poly3
-- vanishes.
for g in factors factor(univariate evalPoly)$GF
| degree g.factor = 1 repeat
if debug(options)$GOPT0 then
output(hconcat("g: ", g::OutputForm))$OutputPackage
a1v: F := -coefficient(g.factor, 0)
/ leadingCoefficient g.factor
-- check whether poly1 and poly2 really vanish. Note that we could have found
-- an extraneous solution, since we only computed the gcd of the two
-- resultants.
t1 := eval(POLYS2POLYF poly1, [a1, A]::List V,
[a1v, Av]::List F)
if zero? t1 then
t2 := eval(POLYS2POLYF poly2, [a1, A]::List V,
[a1v, Av]::List F)
if zero? t2 then
ri1: Fraction SUP POLYS
:= SUPFPOLYS2FSUPPOLYS(numer ri)
/ SUPFPOLYS2FSUPPOLYS(denom ri)
-- for experimental fraction free interpolation
-- ri1: Fraction SUP POLYS := ri
numr: SUP F := SUPPOLYS2SUPF(numer ri1, a1v, Av)
denr: SUP F := SUPPOLYS2SUPF(denom ri1, a1v, Av)
if not zero? denr then
res4: EXPRR := eval(FSUPF2EXPRR(xx, numr/denr),
kernel(xx),
basis(xx::EXPRR))
*p2(last xValues, _
xx, a1v, Av, basis)_
**xx::EXPRR
res := cons(res4, res)
else if zero? numr and debug(options)$GOPT0 then
output("numerator and denominator vanish!")
$OutputPackage
-- If we are only interested in one solution, we do not try other degrees if we
-- have found already some solutions., the indentation here is correct.
if not null(res) and one(options)$GOPT0 then return res
res
guessExpRatAux0(list: List F, basis: DIFFSPECN, options: LGOPT): GUESSRESULT ==
if zero? safety(options)$GOPT0 then
error "Guess: guessExpRat does not support zero safety"
-- guesses Functions of the Form (a1*n+a0)^n*rat(n)
xx := indexName(options)$GOPT0
-- restrict to safety
len: Integer := #list
if len-safety(options)$GOPT0+1 < 0 then return []
shortlist: List F := first(list, (len-safety(options)$GOPT0+1)::NNI)
-- remove zeros from list
zeros: EXPRR := 1
newlist: List F
xValues: List Integer
i: Integer := -1
for x in shortlist repeat
i := i+1
if x = 0 then
zeros := zeros * (basis(xx::EXPRR) - basis(i::EXPRR))
i := -1
for x in shortlist repeat
i := i+1
if x ~= 0 then
newlist := cons(x/retract(retract(eval(zeros, xx::EXPRR,
i::EXPRR))@R),
newlist)
xValues := cons(i, xValues)
newlist := reverse newlist
xValues := reverse xValues
res: List EXPRR
:= [eval(zeros * f, xx::EXPRR, xx::EXPRR) _
for f in guessExpRatAux(xx, newlist, basis, xValues, options)]
reslist := map([#1, checkResult(#1, xx, len, list, options)], res)
$ListFunctions2(EXPRR, Record(function: EXPRR, order: NNI))
select(#1.order < len-safety(options)$GOPT0, reslist)
guessExpRat(list : List F): GUESSRESULT ==
guessExpRatAux0(list, defaultD, [])
guessExpRat(list: List F, options: LGOPT): GUESSRESULT ==
guessExpRatAux0(list, defaultD, options)
if F has RetractableTo Symbol and S has RetractableTo Symbol then
guessExpRat(q: Symbol): GUESSER ==
guessExpRatAux0(#1, q::EXPRR**#1, #2)
EXT ==> (Integer, V, V) -> FPOLYS
EXTEXPR ==> (Symbol, F, F) -> EXPRR
binExt: EXT
binExt(i: Integer, va1: V, vA: V): FPOLYS ==
numl: List POLYS := [(vA::POLYS) + i * (va1::POLYS) - (l::POLYS) _
for l in 0..i-1]
num: POLYS := reduce(_*, numl, 1)
num/(factorial(i)::POLYS)
binExtEXPR: EXTEXPR
binExtEXPR(i: Symbol, a1v: F, Av: F): EXPRR ==
binomial(coerce Av + coerce a1v * (i::EXPRR), i::EXPRR)
guessBinRatAux(xx: Symbol, list: List F,
basis: DIFFSPECN, ext: EXT, extEXPR: EXTEXPR,
xValues: List Integer, options: LGOPT): List EXPRR ==
a1: V := index(1)$V
A: V := index(2)$V
len: NNI := #list
if len < 4 then return []
else len := (len-3)::NNI
xlist := [F2FPOLYS DN2DL(basis, xValues.i) for i in 1..len]
x1 := F2FPOLYS DN2DL(basis, xValues.(len+1))
x2 := F2FPOLYS DN2DL(basis, xValues.(len+2))
x3 := F2FPOLYS DN2DL(basis, xValues.(len+3))
y: NNI -> FPOLYS :=
F2FPOLYS(list.#1) / _
ext((xValues.#1)::Integer, a1, A)
ylist: List FPOLYS := [y i for i in 1..len]
y1 := y(len+1)
y2 := y(len+2)
y3 := y(len+3)
res := []::List EXPRR
-- tpd: this is undefined since maxDegree is always nonnegative
-- if maxDegree(options)$GOPT0 = -1
-- then maxDeg := len-1
-- else maxDeg := min(maxDegree(options)$GOPT0, len-1)
-- maxDeg := min(maxDegree(options)$GOPT0, len-1)
tpd:Integer := (maxDegree(options)$GOPT0)::NNI::Integer
maxDeg:Integer:=min(tpd,len-1)
-- maxDeg:Integer := (maxDegree(options)$GOPT0)::NNI::Integer
for i in 0..maxDeg repeat
-- if debug(options)$GOPT0 then
-- output(hconcat("degree BinRat "::OutputForm, i::OutputForm))
-- $OutputPackage
-- if debug(options)$GOPT0 then
-- output("interpolating..."::OutputForm)$OutputPackage
ri: FSUPFPOLYS
:= interpolate(xlist, ylist, (len-1-i)::NNI) _
$FFFG(FPOLYS, SUP FPOLYS)
-- if debug(options)$GOPT0 then
-- output(hconcat("ri ", ri::OutputForm))$OutputPackage
poly1: POLYS := numer(elt(ri, x1)$SUP(FPOLYS) - y1)
poly2: POLYS := numer(elt(ri, x2)$SUP(FPOLYS) - y2)
poly3: POLYS := numer(elt(ri, x3)$SUP(FPOLYS) - y3)
-- if debug(options)$GOPT0 then
-- output(hconcat("poly1 ", poly1::OutputForm))$OutputPackage
-- output(hconcat("poly2 ", poly2::OutputForm))$OutputPackage
-- output(hconcat("poly3 ", poly3::OutputForm))$OutputPackage
n:Integer := len - i
res1: SUP S := univariate(resultant(poly1, poly3, a1))
res2: SUP S := univariate(resultant(poly2, poly3, a1))
if debug(options)$GOPT0 then
-- output(hconcat("res1 ", res1::OutputForm))$OutputPackage
-- output(hconcat("res2 ", res2::OutputForm))$OutputPackage
-- if res1 ~= res1res or res2 ~= res2res then
-- output(hconcat("poly1 ", poly1::OutputForm))$OutputPackage
-- output(hconcat("poly2 ", poly2::OutputForm))$OutputPackage
-- output(hconcat("poly3 ", poly3::OutputForm))$OutputPackage
-- output(hconcat("res1 ", res1::OutputForm))$OutputPackage
-- output(hconcat("res2 ", res2::OutputForm))$OutputPackage
-- output("n/i: " string(n) " " string(i))$OutputPackage
output("res1 ord: " string(minimumDegree res1))
$OutputPackage
output("res1 deg: " string(degree res1))
$OutputPackage
output("res2 ord: " string(minimumDegree res2))
$OutputPackage
output("res2 deg: " string(degree res2))
$OutputPackage
if debug(options)$GOPT0 then
output("computing gcd..."::OutputForm)$OutputPackage
-- we want to solve over F
res3: SUP F := SUPS2SUPF(primitivePart(gcd(res1, res2)))
-- if debug(options)$GOPT0 then
-- output(hconcat("res3 ", res3::OutputForm))$OutputPackage
-- res3 is a polynomial in A=a0+(len+3)*a1
-- now we have to find the roots of res3
for f in factors factor(res3)$GF | degree f.factor = 1 repeat
-- we are only interested in the linear factors
-- if debug(options)$GOPT0 then
-- output(hconcat("f: ", f::OutputForm))$OutputPackage
Av: F := -coefficient(f.factor, 0)
/ leadingCoefficient f.factor
-- if debug(options)$GOPT0 then
-- output(hconcat("Av: ", Av::OutputForm))$OutputPackage
-- FIXME: in an earlier version, we disregarded vanishing Av
-- maybe we intended to disregard vanishing a1v? Either doesn't really
-- make sense to me right now.
evalPoly := eval(POLYS2POLYF poly3, A, Av)
if zero? evalPoly
then evalPoly := eval(POLYS2POLYF poly1, A, Av)
-- Note that it really may happen that poly3 vanishes when specializing
-- A. Consider for example guessExpRat([1,1,1,1]).
-- FIXME: We check poly1 below, too. I should work out in what cases poly3
-- vanishes.
for g in factors factor(univariate evalPoly)$GF
| degree g.factor = 1 repeat
-- if debug(options)$GOPT0 then
-- output(hconcat("g: ", g::OutputForm))$OutputPackage
a1v: F := -coefficient(g.factor, 0)
/ leadingCoefficient g.factor
-- if debug(options)$GOPT0 then
-- output(hconcat("a1v: ", a1v::OutputForm))$OutputPackage
-- check whether poly1 and poly2 really vanish. Note that we could have found
-- an extraneous solution, since we only computed the gcd of the two
-- resultants.
t1 := eval(POLYS2POLYF poly1, [a1, A]::List V,
[a1v, Av]::List F)
-- if debug(options)$GOPT0 then
-- output(hconcat("t1: ", t1::OutputForm))$OutputPackage
if zero? t1 then
t2 := eval(POLYS2POLYF poly2, [a1, A]::List V,
[a1v, Av]::List F)
-- if debug(options)$GOPT0 then
-- output(hconcat("t2: ", t2::OutputForm))$OutputPackage
if zero? t2 then
ri1: Fraction SUP POLYS
:= SUPFPOLYS2FSUPPOLYS(numer ri)
/ SUPFPOLYS2FSUPPOLYS(denom ri)
-- if debug(options)$GOPT0 then
-- output(hconcat("ri1: ", ri1::OutputForm))$OutputPackage
numr: SUP F := SUPPOLYS2SUPF(numer ri1, a1v, Av)
denr: SUP F := SUPPOLYS2SUPF(denom ri1, a1v, Av)
-- if debug(options)$GOPT0 then
-- output(hconcat("numr: ", numr::OutputForm))$OutputPackage
-- output(hconcat("denr: ", denr::OutputForm))$OutputPackage
if not zero? denr then
res4: EXPRR := eval(FSUPF2EXPRR(xx, numr/denr),
kernel(xx),
basis(xx::EXPRR))
* extEXPR(xx, a1v, Av)
-- if debug(options)$GOPT0 then
-- output(hconcat("res4: ", res4::OutputForm))$OutputPackage
res := cons(res4, res)
else if zero? numr and debug(options)$GOPT0 then
output("numerator and denominator vanish!")
$OutputPackage
-- If we are only interested in one solution,
-- we do not try other degrees if we
-- have found already some solutions.,
-- the indentation here is correct.
if not null(res) and one(options)$GOPT0 then return res
res
guessBinRatAux0(list: List F,
basis: DIFFSPECN, ext: EXT, extEXPR: EXTEXPR,
options: LGOPT): GUESSRESULT ==
if zero? safety(options)$GOPT0 then
error "Guess: guessBinRat does not support zero safety"
-- guesses Functions of the form binomial(a+b*n, n)*rat(n)
xx := indexName(options)$GOPT0
-- restrict to safety
len: Integer := #list
if len-safety(options)$GOPT0+1 < 0 then return []
shortlist: List F := first(list, (len-safety(options)$GOPT0+1)::NNI)
-- remove zeros from list
zeros: EXPRR := 1
newlist: List F
xValues: List Integer
i: Integer := -1
for x in shortlist repeat
i := i+1
if x = 0 then
zeros := zeros * (basis(xx::EXPRR) - basis(i::EXPRR))
i := -1
for x in shortlist repeat
i := i+1
if x ~= 0 then
newlist := cons(x/retract(retract(eval(zeros, xx::EXPRR,
i::EXPRR))@R),
newlist)
xValues := cons(i, xValues)
newlist := reverse newlist
xValues := reverse xValues
res: List EXPRR
:= [eval(zeros * f, xx::EXPRR, xx::EXPRR) _
for f in guessBinRatAux(xx,newlist,basis,ext,extEXPR,xValues, _
options)]
reslist := map([#1, checkResult(#1, xx, len, list, options)], res)_
$ListFunctions2(EXPRR, Record(function: EXPRR, order: NNI))
select(#1.order < len-safety(options)$GOPT0, reslist)
guessBinRat(list : List F): GUESSRESULT ==
guessBinRatAux0(list, defaultD, binExt, binExtEXPR, [])
guessBinRat(list: List F, options: LGOPT): GUESSRESULT ==
guessBinRatAux0(list, defaultD, binExt, binExtEXPR, options)
if F has RetractableTo Symbol and S has RetractableTo Symbol then
qD: Symbol -> DIFFSPECN
qD q == (q::EXPRR)**#1
qBinExtAux(q: Symbol, i: Integer, va1: V, vA: V): FPOLYS ==
fl: List FPOLYS
:= [(1$FPOLYS - _
va1::POLYS::FPOLYS * (vA::POLYS::FPOLYS)**(i-1) * _
F2FPOLYS(q::F)**l) / (1-F2FPOLYS(q::F)**l) _
for l in 1..i]
reduce(_*, fl, 1)
qBinExt: Symbol -> EXT
qBinExt q == qBinExtAux(q, #1, #2, #3)
qBinExtEXPRaux(q: Symbol, i: Symbol, a1v: F, Av: F): EXPRR ==
l: Symbol := 'l
product((1$EXPRR - _
coerce a1v * (coerce Av) ** (coerce i - 1$EXPRR) * _
(q::EXPRR) ** coerce(l)) / _
(1$EXPRR - (q::EXPRR) ** coerce(l)), _
equation(l, 1$EXPRR..i::EXPRR))
qBinExtEXPR: Symbol -> EXTEXPR
qBinExtEXPR q == qBinExtEXPRaux(q, #1, #2, #3)
guessBinRat(q: Symbol): GUESSER ==
guessBinRatAux0(#1, qD q, qBinExt q, qBinExtEXPR q, #2)_
-- some useful types for Ore operators that work on series
-- the differentiation operator
DIFFSPECX ==> (EXPRR, Symbol, NonNegativeInteger) -> EXPRR
-- eg.: f(x)+->f(q*x)
-- f(x)+->D(f, x)
DIFFSPECS ==> (UFPSF, NonNegativeInteger) -> UFPSF
-- eg.: f(x)+->f(q*x)
DIFFSPECSF ==> (UFPSSUPF, NonNegativeInteger) -> UFPSSUPF
-- eg.: f(x)+->f(q*x)
-- the constant term for the inhomogeneous case
DIFFSPEC1 ==> UFPSF
DIFFSPEC1F ==> UFPSSUPF
DIFFSPEC1X ==> Symbol -> EXPRR
termAsEXPRR(f: EXPRR, xx: Symbol, l: List Integer,
DX: DIFFSPECX, D1X: DIFFSPEC1X): EXPRR ==
if empty? l then D1X(xx)
else
ll: List List Integer := powers(l)$Partition
fl: List EXPRR := [DX(f, xx, (first part-1)::NonNegativeInteger)
** second(part)::NNI for part in ll]
reduce(_*, fl)
termAsUFPSF(f:UFPSF,l:List Integer,DS:DIFFSPECS, D1: DIFFSPEC1): UFPSF ==
if empty? l then D1
else
ll: List List Integer := powers(l)$Partition
-- first of each element of ll is the derivative, second is the power
fl: List UFPSF := [DS(f, (first part -1)::NonNegativeInteger) _
** second(part)::NNI for part in ll]
reduce(_*, fl)
-- returns \prod f^(l.i), but using the Hadamard product
termAsUFPSF2(f: UFPSF, l: List Integer,
DS: DIFFSPECS, D1: DIFFSPEC1): UFPSF ==
if empty? l then D1
else
ll: List List Integer := powers(l)$Partition
-- first of each element of ll is the derivative, second is the power
fl: List UFPSF
:= [map(#1** second(part)::NNI, DS(f, (first part -1)::NNI)) _
for part in ll]
reduce(hadamard$UFPS1(F), fl)
termAsUFPSSUPF(f: UFPSSUPF, l: List Integer,
DSF: DIFFSPECSF, D1F: DIFFSPEC1F): UFPSSUPF ==
if empty? l then D1F
else
ll: List List Integer := powers(l)$Partition
-- first of each element of ll is the derivative, second is the power
fl: List UFPSSUPF
:= [DSF(f, (first part -1)::NonNegativeInteger)
** second(part)::NNI for part in ll]
reduce(_*, fl)
-- returns \prod f^(l.i), but using the Hadamard product
termAsUFPSSUPF2(f: UFPSSUPF, l: List Integer,
DSF: DIFFSPECSF, D1F: DIFFSPEC1F): UFPSSUPF ==
if empty? l then D1F
else
ll: List List Integer := powers(l)$Partition
-- first of each element of ll is the derivative, second is the power
fl: List UFPSSUPF
:= [map(#1**second(part)::NNI, DSF(f, (first part -1)::NNI)) _
for part in ll]
reduce(hadamard$UFPS1(SUP F), fl)
FilteredPartitionStream(options: LGOPT): Stream List Integer ==
--tpd: must force types to NNI and Integer
maxD:Integer := 1+maxDerivative(options)$GOPT0::NNI::Integer
maxP:Integer := maxPower(options)$GOPT0::NNI::Integer
if maxD > 0 and maxP > -1 then
s := partitions(maxD, maxP)$PartitionsAndPermutations
else
s1: Stream Integer := generate(inc, 1)$Stream(Integer)
s2: Stream Stream List Integer
:= map(partitions(#1)$PartitionsAndPermutations, s1)
$StreamFunctions2(Integer, Stream List Integer)
s3: Stream List Integer
:= concat(s2)$StreamFunctions1(List Integer)
s := cons([],
select(((maxD = 0) or (# #1 <= maxD)) _
and ((maxP = -1) or (first #1 <= maxP)), s3))
s := conjugates(s)$PartitionsAndPermutations
--tpd: force the Boolean branch
tpd2:Boolean:=homogeneous(options)$GOPT0::Boolean
if tpd2 then rest s else s
-- for functions
ADEguessStream(f: UFPSF, partitions: Stream List Integer,
DS: DIFFSPECS, D1: DIFFSPEC1): Stream UFPSF ==
map(termAsUFPSF(f, #1, DS, D1), partitions)
$StreamFunctions2(List Integer, UFPSF)
-- for coefficients, using the Hadamard product
ADEguessStream2(f: UFPSF, partitions: Stream List Integer,
DS: DIFFSPECS, D1: DIFFSPEC1): Stream UFPSF ==
map(termAsUFPSF2(f, #1, DS, D1), partitions)
$StreamFunctions2(List Integer, UFPSF)
ADEdegreeStream(partitions: Stream List Integer): Stream NNI ==
scan(0, max((if empty? #1 then 0 else (first #1 - 1)::NNI), #2),
partitions)$StreamFunctions2(List Integer, NNI)
ADEtestStream(f: UFPSSUPF, partitions: Stream List Integer,
DSF: DIFFSPECSF, D1F: DIFFSPEC1F): Stream UFPSSUPF ==
map(termAsUFPSSUPF(f, #1, DSF, D1F), partitions)
$StreamFunctions2(List Integer, UFPSSUPF)
ADEtestStream2(f: UFPSSUPF, partitions: Stream List Integer,
DSF: DIFFSPECSF, D1F: DIFFSPEC1F): Stream UFPSSUPF ==
map(termAsUFPSSUPF2(f, #1, DSF, D1F), partitions)
$StreamFunctions2(List Integer, UFPSSUPF)
ADEEXPRRStream(f: EXPRR, xx: Symbol, partitions: Stream List Integer,
DX: DIFFSPECX, D1X: DIFFSPEC1X): Stream EXPRR ==
map(termAsEXPRR(f, xx, #1, DX, D1X), partitions)
$StreamFunctions2(List Integer, EXPRR)
diffDX: DIFFSPECX
diffDX(expr, x, n) == D(expr, x, n)
diffDS: DIFFSPECS
diffDS(s, n) == D(s, n)
diffDSF: DIFFSPECSF
diffDSF(s, n) ==
-- help the compiler here a little to choose the right signature...
if SUP F has _*: (NonNegativeInteger, SUP F) -> SUP F
then D(s, n)
diffAX: DIFFSPECAX
diffAX(l: NNI, x: Symbol, f: EXPRR): EXPRR ==
(x::EXPRR)**l * f
diffA: DIFFSPECA
diffA(k: NNI, l: NNI, f: SUP S): S ==
DiffAction(k, l, f)$FFFG(S, SUP S)
diffAF: DIFFSPECAF
diffAF(k: NNI, l: NNI, f: UFPSSUPF): SUP F ==
DiffAction(k, l, f)$FFFG(SUP F, UFPSSUPF)
diffC: DIFFSPECC
diffC(total: NNI): List S == DiffC(total)$FFFG(S, SUP S)
diff1X: DIFFSPEC1X
diff1X(x: Symbol)== 1$EXPRR
diffHP options ==
if displayAsGF(options)$GOPT0 then
partitions := FilteredPartitionStream options
[ADEguessStream(#1, partitions, diffDS, 1$UFPSF), _
ADEdegreeStream partitions, _
ADEtestStream(#1, partitions, diffDSF, 1$UFPSSUPF), _
ADEEXPRRStream(#1, #2, partitions, diffDX, diff1X), _
diffA, diffAF, diffAX, diffC]$HPSPEC
else
error "Guess: guessADE supports only displayAsGF"
if F has RetractableTo Symbol and S has RetractableTo Symbol then
qDiffDX(q:Symbol,expr:EXPRR,x:Symbol,n:NonNegativeInteger): EXPRR ==
eval(expr, x::EXPRR, (q::EXPRR)**n*x::EXPRR)
qDiffDS(q: Symbol, s: UFPSF, n: NonNegativeInteger): UFPSF ==
multiplyCoefficients((q::F)**((n*#1)::NonNegativeInteger), s)
qDiffDSF(q: Symbol, s: UFPSSUPF, n: NonNegativeInteger): UFPSSUPF ==
multiplyCoefficients((q::F::SUP F)**_
((n*#1)::NonNegativeInteger), s)
diffHP(q: Symbol): (LGOPT -> HPSPEC) ==
if displayAsGF(#1)$GOPT0 then
partitions := FilteredPartitionStream #1
[ADEguessStream(#1,partitions,qDiffDS(q, #1, #2), 1$UFPSF), _
repeating([0$NNI])$Stream(NNI), _
ADEtestStream(#1, partitions, qDiffDSF(q, #1, #2), _
1$UFPSSUPF), _
ADEEXPRRStream(#1, #2, partitions, _
qDiffDX(q, #1, #2, #3), diff1X), _
diffA, diffAF, diffAX, diffC]$HPSPEC
else
error "Guess: guessADE supports only displayAsGF"
ShiftSX(expr: EXPRR, x: Symbol, n: NNI): EXPRR ==
eval(expr, x::EXPRR, x::EXPRR+n::EXPRR)
ShiftSXGF(expr: EXPRR, x: Symbol, n: NNI): EXPRR ==
if zero? n then expr
else
l := [eval(D(expr, x, i)/factorial(i)::EXPRR, x::EXPRR, 0$EXPRR)_
*(x::EXPRR)**i for i in 0..n-1]
(expr-reduce(_+, l))/(x::EXPRR**n)
ShiftSS(s:UFPSF, n:NNI): UFPSF ==
((quoByVar #1)**n)$MappingPackage1(UFPSF) (s)
ShiftSF(s:UFPSSUPF, n: NNI):UFPSSUPF ==
((quoByVar #1)**n)$MappingPackage1(UFPSSUPF) (s)
ShiftAX(l: NNI, n: Symbol, f: EXPRR): EXPRR ==
n::EXPRR**l * f
ShiftAXGF(l: NNI, x: Symbol, f: EXPRR): EXPRR ==
-- I need to help the compiler here, unfortunately
if zero? l then f
else
s := _
[stirling2(l, i)$IntegerCombinatoricFunctions(Integer)::EXPRR _
* (x::EXPRR)**i*D(f, x, i) for i in 1..l]
reduce(_+, s)
ShiftA(k: NNI, l: NNI, f: SUP S): S ==
ShiftAction(k, l, f)$FFFG(S, SUP S)
ShiftAF(k: NNI, l: NNI, f: UFPSSUPF): SUP F ==
ShiftAction(k, l, f)$FFFG(SUP F, UFPSSUPF)
ShiftC(total: NNI): List S ==
ShiftC(total)$FFFG(S, SUP S)
shiftHP options ==
partitions := FilteredPartitionStream options
if displayAsGF(options)$GOPT0 then
if maxPower(options)$GOPT0 = 1 then
[ADEguessStream(#1, partitions, ShiftSS, _
(1-monomial(1,1))**(-1)),_
ADEdegreeStream partitions, _
ADEtestStream(#1, partitions, ShiftSF, _
(1-monomial(1,1))**(-1)), _
ADEEXPRRStream(#1, #2, partitions, ShiftSXGF, _
1/(1-#1::EXPRR)), _
ShiftA, ShiftAF, ShiftAXGF, ShiftC]$HPSPEC
else
error _
"Guess: no support for the Shift operator with displayAsGF _
and maxPower>1"
else
[ADEguessStream2(#1,partitions,ShiftSS,(1-monomial(1,1))**(-1)),_
ADEdegreeStream partitions, _
ADEtestStream2(#1,partitions,ShiftSF,(1-monomial(1,1))**(-1)), _
ADEEXPRRStream(#1, #2, partitions, ShiftSX, diff1X), _
ShiftA, ShiftAF, ShiftAX, ShiftC]$HPSPEC
if F has RetractableTo Symbol and S has RetractableTo Symbol then
qShiftAX(q: Symbol, l: NNI, n: Symbol, f: EXPRR): EXPRR ==
(q::EXPRR)**(l*n::EXPRR) * f
qShiftA(q: Symbol, k: NNI, l: NNI, f: SUP S): S ==
qShiftAction(q::S, k, l, f)$FFFG(S, SUP S)
qShiftAF(q: Symbol, k: NNI, l: NNI, f: UFPSSUPF): SUP F ==
qShiftAction(q::F::SUP(F), k, l, f)$FFFG(SUP F, UFPSSUPF)
qShiftC(q: Symbol, total: NNI): List S ==
qShiftC(q::S, total)$FFFG(S, SUP S)
shiftHP(q: Symbol): (LGOPT -> HPSPEC) ==
partitions := FilteredPartitionStream #1
if displayAsGF(#1)$GOPT0 then
error _
"Guess: no support for the qShift operator with displayAsGF"
else
[ADEguessStream2(#1, partitions, ShiftSS, _
(1-monomial(1,1))**(-1)), _
ADEdegreeStream partitions, _
ADEtestStream2(#1, partitions, ShiftSF, _
(1-monomial(1,1))**(-1)), _
ADEEXPRRStream(#1, #2, partitions, ShiftSX, diff1X), _
qShiftA(q, #1, #2, #3), qShiftAF(q, #1, #2, #3), _
qShiftAX(q, #1, #2, #3), qShiftC(q, #1)]$HPSPEC
makeEXPRR(DAX: DIFFSPECAX, x: Symbol, p: SUP F, expr: EXPRR): EXPRR ==
if zero? p then 0$EXPRR
else
coerce(leadingCoefficient p)::EXPRR * DAX(degree p, x, expr) _
+ makeEXPRR(DAX, x, reductum p, expr)
list2UFPSF(list: List F): UFPSF == series(list::Stream F)$UFPSF
list2UFPSSUPF(list: List F): UFPSSUPF ==
l := [e::SUP(F) for e in list for i in 0..]::Stream SUP F
series(l)$UFPSSUPF + monomial(monomial(1,1)$SUP(F), #list)$UFPSSUPF
SUPF2SUPSUPF(p: SUP F): SUP SUP F ==
map(#1::SUP F, p)$SparseUnivariatePolynomialFunctions2(F, SUP F)
UFPSF2SUPF(f: UFPSF, deg: NNI): SUP F ==
makeSUP univariatePolynomial(f, deg)
getListSUPF(s: Stream UFPSF, o: NNI, deg: NNI): List SUP F ==
map(UFPSF2SUPF(#1, deg), entries complete first(s, o))
$ListFunctions2(UFPSF, SUP F)
S2EXPRR(s: S): EXPRR ==
if F is S then
coerce(s pretend F)@EXPRR
else if F is Fraction S then
coerce(s::Fraction(S))@EXPRR
else error "Type parameter F should be either equal to S or equal _
to Fraction S"
guessInterpolate(guessList: List SUP F, eta: List NNI, D: HPSPEC)
: Matrix SUP S ==
if F is S then
vguessList:Vector SUP S := vector(guessList pretend List(SUP(S)))
generalInterpolation((D.C)(reduce(_+, eta)), D.A,
vguessList, eta)$FFFG(S, SUP S)
else if F is Fraction S then
vguessListF: Vector SUP F := vector(guessList)
generalInterpolation((D.C)(reduce(_+, eta)), D.A,
vguessListF, eta)$FFFGF(S, SUP S, SUP F)
else error "Type parameter F should be either equal to S or equal _
to Fraction S"
guessInterpolate2(guessList: List SUP F,
sumEta: NNI, maxEta: NNI,
D: HPSPEC): Stream Matrix SUP S ==
if F is S then
vguessList:Vector SUP S := vector(guessList pretend List(SUP(S)))
generalInterpolation((D.C)(sumEta), D.A,
vguessList, sumEta, maxEta)
$FFFG(S, SUP S)
else if F is Fraction S then
vguessListF: Vector SUP F := vector(guessList)
generalInterpolation((D.C)(sumEta), D.A,
vguessListF, sumEta, maxEta)
$FFFGF(S, SUP S, SUP F)
else error "Type parameter F should be either equal to S or equal _
to Fraction S"
testInterpolant(resi: List SUP S,
list: List F,
testList: List UFPSSUPF,
exprList: List EXPRR,
initials: List EXPRR,
guessDegree: NNI,
D: HPSPEC,
dummy: Symbol, op: BasicOperator, options: LGOPT)
: Union("failed", Record(function: EXPRR, order: NNI)) ==
--tpd: maxDegree is defined to be nonnegative
-- ((maxDegree(options)$GOPT0 = -1) and
((allDegrees(options)$GOPT0 = false) and
zero?(last resi))
=> return "failed"
nonZeroCoefficient: Integer := 0
for i in 1..#resi repeat
if not zero? resi.i then
if zero? nonZeroCoefficient then
nonZeroCoefficient := i
else
nonZeroCoefficient := 0
break
if not zero? nonZeroCoefficient then
(freeOf?(exprList.nonZeroCoefficient, name op)) => return "failed"
for e in list repeat
if not zero? e then return "failed"
else
resiSUPF := map(SUPF2SUPSUPF SUPS2SUPF #1, resi)
$ListFunctions2(SUP S, SUP SUP F)
iterate? := true;
for d in guessDegree+1.. repeat
c: SUP F := generalCoefficient(D.AF, vector testList,
d, vector resiSUPF)
$FFFG(SUP F, UFPSSUPF)
if not zero? c then
iterate? := ground? c
break
iterate? => return "failed"
g: SUP S
if S has Field
then g := _
leadingCoefficient(find(not zero? #1, reverse resi)::SUP(S))::SUP(S)
else g := gcd resi
resiF := map(SUPS2SUPF((#1 exquo g)::SUP(S)), resi)
$ListFunctions2(SUP S, SUP F)
if debug(options)$GOPT0 then
output(hconcat("trying possible solution ", resiF::OutputForm))
$OutputPackage
-- transform each term into an expression
ex: List EXPRR := [makeEXPRR(D.AX, dummy, p, e) _
for p in resiF for e in exprList]
-- transform the list of expressions into a sum of expressions
res: EXPRR
if displayAsGF(options)$GOPT0 then
res := evalADE(op, dummy, variableName(options)$GOPT0::EXPRR,
indexName(options)$GOPT0::EXPRR,
numerator reduce(_+, ex),
reverse initials)
$RecurrenceOperator(Integer, EXPRR)
ord: NNI := 0
-- FIXME: checkResult doesn't really work yet for generating functions
else
res := evalRec(op, dummy, indexName(options)$GOPT0::EXPRR,
indexName(options)$GOPT0::EXPRR,
numerator reduce(_+, ex),
reverse initials)
$RecurrenceOperator(Integer, EXPRR)
ord: NNI := checkResult(res, indexName(options)$GOPT0, _
#list, list, options)
[res, ord]$Record(function: EXPRR, order: NNI)
guessHPaux(list: List F, D: HPSPEC, options: LGOPT): GUESSRESULT ==
reslist: GUESSRESULT := []
listDegree := #list-1-safety(options)$GOPT0
if listDegree < 0 then return reslist
a := functionName(options)$GOPT0
op := operator a
x := variableName(options)$GOPT0
dummy := new$Symbol
initials: List EXPRR := [coerce(e)@EXPRR for e in list]
guessS := (D.guessStream)(list2UFPSF list)
degreeS := D.degreeStream
testS := (D.testStream)(list2UFPSSUPF list)
exprS := (D.exprStream)(op(dummy::EXPRR)::EXPRR, dummy)
iterate?: Boolean := false -- this is necessary because the compiler
-- doesn't understand => "iterate" properly
-- the latter just leaves the current block, it
-- seems
for o in 2.. repeat
empty? rest(guessS, (o-1)::NNI) => break
guessDegree: Integer := listDegree-(degreeS.o)::Integer
guessDegree < 0 => break
if debug(options)$GOPT0 then
output(hconcat("Trying order ", o::OutputForm))$OutputPackage
output(hconcat("guessDegree is ", guessDegree::OutputForm))
$OutputPackage
if allDegrees(options)$GOPT0 then
(o > guessDegree+2) => return reslist
--tpd: force NNI and Integer
maxEta: Integer := 1+maxDegree(options)$GOPT0::NNI::Integer
if maxEta = 0
then maxEta := guessDegree+1
else
maxParams := divide(guessDegree::NNI+1, o)
if debug(options)$GOPT0
then output(hconcat("maxParams: ", maxParams::OutputForm))
$OutputPackage
if maxParams.quotient = 0 and maxParams.remainder < o-1
then return reslist
--tpd: maxDegree is defined to be nonnegative
-- if ((maxDegree(options)$GOPT0 ~= -1) and
if ((maxDegree(options)$GOPT0::NNI::Integer < _
maxParams.quotient)) and
not (empty? rest(guessS, o) or
((newGuessDegree:=listDegree-(degreeS.(o+1))::Integer)
< 0) or
(((newMaxParams:=divide(newGuessDegree::NNI+1,o+1))
.quotient = 0) and
(newMaxParams.remainder < o)))
then iterate? := true
--tpd:maxDegree is defined to be nonnegative
-- else if ((maxDegree(options)$GOPT0 ~= -1) and
if (maxParams.quotient > _
maxDegree(options)$GOPT0::NNI::Integer)
then
--tpd:maxDegree is defined to be nonnegative
guessDegree := _
o*(1+maxDegree(options)$GOPT0::NNI::Integer)-2
eta: List NNI
:= [(if i < o _
then maxDegree(options)$GOPT0::NNI + 1 _
else maxDegree(options)$GOPT0::NNI) _
for i in 1..o]
else eta: List NNI
:= [(if i <= maxParams.remainder _
then maxParams.quotient + 1 _
else maxParams.quotient)::NNI for i in 1..o]
if iterate?
then
iterate? := false
if debug(options)$GOPT0 then _
output("iterating")$OutputPackage
else
guessList:List SUP F:=getListSUPF(guessS,o,guessDegree::NNI)
testList: List UFPSSUPF := entries complete first(testS, o)
exprList: List EXPRR := entries complete first(exprS, o)
if debug(options)$GOPT0 then
output("The list of expressions is")$OutputPackage
output(exprList::OutputForm)$OutputPackage
if allDegrees(options)$GOPT0 then
MS: Stream Matrix SUP S := guessInterpolate2(guessList,
guessDegree::NNI+1,
maxEta::NNI, D)
repeat
(empty? MS) => break
M := first MS
for i in 1..o repeat
res := testInterpolant(entries column(M, i),
list,
testList,
exprList,
initials,
guessDegree::NNI,
D, dummy, op, options)
(res case "failed") => "iterate"
if not member?(res, reslist)
then reslist := cons(res, reslist)
if one(options)$GOPT0 then return reslist
MS := rest MS
else
M: Matrix SUP S := guessInterpolate(guessList, eta, D)
for i in 1..o repeat
res := testInterpolant(entries column(M, i),
list,
testList,
exprList,
initials,
guessDegree::NNI,
D, dummy, op, options)
(res case "failed") => "iterate"
if not member?(res, reslist)
then reslist := cons(res, reslist)
if one(options)$GOPT0 then return reslist
reslist
guessHP(D: LGOPT -> HPSPEC): GUESSER == guessHPaux(#1, D #2, #2)
--tpd comment out the call to displayAsGF. it won't type check
guessADE(list: List F, options: LGOPT): GUESSRESULT ==
opts := options
guessHPaux(list, diffHP opts, opts)
guessADE(list: List F): GUESSRESULT == guessADE(list, [])
guessAlg(list: List F, options: LGOPT) ==
guessADE(list, cons(maxDerivative(0)$GuessOption, options))
guessAlg(list: List F): GUESSRESULT == guessAlg(list, [])
guessHolo(list: List F, options: LGOPT): GUESSRESULT ==
guessADE(list, cons(maxPower(1)$GuessOption, options))
guessHolo(list: List F): GUESSRESULT == guessHolo(list, [])
guessPade(list: List F, options: LGOPT): GUESSRESULT ==
opts := append(options, [maxDerivative(0)$GuessOption,
maxPower(1)$GuessOption,
allDegrees(true)$GuessOption])
guessADE(list, opts)
guessPade(list: List F): GUESSRESULT == guessPade(list, [])
if F has RetractableTo Symbol and S has RetractableTo Symbol then
--tpd comment out the call to displayAsGF. it won't type check
guessADE(q: Symbol): GUESSER ==
opts := #2
guessHPaux(#1, (diffHP q)(opts), opts)
--tpd comment out the call to displayAsGF. it won't type check
guessRec(list: List F, options: LGOPT): GUESSRESULT ==
opts := options
guessHPaux(list, shiftHP opts, opts)
guessRec(list: List F): GUESSRESULT == guessRec(list, [])
guessPRec(list: List F, options: LGOPT): GUESSRESULT ==
guessRec(list, cons(maxPower(1)$GuessOption, options))
guessPRec(list: List F): GUESSRESULT == guessPRec(list, [])
guessRat(list: List F, options: LGOPT): GUESSRESULT ==
opts := append(options, [maxShift(0)$GuessOption,
maxPower(1)$GuessOption,
allDegrees(true)$GuessOption])
guessRec(list, opts)
guessRat(list: List F): GUESSRESULT == guessRat(list, [])
if F has RetractableTo Symbol and S has RetractableTo Symbol then
guessRec(q: Symbol): GUESSER ==
opts := #2
guessHPaux(#1, (shiftHP q)(opts), opts)
--tpd comment out the call to displayAsGF. it won't type check
guessPRec(q: Symbol): GUESSER ==
opts := #2
guessHPaux(#1, (shiftHP q)(opts), opts)
opts := #2
guessHPaux(#1, (shiftHP q)(opts), opts)
guess(list: List F, guessers: List GUESSER, ops: List Symbol,
options: LGOPT): GUESSRESULT ==
maxLevel := maxLevel(options)$GOPT0
xx := indexName(options)$GOPT0
if debug(options)$GOPT0 then
output(hconcat("guessing level ", maxLevel::OutputForm))
$OutputPackage
output(hconcat("guessing ", list::OutputForm))$OutputPackage
res: GUESSRESULT := []
len := #list :: PositiveInteger
if len <= 1 then return res
for guesser in guessers repeat
res := append(guesser(list, options), res)
if debug(options)$GOPT0 then
output(hconcat("res ", res::OutputForm))$OutputPackage
if one(options)$GOPT0 and not empty? res then return res
if (maxLevel = 0) then return res
if member?('guessProduct, ops) and not member?(0$F, list) then
prodList: List F := [(list.(i+1))/(list.i) for i in 1..(len-1)]
-- tpd: maxLevel is NNI
if not every?(one?, prodList) then
var: Symbol := subscript('p, [len::OutputForm])
prodGuess :=
[[coerce(list.(guess.order+1))
* product(guess.function, _
equation(var, _
(guess.order)::EXPRR..xx::EXPRR-1)), _
guess.order] _
for guess in guess(prodList, guessers, ops, options)$%]
if debug(options)$GOPT0 then
output(hconcat("prodGuess "::OutputForm,
prodGuess::OutputForm))
$OutputPackage
for guess in prodGuess
| not any?(guess.function = #1.function, res) repeat
res := cons(guess, res)
if one(options)$GOPT0 and not empty? res then return res
if member?('guessSum, ops) then
sumList: List F := [(list.(i+1))-(list.i) for i in 1..(len-1)]
-- tpd:maxLevel is NNI
if not every?(#1=sumList.1, sumList) then
var: Symbol := subscript('s, [len::OutputForm])
sumGuess :=
[[coerce(list.(guess.order+1)) _
+ summation(guess.function, _
equation(var, _
(guess.order)::EXPRR..xx::EXPRR-1)),_
guess.order] _
for guess in guess(sumList, guessers, ops, options)$%]
for guess in sumGuess
| not any?(guess.function = #1.function, res) repeat
res := cons(guess, res)
res
guess(list: List F): GUESSRESULT ==
guess(list, [guessADE$%, guessRec$%], ['guessProduct, 'guessSum], [])
guess(list: List F, options: LGOPT): GUESSRESULT ==
guess(list, [guessADE$%, guessRat$%], ['guessProduct, 'guessSum],
options)
guess(list: List F, guessers: List GUESSER, ops: List Symbol)
: GUESSRESULT ==
guess(list, guessers, ops, [])
|