Orthogonal Reduction of Sparse Matrices to Upper Triangular Form Using Householder Transformations
Authors:
- Alan GeorgeAGAlan George
- Esmond NgENEsmond Ng
- 1 April 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 7 (2) , 460-472
Abstract
In this paper we consider the problem of predicting where fill-in occurs in the orthogonal decomposition of sparse matrices using Householder transformations. We show that a static data structure can be used throughout the numerical computation, and that the Householder transformations can be saved explicitly in a compact format.Keywords
This publication has 6 references indexed in Scilit:
- An Implementation of Gaussian Elimination with Partial Pivoting for Sparse SystemsSIAM Journal on Scientific and Statistical Computing, 1985
- Some Extensions of an Algorithm for Sparse Linear Least Squares ProblemsSIAM Journal on Scientific and Statistical Computing, 1982
- Computing the Minimum Fill-In is NP-CompleteSIAM Journal on Algebraic Discrete Methods, 1981
- Solution of sparse linear least squares problems using givens rotationsLinear Algebra and its Applications, 1980
- The economical storage of plane rotationsNumerische Mathematik, 1976
- QR-factorization of partitioned matrices: Solution of large systems of linear equations with non-definite coefficient matricesComputer Methods in Applied Mechanics and Engineering, 1974