The Role of Elimination Trees in Sparse Factorization
From MaRDI portal
Recommendations
Cited in
(89)- Hypermatrix oriented supernode amalgamation
- Solution of sparse positive definite systems on a hypercube
- An optimal parallel algorithm for node ranking of cographs
- A partial k-arboretum of graphs with bounded treewidth
- A parallel interior point algorithm for linear programming on a network of transputers
- Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution
- On constructing the elimination tree
- Finding minimum height elimination trees for interval graphs in polynomial time
- Separators and structure prediction in sparse orthogonal factorization
- Algorithms for generalized vertex-rankings of partial k-trees
- Refining an approximate inverse
- On vertex ranking of a starlike graph
- Free-surface film flow over topography: full three-dimensional finite element solutions
- \(l_p\)-optimal rankings and max-optimal rankings are different
- Arankings of trees
- New parallel sparse direct solvers for multicore architectures
- Numerical aspects in developing LP softwares, LPAKO and LPABO
- Finding the edge ranking number through vertex partitions
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
- Sparse Cholesky factorization on FPGA using parameterized model
- Element partition trees for \(h\)-refined meshes to optimize direct solver performance. I: Dynamic programming
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- Learning chordal extensions
- On the tree-depth and tree-width in heterogeneous random graphs
- The complexity of restricted star colouring
- On vertex rankings of graphs and its relatives
- On the tree-depth of random graphs
- Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking
- Robust memory-aware mappings for parallel multifrontal factorizations
- Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations
- Obstructions for tree-depth
- Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
- An efficient analyse phase for element problems.
- Vertex ranking of asteroidal triple-free graphs
- Enhancing performance and robustness of ILU preconditioners by blocking and selective transposition
- Fast algorithms for hierarchically semiseparable matrices
- State-of-the-art sparse direct solvers
- Equality perfect graphs and digraphs
- Fast implementation of the traveling-salesman-problem method for reordering columns within supernodes
- Ordered coloring grids and related graphs
- Combinatorial Aspects in Sparse Elimination Methods
- The role of graph structures in the theory of local elimination algorithms
- A compact row storage scheme for Cholesky factors using elimination trees
- A fast algorithm for sparse matrix computations related to inversion
- Forbidden graphs for tree-depth
- Ordered coloring of grids and related graphs
- PCx: an interior-point code for linear programming
- On exploiting sparsity of multiple right-hand sides in sparse direct solvers
- FPGA implementation of a Cholesky algorithm for a shared-memory multiprocessor architecture
- scientific article; zbMATH DE number 2098239 (Why is no real title available?)
- ThewwTfactorization of dense and sparse matrices
- Hierarchical orthogonal factorization: sparse square matrices
- Parallel \textit{QR} factorization of block-tridiagonal matrices
- Improving multifrontal methods by means of block low-rank representations
- A parallel geometric multifrontal solver using hierarchically semiseparable structure
- Logarithmic barriers for sparse matrix cones
- Reordering strategy for blocking optimization in sparse linear solvers
- On the complexity of the block low-rank multifrontal factorization
- AMPS: an augmented matrix formulation for principal submatrix updates with application to power grids
- A survey of direct methods for sparse linear systems
- The complexity of bicriteria tree-depth
- The complexity of bicriteria tree-depth
- Acoustic inverse scattering via Helmholtz operator factorization and optimization
- Linear optimization over homogeneous matrix cones
- Edge and pair queries-random graphs and complexity
- Minimizing I/Os in Out-of-Core Task Tree Scheduling
- Rankings of graphs
- Fast separator decomposition for finite element meshes
- Graph unique-maximum and conflict-free colorings
- Vertex ranking of asteroidal triple-free graphs
- Graphs whose \(l_p\)-optimal rankings are \(l_{\infty}\) optimal
- Fully parallel and pipelined sparse direct solver for large symmetric indefinite finite element problems
- Minimizing elimination tree height can increase fill more than linearly
- Sparse linear least-squares problems
- Approximation algorithms for treewidth, pathwidth, and treedepth -- a short survey
- An improved bordered block diagnal method for solving large scale sparse linear equations in circuit simulation
- Combinatorial generation via permutation languages. IV: Elimination trees
- Parallel structured Gaussian elimination for the number field sieve
- Minimal triangulations of graphs: a survey
- An optimal parallel algorithm forc-vertex-ranking of trees
- Vertex rankings of chordal graphs and weighted trees
- On the row merge tree for sparse LU factorization with partial pivoting
- Constructing a minimum height elimination tree of a tree in linear time
- Task scheduling for parallel sparse Cholesky factorization
- Digraph measures: Kelly decompositions, games, and orderings
- Optimal vertex ranking of block graphs
- Treewidth computations. I: Upper bounds
- Sparse QR factorization on a massively parallel computer
- Analysis of the solution phase of a parallel multifrontal approach
This page was built for publication: The Role of Elimination Trees in Sparse Factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3474026)
