Revision as of 20:06, 28 April 2021 edit Bender the Bot (talk \| contribs) Bots 1,064,377 edits m →Stability: HTTP → HTTPS for the American Mathematical Society, replaced: =http://www.ams.org/ → =https://www.ams.org/ Tag: AWB ← Previous edit		Revision as of 21:34, 12 September 2024 edit undo 128.210.106.86 (talk) →Generalizations: this was not a true statement. Next edit →
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~~An approximation to 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 ==

Incomplete LU factorization: Difference between revisions