Content deleted Content added
→Stability: fix typos |
m →Generalizations: Added 1 doi to a journal cite |
||
Line 51:
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.
The ILU factorization can be performed as a [[fixed-point iteration]] in a highly parallel way.<ref>{{cite journal|last1=Chow|first1=Edmond|last2=Patel|first2=Aftab|title=Fine-grained parallel incomplete LU factorization|journal=SIAM Journal on Scientific Computing|date=2015|volume=37|issue=2|page=C169-C193|ref=iterativeILU|doi=10.1137/140968896}}</ref>
== See also ==
| |||