On General Row Merging Schemes for Sparse Givens Transformations
From MaRDI portal
Recommendations
- Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model
- Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem
- Row-ordering schemes for sparse Givens transformations. II. Implicit graph model
- Row Ordering for a Sparse QR Decomposition
- A compact row storage scheme for Cholesky factors using elimination trees
Cited in
(11)- Householder reflections versus Givens rotations in sparse orthogonal decomposition
- A survey of direct methods for sparse linear systems
- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- Sparse linear least-squares problems
- Parallel \textit{QR} factorization of block-tridiagonal matrices
- On the row merge tree for sparse LU factorization with partial pivoting
- Parallel sparse Gaussian elimination with partial pivoting
- Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model
- Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem
- Solving large and sparse linear least-squares problems by conjugate gradient algorithms
- Solution of sparse positive definite systems on a hypercube
This page was built for publication: On General Row Merging Schemes for Sparse Givens Transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3742616)
