Code covered by the BSD License

Highlights from Conjugate Gradient Method

5.0
5.0 | 2 ratings Rate this file 44 Downloads (last 30 days) File Size: 1.49 KB File ID: #22494

Conjugate Gradient Method

by

Yi Cao (view profile)

18 Dec 2008 (Updated )

Conjugate Gradient Method to solve a system of linear equations

File Information
Description

The conjugate gradient method aims to solve a system of linear equations, Ax=b, where A is symmetric, without calculation of the inverse of A. It only requires a very small amount of membory, hence is particularly suitable for large scale systems.

It is faster than other approach such as Gaussian elimination if A is well-conditioned. For example,

n=1000;
[U,S,V]=svd(randn(n));
s=diag(S);
A=U*diag(s+max(s))*U'; % to make A symmetric, well-contioned
b=randn(1000,1);
tic,x=conjgrad(A,b);toc
tic,x1=A\b;toc
norm(x-x1)
norm(x-A*b)

Conjugate gradient is about two to three times faster than A\b, which uses the Gaissian elimination.

MATLAB release MATLAB 8.2 (R2013b)
Tags for This File   Please login to tag files.
 Please login to add a comment or rating.
Comments and Ratings (4)
02 Feb 2012 Kovács Sebestyén

Kovács Sebestyén (view profile)

great.thanks

05 Apr 2009 V. Poor

13 Jan 2009 Lei

Lei (view profile)

Could anybody tell me how to evaluate the time required by the SVD. Please kindly note the svd.m called directly by the workspace is a built-in function, which is much faster than the svd.m available on the Matlab website. So which one is more suitable to evaluate the required time?

Actually, I am trying to compare a new algorithm with the SVD in computational cost or time. I suppose the built-in SVD function might be faster than the source-code SVD function. Could anybody help me? Thanks a lot for your kindly helps in advance! My email address is huanglei8rsp@yahoo.com.cn.

Comment only
04 Jan 2009 Luigi Giaccari

Luigi Giaccari (view profile)

A\b uses cholesky factorization if A is simmetric. It swithes to gauss method when A is not simmetric and the factorization fails due to negative sqrt input.

I don't know if it is present in all version, but there already is a conjgrad method in matlab.

Try:

help pcg

Anyway thank to Cao, submissions that works are always usefull, in the worst case you can study the algorithm.

Comment only
Updates
22 Dec 2008

update description

05 Feb 2014

change initial value to x=b. slightly faster.

06 Feb 2014

To consider two trival cases.

Contact us