Physics – Condensed Matter – Disordered Systems and Neural Networks
Scientific paper
2003-12-01
Physics
Condensed Matter
Disordered Systems and Neural Networks
12 pages, 5 figures. All code and configuration files necessary to reproduce the results will be made available at http://www.
Scientific paper
The past thirteen years have seen the development of many algorithms for approximating matrix functions in O(N) time, where N is the basis size. These O(N) algorithms rely on assumptions about the spatial locality of the matrix function; therefore their validity depends very much on the argument of the matrix function. In this article I carefully examine the validity of certain O(N) algorithms when applied to hamiltonians of disordered systems. I focus on the prototypical disordered system, the Anderson model. I find that O(N) algorithms for the density matrix function can be used well below the Anderson transition (i.e. in the metallic phase;) they fail only when the coherence length becomes large. This paper also includes some experimental results about the Anderson model's behavior across a range of disorders.
No associations
LandOfFree
O(N) algorithms for disordered systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with O(N) algorithms for disordered systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and O(N) algorithms for disordered systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-687609