lengthy discussion/introduction to Kryolov subspaces and eigensolvers including QR and Arnoldi, implemented (apparently correctly, though error checking is still somehwat haphazard) in arnoldi_method.py for hermitian input matrices
implemented implicit double-shift qr, which may or may not be working as it is yet untested. the wilkinson shift appears to function, but its quadratic convergence needs to be tested
began c++ translation of arnoldi method, finished up to implicitly restarted qr, which is does not currently pass tests
all compiles and runs, but arnoldi's accuracy is poor and probably unacceptable
everything seems to work, qr often hangs up with small 'n'
IMPORTANT: arnoldi iteration will now return a smaller decomposition than requested. arnoldi eigensolver is set up to handle this, so long as the subspace never shrinks below k dimensions. it seems wise, but it's a homebrew adjustment and thus probably bad, though tests suggest it works
made a better library creation script