scientific article; zbMATH DE number 3523042
From MaRDI portal
Publication:4101346
Cited in
(10)- Householder reflections versus Givens rotations in sparse orthogonal decomposition
- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- Parallel \textit{QR} factorization of block-tridiagonal matrices
- Sparse linear problems and the least squares method
- Scaling up parallel computation of tiled QR factorizations by a distributed scheduling runtime system and analytical modeling
- 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
- Test procedures and test problems for least squares algorithms
- Row-ordering schemes for sparse Givens transformations. II. Implicit graph model
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4101346)