Knowledge (XXG)

Predictor–corrector method

Source 📝

1565: 1133: 1122: 826: 1560:{\displaystyle {\begin{aligned}{\tilde {y}}_{i+1}&=y_{i}+hf(t_{i},y_{i}),\\{\hat {y}}_{i+1}&=y_{i}+{\tfrac {1}{2}}h{\bigl (}f(t_{i},y_{i})+f(t_{i+1},{\tilde {y}}_{i+1}){\bigr )},\\y_{i+1}&=y_{i}+{\tfrac {1}{2}}h{\bigl (}f(t_{i},y_{i})+f(t_{i+1},{\hat {y}}_{i+1}){\bigr )}.\end{aligned}}} 841: 563: 543: 1117:{\displaystyle {\begin{aligned}{\tilde {y}}_{i+1}&=y_{i}+hf(t_{i},{\tilde {y}}_{i}),\\y_{i+1}&=y_{i}+{\tfrac {1}{2}}h{\bigl (}f(t_{i},{\tilde {y}}_{i})+f(t_{i+1},{\tilde {y}}_{i+1}){\bigr )}.\end{aligned}}} 556:
There are different variants of a predictor–corrector method, depending on how often the corrector method is applied. The Predict–Evaluate–Correct–Evaluate (PECE) mode refers to the variant in the above example:
32:
The initial, "prediction" step, starts from a function fitted to the function-values and derivative-values at a preceding set of points to extrapolate ("anticipate") this function's value at a subsequent, new
368: 1127:
Additionally, the corrector step can be repeated in the hope that this achieves an even better approximation to the true solution. If the corrector method is run twice, this yields the PECECE mode:
174: 1138: 846: 568: 821:{\displaystyle {\begin{aligned}{\tilde {y}}_{i+1}&=y_{i}+hf(t_{i},y_{i}),\\y_{i+1}&=y_{i}+{\tfrac {1}{2}}h{\bigl (}f(t_{i},y_{i})+f(t_{i+1},{\tilde {y}}_{i+1}){\bigr )}.\end{aligned}}} 28:
designed to integrate ordinary differential equations – to find an unknown function that satisfies a given differential equation. All such algorithms proceed in two steps:
379: 1847: 1794: 1761: 1753: 58: 269: 1744: 227: 197: 1812: 82: 1601: 1681: 1658: 1737: 1716: 1577:
times, the method is in P(EC) or P(EC)E mode. If the corrector method is iterated until it converges, this could be called PE(CE).
1880: 1586: 1865: 277: 1730: 62: 1932: 94: 1779: 1890: 1784: 1860: 538:{\displaystyle y_{i+1}=y_{i}+{\tfrac {1}{2}}h{\bigl (}f(t_{i},y_{i})+f(t_{i+1},{\tilde {y}}_{i+1}){\bigr )}.} 1870: 1875: 1855: 1606: 1906: 1774: 1722: 232: 1817: 1591: 1885: 1837: 1650: 1927: 1832: 1802: 17: 1702: 1699: 1677: 1654: 1827: 1596: 74: 205: 1822: 1807: 1642: 182: 1921: 1769: 1669: 78: 835:
only once per step by using the method in Predict–Evaluate–Correct (PEC) mode:
1707: 373:
Next, the corrector step: improve the initial guess using trapezoidal rule,
25: 36:
The next, "corrector" step refines the initial approximation by using the
1670:"Section 17.6. Multistep, Multivalue, and Predictor-Corrector Methods" 65:
for the predictor step and an implicit method for the corrector step.
1570:
The PECEC mode has one fewer function evaluation than PECECE mode.
1726: 1668:
Press, WH; Teukolsky, SA; Vetterling, WT; Flannery, BP (2007).
59:
numerical solution of ordinary differential equations (ODEs)
202:
First, the predictor step: starting from the current value
363:{\displaystyle {\tilde {y}}_{i+1}=y_{i}+hf(t_{i},y_{i}).} 1676:(3rd ed.). New York: Cambridge University Press. 1434: 1274: 982: 695: 416: 1754:
Numerical methods for ordinary differential equations
1647:
Numerical Methods for Ordinary Differential Equations
1136: 844: 566: 382: 280: 235: 208: 185: 97: 44:
to interpolate that unknown function's value at the
1899: 1846: 1793: 1760: 1674:Numerical Recipes: The Art of Scientific Computing 1559: 1116: 820: 537: 362: 263: 221: 191: 168: 61:, a predictor–corrector method typically uses an 169:{\displaystyle y'=f(t,y),\quad y(t_{0})=y_{0},} 69:Example: Euler method with the trapezoidal rule 73:A simple predictor–corrector method (known as 1738: 1545: 1450: 1385: 1290: 1102: 998: 831:It is also possible to evaluate the function 806: 711: 527: 432: 8: 53:Predictor–corrector methods for solving ODEs 1745: 1731: 1723: 1544: 1543: 1528: 1517: 1516: 1500: 1478: 1465: 1449: 1448: 1433: 1424: 1401: 1384: 1383: 1368: 1357: 1356: 1340: 1318: 1305: 1289: 1288: 1273: 1264: 1241: 1230: 1229: 1212: 1199: 1177: 1154: 1143: 1142: 1137: 1135: 1101: 1100: 1085: 1074: 1073: 1057: 1035: 1024: 1023: 1013: 997: 996: 981: 972: 949: 929: 918: 917: 907: 885: 862: 851: 850: 845: 843: 805: 804: 789: 778: 777: 761: 739: 726: 710: 709: 694: 685: 662: 642: 629: 607: 584: 573: 572: 567: 565: 526: 525: 510: 499: 498: 482: 460: 447: 431: 430: 415: 406: 387: 381: 348: 335: 313: 294: 283: 282: 279: 249: 238: 237: 234: 213: 207: 184: 157: 141: 96: 1573:More generally, if the corrector is run 1625: 1618: 548:That value is used as the next step. 7: 1602:Mehrotra predictor–corrector method 229:, calculate an initial guess value 88:Consider the differential equation 264:{\displaystyle {\tilde {y}}_{i+1}} 14: 1881:Backward differentiation formula 1587:Backward differentiation formula 130: 1540: 1522: 1493: 1484: 1458: 1380: 1362: 1333: 1324: 1298: 1235: 1218: 1192: 1148: 1097: 1079: 1050: 1041: 1029: 1006: 935: 923: 900: 856: 801: 783: 754: 745: 719: 648: 622: 578: 522: 504: 475: 466: 440: 354: 328: 288: 243: 147: 134: 124: 112: 77:) can be constructed from the 1: 1703:"Predictor-Corrector Methods" 81:(an explicit method) and the 179:and denote the step size by 1866:List of Runge–Kutta methods 1717:Predictor–corrector methods 22:predictor–corrector methods 1949: 1719:for differential equations 40:value of the function and 1871:Linear multistep method 1876:General linear methods 1856:Exponential integrator 1607:Numerical continuation 1561: 1118: 822: 552:PEC mode and PECE mode 539: 364: 271:via the Euler method, 265: 223: 193: 170: 85:(an implicit method). 1907:Symplectic integrator 1891:Gauss–Legendre method 1651:John Wiley & Sons 1562: 1119: 823: 540: 365: 266: 224: 222:{\displaystyle y_{i}} 194: 171: 57:When considering the 24:belong to a class of 1848:Higher-order methods 1838:Leapfrog integration 1795:Second-order methods 1134: 842: 564: 380: 278: 233: 206: 183: 95: 1861:Runge–Kutta methods 1833:Newmark-beta method 1780:Semi-implicit Euler 1762:First-order methods 1933:Numerical analysis 1818:Beeman's algorithm 1803:Verlet integration 1700:Weisstein, Eric W. 1592:Beeman's algorithm 1557: 1555: 1443: 1283: 1114: 1112: 991: 818: 816: 704: 535: 425: 360: 261: 219: 189: 166: 18:numerical analysis 1915: 1914: 1785:Exponential Euler 1683:978-0-521-88068-8 1660:978-0-471-96758-3 1525: 1442: 1365: 1282: 1238: 1151: 1082: 1032: 990: 926: 859: 786: 703: 581: 507: 424: 291: 246: 192:{\displaystyle h} 48:subsequent point. 1940: 1813:Trapezoidal rule 1747: 1740: 1733: 1724: 1713: 1712: 1687: 1663: 1643:Butcher, John C. 1629: 1623: 1566: 1564: 1563: 1558: 1556: 1549: 1548: 1539: 1538: 1527: 1526: 1518: 1511: 1510: 1483: 1482: 1470: 1469: 1454: 1453: 1444: 1435: 1429: 1428: 1412: 1411: 1389: 1388: 1379: 1378: 1367: 1366: 1358: 1351: 1350: 1323: 1322: 1310: 1309: 1294: 1293: 1284: 1275: 1269: 1268: 1252: 1251: 1240: 1239: 1231: 1217: 1216: 1204: 1203: 1182: 1181: 1165: 1164: 1153: 1152: 1144: 1123: 1121: 1120: 1115: 1113: 1106: 1105: 1096: 1095: 1084: 1083: 1075: 1068: 1067: 1040: 1039: 1034: 1033: 1025: 1018: 1017: 1002: 1001: 992: 983: 977: 976: 960: 959: 934: 933: 928: 927: 919: 912: 911: 890: 889: 873: 872: 861: 860: 852: 827: 825: 824: 819: 817: 810: 809: 800: 799: 788: 787: 779: 772: 771: 744: 743: 731: 730: 715: 714: 705: 696: 690: 689: 673: 672: 647: 646: 634: 633: 612: 611: 595: 594: 583: 582: 574: 544: 542: 541: 536: 531: 530: 521: 520: 509: 508: 500: 493: 492: 465: 464: 452: 451: 436: 435: 426: 417: 411: 410: 398: 397: 369: 367: 366: 361: 353: 352: 340: 339: 318: 317: 305: 304: 293: 292: 284: 270: 268: 267: 262: 260: 259: 248: 247: 239: 228: 226: 225: 220: 218: 217: 198: 196: 195: 190: 175: 173: 172: 167: 162: 161: 146: 145: 105: 83:trapezoidal rule 1948: 1947: 1943: 1942: 1941: 1939: 1938: 1937: 1918: 1917: 1916: 1911: 1895: 1842: 1823:Midpoint method 1808:Velocity Verlet 1789: 1756: 1751: 1698: 1697: 1694: 1684: 1667: 1661: 1641: 1638: 1633: 1632: 1624: 1620: 1615: 1583: 1554: 1553: 1515: 1496: 1474: 1461: 1420: 1413: 1397: 1394: 1393: 1355: 1336: 1314: 1301: 1260: 1253: 1228: 1225: 1224: 1208: 1195: 1173: 1166: 1141: 1132: 1131: 1111: 1110: 1072: 1053: 1022: 1009: 968: 961: 945: 942: 941: 916: 903: 881: 874: 849: 840: 839: 815: 814: 776: 757: 735: 722: 681: 674: 658: 655: 654: 638: 625: 603: 596: 571: 562: 561: 554: 497: 478: 456: 443: 402: 383: 378: 377: 344: 331: 309: 281: 276: 275: 236: 231: 230: 209: 204: 203: 181: 180: 153: 137: 98: 93: 92: 71: 63:explicit method 55: 12: 11: 5: 1946: 1944: 1936: 1935: 1930: 1920: 1919: 1913: 1912: 1910: 1909: 1903: 1901: 1897: 1896: 1894: 1893: 1888: 1883: 1878: 1873: 1868: 1863: 1858: 1852: 1850: 1844: 1843: 1841: 1840: 1835: 1830: 1825: 1820: 1815: 1810: 1805: 1799: 1797: 1791: 1790: 1788: 1787: 1782: 1777: 1775:Backward Euler 1772: 1766: 1764: 1758: 1757: 1752: 1750: 1749: 1742: 1735: 1727: 1721: 1720: 1714: 1693: 1692:External links 1690: 1689: 1688: 1682: 1665: 1659: 1637: 1634: 1631: 1630: 1617: 1616: 1614: 1611: 1610: 1609: 1604: 1599: 1594: 1589: 1582: 1579: 1568: 1567: 1552: 1547: 1542: 1537: 1534: 1531: 1524: 1521: 1514: 1509: 1506: 1503: 1499: 1495: 1492: 1489: 1486: 1481: 1477: 1473: 1468: 1464: 1460: 1457: 1452: 1447: 1441: 1438: 1432: 1427: 1423: 1419: 1416: 1414: 1410: 1407: 1404: 1400: 1396: 1395: 1392: 1387: 1382: 1377: 1374: 1371: 1364: 1361: 1354: 1349: 1346: 1343: 1339: 1335: 1332: 1329: 1326: 1321: 1317: 1313: 1308: 1304: 1300: 1297: 1292: 1287: 1281: 1278: 1272: 1267: 1263: 1259: 1256: 1254: 1250: 1247: 1244: 1237: 1234: 1227: 1226: 1223: 1220: 1215: 1211: 1207: 1202: 1198: 1194: 1191: 1188: 1185: 1180: 1176: 1172: 1169: 1167: 1163: 1160: 1157: 1150: 1147: 1140: 1139: 1125: 1124: 1109: 1104: 1099: 1094: 1091: 1088: 1081: 1078: 1071: 1066: 1063: 1060: 1056: 1052: 1049: 1046: 1043: 1038: 1031: 1028: 1021: 1016: 1012: 1008: 1005: 1000: 995: 989: 986: 980: 975: 971: 967: 964: 962: 958: 955: 952: 948: 944: 943: 940: 937: 932: 925: 922: 915: 910: 906: 902: 899: 896: 893: 888: 884: 880: 877: 875: 871: 868: 865: 858: 855: 848: 847: 829: 828: 813: 808: 803: 798: 795: 792: 785: 782: 775: 770: 767: 764: 760: 756: 753: 750: 747: 742: 738: 734: 729: 725: 721: 718: 713: 708: 702: 699: 693: 688: 684: 680: 677: 675: 671: 668: 665: 661: 657: 656: 653: 650: 645: 641: 637: 632: 628: 624: 621: 618: 615: 610: 606: 602: 599: 597: 593: 590: 587: 580: 577: 570: 569: 553: 550: 546: 545: 534: 529: 524: 519: 516: 513: 506: 503: 496: 491: 488: 485: 481: 477: 474: 471: 468: 463: 459: 455: 450: 446: 442: 439: 434: 429: 423: 420: 414: 409: 405: 401: 396: 393: 390: 386: 371: 370: 359: 356: 351: 347: 343: 338: 334: 330: 327: 324: 321: 316: 312: 308: 303: 300: 297: 290: 287: 258: 255: 252: 245: 242: 216: 212: 188: 177: 176: 165: 160: 156: 152: 149: 144: 140: 136: 133: 129: 126: 123: 120: 117: 114: 111: 108: 104: 101: 70: 67: 54: 51: 50: 49: 42:another method 34: 13: 10: 9: 6: 4: 3: 2: 1945: 1934: 1931: 1929: 1926: 1925: 1923: 1908: 1905: 1904: 1902: 1898: 1892: 1889: 1887: 1884: 1882: 1879: 1877: 1874: 1872: 1869: 1867: 1864: 1862: 1859: 1857: 1854: 1853: 1851: 1849: 1845: 1839: 1836: 1834: 1831: 1829: 1828:Heun's method 1826: 1824: 1821: 1819: 1816: 1814: 1811: 1809: 1806: 1804: 1801: 1800: 1798: 1796: 1792: 1786: 1783: 1781: 1778: 1776: 1773: 1771: 1768: 1767: 1765: 1763: 1759: 1755: 1748: 1743: 1741: 1736: 1734: 1729: 1728: 1725: 1718: 1715: 1710: 1709: 1704: 1701: 1696: 1695: 1691: 1685: 1679: 1675: 1671: 1666: 1662: 1656: 1652: 1648: 1644: 1640: 1639: 1635: 1628:, p. 104 1627: 1622: 1619: 1612: 1608: 1605: 1603: 1600: 1598: 1597:Heun's method 1595: 1593: 1590: 1588: 1585: 1584: 1580: 1578: 1576: 1571: 1550: 1535: 1532: 1529: 1519: 1512: 1507: 1504: 1501: 1497: 1490: 1487: 1479: 1475: 1471: 1466: 1462: 1455: 1445: 1439: 1436: 1430: 1425: 1421: 1417: 1415: 1408: 1405: 1402: 1398: 1390: 1375: 1372: 1369: 1359: 1352: 1347: 1344: 1341: 1337: 1330: 1327: 1319: 1315: 1311: 1306: 1302: 1295: 1285: 1279: 1276: 1270: 1265: 1261: 1257: 1255: 1248: 1245: 1242: 1232: 1221: 1213: 1209: 1205: 1200: 1196: 1189: 1186: 1183: 1178: 1174: 1170: 1168: 1161: 1158: 1155: 1145: 1130: 1129: 1128: 1107: 1092: 1089: 1086: 1076: 1069: 1064: 1061: 1058: 1054: 1047: 1044: 1036: 1026: 1019: 1014: 1010: 1003: 993: 987: 984: 978: 973: 969: 965: 963: 956: 953: 950: 946: 938: 930: 920: 913: 908: 904: 897: 894: 891: 886: 882: 878: 876: 869: 866: 863: 853: 838: 837: 836: 834: 811: 796: 793: 790: 780: 773: 768: 765: 762: 758: 751: 748: 740: 736: 732: 727: 723: 716: 706: 700: 697: 691: 686: 682: 678: 676: 669: 666: 663: 659: 651: 643: 639: 635: 630: 626: 619: 616: 613: 608: 604: 600: 598: 591: 588: 585: 575: 560: 559: 558: 551: 549: 532: 517: 514: 511: 501: 494: 489: 486: 483: 479: 472: 469: 461: 457: 453: 448: 444: 437: 427: 421: 418: 412: 407: 403: 399: 394: 391: 388: 384: 376: 375: 374: 357: 349: 345: 341: 336: 332: 325: 322: 319: 314: 310: 306: 301: 298: 295: 285: 274: 273: 272: 256: 253: 250: 240: 214: 210: 200: 186: 163: 158: 154: 150: 142: 138: 131: 127: 121: 118: 115: 109: 106: 102: 99: 91: 90: 89: 86: 84: 80: 76: 75:Heun's method 68: 66: 64: 60: 52: 47: 43: 39: 35: 31: 30: 29: 27: 23: 19: 1770:Euler method 1706: 1673: 1649:, New York: 1646: 1626:Butcher 2003 1621: 1574: 1572: 1569: 1126: 832: 830: 555: 547: 372: 201: 178: 87: 79:Euler method 72: 56: 45: 41: 37: 21: 15: 1928:Algorithms 1922:Categories 1636:References 26:algorithms 1708:MathWorld 1523:^ 1363:~ 1236:^ 1149:~ 1080:~ 1030:~ 924:~ 857:~ 784:~ 579:~ 505:~ 289:~ 244:~ 38:predicted 1645:(2003), 1581:See also 103:′ 1886:Yoshida 1900:Theory 1680:  1657:  33:point. 1613:Notes 1678:ISBN 1655:ISBN 46:same 16:In 1924:: 1705:. 1672:. 1653:, 199:. 20:, 1746:e 1739:t 1732:v 1711:. 1686:. 1664:. 1575:k 1551:. 1546:) 1541:) 1536:1 1533:+ 1530:i 1520:y 1513:, 1508:1 1505:+ 1502:i 1498:t 1494:( 1491:f 1488:+ 1485:) 1480:i 1476:y 1472:, 1467:i 1463:t 1459:( 1456:f 1451:( 1446:h 1440:2 1437:1 1431:+ 1426:i 1422:y 1418:= 1409:1 1406:+ 1403:i 1399:y 1391:, 1386:) 1381:) 1376:1 1373:+ 1370:i 1360:y 1353:, 1348:1 1345:+ 1342:i 1338:t 1334:( 1331:f 1328:+ 1325:) 1320:i 1316:y 1312:, 1307:i 1303:t 1299:( 1296:f 1291:( 1286:h 1280:2 1277:1 1271:+ 1266:i 1262:y 1258:= 1249:1 1246:+ 1243:i 1233:y 1222:, 1219:) 1214:i 1210:y 1206:, 1201:i 1197:t 1193:( 1190:f 1187:h 1184:+ 1179:i 1175:y 1171:= 1162:1 1159:+ 1156:i 1146:y 1108:. 1103:) 1098:) 1093:1 1090:+ 1087:i 1077:y 1070:, 1065:1 1062:+ 1059:i 1055:t 1051:( 1048:f 1045:+ 1042:) 1037:i 1027:y 1020:, 1015:i 1011:t 1007:( 1004:f 999:( 994:h 988:2 985:1 979:+ 974:i 970:y 966:= 957:1 954:+ 951:i 947:y 939:, 936:) 931:i 921:y 914:, 909:i 905:t 901:( 898:f 895:h 892:+ 887:i 883:y 879:= 870:1 867:+ 864:i 854:y 833:f 812:. 807:) 802:) 797:1 794:+ 791:i 781:y 774:, 769:1 766:+ 763:i 759:t 755:( 752:f 749:+ 746:) 741:i 737:y 733:, 728:i 724:t 720:( 717:f 712:( 707:h 701:2 698:1 692:+ 687:i 683:y 679:= 670:1 667:+ 664:i 660:y 652:, 649:) 644:i 640:y 636:, 631:i 627:t 623:( 620:f 617:h 614:+ 609:i 605:y 601:= 592:1 589:+ 586:i 576:y 533:. 528:) 523:) 518:1 515:+ 512:i 502:y 495:, 490:1 487:+ 484:i 480:t 476:( 473:f 470:+ 467:) 462:i 458:y 454:, 449:i 445:t 441:( 438:f 433:( 428:h 422:2 419:1 413:+ 408:i 404:y 400:= 395:1 392:+ 389:i 385:y 358:. 355:) 350:i 346:y 342:, 337:i 333:t 329:( 326:f 323:h 320:+ 315:i 311:y 307:= 302:1 299:+ 296:i 286:y 257:1 254:+ 251:i 241:y 215:i 211:y 187:h 164:, 159:0 155:y 151:= 148:) 143:0 139:t 135:( 132:y 128:, 125:) 122:y 119:, 116:t 113:( 110:f 107:= 100:y

Index

numerical analysis
algorithms
numerical solution of ordinary differential equations (ODEs)
explicit method
Heun's method
Euler method
trapezoidal rule
Backward differentiation formula
Beeman's algorithm
Heun's method
Mehrotra predictor–corrector method
Numerical continuation
Butcher 2003
Butcher, John C.
John Wiley & Sons
ISBN
978-0-471-96758-3
"Section 17.6. Multistep, Multivalue, and Predictor-Corrector Methods"
ISBN
978-0-521-88068-8
Weisstein, Eric W.
"Predictor-Corrector Methods"
MathWorld
Predictor–corrector methods
v
t
e
Numerical methods for ordinary differential equations
First-order methods
Euler method

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.