S. Parter. The use of planar graph in Gaussian elimination. SIAM Review, 3:364--369, 1961.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....some quantity at each step of a simulated n step symmetric Gaussian elimination process. The algorithms using such an approach are typically distinguished by their greedy minimization criteria [11] 4. 1 Graph Models In 1961, Parter introduced the graph model of symmetric Gaussian elimination [12]. A sequence of elimination graphs represent a sequence of Gaussian elimination steps. The initial Elimination graph is the original graph for matrix A. The elimination graph of k s step is obtained by adding edges between adjacent vertices of the current eliminated vertex to form a clique, ....

S. Parter. The use of planar graph in Gaussian elimination. SIAM Review, 3:364--369, 1961.

....MMDF Modified Minimum Deficiency Ng and Raghavan [6] MMMD Modified Multiple Minimum Degree Ng and Raghavan [6] connecting vertices i and j in G exists if and only if a ij is nonzero. By symmetry, a j,i is also nonzero. The graph model of symmetric Gaussian elimination was introduced by Parter [7]. A sequence of elimination graphs, G k , represent the fill created in each step of the factorization. The initial elimination graph is the graph of the matrix, G 0 = G(A) At each step k,letv k be the vertex corresponding to the k th column of A to be eliminated. The elimination graph at the ....

S. Parter, The use of planar graphs in Gaussian elimination,SIAMRev.,3 (1961), pp. 364--369.

....to the columns of A. We label the vertices 1; n, to correspond to the n columns of A. An edge (i; j) connecting vertices i and j in G exists if and only if a ij is nonzero. By symmetry, a j;i is also nonzero. The graph model of symmetric Gaussian elimination was introduced by Parter [7]. A sequence of elimination graphs, G k , represent the fill created in each step of the factorization. The initial elimination graph is the graph of the matrix, G 0 = G(A) At each step k, let v k be the vertex corresponding to the k th column of A to be eliminated. The elimination graph at ....

S Parter. The use of planar graphs in Gaussian elimination. SIAM Rev., 3:364--369, 1961.

No context found.

S. Parter. The use of planar graph in Gaussian elimination. SIAM Review, 3:364# 369, 1961.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC