| Autor: |
Wil H. A. Schilders, Sangye Lungten, Joseph M. Maubach |
| Přispěvatelé: |
Scientific Computing, Center for Analysis, Scientific Computing & Appl., Mathematics and Computer Science |
| Rok vydání: |
2014 |
| Předmět: |
|
| Zdroj: |
Numerical Algebra, Control and Optimization, 4(3), 227-239. American Institute of Mathematical Sciences |
| ISSN: |
2155-3297 |
| DOI: |
10.3934/naco.2014.4.227 |
| Popis: |
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. Keywords: Schilders' factorization, lower trapezoidal, digraph, incidence matrix, nilpotent. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
