A note on the decomposition of systems of sparse non-linear equations
暂无分享,去创建一个
In this paper we point out some advantages of decomposing a system of non-linear equations into block-triangular form directly instead of decomposing the linearized systems.
[1] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[2] F. Gustavson. FINDING THE BLOCK LOWER TRIANGULAR FORM OF A SPARSE MATRIX , 1976 .
[3] Marshall Hall,et al. An Algorithm for Distinct Representatives , 1956 .
[4] James R. Bunch. Complexity of Sparse Elimination , 1973 .
[5] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.