Knowledge

Talk:Thiele's interpolation formula

Source 📝

172:¢ The MODE of lx and ly here should really be a UNION of "something REAL" and "something SYMBOLIC" ... ¢ PROC thiele:=(REAL lx,ly, REAL x) REAL: BEGIN REAL xx=lx,yy=ly; INT n=UPB xx; IF UPB yy=n THEN ¢ Assuming that the values of xx are distinct ... ¢ REAL p; p:=yy; FOR i TO n-1 DO p:=(xx-xx)/(p-p) OD; FOR i FROM 2 TO n-1 DO FOR j TO n-i DO p:=(xx-xx)/(p-p)+p OD OD; REAL a:=0; FOR i FROM n-1 BY -1 TO 2 DO a:=(x-xx)/(p-p+a) OD; y+(x-xx)/(p+a) ELSE error ¢ Unequal length arrays supplied ¢ FI END; 84: 74: 53: 22: 157:
The article on Thiele's interpolation formula duplicates the form given in Abramowitz and Stegun's "Handbook of Mathematical Functions" - as does Eric Weisstein's. However, it is not particularly easy to implement, from the description given, even by writing recursively. In the (antique) version of
158:"Maple" to which I have access, there is a good non-recursive working implementation of Thiele's algorithm. (Dognose (as Anthony Burgess wrote it in one novel), I've used it to good effect often enough.) If anyone is interested, I can pass on the code (copyright abuse permitting). 175:
Note that, although it works in most cases, it is sensitive to input values, especially those due to equally spaced abscissæ. (Essentially, in such a case, it reduces to the ratio of two polynomials, which may have factors in common - thus yielding a 0/0 form.)
140: 221: 248: 130: 243: 106: 97: 58: 225: 33: 21: 39: 83: 180: 161: 194: 105:
on Knowledge. If you would like to participate, please visit the project page, where you can join
89: 73: 52: 229: 202: 183: 164: 198: 237: 102: 79: 15: 169:
Here is a version of Thiele interpolation in Algol 68:
101:, a collaborative effort to improve the coverage of 8: 47: 19: 49: 7: 95:This article is within the scope of 222:2001:4643:EBFE:0:A11B:257F:77A1:A7F 38:It is of interest to the following 14: 249:Low-priority mathematics articles 115:Knowledge:WikiProject Mathematics 118:Template:WikiProject Mathematics 82: 72: 51: 20: 244:Stub-Class mathematics articles 135:This article has been rated as 1: 109:and see a list of open tasks. 184:18:00, 1 February 2007 (UTC) 165:20:58, 2 November 2006 (UTC) 265: 230:10:05, 23 March 2016 (UTC) 203:17:43, 27 June 2015 (UTC) 134: 67: 46: 141:project's priority scale 98:WikiProject Mathematics 28:This article is rated 121:mathematics articles 90:Mathematics portal 34:content assessment 155: 154: 151: 150: 147: 146: 256: 123: 122: 119: 116: 113: 92: 87: 86: 76: 69: 68: 63: 55: 48: 31: 25: 24: 16: 264: 263: 259: 258: 257: 255: 254: 253: 234: 233: 220:Not too bad :) 173: 120: 117: 114: 111: 110: 88: 81: 61: 32:on Knowledge's 29: 12: 11: 5: 262: 260: 252: 251: 246: 236: 235: 191:???!? Really? 181:Hair Commodore 171: 162:Hair Commodore 153: 152: 149: 148: 145: 144: 133: 127: 126: 124: 107:the discussion 94: 93: 77: 65: 64: 56: 44: 43: 37: 26: 13: 10: 9: 6: 4: 3: 2: 261: 250: 247: 245: 242: 241: 239: 232: 231: 227: 223: 218: 216:Pascal -: --> 213: 209: 205: 204: 200: 196: 192: 190: 186: 185: 182: 177: 170: 167: 166: 163: 159: 142: 138: 132: 129: 128: 125: 108: 104: 100: 99: 91: 85: 80: 78: 75: 71: 70: 66: 60: 57: 54: 50: 45: 41: 35: 27: 23: 18: 17: 219: 215:Algol -: --> 214: 211:Algol -: --> 210: 207:Algol -: --> 206: 193: 188: 187: 178: 174: 168: 160: 156: 137:Low-priority 136: 96: 62:Low‑priority 40:WikiProjects 112:Mathematics 103:mathematics 59:Mathematics 238:Categories 179:Comments? 30:Stub-class 189:Algol 68 208:Simula 195:Arghman 139:on the 36:scale. 226:talk 212:Ada 199:talk 217:C# 131:Low 240:: 228:) 201:) 224:( 197:( 143:. 42::

Index


content assessment
WikiProjects
WikiProject icon
Mathematics
WikiProject icon
icon
Mathematics portal
WikiProject Mathematics
mathematics
the discussion
Low
project's priority scale
Hair Commodore
20:58, 2 November 2006 (UTC)
Hair Commodore
18:00, 1 February 2007 (UTC)
Arghman
talk
17:43, 27 June 2015 (UTC)
2001:4643:EBFE:0:A11B:257F:77A1:A7F
talk
10:05, 23 March 2016 (UTC)
Categories
Stub-Class mathematics articles
Low-priority mathematics articles

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