Math 2.0

Numerical analysis Definition

Incomplete LU factorization

Builds on Sparse matrixTriangular matrixLU decompositionM-matrixIncomplete Cholesky factorization

Definition

Let AA be a real n×nn \times n sparse matrix. Let P⊆{1,…,n}2P \subseteq \set{1, \dots, n}^2 be a set of positions that contains every diagonal position (i,i)(i, i). An incomplete LU factorization of AA with pattern PP is a pair (L,U)(L, U) such that:

  1. LL is unit lower triangular and UU is upper triangular;
  2. lij=0l_{ij} = 0 and uij=0u_{ij} = 0 for every position (i,j)∉P(i, j) \notin P;
  3. (LU)ij=aij(L U)_{ij} = a_{ij} for every (i,j)∈P(i, j) \in P.

When PP is the set of positions with aij≠0a_{ij} \ne 0 together with the diagonal, it is called ILU(0).

Remarks

If PP is the set of all positions and AA has an LU decomposition with unit lower triangular LL, the two factorizations coincide. Example: if AA is tridiagonal and has an LU decomposition, its exact factors are bidiagonal. They vanish outside the pattern of AA, so they form the ILU(0) factorization. Non-example: let AA be the 2×22 \times 2 identity, let PP be all positions, and let LL have rows (1,0)(1, 0) and (1,1)(1, 1), with U=IU = I. Clauses 1 and 2 hold, but clause 3 fails, since (LU)21=1≠0=a21(L U)_{21} = 1 \ne 0 = a_{21}. The factors are computed by Gaussian elimination in which each update outside PP is discarded. For a general matrix a zero pivot can occur, and then the factorization does not exist. It exists for every pattern when AA is an M-matrix. For symmetric positive definite AA the symmetric analogue is the incomplete Cholesky factorization. Variants use levels of fill, written ILU(kk), or thresholds, written ILUT.

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Incomplete Cholesky factorization concept
  2. LU decomposition concept
  3. M-matrix concept
  4. Sparse matrix concept
  5. Triangular matrix concept
  6. Incomplete LU factorization definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Incomplete_LU_factorization
About this page
TagEMYPFVX322
URIm2://EMYPFVX322
Kinddefinition
WritingW0 stub
MSC65F08, 65F50, 65F10
DefinesIncomplete LU factorization
UsesSparse matrix, Triangular matrix, LU decomposition, M-matrix, Incomplete Cholesky factorization

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.