Jump to content

Talk:Incomplete LU factorization

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Poopbutt68 (talk | contribs) at 15:50, 19 June 2025 (Rewrite: Reply). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Untitled

[edit]

Is this REALLY necessary? I mean, the article uses the term to define itself, and has no other content otherwise.

Rewrite

[edit]

I rewrote this article to add some actual content. It could use some additional discussion of ILU with thresholds, which I don't know a whole lot a bot. Additionally, I think it belongs in the mathematics rather than the engineering portal. Compsonheir (talk) 19:22, 19 April 2014 (UTC)[reply]

The current discussion regarding the ILU(k) is also incorrect. Poopbutt68 (talk) 15:50, 19 June 2025 (UTC)[reply]

Algorithm?

[edit]

It would be nice if this article had an actual algorithm, and possibly a brief mention (especially for newbies to numerical linear algebra) that the incomplete LU factorisation becomes the incomplete Cholesky factorisation if the matrix is symmetric. 24.116.219.204 (talk) 14:28, 5 November 2023 (UTC)[reply]

This is not necessarily true. It becomes the IC factorization if the matrix is symmetric, the structure of L and U and transposes of one another, and no approximations are used for one or the other. Poopbutt68 (talk) 15:49, 19 June 2025 (UTC)[reply]