This is the first commit.
This is the first commit.
This is the first commit.
Algorithm working.

Programmed a working example for the tridiagonal matrix algorithm. The
data is written to a file, but have not plotted it yet. Don't know if
it's the right result.
Also made a header file.
Successful call to the algorithm solver.
Algorithm yields correct result.

Fixed an issue where I used used the modified f[i+1] before the modified
f[i] was defined. Moved the original f[i] values in a separate loop, so
that the original f array is defined before the subtractions begin and f
is modified.
Also used a colleague's Python program - ReadPlot.py - to read the
outfile that is created.
Need to look into boundary conditions. Doesn't look like the plot starts
from x = 0.
Boundary conditions still not fixed.

Had some weird values (order 10^(-7)) for the last values of f and v.
Fixed that, but need to change it so that v(0) = v(1) = 0. That is not
the case in my plot.
Compared with analytical solution. Did not match.

Made poissonEqSolution.cpp, which calculates the exact solution.
Compared for N = 1000, which should yield exactly the same result.
Need to go back and work with the boundary conditions.
Changed ReadPlot.py to take two separate files, and plot the matrix
solution and analytical solution together.
Algorithm working with boundary conditions.

Renamed the files tdma.cpp and tdma.h that use the algorithm to
gaussianElimination.cpp and gaussianElimination.h to better reflect what
they do.

Finally made the boundary conditions right, and the algorithm is now
very close (pretty much the same) to the analytical solution, even for "low" N.
Made the indexing so that it better represents what actually happens with the
elements in the tridiagonal matrix. This helped me get the boundary
conditions right, and made the algorithm work like it should.
Merge branch 'master' of github.com:vedad/Project-1