Combinatorial problems in solving linear systems

Abstract : Numerical linear algebra and combinatorial optimization are vast subjects; as is their interaction. In virtually all cases there should be a notion of sparsity for a combinatorial problem to arise. Sparse matrices therefore form the basis of the interaction of these two seemingly disparate subjects. As the core of many of today's numerical linear algebra computations consists of the solution of sparse linear system by direct or iterative methods, we survey some combinatorial problems, ideas, and algorithms relating to these computations. On the direct methods side, we discuss issues such as matrix ordering; bipartite matching and matrix scaling for better pivoting; task assignment and scheduling for parallel multifrontal solvers. On the iterative method side, we discuss preconditioning techniques including incomplete factorization preconditioners, support graph preconditioners, and algebraic multigrid. In a separate part, we discuss the block triangular form of sparse matrices.
Complete list of metadatas

Cited literature [159 references]  Display  Hide  Download

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00411638
Contributor : Bora Uçar <>
Submitted on : Tuesday, April 12, 2011 - 6:09:36 PM
Last modification on : Saturday, April 21, 2018 - 1:27:24 AM

File

isdbu.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : ensl-00411638, version 3

Collections

Citation

Iain Duff, Bora Uçar. Combinatorial problems in solving linear systems. 2011. ⟨ensl-00411638v3⟩

Share

Metrics

Record views

441

Files downloads

232