Matches in SemOpenAlex for { <https://semopenalex.org/work/W2396646384> ?p ?o ?g. }
- W2396646384 abstract "Alex Pothen Old Dominion University Sivan Toledo Tel-Aviv University The most fundamental computation in numerical linear algebra is the factorization of a matrix as a product of two or more matrices with simpler structure. An important example is Gaussian elimination, in which a matrix is written as a product of a lower triangular matrix and an upper triangular matrix. The factorization is accomplished by elementary operations in which two or more rows (columns) are combined together to transform the matrix to the desired form. In Gaussian elimination, the desired form is an upper triangular matrix, in which nonzero elements below the diagonal have been transformed to be equal to zero. We say that the subdiagonal elements have been eliminated. (The transformations that accomplish the elimination yield a lower triangular matrix.) The input matrix is usually sparse, i.e., only a few of the matrix elements are nonzero to begin with; in this situation, row operations constructed to eliminate nonzero elements in some locations might create new nonzero elements, called fill, in other locations, as a side-effect. Data structures that predict fill from graph models of the numerical algorithm, and algorithms that attempt to minimize fill, are key ingredients of efficient sparse matrix algorithms. This chapter surveys these data structures, known as elimination structures, and the algorithms that construct and use them. We begin with the elimination tree, a data structure associated with symmetric Gaussian elimination, and we then describe its most important applications. Next we describe other data structures associated with symmetric Gaussian elimination, the clique tree, the clique cover, and the quotient graph. We then consider data structures that are associated with unsymmetric Gaussian elimination, the column elimination tree and the elimination directed acyclic graph. This survey has been written with two purposes in mind. First, we introduce the algorithms community to these data structures and algorithms from" @default.
- W2396646384 created "2016-06-24" @default.
- W2396646384 creator A5055182869 @default.
- W2396646384 creator A5056808449 @default.
- W2396646384 date "2004-01-01" @default.
- W2396646384 modified "2023-09-23" @default.
- W2396646384 title "Elimination Structures in Scientific Computing" @default.
- W2396646384 cites W1510285529 @default.
- W2396646384 cites W1510491715 @default.
- W2396646384 cites W1562509598 @default.
- W2396646384 cites W1607358149 @default.
- W2396646384 cites W1796399974 @default.
- W2396646384 cites W1973101972 @default.
- W2396646384 cites W1976964180 @default.
- W2396646384 cites W1982838361 @default.
- W2396646384 cites W1987177655 @default.
- W2396646384 cites W1990474090 @default.
- W2396646384 cites W1991477862 @default.
- W2396646384 cites W1998276913 @default.
- W2396646384 cites W2006204498 @default.
- W2396646384 cites W2007259720 @default.
- W2396646384 cites W2007903522 @default.
- W2396646384 cites W2008859258 @default.
- W2396646384 cites W2013116221 @default.
- W2396646384 cites W2013424510 @default.
- W2396646384 cites W2014730252 @default.
- W2396646384 cites W2016441057 @default.
- W2396646384 cites W2020561008 @default.
- W2396646384 cites W2021108117 @default.
- W2396646384 cites W2023521505 @default.
- W2396646384 cites W2027140916 @default.
- W2396646384 cites W2027566319 @default.
- W2396646384 cites W2034036349 @default.
- W2396646384 cites W2038205735 @default.
- W2396646384 cites W2046020107 @default.
- W2396646384 cites W2049226297 @default.
- W2396646384 cites W2052602889 @default.
- W2396646384 cites W2055094346 @default.
- W2396646384 cites W2055791798 @default.
- W2396646384 cites W2059241685 @default.
- W2396646384 cites W2061782500 @default.
- W2396646384 cites W2063675347 @default.
- W2396646384 cites W2070299075 @default.
- W2396646384 cites W2075440511 @default.
- W2396646384 cites W2077309453 @default.
- W2396646384 cites W2077791079 @default.
- W2396646384 cites W2086119402 @default.
- W2396646384 cites W2086648616 @default.
- W2396646384 cites W2088160222 @default.
- W2396646384 cites W2089790965 @default.
- W2396646384 cites W2089898547 @default.
- W2396646384 cites W2096559782 @default.
- W2396646384 cites W2101501830 @default.
- W2396646384 cites W2104133620 @default.
- W2396646384 cites W2113280143 @default.
- W2396646384 cites W2113517218 @default.
- W2396646384 cites W2123571807 @default.
- W2396646384 cites W2125720043 @default.
- W2396646384 cites W2141331848 @default.
- W2396646384 cites W2167797964 @default.
- W2396646384 cites W2570578302 @default.
- W2396646384 cites W69764252 @default.
- W2396646384 cites W91483751 @default.
- W2396646384 cites W1518532763 @default.
- W2396646384 doi "https://doi.org/10.1201/9781315119335-61" @default.
- W2396646384 hasPublicationYear "2004" @default.
- W2396646384 type Work @default.
- W2396646384 sameAs 2396646384 @default.
- W2396646384 citedByCount "3" @default.
- W2396646384 countsByYear W23966463842014 @default.
- W2396646384 countsByYear W23966463842018 @default.
- W2396646384 countsByYear W23966463842021 @default.
- W2396646384 crossrefType "journal-article" @default.
- W2396646384 hasAuthorship W2396646384A5055182869 @default.
- W2396646384 hasAuthorship W2396646384A5056808449 @default.
- W2396646384 hasConcept C104140500 @default.
- W2396646384 hasConcept C104528550 @default.
- W2396646384 hasConcept C106487976 @default.
- W2396646384 hasConcept C11413529 @default.
- W2396646384 hasConcept C121332964 @default.
- W2396646384 hasConcept C126312332 @default.
- W2396646384 hasConcept C135598885 @default.
- W2396646384 hasConcept C158693339 @default.
- W2396646384 hasConcept C159985019 @default.
- W2396646384 hasConcept C163716315 @default.
- W2396646384 hasConcept C1678238 @default.
- W2396646384 hasConcept C187834632 @default.
- W2396646384 hasConcept C192562407 @default.
- W2396646384 hasConcept C202444582 @default.
- W2396646384 hasConcept C33343441 @default.
- W2396646384 hasConcept C33923547 @default.
- W2396646384 hasConcept C41008148 @default.
- W2396646384 hasConcept C54848796 @default.
- W2396646384 hasConcept C56372850 @default.
- W2396646384 hasConcept C62520636 @default.
- W2396646384 hasConcept C69044650 @default.
- W2396646384 hasConcept C77088390 @default.
- W2396646384 hasConcept C85817219 @default.
- W2396646384 hasConcept C96442724 @default.
- W2396646384 hasConceptScore W2396646384C104140500 @default.