Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Iterative methods: system of linear equations

  1. Oct 30, 2009 #1
    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!
     
  2. jcsd
  3. Oct 31, 2009 #2

    arildno

    User Avatar
    Science Advisor
    Homework Helper
    Gold Member
    Dearly Missed

    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.
     
  4. Oct 31, 2009 #3

    daniel_i_l

    User Avatar
    Gold Member

    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
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Iterative methods: system of linear equations
Loading...