Matches in SemOpenAlex for { <https://semopenalex.org/work/W2003223094> ?p ?o ?g. }
Showing items 1 to 75 of
75
with 100 items per page.
- W2003223094 abstract "A recent approach for solving sparse triangular systems of equations on massively parallel computers employs a factorization of the triangular coefficient matrix to obtain a representation of its inverse in product form. The number of general communication steps required by this approach is proportional to the number of factors in the factorization. The triangular matrix can be symmetrically permuted to minimize the number of factors over suitable classes of permutations, and thereby the complexity of the parallel algorithm can be minimized. Algorithms for minimizing the number of factors over several classes of permutations have been considered in earlier work. Let $F=L+L^T$ denote the symmetric filled matrix corresponding to a Cholesky factor $L$, and let $G_F$ denote the adjacency graph of $F$. In this paper we consider the problem of minimizing the number of factors over all permutations which preserve the structure of $G_F$. The graph model of this problem is to partition the vertices $G_F$ into the fewest transitively closed subgraphs over all perfect elimination orderings while satisfying a certain precedence relationship. The solution to this chordal graph partitioning problem can be described by a greedy scheme which eliminates a largest permissible subgraph at each step. Further, the subgraph eliminated at each step can be characterized in terms of lengths of chordless paths in the current elimination graph. This solution relies on several results concerning {em transitive perfect elimination orderings/} introduced in this paper. We describe a partitioning algorithm with $order{|V|+|E|}$ time and space complexity." @default.
- W2003223094 created "2016-06-24" @default.
- W2003223094 creator A5046090135 @default.
- W2003223094 creator A5050129306 @default.
- W2003223094 creator A5055182869 @default.
- W2003223094 date "1992-12-01" @default.
- W2003223094 modified "2023-10-16" @default.
- W2003223094 title "Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution" @default.
- W2003223094 cites W1531652487 @default.
- W2003223094 cites W1967688579 @default.
- W2003223094 cites W1976964180 @default.
- W2003223094 cites W1981885118 @default.
- W2003223094 cites W1991477862 @default.
- W2003223094 cites W2007903522 @default.
- W2003223094 cites W2022241871 @default.
- W2003223094 cites W2027140916 @default.
- W2003223094 cites W2036603155 @default.
- W2003223094 cites W2059098138 @default.
- W2003223094 cites W2059241685 @default.
- W2003223094 cites W2077309453 @default.
- W2003223094 cites W2096559782 @default.
- W2003223094 doi "https://doi.org/10.2172/10121667" @default.
- W2003223094 hasPublicationYear "1992" @default.
- W2003223094 type Work @default.
- W2003223094 sameAs 2003223094 @default.
- W2003223094 citedByCount "3" @default.
- W2003223094 crossrefType "report" @default.
- W2003223094 hasAuthorship W2003223094A5046090135 @default.
- W2003223094 hasAuthorship W2003223094A5050129306 @default.
- W2003223094 hasAuthorship W2003223094A5055182869 @default.
- W2003223094 hasBestOaLocation W20032230943 @default.
- W2003223094 hasConcept C102192266 @default.
- W2003223094 hasConcept C114614502 @default.
- W2003223094 hasConcept C132525143 @default.
- W2003223094 hasConcept C147792647 @default.
- W2003223094 hasConcept C160446614 @default.
- W2003223094 hasConcept C173608175 @default.
- W2003223094 hasConcept C191399111 @default.
- W2003223094 hasConcept C203776342 @default.
- W2003223094 hasConcept C22149727 @default.
- W2003223094 hasConcept C33923547 @default.
- W2003223094 hasConcept C41008148 @default.
- W2003223094 hasConcept C43413943 @default.
- W2003223094 hasConceptScore W2003223094C102192266 @default.
- W2003223094 hasConceptScore W2003223094C114614502 @default.
- W2003223094 hasConceptScore W2003223094C132525143 @default.
- W2003223094 hasConceptScore W2003223094C147792647 @default.
- W2003223094 hasConceptScore W2003223094C160446614 @default.
- W2003223094 hasConceptScore W2003223094C173608175 @default.
- W2003223094 hasConceptScore W2003223094C191399111 @default.
- W2003223094 hasConceptScore W2003223094C203776342 @default.
- W2003223094 hasConceptScore W2003223094C22149727 @default.
- W2003223094 hasConceptScore W2003223094C33923547 @default.
- W2003223094 hasConceptScore W2003223094C41008148 @default.
- W2003223094 hasConceptScore W2003223094C43413943 @default.
- W2003223094 hasLocation W20032230941 @default.
- W2003223094 hasLocation W20032230942 @default.
- W2003223094 hasLocation W20032230943 @default.
- W2003223094 hasLocation W20032230944 @default.
- W2003223094 hasOpenAccess W2003223094 @default.
- W2003223094 hasPrimaryLocation W20032230941 @default.
- W2003223094 hasRelatedWork W1966724030 @default.
- W2003223094 hasRelatedWork W2073285758 @default.
- W2003223094 hasRelatedWork W2079220110 @default.
- W2003223094 hasRelatedWork W2182371183 @default.
- W2003223094 hasRelatedWork W2570578302 @default.
- W2003223094 hasRelatedWork W2949406206 @default.
- W2003223094 hasRelatedWork W2992965972 @default.
- W2003223094 hasRelatedWork W4229667864 @default.
- W2003223094 hasRelatedWork W4297910563 @default.
- W2003223094 hasRelatedWork W4301446366 @default.
- W2003223094 isParatext "false" @default.
- W2003223094 isRetracted "false" @default.
- W2003223094 magId "2003223094" @default.
- W2003223094 workType "report" @default.