Iterative methods: system of linear equations

  • Thread starter defunc
  • Start date
  • #1
defunc
55
0
Hi all,

I'm looking for a an effective technique for solving a system of linear equations. It should always converge, unlike jacobi or gauss seidel etc. It has to be more efficient than ordinary gauss elimination or kramers rule for large matrices.

Thanks!
 

Answers and Replies

  • #2
arildno
Science Advisor
Homework Helper
Gold Member
Dearly Missed
10,089
135
First off, anything is more efficient than Cramer's Rule!

Secondly, why do you think Gauss elimination is focused so much upon?
It is precisely because it IS the major technique tat always produces convergence.

You may look up into LU-factorization schemes and so on, but typically, these faster (and often preferred) methods will only have conditional convergence.

Simply put, calculation speed is gained by dropping mathematical safe-guards that ensure absolute convergence.

Thus, what you are seeking after is, really, a contradiction in terms.
 
  • #3
daniel_i_l
Gold Member
868
0
The more advanced methods usually deal with specific subclasses of matrices. For example, if you're trying to solve symmetric positive-definite systems you might want to look at the conjugate-gradient method:
http://en.wikipedia.org/wiki/Conjugate_gradient_method
 

Suggested for: Iterative methods: system of linear equations

Replies
9
Views
543
  • Last Post
Replies
0
Views
440
  • Last Post
Replies
3
Views
484
  • Last Post
Replies
2
Views
582
Replies
5
Views
766
Replies
2
Views
565
  • Last Post
Replies
1
Views
602
  • Last Post
Replies
0
Views
396
Replies
7
Views
926
Replies
2
Views
432
Top