Initial commit. Seems to work for a simple case.
Removed printing of individual contributions from trial functions.

Now the output just shows the exact and numerical solutions to the ODE,
not the values of the individual trial polynomials.
Ran all code through GNU "indent" program to fix the code style.
Added barebones README.
Replaced error status pointers with assert() in Chebyshev polynomial functions.

Error handling in C is not always very graceful. We can't use exceptions
like we can in C++. One way to deal with errors is to include "success
pointers" as arguments to functions which can cause errors. However, I
found a better philosophy while prowling StackOverflow which said
something along the lines of the following:

If the only possible error is a programming error, use assert().

The errors in the Chebyshev polynomials occur if the index "n" is less
than 0. But that's a programming error. So for those I use assert() now.
It uses less code and works just as well.
Moved output of exact and numerical solutions from STDOUT to a file.
Changed variable name containing numerical solution to something more descriptive.

We'll probably have more files before too long, so let's use something
more descriptive than "filename".
Added output of basis functions to file.

It's cool to plot them all on top of each other and try to see how they
add up to give the right answer.
Added output of basis function coefficients to a file.

This one isn't so nice to plot, but it can be very interesting to look
at, especially in those rare cases where you actually calculate the
analytic solution!
Fixed wrongly copied+pasted filename when checking for NULL file pointer.
CMake: removed manual override of CMAKE_C_COMPILER variable.

I do love clang, but it's not nearly as common as gcc. For portability,
let CMake file the default C compiler.
CMake: turned off verbosity during make.

I only use verbose mode to check that I set compile or link flags
correctly. By default it shouldn't spam the user so much.
Ran GNU indent on main.c to fix some minor code style stuff.

No functional changes at all in this commit. Just eye candy.
Added GSL, BLAS, and LAPACK requirements to README
Merged friesen/galerkin_method/develop into develop
Merged in jlusk/galerkin_method/develop (pull request #1)

Added GSL, BLAS, and LAPACK requirements to README
Replaced recusion relations with trigonometric definitions in Chebyshev polynomial functions.

For small n, it will probably be much faster to use the recursion
relations than the trigonometric identities. But the latter uses far
less code, and for large enough n will probably be faster to calculate.
Updated README to reflect new output.
Added AUTHORS file.
Added TODO file.