Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model
Row-ordering schemes are studied for Givens transformations in the computation of the QR decomposition of a large sparse \(m\times n\) matrix, where \(m\geq n\). Row-orderings do not effect the sparsity of the upper triangular factor but can have significant impact on the amount of computation required to compute the decomposition. The reduction is modeled by a sequence of bipartite graphs, and the number of nontrivial rotations and the number of arithmetic operations are both expressed in terms of adjacency relations in this sequence of bipartite graphs. This suggests several ways in which good row-orderings can be determined.
- Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem
- Row-ordering schemes for sparse Givens transformations. II. Implicit graph model
- Ordering Givens Rotations for Sparse QR Factorization
- A parameterized ordering for cache-, register- and pipeline-efficient Givens QR decomposition
- On General Row Merging Schemes for Sparse Givens Transformations
- Comparison of two pivotal strategies in sparse plane rotations
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 3523042 (Why is no real title available?)
- Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
- Least Squares Computations by Givens Transformations Without Square Roots
- Numerical methods for solving linear least squares problems
- On Row and Column Orderings for Sparse Least Squares Problems
- Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem
- Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage
- Solution of sparse linear least squares problems using Givens rotations
- The natural factor formulation of the stiffness for the matrix displacement method
- Yale sparse matrix package I: The symmetric codes
- Row-ordering schemes for sparse Givens transformations. II. Implicit graph model
- Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem
- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- A parameterized ordering for cache-, register- and pipeline-efficient Givens QR decomposition
- A locally optimized reordering algorithm and its application to a parallel sparse linear system solver
- Solving sparse linear least-squares problems on some supercomputers by using large dense blocks
- Accuracy of preconditioned CG-type methods for least squares problems.
- scientific article; zbMATH DE number 5533281 (Why is no real title available?)
- On General Row Merging Schemes for Sparse Givens Transformations
- Row Ordering for a Sparse QR Decomposition
- A survey of direct methods for sparse linear systems
This page was built for publication: Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761765)
