paolofinelli / srg Goto Github PK

Author: Justin Angra
Last Updated: 10/32/14

----------------------
Command Line Arguments
----------------------

Example(via iPython):  run srg.py -m 100x100.txt -v v100.txt

-m | -v 
  (required) Specifies the T (kinetic) and V (potential) matrix of the initial Hamiltonian to evolve

    -m - Square diagonalized matrix containing eigenvalues as elements of diagonal. Matrix in text file must of be of the form:
	
	a1 a2 a3
	a4 a5 a6
        a6 a7 a8
	
as in a white space between each elements and a new line after each row of elements starting at the first character of the text file.

    -v - Square symmetric matrix containing inital potential values as elements. Matrix in text file must be of exact same form as described above. 

Note: argument of -m and -v must be of the same size.

--------------------
Algorithmic Analysis
--------------------

Running files for matrices of size (number of diagonal elements) 2, 3, ... , 9, 10, 20, ... , 40 and plotting. We conclude that the algorithm runs at n^5, where n is the matrix size. 

---------------------
Issues with Algorithm
---------------------

Currently the program will not complete size 50 matrices or above within a realistic timeline or the computer will run out of memory and terminate said process.