Pages that link to "Item:Q3806668"
From MaRDI portal
The following pages link to On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element Matrices (Q3806668):
Displayed 4 items.
- Parallel sparse Gaussian elimination with partial pivoting (Q753685) (← links)
- Block computation and representation of a sparse nullspace basis of a rectangular matrix (Q924318) (← links)
- An incomplete nested dissection algorithm for parallel direct solution of finite element discretizations of partial differential equations (Q1322460) (← links)
- Separators and structure prediction in sparse orthogonal factorization (Q1361831) (← links)