Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.num-analysis.independent

Topic: ILU-Preconditioning problem
Replies: 1   Last Post: Dec 9, 1996 6:01 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View  
Ulrich Elsner

Posts: 108
Registered: 12/7/04
Re: ILU-Preconditioning problem
Posted: Dec 9, 1996 6:01 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Hallo,

In article <5897pj$50@unidoct.chemietechnik.uni-dortmund.de> you write:
>Dear netters,
>
>I run into a problem in the context of the iterative solution of a linear
>system. It appears during the construction of the incomplete LU-factorization
>of the matrix, is caused by the structure of the matrix and leads to failure
>due to division by zero. It is sure that the matrix is regular as Gauss'
>algorithm works without any problems. However, Gauss' algorithm applies row
>interchangings which I could not apply successfully in the context of the
>ILU decomposition.


ILUs (there are different ones ) don't have to exist, even if the Matrix
itself is regular.

See e.g. Hackbusch, "Iterative Loesung grosser schwachbesetzter
Gleichungssysteme" (also available in english, title something like
Iterative solution of large sparse systems") oder Axelsson, "Iterative
Solution Methods".


>The linear systems are relativly small, so row interchangings do not cause
>Too much trouble. On the other hand, the system has to be solved repeatedly,
>what makes an iterative solution interesting.


Why? Especially when solving the same system with different right hand
sides, using LU-decomposition (i.e. Gauss) is quite efficient. If the
matrix is sparse, you might want to use the appropriate sparse
decompositions. A reason for iterative methods could be the lack of space
but you mention that the systems are relatively small.

>Now the question: What could I do to get an effective preconditioning?
>Are there other preconditioners, which do not require any row
>interchanging?


Usually preconditioners are problem-dependent, i.e. a preconditioner which
works quite well for a system derived from some PDE will have problems if
the system comes from some LP-problem.

Some (more or less) problem independent preconditioners are
SSOR, (block)-Jakobi and different variants of ILU.

If all you want to do is solve the problem, you can find all of these
(and more) on the net (e.g. netlib). No need to reinvent the wheel.

By the way, your mail-address (hiegeman@Chemietechnik.Uni-Dortmund.DE)
bounces.

Regards,


--
Ulrich Elsner, Fak. fuer Mathematik, TU Chemnitz, D-09107 Chemnitz, Germany
http://www.tu-chemnitz.de/~elsner email: elsner@mathematik.tu-chemnitz.de





Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.