Sparse inverse incidence matrices for Schilders' factorization applied to resistor network modeling

DOI10.3934/NACO.2014.4.227MaRDI QIDQ478946zbMATH OpenOpenAlexFDO

Authors S. Lungten, W. H. A. Schilders, J. M. L. Maubach

Publication date 5 December 2014

Published in Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/naco.2014.4.227

zbMATH Keywords

digraphincidence matrixSchilders' factorizationnilpotentlower trapezoidal

Mathematics Subject Classification ID

Applications of graph theory (05C90) Computational methods for sparse matrices (65F50) Preconditioners for iterative methods (65F08) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Sparse block factorization of saddle point matrices
• A comparative study of sparse approximate inverse preconditioners
• scientific article; zbMATH DE number 3963090
• Preconditioning algorithm for symmetric diagonally dominant linear systems
• A sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of an SPD matrix

Cites work

• scientific article; zbMATH DE number 1055145 (Why is no real title available?)
• A textbook of graph theory
• Graphs and matrices
• Matrix computations and semiseparable matrices. Vol. 1: Linear systems.
• Preconditioning techniques for nonsymmetric and indefinite linear systems
• Solution of indefinite linear systems using an LQ decomposition for the linear constraints

Cited in

(2)

• Sparse block factorization of saddle point matrices
• Threshold incomplete factorization constraint preconditioners for saddle-point matrices

This page was built for publication: Sparse inverse incidence matrices for Schilders' factorization applied to resistor network modeling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q478946)