Ok, I’ve been missing for a few days…months…almost a year. Ran out of ideas and time for new articles (thanks to the university) so I’ll publish some stuff related to numerical methods, starting with a basic interpolation method using the Lagrange Polynomial. And since there’s a lot of C# here, I thought it would be a good idea, for “programming diversity”, to write this in Matlab/Octave. Forgive me guys :/
The Lagrange Polynomial
This Lagrange Polynomial is a function (curve) that you create, that goes through a specific set of points (the basic interpolation rule).
For N sets of points (x y) the general formula is the one below:
Now a sum of products may look intimidating, but it’s a really simple method - whatever is not needed is cancelled (in this case multiplied with 0) so it won’t change the final result unless it’s necessary.
Don’t worry if you don’t understand the formula, take a look at the example below, it should be way clearer after.
Example & Explanation
Let’s take the… factorial function (x!) and try to write a Lagrange Polynomial that produces “similar” results.
It won’t produce very precise outputs since we gave it a low number of points - don’t expect miracles.
Given this set of 4 points:
We construct the polynomial this way (using Lagrange Multipliers)
Notice that if x is equal to one of the known values (from the table), many of these fractions will be 0 and only one of them will be 1. That 1 is multiplied with the expected output and you get the result.
For x = 2: the equation becomes: 2 * 1 + 6 * 0 + 24 * 0 + 120 * 0 = 2. Got the point? This ensures us that no matter what, the graph of this function will go through our set of points and since this polynomial will have an order <= n-1, there’s no need to worry about any edges.
After creating the polynomial and testing it, we may find out that…we’ll need more than 4 points to obtain a good approximation of the factorial function.
You can see below a plot that contains the Lagrange Polynomial and the values computed with Gamma function(or the correct factorial values).
And this is for inputs inside the interval of known values [2;5] - for values greater than 5 or lower than 2, the function still works but the outputs are completely wrong since there are no points to guide the curve.
Still it provides exact values for 2!, 3!, 4! and 5!
Here goes the code:
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 function [y] = lagrange(x, x0, y0) % x0 - vector containing inputs (x values) % y0 - vector containing outputs (results for these x values % x - value you want to compute, for interpolation % y - computed value n = size(x0, 1); y = 0; for i=1:n p = 1; for j=1:n if j == i % avoiding fancy division by 0 continue; endif; p *= (x-x0(j)) / (x0(i)-x0(j)); endfor; y += y0(i) * p; endfor; endfunction;
Pretty useful to approximate another polynomials, not that great when it comes to “unusual” functions - it requires many known points in order to work…precisely => pretty bad for a predictor. Maybe the factorial function is not the best example here, since it’s not that easy to approximate it, but I chose it for simplicity.
On the bright side: might be a nice way to approximate factorials for non-natural numbers.