In electronic structure calculations the computational cost is of great importance because large systems can contain a huge number of electrons. One effective method to make such calculations is by density matrix purification. Although, the cost for this method is relatively low compared to other existing methods there is room for improvements. In this paper one method proposed by Emanuel Rubensson and one method proposed by Jaehoon Kim & Yousung Jung was compared to each other with respect to efficiency, simplicity and robustness. Both are improved methods to compute the density matrix by accelerated polynomial expansion. Rubensson’s method consists of two different algorithms and results showed that both performed better than Kim & Jung’s method in terms of efficiency, which is the property both methods directs their main focus on. The major differences between them was identified in terms of adaptivity. The methods require different inputs that demands separate levels of knowledge about the system. Kim & Jung’s method which require less knowledge can however benefit efficiency-wise from more information in order to optimize the algorithm for the system. Results also showed that both methods were stable, but since they only were tested with arbitrarily assumed input arguments no conclusion about their general stability could be drawn.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:uu-256377 |
| Date | January 2015 |
| Creators | Joneus, Carl, Wretstam, Oskar, Enander, Filip |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | TVE ; 15 058 |
Page generated in 0.002 seconds