Applications of sparse matrices in the analysis of electric circuits
Abstract
Nodes and branches of electric circuits are related to rows and columns of sparse matrices in a computeraided circuit analysis procedure. The article discusses triangle decomposition of sparse matrices, how to minimize increments of nonzero elements, how to minimize the number of numerical operations needed in elimination steps, and how to select the principal element of a sparse matrix. An iterative method of conjugate gradients is applied for solving systems of linear equations using sparse matrices, and Newton and Broydon iterative methods are invoked for the solution of nonlinear equations using sparse matrices.
 Publication:

Slaboproudy Obzor
 Pub Date:
 October 1975
 Bibcode:
 1975SlaOb..36..485L
 Keywords:

 Computer Aided Design;
 Electric Networks;
 Matrices (Mathematics);
 Network Analysis;
 Applications Of Mathematics;
 Iterative Solution;
 Matrix Theory;
 Newton Methods;
 Electronics and Electrical Engineering