Modified conjugated gradient method for diagonalising large matrices

Details Modified conjugated gradient method for diagonalising large matrices Modified conjugated gradient method for diagonalising large matrices

2003-09-20

arxiv.org/abs/physics/0309086v1

Physics

Computational Physics

6 Pages, 2EPS figures. (To appear in Phys. Rev. E)

Scientific paper

10.1103/PhysRevE.68.056706

We present an iterative method to diagonalise large matrices. The basic idea is the same as the conjugated gradient (CG) method, i.e, minimizing the Rayleigh quotient via its gradient and avoiding reintroduce errors to the directions of previous gradients. Each iteration step is to find lowest eigenvector of the matrix in a subspace spanned by the current trial vector and the corresponding gradient of the Rayleigh quotient, as well as some previous trial vectors. The gradient, together with the previous trail vectors, play a similar role of the conjugated gradient of the original CG algorithm. Our numeric tests indicate that this method converges significantly faster than the original CG method. And the computational cost of one iteration step is about the same as the original CG method. It is suitably for first principle calculations.

Affiliated with

Also associated with

No associations

Rating

Modified conjugated gradient method for diagonalising large matrices 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 Modified conjugated gradient method for diagonalising large matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modified conjugated gradient method for diagonalising large matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-276202