×

VBARMS

swMATH ID: 9387
Software Authors: Carpentieri, Bruno; Liao, Jia; Sosonkina, Masha
Description: VBARMS: a variable block algebraic recursive multilevel solver for sparse linear systems. Sparse matrices arising from the solution of systems of partial differential equations often exhibit a perfect block structure, meaning that the nonzero blocks in the sparsity pattern are fully dense (and typically small), e.g., when several unknown quantities are associated with the same grid point. Similar block orderings can be sometimes unravelled also on general unstructured matrices, by ordering consecutively rows and columns with a similar sparsity pattern, and treating some zero entries of the reordered matrix as nonzero elements, with a little sacrifice of memory. We show how we can take advantage of these frequently occurring structures in the design of the multilevel incomplete LU factorization preconditioner ARMS [{it Y. Saad} and {it B. Suchomel}, Numer. Linear Algebra Appl. 9, No. 5, 359–378 (2002; Zbl 1071.65001)] and maximize computational efficiency.
Homepage: http://www.sciencedirect.com/science/article/pii/S0377042713002227
Keywords: linear systems; sparse matrices; Krylov methods; algebraic preconditioners; multilevel incomplete LU factorization; graph compression
Related Software: ARMS; BFSAI-IC; symrcm; BPKit; SuperLU; SparseMatrix; ILUPACK; ILUT; BLAS; YSMP; Ipopt; MUMPS; UMFPACK; PARDISO; FSAIPACK; ML; pARMS; SYM-ILDL; SPARSKIT; BlockSolve95
Referenced in: 5 Publications

Referenced in 1 Field

5 Numerical analysis (65-XX)

Referencing Publications by Year