Appeal: Sample Workings to Augment an Earlier Submitted Assignment

On my last submission for this Neville's Method question, I lost marks because I only handed in the final answer with no working shown — there was nothing to check my process against. This page accompanies that submission with the full working, computed live rather than typed by hand, using the exact recurrence we covered in class:

Q[i, 0] = f(x_i)

Q[i, j] = ((x_target - x[i-j]) * Q[i, j-1] - (x_target - x[i]) * Q[i-1, j-1])
          / (x[i] - x[i-j])

Defaults below are the assignment's own data (x = 1.0 to 2.5, target x = 1.5, expected result f(1.5) = 0.5118276664). Every working can be checked two ways: directly on this page — the table and every substituted calculation below — or independently, using the CSV and Python downloads next to the result.

Download and check independently

  • CSV — not just a transcript: alongside the finished value, each row also has the recurrence's five numeric inputs in their own columns. Open it in Excel, build the formula yourself in a spare column from those columns, and confirm it matches — a ready-to-test solution, not only something to read.
  • Python source (neville.py) — the real code that produced every number above, not hand-typed workings. It needs only numpy and nothing else from this project, so it can be downloaded on its own and run/validated on any other machine: pip install numpy then python neville.py reproduces the table above from scratch.
neville .py 11.2 KB ⇣

Complete recursive table