Sparse inverse incidence matrices for Schilders' factorization applied to resistor network modeling
Sangye Lungten, W.H.A. Schilders, J.M.L. Maubach · Numerical Algebra Control and Optimization · 2014
Schilders' factorization can be used as a basis for preconditioning indefinite linear systems which arise in many problems like least-squares, saddle-point and electronic circuit simulations. Here we consider its application to resistor network modeling. In that case the sparsity of the matrix blocks in Schilders' factorization depends on the sparsity of the inverse of a permuted incidence matrix. We introduce three different possible permutations and determine which permutation leads to the sparsest inverse of the incidence matrix. Permutation techniques are based on types of sub-digraphs of the network of an incidence matrix.