Combinatorial problems in solving linear systems - ENS de Lyon - École normale supérieure de Lyon Access content directly
Preprints, Working Papers, ... Year : 2011

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.
Fichier principal
Vignette du fichier
isdbu.pdf (409.61 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

ensl-00411638 , version 1 (28-08-2009)
ensl-00411638 , version 2 (05-07-2010)
ensl-00411638 , version 3 (12-04-2011)

Identifiers

  • HAL Id : ensl-00411638 , version 3

Cite

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

Share

Gmail Facebook X LinkedIn More