Comparison of two pivotal strategies in sparse plane rotations
From MaRDI portal
Publication:1164377
DOI10.1016/0898-1221(82)90051-7zbMath0485.65031OpenAlexW2045583745MaRDI QIDQ1164377
Publication date: 1982
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(82)90051-7
robustnessnumerical experimentsaccuracysparse matrixiterative refinementplane rotationspivotal strategiesupper triangular formdrop tolerances
Related Items
A survey of the advances in the exploitation of the sparsity in the solution of large problems ⋮ Solving large and sparse linear least-squares problems by conjugate gradient algorithms ⋮ Sparse linear problems and the least squares method ⋮ Class of optimization algorithms for the solution of large nonlinear programming problems. I ⋮ Solving sparse linear least-squares problems on some supercomputers by using large dense blocks ⋮ Accuracy of preconditioned CG-type methods for least squares problems. ⋮ A survey of direct methods for sparse linear systems ⋮ Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model ⋮ General scheme for solving linear algebraic problems by direct methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving large and sparse linear least-squares problems by conjugate gradient algorithms
- Solution of sparse linear least squares problems using Givens rotations
- Y12M. Solution of large and sparse systems of linear algebraic equations. Documentation of subroutines
- A direct method for the solution of sparse linear least squares problems
- Pivot selection and row ordering in Givens reduction on sparse matrices
- Error analysis of QR decompositions by Givens transformations
- The economical storage of plane rotations
- Consistency and convergence of general linear multistep variable stepsize variable formula methods
- A desirable form for sparse matrices when computing their inverse in factored forms
- Computation of Plain Unitary Rotations Transforming a General Matrix to Triangular Form
- The use of sparse matrix technique in the numerical integration of stiff systems of linear ordinary differential equations
- Use of Iterative Refinement in the Solution of Sparse Linear Systems
- Comparison of Two Algorithms for Solving Large Linear Systems
- A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
- Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
- Basic Linear Algebra Subprograms for Fortran Usage
- Least Squares Computations by Givens Transformations Without Square Roots
- Iterative refinement of linear least squares solutions I
- Techniques for automatic tolerance control in linear programming
- Iterative refinement of linear least squares solutions II
- Solving linear least squares problems by Gram-Schmidt orthogonalization
