Content deleted Content added
m v2.04b - Bot T20 CW#61 - WP:WCW project (Reference before punctuation) |
MichaelMaggs (talk | contribs) Adding local short description: "Concept in numerical linear algebra", overriding Wikidata description "sparse approximation of the LU factorization often used as a preconditioner" |
||
| (3 intermediate revisions by 3 users not shown) | |||
Line 1:
{{Short description|Concept in numerical linear algebra}}
In [[numerical linear algebra]], an '''incomplete LU factorization''' (abbreviated as '''ILU''') of a [[matrix (mathematics)|matrix]] is a [[sparse matrix|sparse]] approximation of the [[LU factorization]] often used as a [[preconditioner]].
Line 15 ⟶ 16:
G(A) := \left\lbrace (i,j) \in \N^2 : A_{ij} \neq 0 \right\rbrace \,,
</math>
which is used to define the conditions a ''sparsity
:<math>
S \subset \left\lbrace 1, \dots , n \right\rbrace^2
Line 35 ⟶ 36:
== Stability ==
Concerning the stability of the ILU the following theorem was proven by Meijerink and van der Vorst.<ref>{{Cite journal|last=Meijerink|first=J. A.|last2=Vorst|first2=Van Der|last3=A|first3=H.|date=1977|title=An iterative solution method for linear systems of which the coefficient matrix is a symmetric 𝑀-matrix|url=
Let <math> A </math> be an [[M-matrix]], the (complete) LU decomposition given by <math> A=\hat{L} \hat{U} </math>, and the ILU by <math> A=LU-R </math>.
Line 51 ⟶ 52:
More accurate ILU preconditioners require more memory, to such an extent that eventually the running time of the algorithm increases even though the total number of iterations decreases. Consequently, there is a cost/accuracy trade-off that users must evaluate, typically on a case-by-case basis depending on the family of linear systems to be solved.
== See also ==
| |||